MCQ on Data structure and algorithm

Rajasthan Polytechnic Third Year Paper 2016 – Data structure and algorithm

Which of the following data structure is linear data strucutre?
(a) Tree
(b) Graph
(c) Array
(d) None of above

When determining the efficiency of algorithm the time factor is measured by
(a) Counting microseconds
(b) Counting the number of key operations
(c) Counting the number of statements
(d) Counting the kilobytes of algorithm

The memory address of the first element of an array is called
(a) floor address
(b) foundation address
(c) first address
(d) base address

The operation of processing each element in the link list is known as
(a) Sorting
(b) Merging
(c) Inserting
(d) Traversal

Finding the location of the element in link list with a given value is known as
(a) Traversal
(b) Search
(c) Sort
(d) None of above

In circular linked list, how many pointers are required to insert a node?
(a) One
(b) Two
(c) Three
(d) None

In worst case, how many comparisons needed to search a singly linked list of length ‘n’ for a given element?
(a) log n
(b) n/2
(c) log n-1
(d) n

Stack is also known as
(a) last in first out
(b) first in first out
(c) last in last out
(d) none of above

Which of the following data structure is one ended?
(a) Queue
(b) Stack
(c) Tree
(d) Graph

Inserting an item into the stack when stack is not full is called _________operation and deletion of item from the stack when not empty is called ___operation.
(a) Pop, push
(b) Push, pop
(c) Insert, delete
(d) Delete, Insert