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

• Insertion Sort

• Quick Sort

• Merge Sort

• Heap Sort

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)

• log 2 n

• n/2

• log 2 n - 1

• n

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest? (GATE CS 2004)

• membership, cardinality

• intersection, membership

• union, intersection

• union only

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is

• Θ(n)

• Θ(logn)

• Θ(log*n)

• Θ(1)

A series of values stored in memory is called ___

• an array

• a tree

• a matrix

• a struct

In some languages, arrays are also called ___

• groups or arrows

• roots or leaves

• lists or vectors

• lines or strings

Arrays of characters, like letters, numbers, punctuation and other written symbols, are called ___

• structs

• vectors

• strings

• groups

Finding the location of a given item in a collection of items is called ……

• Discovering

• Finding

• searching

• mining

Example of linear data structure except

• array

• tree

• queue

• stack

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list