www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
5

Data structures and Algorithms MCQ with Answers

5) Which of the following abstract data types can be used to represent a many to many relation?

Tree

Plex

Graph

Both 1) Tree and 2)Graph

Answer is:

Both 1) Tree and 2)Graph

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

6) An algorithm is made up of 2 modules M1&M2. If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?

max (f(n),g(n))

min (f(n),g(n))

f(n) + g(n)

f(n) X g(n)

Answer is:

min (f(n),g(n))

7) An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

At least 2n-c comparisons, for some constant c, are needed.

At most 1.5n-2 comparisons are needed.

At least nlog2n comparisons are needed.

None of the above.

Answer is:

At most 1.5n-2 comparisons are needed.

8) 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)

Answer is:

Θ(logn)

9) The average search time of hashing, with linear probing will be less if the load factor

is far less than one

equals one

is far greater than one

none of these

Answer is:

is far less than one

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here