Time Left - 08:00 mins

ECIL GET 2018 : Topic wise test-2 (PDS)

Attempt now to get your rank among 451 students!

Question 1

With regard to linked list, which of the following statement is false?

Question 2

Which of the following data structure is linear type?

Question 3

Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5?
A. 3, 2, 1, 5, 4
B. 5, 4, 3, 2, 1
C. 3, 4, 5, 2, 1
D. 3, 4, 5, 1, 2

Question 4

Recursive functions are executed in a

Question 5

The following postfix expression is evaluated using a stack

The top two elements of the stack after first * is evaluated

Question 6

The postfix expression

can be evaluated using a

Question 7

Queue is a _________ list.

Question 8

Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack?

Question 9

Consider a sorted circular doubly-linked list where the head element points to the smallest element in the list, so what is the complexity in terms of Big-Oh for determining the median element in this doubly-linked list ?

Question 10

An algorithm performs (log N)^1/2 find operations, N insert operations, (log N)^1/2 delete operations, and (log N)^1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted.
For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?

451 attempts
5 upvotes
18 comments

Tags :

GATE & PSU CS General

Mar 25GATE & PSU CS