Download multiple choice questons

ROLL NO:
Dinkarrao K. Shinde Smarak Trust’s
Dr. A. D. SHINDE INSTITUTE OF TECHNOLOGY
Guddai, A/P. Bhadgaon, Tal. Gadhinglaj, Dist. Kolhapur
MULTIPLE CHOICE QUESTONS
SUBJECT TITLE: Data Structure.
DATE: 23/02/2013
SUBJECT CODE: 12111.
COURSE: CO4E.
MARKS: 40
Instructions: #Each question carries 1 mark
# Make circle to correct option& making more than 1 option, consider wrong answer
1. On which principle does stack work?
a. FIFO b. LIFO c. LILO d. FOFI
2. A data structure where elements can be added or removed at either end but not in the middle
a. Linked lists
b. Stacks
c. Queues
d. Dequeue
3. When new data are to be inserted into a data structure, but there is no available space; this situation is
usually called
a. underflow
b. overflow
c. houseful
d. saturated
4. Which data structure allows deleting data elements from front and inserting at rear?
a. Stacks
b. Queues c. Deques d. Binary search tree
5. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque b. Output-restricted deque
c. Priority queues
6. Which of the following data structure is non-linear type?
a. Strings
7.
b. Lists
c.Stacks
d. None of above
Which of the following data structure is linear type?
a. Strings
b. Lists c. Queues
d. All of above
d. None of above
8. An algorithm that calls itself directly or indirectly is known as
a. Sub algorithm
b. Recursion
c. Polish notation
d. Traversal algorithm
12. Which of the following sorting algorithm is of divide-and-conquer type?
a. Bubble sort b. Insertion sort
c. Quick sort d. All of above
13. The operator is present between the operands is called as
a. Prefix
b. Postfix
c. Infix d. String
14.In which sort we getting the smallest element at first position after first iteration
a. Bubble sort b. Insertion sort
c. Selection sort
d. Quick sort
15. Two main measures for the efficiency of an algorithm are
a. Processor and memory
b. Complexity and capacity
c. Time and spaced. Data and space
16. The time factor when determining the efficiency of algorithm is measured by
a. Counting microseconds
c. Counting the number of statements
b. Counting the number of key operations
d. Counting the kilobytes of algorithm
17. Which of the following case does not exist in complexity theory?
a. Best case
b. Worst case c. Average case
d. Null case
18. The Worst case occur in linear search algorithm when
a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
19. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
20. Which of the following data structure is linear data structure?
a. Trees b. Graphs
c. Arrays
d. None of above
21. The operation of processing each element in the list is known as
a. Sorting
b. Merging
c. Inserting
d. Traversal
22. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort d. None of above
22. Arrays are best data structures
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
23. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
c. the first data from the set to be stored
b. the data type of array
d. the index set of the array
24. Items in a priority queue are entered in a _____________ order
a. Random
b. order of priority
c .As when they ate come d. None of above
25. If the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are
performed on a stack, the sequence of popped out values are ?
a.
b.
c.
d.
2, 2, 1, 1, 2
2, 2, 1, 2, 2
2, 1, 2, 2, 1
2, 1, 2, 2, 2
26) The postfix expression for * + a b - c d is?
a.
b.
c.
d.
ab + cd - *
ab cd + - *
ab + cd * ab + - cd *
27) Postfix expression for (A+B)*(C*D-E)*F/G is
a.AB+CD*E-FG/**
b.AB+CD*E-F**G/
C.AB+CD*E-*F*G/
D.AB+CDE*-*F*G/
28. The data structure required to evaluate a postfix expression is
a.Queue
b.Stack c.array d. linked list
29.The five items :A,B,C,D and E are pushed in a stack.one after the other starting from A.The stack is
popped four items and each element is inserted in a queue.Then two elements are deleted from the queue
and pushed back on a stack.Now one item is popped from stack. The popped item is:
a. E
b. B
c. C
d. D
30. In evaluating the arithmetic expression 2*3-(4+5),using stack to evaluate its equivalent postfix
form,which of the following stack configuration is not possible?
a. 4,6
b. 5,4,6
c.9,6
d.9,3,23
31.A sort which compares adjacent elements in a list and switches where necessary is
a. Insertion sort
b. bubble sort
c quick sort
d. selection sort
32. A sort which iteratively passes through a list to exchange the first element with any element less than
it and then repeats with a new element is called
a. insertion sort
b .selection sort
c. quick sort
d. merge sort
33. The data for which you are searching is called
a. search argument
b. sorting argument c. detection argument
d. binary argument
34. which statements is used to divide the array in binary search
a.mid= (high-low)/2
b. mid= (low-high)/2
c.mid= (low +high)/2 d .all of above
35. Which is not a property of algorithm?
a. Input
b. effectiveness
c. defectiveness
d. finiteness
36. The function calling itself is called
a. Iteration b. function
c. recursion
d .call by value
37. Which is application queue.
a. Chart b. map
c. customer service software’s d. sorting
38. Queue is type of list
A .LIFO
b. FIFO
c. LOFI d. LILO
39. The term related to queue is
a. rear b. front c. top d. both a &b
40. If there is no element in queue then
a. top=-1
b. front=-1
c. rear=-1
d. front=-1 & rear=-1