2/18/2014 Data structure Multiple Choice questions | Admissionadda.

com @ School,College,University Admission

http://admissionadda.com/data-structure-multiple-choice-questions/ 1/13
Admissionadda.com @ School,College,University
AdmissionAdmission notification & notices,Admission
Alert,Admission news,Entrance Exam Notification,Online
Admission Form,Admission Update,Admission
Helpline,Admission Test,Solved Question Paper 2014
Home
Search Keywords Search
Home
About Us
Contact Us
Disclaimer
Data Structure Multiple Choice Questions
15.10.2012 | Author: jitendra | Posted in SOLVED QUESTION PAPERS
1. The memory address of the first element of an array is called
a. floor address
b. foundation address
c. first address
d. base address
Answer : d. base address
Also see Interview questions of Operating System
2. The memory address of fifth element of an array can be calculated by the formula
a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
d. None of above
Answer: a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array



3. Which of the following data structures are indexed structures?
a. linear arrays
b. linked lists
c. both of above
d. none of above
Answer: a. linear arrays

2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 2/13
4. Which of the following is not the required condition for binary search algorithm?
a. The list must be sorted
b. there should be the direct access to the middle element in any sublist
c. There must be mechanism to delete and/or insert elements in list
d. none of above
Answer: c. There must be mechanism to delete and/or insert elements in list

5. Which of the following is not a limitation of binary search algorithm?
a. must use a sorted array
b. requirement of sorted array is expensive when a lot of insertion and deletions are needed
c. there must be a mechanism to access middle element directly
d. binary search algorithm is not efficient when the data elements are more than 1000.
Answer: d. binary search algorithm is not efficient when the data elements are more than 1000.

6. Two dimensional arrays are also called
a. tables arrays
b. matrix arrays
c. both of above
d. none of above
Answer: c. both of above

7. A variable P is called pointer if
a. P contains the address of an element in DATA.
b. P points to the address of first element in DATA
c. P can store only memory addresses
d. P contain the DATA and the address of DATA
Answer: a. P contains the address of an element in DATA.

8. Which of the following data structure cant store the non-homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None
Answer: a. Arrays

9. Which of the following data structure store the homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None
Answer: b. Records

2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 3/13
10. 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
Answer: d. all of above

11. The difference between linear array and a record is
a. An array is suitable for homogeneous data but hte data items in a record may have different data type
b. In a record, there may not be a natural ordering in opposed to linear array.
c. A record form a hierarchical structure but a lienear array does not
d. All of above
Answer: d. All of above

12. Which of the following statement is false?
a. Arrays are dense lists and static data structure
b. data elements in linked list need not be stored in adjecent space in memory
c. pointers store the next data element of a list
d. linked lists are collection of the nodes that contain information part and next pointer
Answer: c. pointers store the next data element of a list

13. Binary search algorithm can not be applied to
a. sorted linked list
b. sorted binary trees
c. sorted linear array
d. pointer array
Answer: a. sorted linked list

14. 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. housefull
d. saturated
Answer: b. overflow

15. The situation when in a linked list START=NULL is
a. underflow
b. overflow
c. housefull
d. saturated
Answer: a. underflow

2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 4/13
16. Which of the following is a two way list?
a. grounded header list
b. circular header list
c. linked list with header and trailer nodes
d. none of above
Answer: d. none of above

17. Which of the following name does not relate to stacks?
a. FIFO lists
b. LIFO list
c. Piles
d. Push-down lists
Answer: a. FIFO lists

18. The term "push" and "pop" is related to the
a. array
b. lists
c. stacks
d. all of above
Answer: c. stacks

19. 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. Deque
Answer: d. Deque

20. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
a. FAEKCDBHG
b. FAEKCDHGB
c. EAFKHDCBG
d. FEAKDCHBG
Answer: b. FAEKCDHGB

21. Two main measures of the efficiency of an algorithm are
a) Processor and memory
b) Complexity and capacity
c) Time and space
d) Data and space
Answer: (c )
22. The time factor when determining the efficiency of algorithms is measured by
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 5/13

a) Counting microseconds
b) Counting the number of key operations
c) Counting the number of operations
d) Counting the kilobytes of an operation
Answer: (b)

23. The complexity of linear search algorithm is
a) O(n)
b) O(logn)
c) O(n
2)
d) O(nlogn)
Answer: (a)

24. Which of the following is not a linear data structure
a) Arrays
b) Linked list
c) Both of these
d) None of these
Answer: (d )
25.A self-referential structure contains a pointer member that points to a structure of the same structure type. For example, the
following definition of structure node.
struct node {
int data;
struct node *nextPtr;
}; True (True/ False)

26 26. Function malloc returns a pointer of type void * to the memory it allocates. If it is unable to allocate memory, it returns a NULL
pointer. True (True/ False)
27 27.A linked list is a linear collection of self-referential structures, called nodes, connected by pointer linkshence, the term "linked" list.
True (True/ False)

28 28. A tree is an example of linear data structure. False (True/ False)
29. Following are the steps for a post order traversal of a binary tree True (True/ False)
Traverse the left subtree in post order
Traverse the right subtree in post order
Process the value in the node


30. Consider the following tree.



2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 6/13







If the post order travesal gives ab cd * + then the label of the
nodes 1, 2, 3, .. will be
(a) +, -, *, a, b, c, d (b) a, -, b, +, c, *, d
(c) a, b, c, d, -, *, + (d) -, a, b, +, *, c, d

Ans: (a)
31. Consider the following tree.

If this tree is used for sorting then a new number 8 is placed as the:

(a) left child of node labeled 30 (b) right child of node labeled 5
(c) right child of node labeled 30 (d) left child of node labeled 10
Ans: (b)

32. The initial configuration of a queue is a. b. c. d. (a is in the front end). To get the configuration d. c. b. a. one needs a minimum of

(a) 2 deletions and 3 additions (b)3 deletions and 2 additions
(c) 3 deletions and 3 additions (d) 3 deletions and 4 additions
Ans: ( c )
33. The number of possible ordered trees with 3 nodes A, B, C is

(a) 16 (b) 12 (c) 6 (d) 10
Ans: (c)
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 7/13
34. The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is

(a) 11 (b) 12 (c) 13 (d) 14
Ans: (d)
35. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10
leaves
(a) can not have more than 19 nodes (b) has exactly 19 nodes
(c) has exactly 17 nodes (d) can not have more than 17 nodes
Ans: (b)
36. Preorder is nothing but
(a) depth-first order (b) breadth- first order
(c) topological order (d) linear order
Ans: (a)
37. Which of the following traversal techniques lists the nodes of a binary search tree in ascending order ?
(a) post-order (b) in-order (c) Pre-order (d) None of the above
Ans: (b)
38. There are 4 different algorithms A1, A2, A3, A4 to solve a given problem with the order log (n), loglog (n), nlog (n), n/log (n)
respectively. Which is the best algorithm?
(a) A1 (b) A2 (c) A4 (d) A3
Ans: (b)
39. The number of possible binary trees with 3 nodes is
(a) 12 (b) 13 (c) 5 (d) 15
Ans: ( c )
40. Sorting is useful for
(a) report generation (b) minimizing the storage needed
(c) making searching easier and efficient (d) responding to queries easily
Ans: ( c )
41. Choose the correct statements.
(a) Internal sorting is used if the number of items to be sorted is very large.
(b) External sorting is used if the number of items to be sorted is very large
(c) External sorting needs auxiliary storage
(d) Internal sorting needs auxiliary storage
Ans: ( c )
42. A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the
original unsorted list is said to be
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 8/13
(a) stable (b) consistent (c) external (d) linear
Ans: (a)
43. The way a card game player arranges his cards as he picks them up one by one, is an example of
(a) bubble sort (b) selection sort (c) insertion sort (d) merge sort
Ans: ( c )
44. You want to check whether a given set of items is sorted or not. Which of the following sorting methods will be the most efficient if it
is already in sorted order.
(a) bubble sort (b) selection sort (c) insertion sort (d) merge sort
Ans: (d)
45. Which of the following sorting methods will be the best if number of swapping done, is the only measure of efficiency?
a) Bubble sort (b) Selection sort (c) Insertion sort (d) Quick sort
Ans: ( c )
46. Which of the following sorting algorithm has the worst time complexity of nlogn?
a) Heap sort (b) Quick sort (c) Insertion sort (d) Selection sort
Ans: (a)
47. The postfix equivalent of the prefix * + a b c d is
(a) ab + cd -* (b) abcd + -* (c) ab + cd* (d) ab + cd*
Ans: (a)
48. The order of the binary search algorithm is
a) n (b) n
2
(c) nlogn (d) logn
Ans: (d)
49. The aver45age search time of hashing, with linear probing will be less kf the load factor
(a) is far less than one (b) equals ones
(c) is far greater than one (d) none of the above
Ans: (a)
50. Pick the correct statements.
(a) Sequential file organization is suitable for batch processing
(b) Sequential file organization is suitable for interactive processing
(c) Indexed sequential file organization supports both batch and interactive processing
(d) Relative file cant be accessed sequentially
Ans: (a) and ( c)

51. Stacks cant be used to
(a) Evaluate an arithmetic expression in postfix form
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 9/13
(b) Implement recursion
(c) Convert a given arithmetic expression in infix form to its equivalent postfix form
(d) Allocate resources (like CPU) by the operating system
Ans: (d)
52. Which of the following abstract data types can be used to represent a many to many relation?
(a) Tree (b) Plex (c) Graph (d) Queue
Ans: (c )
53. Merge sort uses
(a) divide and conquer strategy (b) backtracking approach
(c) heuristic search (d) greedy approach
Ans: (a)
54. The postfix expression for the infix expression
A + B* (C+D) /F + D*E is
(a) AB+CD+*F/D+E* (b) ABCD+*F/+DE*+
(c) A*B+CD/F*DE++ (d) A+*BCD/F*DE++
Ans: (b)
55. Which of the following statements is true?
I. As the number of entries in the hash table increases, the number of collisions increases.
II. Recursive programs are efficient.
III The worst time complexity of quick sort is O(n
2
).
IV.Binary search using a linked list is efficient.

(a) I and II (b) II and III (c) I and IV (d) I and III
Ans: (d)
56. In a circularly linked list organization, insertion of a record involves the modification of
(a) no pointer (b) 1 pointer (c) 2 pointers (d) 3 pointers
Ans: (c )
57. Stack is useful for implementing
(a) radix sort (b) breadth first search (c) recursion (d) depth first search
Ans: (d)

58. Which of the following is useful in implementing quick sort?
a) stack b) set c) list d) queue
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 10/13
Ans: (a)
59. Queue can be used to implement
(a) radix sort (b) quick sort (c) recursion (d) depth first search
Ans: (a)
60. The process of accessing data stored in a tape is similar to manipulating data on a
(a) stack (b) queue (c) list (d) heap
Ans: (b)

61. Which of the following algorithm design technique is used in the quick sort algorithm?
(a) Dynamic programming (b) Backtracking
(c) Divide and conquer (d) Greedy method
Ans: ( c)
62. Linked lists are not suitable for which of the following problems?
(a) Insertion sort (b) Binary search (c) Radix sort (d) Polynomial manipulation
Ans: (c )
63. A tree can have 2 roots. False (True or False)
64. When an existing sequential file is opened for output (File.CreateText), then the WriteLine statement will add the new data to the
end of the existing file True (True or False)
65. Arrays are dynamic data structures. False (True or False)
66. Linked list is a sequential collection of data items. True (True or False)
67. Iteration and recursion are the same thing. False (True or False)
68. Arrays are always consecutive in memory locations. True (True or False)

Also see C programming Multiple choice question

2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 11/13


Leave a Reply
Name (*)
Mail (will not be published) (*)
Website
Submit Comment
Additional Articles From "SOLVED QUESTION PAPERS"
Solved Logical Verbal Reasoning Aptitude Questions For Competitive Exams Admission Notification
HR INTERVIEW IMPORTANT QUESTIONS AND ANSWERS TIPS and Tricks
How To Prepare Good Computer Science C Programming Lecture Plan
C Programming Descriptive Question and Answer for Interview
Data Base Management System Multiple Choice Questions with Answers
GATE Computer Science ,Electronics and Electrical Enggineering Importent Questions
Kurukshetra University, Haryana- Admission News 2013 For BA-LLB (Hons.) Integrated
MANUFACTURING PROCESS SOLVED PAPER OF GBTU/UPTU/MTU
ENGGINEERING CHEMISTRY SOLVED PAPER OF GBTU/UPTU/MTU
PROFESSIONAL COMMUNICATION SOLVED PAPER OF GBTU/UPTU/MTU
Get latest admission alert Notification

Enter Email Here
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 12/13
Reach more customers with the best web directory for free where you can find more resources about Current Events Directory
Search Open Directory
dmoz.org
Backlink Checker Tool - SEOSkipper
link directory
Free Link Exchange
Link Exchange at iWEBTOOL.com
Free Link Directory - Free Website Link Listing Directory - Submit Your Website Link Free
LinkBook
Stay in Touch
Recent Posts
2/18/2014 Data structure Multiple Choice questions | Admissionadda.com @ School,College,University Admission
http://admissionadda.com/data-structure-multiple-choice-questions/ 13/13
Copyright 2012 Admissionadda.com @ School,College,University Admission

Certificate Course in Hospital Financial

Management Admission Notice 2014 at The
Chennai , India
Website:www.thesnacademy.ac.inPh.No.:91 - 44 - 4908
6000 The Sankara Nethralaya Academy announces
Certification Course in Hospital Financial Management
Admission Notice 2014.Doctors and health staff can
apply. Objective of The Program: To enable Healthcare
Administrators, Doctors, and Consultants- appreciate and
understand: [more]