ISRO CS 2019 : DS Booster Quiz 2 (App update required to attempt this test)
Attempt now to get your rank among 617 students!
Question 1
Question 2
as the highest precedence and follows right associativity. Infix: m
p * q * r + a * b 
cQuestion 3
int fun (int n)
if
return (n% 10); else return fun
What is the return value of fun(9874)?
Question 4
What appears in List 2 after completion of above code ?
Question 5
Consider a max heap represented by the array elements:
{50, 25, 22, 17, 16, 15, 12, 10, 9}. The following operations are carried out: 17 is deleted, 24 is inserted. The number of operations to heapify is
Question 6
The time complexity to check whether the two linked lists have an intersection node or not is :
For example :
Question 7
Question 8
Question 9
Consider the following code which is being implemented on a binary tree :
void ABC(struct Node* node)
{
if (node==NULL)
return;
else
{
struct Node* temp;
ABC(node->left);
ABC(node->right);
temp = node->left;
node->left = node->right;
node->right = temp;
}
}
What does the code is performing on the binary tree ?
Question 10
S1 : Prim's algorithm will generate connected graph in every step but Kruskal's algorithm may generate disconnected graph in some step.
S2 : Bellman Ford algorithm can find all negative edge weight cycles present in the graph.
- 617 attempts
- 1 upvote
- 1 comment
Tags :
GATE & PSU CSGeneral
