data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

Which of the following data structure is linear data structure?

a) Trees

b) Graphs

c) Arrays

d) None of the above

Question : 2

The situation when in a linked list START=NULL is

a) Underflow

b) Overflow

c) Housefull

d) Saturated

Question : 3

Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

a) Elementary items

b) Atoms

c) Scalars

d) All of above

Question : 4

Two main measures for the efficiency of an algorithm are

a) Time and space

b) Processor and memory

c) Complexity and capacity

d) Data and space

Question : 5

The following is two-way list

a) Grounded header list

b) Circular header list

c) Linked list with header and trailer nodes

d) None of above

Question : 6

A data structure where elements can be added or removed at either end but not in the middle is referred as

a) Linked lists

b) Stacks

c) Queues

d) Deque