Data Structure Multiple Choice Questions and Answers Pdf - 1

Question: 1

What is the worst-case time for serial search finding a single item in an array?

(A) Quadratic time

(B) Linear time

(C) Logarithmic time

(D) Constant time

Ans: B

Linear time

Question: 2

A non-circular doubly linked list can best and most generally be defined as a ___

(A) Set of elements, each with two pointers

(B) Set of elements chained together with pointers

(C) Linear sequence of elements in sequential memory locations

(D) Linear sequence of elements chained together with pointers

Ans: D

Linear sequence of elements chained together with pointers

Question: 3

Which of the following operations is a dictionary operation?

(A) Search

(B) Delete

(C) Insert

(D) All of above

Ans: D

All of above

Question: 4

To create a linked structure, each node must have one member, which is ____

(A) A pointer to the head of the list

(B) A pointer to NULL

(C) A pointer to the node type

(D) A reference to the element type

Ans: C

A pointer to the node type

Question: 5

Each attribute of an entity has a defined set of values. This set of values is called a

(A) Mapping

(B) Entity set

(C) Domain

(D) Range

Ans: C

Domain

Error Report!

Related Questions