Time Left - 10:00 mins

ISRO 2018:Programming & DS Booster Quiz- 4

Attempt now to get your rank among 1028 students!

Question 1

Average number of comparison required search for sequential search on ‘n’ items is:

Question 2

Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list?
Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image026.png

Question 3

Consider the following binary search tree T given below. Which node contains the fourth smallest element in T?
Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image021.png

Question 4

A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set.
1. Deletion of the smallest element.
2. Insertion of an element if it is not already present in the set.
Which of the following data structures can be used for this purpose?

Question 5

We use malloc and calloc for

Question 6

Class program
{
int p,q;
Public :
Program(int a,int b)
{
p=a,q=b;
}
int fun()
{
int r;
r=(p=p-q,q=p*q,p=p+q);
return r;
}
};
int main()
{
Program obj1, obj2(3,5);
cout<<obj2.fun();
return 0;
}
What is output of above code?

Question 7

Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?

Question 8

The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack.-The popped item is
  • 1028 attempts
  • 6 upvotes
  • 18 comments
Apr 6GATE & PSU CS