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

Attempt now to get your rank among 411 students!

Question 1

Question 2

Question 3

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

_____________.

Question 5

[{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

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

Question 7

Question 8

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

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

int func(int num) {

int count = 0;

while (num) {

count++;

num>>= 1;

}

return (count);

}

The value returned by func(435)is______.

- 411 attempts
- 0 upvotes
- 1 comment

Posted by: