Data structure MCQ

1.What do you mean by the data structure ?

a.arranging the elements in the systematic way

b.arranging  the elements into the multiple parts

C.collection of data

d.None of these

Answer:a

2.Stack is also known as

a.First in First out

b.Last in first out

C.sequence of elements

d.None of these

Answer:b

3.Queue is also known as 

a.First in First out

b.Last in first out

c.sequence of elements

d.None of these

Answer:a

4.Which of the following is a non-linear data structure.

a.stack

b.Tree

c.Array

d.string

Answer:b

5.Is linked- list is a dynamic data structure ?

a.True

b.False

Answer:a

6.Inserting and deleting an element from the stack,this operation is known as

a.push,delete

b.insert,pop

c.push,pop

d.None of these

Answer: c

7.How we can re-allocate the memory in data structure ?

a.calloc

b.malloc

c.free

d.realloc

Answer: d

8.What is the time complexity of the binary search ?

a.O(n)

b.O(log n)

c.O(n log n)

d.None of these

Answer:b

9.In which of the following operation can do in data structure.

a.insertion

b.deleting

c.traversing

d.All of the above

Answer:d

10.What are the levels of data structure ?

a.abstract level

b.application level

c.implementation level

d. all of the above

Answer:d

11.AVL stands for

a.georgy -velsky and landis

b.georgy velso and landis

c.george-velskii and landis

d.None of these

Answer:a

12.When the element is inserted from the one end and removed from the other end then this operation is known as 

a.list

b.queue

c.stack

d.None of these

Answer:b

13.To represent the element in the hierarchical form,which data structure is suitable.

a.list

b.graph

c.tree

d.None of these

Answer:c

14.Graph contains

a.edge,vertices

b.edge,paths

c.connector,edge

d.None of these

Answer:a

15.The time complexity of quick sort 

a.O(log n)

b.O(1)

c.O(n log n)

d.None of these

Answer:c

16.By which function, memory can be free in data structure.

a.remove

b.free

c.delete

d.None of these

Answer:b

17.The difference between the left side tree and right side tree is exactly 1 then this tree is known as

a.Binary search tree

b.AVL tree

c.Linear search tree

d.None of these

Answer:b

18.What are the main two measure efficiency of an algorithms.

a.Time and space

b.processor and memory

c.date and time

d.None of these

Answer:a

19.Queue can be used to implement

a.Quick sort

b. Radix sort

C.recursion

d.None of these

Answer:b

20.In which of the following is the best behaviour/algorithms.

a.quick sort

b.merge sort

c.Insertion sort

d.heap sort

Answer:a