Time Left - 12:00 mins

UGC-NET 2018: ( Data Structure & Algorithms ) SpeedTest Quiz 5

Attempt now to get your rank among 644 students!

Question 1

The time complexities of some standard graph algorithms are given.
Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively)
List - I
a. Bellman Ford algorithm
b. Kruskals algorithm
c. Floyd Warshall algorithm
d. Topological sorting
List - II
1. O (m log n)
2. O (n³)
3. O(mn)
4. O(n + m)

Question 2

An ideal sort is an in-place-sort whose additional space requirement is ……………….

Question 3

The worst case time complexity of AVL tree is better in comparison to binary search tree for

Question 4

Let T(n) be the function defined by T(n) = 1 and

which of the following is TRUE?

Question 5

Suppose there are logn sorted lists of n/logn elements each. The time complexity of producing a sorted list of all these elements is
(use heap data structure)

Question 6

Given below are two premises and four conclusions drawn from those premises. Select the code that express conclusion drawn validly from the premises (separately or jointly).
Premises:
(a) All dogs are mammals
(b) No cats are dogs
Conclusions:
(i) No cats are mammals
(ii) Some cats are mammals
(iii) No dogs are cats
(iv) No dogs are non-mammals

Question 7

When a computer is booting, BIOS is loaded to the memory by

Question 8

Which of the statements are true?
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

Question 9

In which tree, for every node the height of its left subtree and right subtree different almost by one?

Question 10

The inorder traversal of the following tree is:

644 attempts
3 upvotes
11 comments

Tags :

GATE & PSU CS Programming and Data Structures

Jun 4GATE & PSU CS