Time Left - 06:00 mins
BARC CS 2018 Nuclear Quiz -1 (DS)
Attempt now to get your rank among 596 students!
Question 1
Consider a program which stores the frequency of marks of student in a particular subject say Mathematics. The marks is in the range [0...100] and there are around 500 students. But there is one condition we only want to record frequency if the student has passed in the exam, the passing marks being 40. What is the best way to store the frequency of marks above 40?
Question 2
Consider the following Max-heap tree stored in the form of an array.
Which of the following is a heap tree after deleting 97 and 88?
Which of the following is a heap tree after deleting 97 and 88?
Question 3
In which order the following numbers 7,5,1,8,3 and 2, should be inserted into the binary search tree to get in order and preorder traversal sequences as the same?
Question 4
Consider the following fragment:
if(a<b)
printf(“a>b”);
else
printf(“else part”);
printf(“a<=b”);
a<=b will be printed if
if(a<b)
printf(“a>b”);
else
printf(“else part”);
printf(“a<=b”);
a<=b will be printed if
Question 5
The postfix expression for the infix expression
(A + B *(C + D))/ (F + D * E) is?
(A + B *(C + D))/ (F + D * E) is?
- 596 attempts
- 4 upvotes
- 15 comments
Oct 13GATE & PSU CS
