CoCubes Computer Science and Computer Fundamentals

CoCubes Computer Science Questions and CoCubes Domain Test Papers with Answers

CoCubes Computer Fundamentals Papers difficulty may vary company to company, as seen Cocubes Computer Science Questions questions asked in Microsoft were much harder than the Cocubes Computer Science questions asked in Capgemini. CoCubes Computer Fundamentals Questions are a little tricky and need a lot of practicing thus studying from our website should help you a lot.

Computer Fundamentals Test for        CoCubes
Number of Sections          1
Time Duration for Computer Fundamentals test     15 min
Type of Exam     Adaptive
Mode Conducted      Online

Also, check our Cocubes Syllabus page here for some interesting facts about the exam

No. of Questions

15

Time Duration

15 Minutes

Order of section

Computer Programming is the last section

Negative Marking

No

No of Topics

6 - 8

Syllabus for the Computer Programming Exam

CoCubes Computer Fundamentals Previous year Questions

Click here to view detailed Syllabus for Computer Fundamentals

CoCubes Computer Fundamentals Curriculum

CoCubes Computer Science Previous Questions Part-I

CoCubes Computer Fundamentals Questions Part-II

Some Extra Pages Which are Important to visit regarding CoCubes exams.........

NOTE: Register for CoCubes Exam through PrepInsta and get Flat Rs200/- Off. Click on the button given here and get Coupon Code.

 

CoCubes Exam Coupon Code 2021

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your analytics for this Subject

Mocks

15/291

Cocubes Mocks Completed

Mocks

0/29

CoCubes - Computer Science Mocks Completed

Start Preparing
Detailed performance

Prime

PrepInsta Prime

Complete Video Course of CoCubes

( for CoCubes )
Get Prime Video

Prime

PrepInsta Prime

Complete Mock Subscription of CoCubes

( for CoCubes )
Get Prime Mock

CoCubes Computer Fundamental Questions

> Start

C

0/100%
Completed

> Start

C++

0/100%
Completed

> Start

OOPS Concepts

0/100%
Completed

> Start

Data Structure

0/100%
Completed

> Start

DBMS

0/100%
Completed

> Start

Networking

0/100%
Completed

> Start

Operating Systems

0/100%
Completed

> Start

Computer Architecture

0/100%
Completed

1. 

void fun1(struct node* head)
{
  if(head == NULL)
    return;
  
  fun1(head->next);
  printf("%d  ", head->data);
}

Prints all nodes of linked lists

Prints all nodes of linked lists

49.76%

Prints all nodes of linked list in reverse order

Prints all nodes of linked list in reverse order

35.11%

Prints alternate nodes of Linked List

Prints alternate nodes of Linked List

10.3%

Prints alternate nodes in reverse order

Prints alternate nodes in reverse order

4.83%

fun1() prints the given Linked List in reverse manner.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

2. Which of the following points is/are true about Linked List data structure when it is compared with array

Arrays have better cache locality that can make them better in terms of performance.

Arrays have better cache locality that can make them better in terms of performance.

5.75%

It is easy to insert and delete elements in Linked List

It is easy to insert and delete elements in Linked List

15.03%

Random access is not allowed in a typical implementation of Linked Lists

Random access is not allowed in a typical implementation of Linked Lists

8.18%

The size of array has to be pre-decided, linked lists can change their size any time

The size of array has to be pre-decided, linked lists can change their size any time

16.24%

All of the above

All of the above

54.81%

Key Differences Between Array and Linked List
1. An array is the data structure that contains a collection of similar type data elements whereas the Linked list is considered as non-primitive data structure contains a collection of unordered linked elements known as nodes.
2. In the array the elements belong to indexes, i.e., if you want to get into the fourth element you have to write the variable name with its index or location within the square bracket.
3. In a linked list though, you have to start from the head and work your way through until you get to the fourth element.
4. Accessing an element in an array is fast, while Linked list takes linear time, so it is quite a bit slower.
5. Operations like insertion and deletion in arrays consume a lot of time. On the other hand, the performance of these operations in Linked lists is fast.
6. Arrays are of fixed size. In contrast, Linked lists are dynamic and flexible and can expand and contract its size.
7. In an array, memory is assigned during compile time while in a Linked list it is allocated during execution or runtime.
9. Elements are stored consecutively in arrays whereas it is stored randomly in Linked lists.
10. The requirement of memory is less due to actual data being stored within the index in the array. As against, there is a need for more memory in Linked Lists due to storage of additional next and previous referencing elements.
11. In addition memory utilization is inefficient in the array. Conversely, memory utilization is efficient in the linked list.

Following are the points in favor of Linked Lists.

(1) The size of the arrays is fixed: So we must know the upper limit on the number of elements in advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the usage, and in practical uses, the upper limit is rarely reached.

(2) Inserting a new element in an array of elements is expensive because a room has to be created for the new elements and to create room existing elements have to be shifted.

For example, suppose we maintain a sorted list of IDs in an array id[].

id[] = [1000, 1010, 1050, 2000, 2040, …..].

And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the elements after 1000 (excluding 1000).

Deletion is also expensive with arrays until unless some special techniques are used. For example, to delete 1010 in id[], everything after 1010 has to be moved.

So Linked list provides the following two advantages over arrays
1) Dynamic size
2) Ease of insertion/deletion

Linked lists have following drawbacks:
1) Random access is not allowed. We have to access elements sequentially starting from the first node. So we cannot do a binary search with linked lists.
2) Extra memory space for a pointer is required with each element of the list.
3) Arrays have better cache locality that can make a pretty big difference in performance.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

3. Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as prev and next pointer as next.

void fun(struct node **head_ref)
{
    struct node *temp = NULL;
    struct node *current = *head_ref;
    while (current !=  NULL)
    {
        temp = current->prev;
        current->prev = current->next;
        current->next = temp;
        current = current->prev;
    }
    if(temp != NULL )
        *head_ref = temp->prev;
}

Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

24%

5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

12.9%

6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

48.54%

6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

14.56%

The given function reverses the given doubly linked list

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

4. The worst-case running time to search for an element in a balanced in a binary search tree with n2^n elements is

O(nlogn)

O(nlogn)

30.81%

O(n2^n)

O(n2^n)

33.9%

On

On

17.74%

O(logn)

O(logn)

17.55%

Time taken to search an element is \Theta (h) where h is the height of Binary Search Tree (BST). The growth of height of a balanced BST is logerthimic in terms of number of nodes. So the worst case time to search an element would be \Theta (Log(n*2^n)) which is \Theta (Log(n) + Log(2^n)) Which is \Theta (Log(n) + n) which can be written as \Theta (n) .

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

5. Following function is supposed to calculate the maximum depth or height of a Binary tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.

int maxDepth(struct node* node)
{
   if (node==NULL)
       return 0;
   else
   {
       /* compute the depth of each subtree */
       int lDepth = maxDepth(node->left);
       int rDepth = maxDepth(node->right);
 
       /* use the larger one */
       if (lDepth > rDepth)
           return X;
       else return Y;
   }
}

X = lDepth, Y = rDepth

X = lDepth, Y = rDepth

30.16%

X = lDepth + 1, Y = rDepth + 1

X = lDepth + 1, Y = rDepth + 1

41.96%

X = lDepth - 1, Y = rDepth -1

X = lDepth - 1, Y = rDepth -1

16.94%

None of the above

None of the above

10.94%

f a tree is not empty, height of tree is MAX(Height of Left Subtree, Height of Right Subtree) + 1

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

6. Which one of the below is not divide and conquer approach?

Insertion Sort

Insertion Sort

42.09%

Merge Sort

Merge Sort

18.73%

Heap Sort

Heap Sort

15.89%

Shell sort

Shell sort

23.29%

Explanation

Among the options, only Merge sort divides the list in sub-list, sorts and then merges them together

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

7. What is the functionality of the following code?

public void function(Node node)
{
	if(size == 0)
		head = node;
	else
	{
		Node temp,cur;
		for(cur = head; (temp = cur.getNext())!=null; cur = temp);
		cur.setNext(node);
	}
	size++;
}

Inserting a node at the beginning of the list

Inserting a node at the beginning of the list

43.17%

Deleting a node at the beginning of the list

Deleting a node at the beginning of the list

11.79%

Inserting a node at the end of the list

Inserting a node at the end of the list

40.46%

Deleting a node at the end of the list

Deleting a node at the end of the list

4.58%

Explanation: The for loop traverses through the list and then inserts a new node as cur.setNext(node);

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

8. How do you count the number of elements in the circular linked list?

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head)
{
temp = temp.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head)
{
temp = temp.getNext();
length++;
}
return length;
}

33.46%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != null)
{
temp = temp.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != null)
{
temp = temp.getNext();
length++;
}
return length;
}

21%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp != null)
{
temp = head.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp != null)
{
temp = head.getNext();
length++;
}
return length;
}

30.52%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp == null)
{
temp = head.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp == null)
{
temp = head.getNext();
length++;
}
return length;
}

15.01%

Explanation: If the head is null, it means that the list is empty. Otherwise, traverse the list until the head of the list is reached

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

9. What is the functionality of the following piece of code? Select the most appropriate

public void function(int data)
{
	int flag = 0;
	if( head != null)
	{
		Node temp = head.getNext();
		while((temp != head) && (!(temp.getItem() == data)))
		{
			temp = temp.getNext();
			flag = 1;
			break;
		}
	}
	if(flag)
		System.out.println("success");
	else
		System.out.println("fail");
}

Print success if a particular element is not found

Print success if a particular element is not found

34.75%

Print fail if a particular element is not found

Print fail if a particular element is not found

30.91%

Print success if a particular element is equal to 1

Print success if a particular element is equal to 1

22.82%

Print fail if the list is empty

Print fail if the list is empty

11.51%

Explanation: The function prints fail if the given element is not found. Note that this option is inclusive of option d, the list being empty is one of the cases covered.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

10. Which of the following is false about a circular linked list?

Every node has a successor

Every node has a successor

13.59%

Time complexity of inserting a new node at the head of the list is O(1)

Time complexity of inserting a new node at the head of the list is O(1)

31.71%

Time complexity for deleting the last node is O(n)

Time complexity for deleting the last node is O(n)

27.87%

We can traverse the whole circular linked list by starting from any point

We can traverse the whole circular linked list by starting from any point

26.83%

Explanation: Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

×

Please login to report

Analytics 2021

Stats About CoCubes ( Computer Fundamentals )

Number of Question 15 Questions
Cut-Off 12 Questions
Difficullty medium
Importance high

Topic Wise Analysis

C Questions 0-2
Difficulty medium
Importance high
C++ Questions 0-2
Difficulty medium
Importance: high
Basics of OOPs Questions 0-1
Difficulty medium
Importance high
Data Structures Questions 0-3
Difficulty medium
Importance high
DBMS Questions 0-2
Difficulty high
Importance high
Basics of networking Questions 0-2
Difficulty high
Importance high
Operating Systems Questions 0-2
Difficulty medium
Importance high
Computer Architecture Questions 0-3
Difficulty high
Importance high

CoCubes Computer Fundamentals Questions 2021

Here you will find CoCubes Verbal English topic difficulty and minimum time you should take to solve Logical questions of CoCubes.

CoCubes VERBAL TOPICS NO. OF QUESTIONS IN TEST TIME DIFFICULTY
C 0-1 2 mins Medium
C++ 0-2 1 min 15 secs Medium
Basics of OOPs 0-2 1 min 10 secs High
Reading Comprehension 0-4 2 min Medium
Code Snippets 0-2 1 min 30 secs High
Data Structures 0-1 1 min 25 secs Medium
DBMS 0-2 1 min Medium
Basics of networking 0-1 1 min 15 secs High
Operating Systems 0-1 1 min 15 secs High
Computer Architecture 0-1 1 min 15 secs High

 

Card image cap

How is CoCubes Helping Students getting Off Campus Jobs

All Videos

CoCubes Computer Programming based FAQ's

DBMS, Basics of networking and OOPs are the important topics of Computer Programming on which one has to learn and practice hard with the previous papers.

The importance of this section is very much high. One has to clear each and every topic of programming well.

The Words Like “Placement Papers” and “Previous Year Papers” are used here for Google Search Purposes only. All these placement papers and previous year papers are freely available on the internet, we are only charging students for the PrepInsta’s Mock Test experiences and Analytics as well as preparation for the exam. Prepinsta does not guarantee any recurrence of the questions in the exam however we believe that the questions should be of the similar pattern in the exam

Prime

Prime Video

Complete Video Course for CoCubes

Get Prime Video( for CoCubes )

81% of Prepinsta Prime Course students gets selected in CoCubes

Prime Mock Access is included with Prime Video Course

Interview and Resume Buliding Preoaration with Prime Subscription

Get Prime Video
Prime

Prime Mock

Complete Mock Subscription for CoCubes

Get Prime Mock( for CoCubes )

81% of our Prime Learners got selected in CoCubes

6 out of 10 fresh grads are from PrepInsta

4,423+ bought in last 1 month

Get Prime Mock

July 12, 2021

Comments

6 comments on “CoCubes Computer Science and Computer Fundamentals”