Time Left - 12:00 mins

BARC 2020: Data Structures and Programming Nuclear Quiz 1 (App update required to attempt this test)

Attempt now to get your rank among 427 students!

Question 1

Consider a doubly linked list. The doubly linked list contains pointers to next nodes and to previous nodes as well. Hence a node in doubly linked list contains a data and two pointers. Our task is to insert a new node at the second last position of the linked list. Find the number of pointers that needs to be updated in doubly linked list to do so __________.

Question 2

Consider an array S which has base address 1000 and size of each element in the array is 1. The array S has 20 elements (0-19) What is the address printed when &S + 1 is executed _______.

Question 3

Consider the following elements :

5 , 12 , 3 , 15 , 4 , 6 , 10

These elements are inserted one-by-one into two separate heaps , one min heap and another max heap. Then these two heaps are stored in two different array starting form index How many elements have different index value in both the arrays ___________.

Question 4

The output of the following C program is _________.

Question 5

Consider the following expression :

[{a+(b*c[s/d])}+{2*(b-c)}/d]

Parenthesis matching is done on the above expression using stack as a data structure. Find the maximum size of stack at any instant during the parenthesis matching _________.

Question 6

Consider the following graph :

How many Breadth First Traversals are possible starting from vertex A ____________.

Question 7

Consider a complete 5 - ary tree which has height = 6 (Height is the maximum length of path from root node to leaf node). Find the total number of nodes in this tree ________.

Question 8

Consider the road map given below :

The vertices denotes the different places in the city and the edge between two vertices denotes the roads between the places. Find the number of places that acts as articulation points in the graph ________.

Question 9

Consider the following elements inserted into an empty AVL tree in the following order

25, 10, 15, 17, 30, 35, 40, 21, 28

If (Ld) be the sum of value of elements on left side of root and (Rd) be the sum of value of elements on right side of root, then the value of [(Rd) – (Ld) + Root] is ________.

Question 10

Consider the function func shown below:
int func(int num) {
int count = 0;
while (num) {
count++;
num>>= 1;
}
return (count);
}
The value returned by func(435)is______.

427 attempts
0 upvotes
1 comment

Tags :

GATE & PSU CS Programming and Data Structures

Apr 27GATE & PSU CS