TECH FEUD 3

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

• INSERTION SORT

• QUICK SORT

• HEAP SORT

• MERGE SORT

CONSIDER THE FOLLOWING C PROGRAM

THE VALUE PRINTED BY THE PROGRAM IS:

• 26

• 25

• 24

• 22

Which of the following is an advantage of adjacency list representation over adjacency matric representation of a graph?

• In adjacency list representation, space is saved for sparse graphs.

• Add vertex in adjlist representation is easy than adjmatrix representation

• All of the above

• None of the above

THE OUTPUT OF THE FOLLOWING CODE IS:

• 20

• 30

• 10

• 0

A single array A[1…MAXSIZE] is used to implement two stacks, the two stacks grow from opposite ends of array. Variables top1 and top2(top1<top2) point to the location of the topmost element in each of the stacks, If the space is to be used efficiently, the condition for “stack full” is

• (top 1= MAXSIZE/2) AND (top 2 = MAXSIZE/2 +1)

• top1 1 + top 1 = MAXSIZE

• (top 1= MAXSIZE/2) OR (top 2 = MAXSIZE)

• top 1 = top 2 - 1

CONSIDER THE FOLLOWING C PROGRAM

THE OUTPUT OF THE PROGRAM IS:

• 20

• 19

• 18

• 17

Consider the following graph, among the following sequences: 

(I) a b e g h f

(II) a b f e h g

(III) a b f h g e

(IV) a f g h b e

Which are depth first traversals of the above graph? 

• I, II AND IV only

• I AND IV only

• I, III, AND IV only

• II, III, AND IV only

Which of the following statements is correct?

I. A self-join may be implemented in SQL using table aliases.

II. The outer-join operation is a fundamental relational algebra procedure.

III. The procedures of natural join and outside join are the same

• Only I is correct

• Only III is correct

• I and II are correct

• II and III are correct

Suppose we are given n keys, m has table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys ?

• m/n

• n/m

• 2n/m

• n/2m

THE OUTPUT OF THE PROGRAM IS:

• 4

• 3

• 5

• 81