This action might not be possible to undo. Are you sure you want to continue?

Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting and searching.

Set - 1

1. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space

2. The time factor when determining the efficiency of algorithm 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

3. The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm b. Counting the minimum memory needed by the algorithm c. Counting the average memory needed by the algorithm d. Counting the maximum disk space needed by the algorithm

4. Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case

5. 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

6. 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

7. The complexity of the average case of an algorithm is a. Much more complicated to analyze than that of worst case b. Much more simpler to analyze than that of worst case c. Sometimes more complicated and some other times simpler than that of worst case d. None or above

8. The complexity of linear search algorithm is a. O(n) b. O(log n)

c. O(n2) d. O(n log n)

9. The complexity of Binary search algorithm is a. O(n) b. O(log ) c. O(n2) d. O(n log n)

10. The complexity of Bubble sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

11. The complexity of merge sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

12. The indirect change of the values of a variable in one module by another module is called a. internal change b. inter-module change c. side effect d. side-module update

None of above 14. None of above 15. Both of above d.13. The operation of processing each element in the list is known as a. Inserting d. Trees b. Graphs c. Traversal 16. Traversal b. Merging c. Arrays d. Sort d. Which of the following data structure is linear data structure? a. Sorting b. Arrays b. Which of the following data structure is not linear data structure? a. Search c. Linked lists c. None of above . Finding the location of the element with a given value is: a.

17. none of above Answers . implicitly or explicitly. Linked lists are best suited a. for none of above situation 18. for relatively permanent collections of data b. for both of above situation d. the architecture of computer memory does not allow arrays to store other than serially c. Each array declaration need not give. for none of above situation 19. the information about a. the data type of array c. The elements of an array are stored successively in memory cells because a. for relatively permanent collections of data b. the name of array b. the index set of the array 20. both of above d. for the size of the structure and the data in the structure are constantly changing c. the first data from the set to be stored d. Arrays are best data structures a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d.

The Worst case occur in linear search algorithm when d. Which of the following case does not exist in complexity theory d. The complexity of merge sort algorithm is d. The complexity of the average case of an algorithm is a. The space factor when determining the efficiency of algorithm is measured by a. O(n2) 11. O(n) 9. Counting the maximum memory needed by the algorithm 4. O(log n) 10.1. The Average case occur in linear search algorithm a. The complexity of Bubble sort algorithm is c. Item is the last element in the array or is not there at all 6. Null case 5. The complexity of Binary search algorithm is b. The time factor when determining the efficiency of algorithm is measured by b. Time and space 2. Much more complicated to analyze than that of worst case 8. When Item is somewhere in the middle of the array 7. O(n log n) . Two main measures for the efficiency of an algorithm are c. Counting the number of key operations 3. The complexity of linear search algorithm is a.

Which of the following data structure is linear data structure? c. Arrays 15. Search 17.2 . side effect 13. Traversal 16. Finding the location of the element with a given value is: b. Linked lists are best suited b.12. The operation of processing each element in the list is known as d. for relatively permanent collections of data 18. Each array declaration need not give. None of above 14. the information about c. for the size of the structure and the data in the structure are constantly changing 19. The indirect change of the values of a variable in one module by another module is called c. Arrays are best data structures a. implicitly or explicitly. The elements of an array are stored successively in memory cells because a. the first data from the set to be stored 20. Which of the following data structure is not linear data structure? d. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated Set .

none of above . Which of the following is not the required condition for binary search algorithm? a. LOC(Array[5])=Base(Array[5])+(5-lower bound). there should be the direct access to the middle element in any sublist c. where w is the number of words per memory cell for the array c. linked lists c. first address d. LOC(Array[5])=Base(Array[4])+(5-Upper bound). 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). base address 2. There must be mechanism to delete and/or insert elements in list d. where w is the number of words per memory cell for the array b. The list must be sorted b. floor address b. The memory address of the first element of an array is called a. None of above 3. where w is the number of words per memory cell for the array d.1. Which of the following data structures are indexed structures? a. both of above d. linear arrays b. foundation address c. none of above 4.

P can store only memory addresses d. P contains the address of an element in DATA. requirement of sorted array is expensive when a lot of insertion and deletions are needed c. binary search algorithm is not efficient when the data elements are more than 1000. 6. none of above 7.5. Which of the following data structure store the homogeneous data elements? a. tables arrays b. Which of the following data structure can't store the non-homogeneous data elements? a. Records c. Pointers d. Arrays b. None 9. Two dimensional arrays are also called a. Records . must use a sorted array b. P contain the DATA and the address of DATA 8. A variable P is called pointer if a. P points to the address of first element in DATA c. b. both of above d. Which of the following is not a limitation of binary search algorithm? a. Arrays b. there must be a mechanism to access middle element directly d. matrix arrays c.

None 10. sorted binary trees c. those items which are indecomposable are called a. atoms c. sorted linear array . c. All of above 12. An array is suitable for homogeneous data but hte data items in a record may have different data type b. Binary search algorithm can not be applied to a.c. Arrays are dense lists and static data structure b. scalars d. sorted linked list b. data elements in linked list need not be stored in adjecent space in memory c. elementary items b. Pointers d. linked lists are collection of the nodes that contain information part and next pointer 13. pointers store the next data element of a list d. In a record. all of above 11. Each data item in a record may be a group item composed of sub-items. The difference between linear array and a record is a. Which of the following statement is false? a. A record form a hierarchical structure but a lienear array does not d. there may not be a natural ordering in opposed to linear array.

housefull d. linked list with header and trailer nodes d. this situation is usually called a. Which of the following is two way list? a. Push-down lists . FIFO lists b. none of above 17. Which of the following name does not relate to stacks? a. overflow c. Piles d. but there is no available space. overflow c. LIFO list c.d. housefull d. pointer array 14. saturated 16. When new data are to be inserted into a data structure. The situation when in a linked list START=NULL is a. underflow b. circular header list c. saturated 15. grounded header list b. underflow b.

array b. FAEKCDHGB c. Deque 20. The memory address of fifth element of an array can be calculated by the formula . A data structure where elements can be added or removed at either end but not in the middle a. The memory address of the first element of an array is called d. The term "push" and "pop" is related to the a. FEAKDCHBG Answers 1. the preorder traversal would return (C. When inorder traversing a tree resulted E A C K F H D B G. lists c. Stacks c. EAFKHDCBG d. stacks d. base address 2. Linked lists b.18. Queues d. all of above 19. FAEKCDBHG b.Technical) a.

There must be mechanism to delete and/or insert elements in list 5. Each data item in a record may be a group item composed of sub-items. Which of the following data structures are indexed structures? a. Records 10. Which of the following data structure can't store the non-homogeneous data elements? a. both of above 7. Two dimensional arrays are also called c. A variable P is called pointer if a. Which of the following is not the required condition for binary search algorithm? c. Arrays 9. binary search algorithm is not efficient when the data elements are more than 1000. Which of the following is not a limitation of binary search algorithm? d.a. 6. linear arrays 4. 8. 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 structure store the non-homogeneous data elements? b. all of above . P contains the address of an element in DATA. those items which are indecomposable are called d.

sorted linked list 14. overflow 15. pointers store the next data element of a list 13. Binary search algorithm can not be applied to a. Deque . When new data are to be inserted into a data structure. underflow 16. A data structure where elements can be added or removed at either end but not in the middle d. none of above 17. but there is no available space. Which of the following statement is false? c. All of above 12. The difference between linear array and a record is d. Which of the following name does not relate to stacks? a. The term "push" and "pop" is related to the c. The situation when in a linked list START=NULL is a. stacks 19. this situation is usually called b. Which of the following is two way list? d.11. FIFO lists 18.

20. Strings b. Lists c.3 1. Binary search tree 2. Input-restricted deque b. Deque . None of above 3. Stacks d. FAEKCDHGB Set . Priority queues d. Which of the following data structure is non-linear type? (C-Technical) a. To represent hierarchical relationship between elements. Which data structure allows deleting data elements from front and inserting at rear? a. which data structure is suitable? a. the preorder traversal would return b. Deques d. Queues c. All of above 5. None of above 4. Lists c. (C-Technical) a. Stacks b. Queues d. When inorder traversing a tree resulted E A C K F H D B G. Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Output-restricted deque c. Strings b. Which of the following data structure is linear type? (C-Technical) a.

Dn = n log2n b. the variables and operations in E will appear only in external nodes 9. vanished on extended tree d. all the original nodes in binary tree are (C-Technical) a. A binary tree can easily be converted into q 2-tree a. When representing any algebraic expression E which uses only binary operations in a 2-tree. Dn = n log2n+1 c. Tree d. the variables and operations in E will appear only in internal nodes d. by inserting an external nodes for non-empty node d. Priority c. internal nodes on extended tree b. external nodes on extended tree c. None of above 7. by inserting an internal nodes for non-empty node c. Binary search tree c. None of above .b. All of above 6. the variable in E will appear as external nodes and operations in internal nodes b. Dn = log2n d. Complete binary tree b. Dn = log2n+1 8. the operations in E will appear as external nodes and variables in internal nodes c. The depth of a complete binary tree is given by a. When converting binary tree into extended binary tree. by replacing each empty sub tree by a new external node 10. by replacing each empty sub tree by a new internal node b. A binary tree whose every node has either zero or two children is called a. Extended binary tree d. a.

Insertion sort c. Polish notation d. ABDCEF 12. The in order traversal of tree will yield a sorted listing of elements of tree in a. Recursion c. An algorithm that calls itself directly or indirectly is known as a. The post order traversal of a binary tree is DEBFCA. Binary trees b. path d. In a Heap tree a. ABDECF d. Values in a node is greater than every value in children of it c. Sub algorithm b. Find out the pre order traversal a. certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. Bubble sort b. None of above conditions applies . thread 15. These special pointers are called a. Which of the following sorting algorithm is of divide-and-conquer type? a. Heaps d. Traversal algorithm 14. None of above 16. ADBFEC c. ABFCDE b. Binary search trees c. Values in a node is greater than every value in left sub tree and smaller than right sub tree b. In a binary tree. branch c. All of above 13. Leaf b.11. Quick sort d. Both of above conditions applies d.

If every node u in G is adjacent to every other node v in G. Queues . a tree d. A graph is said to be a. free tree c. a tree graph b. Then u and v are called a.17. In a graph if e=(u. finite d. all of above 18. All of above 19. endpoints of e b. neighbors d. v]. complete c. strongly connected Answers: 1. adjacent nodes c. both b and c 20. In a graph if e=[u. isolated b. e begins at u and ends at v c. A connected graph T without any cycles is called a. Which data structure allows deleting data elements from front and inserting at rear? b. u is adjacent to v but v is not adjacent to u b. v) means a. u is processor and v is successor d.

A binary tree can easily be converted into q 2-tree d. Tree 6. Which of the following data structure is non-linear type? d. Quick sort 13. Input-restricted deque 3. All of above 5. by replacing each empty sub tree by a new external node 10. a. None of above 4. all the original nodes in binary tree are a. which data structure is suitable? c. the variable in E will appear as external nodes and operations in internal nodes 9. Extended binary tree 7. An algorithm that calls itself directly or indirectly is known as b.2. Which of the following data structure is linear type? d. The post order traversal of a binary tree is DEBFCA. Which of the following sorting algorithm is of divide-and-conquer type? c. Dn = log2n + 1 8. The depth of a complete binary tree is given by d. A binary tree whose every node has either zero or two children is called c. When converting binary tree into extended binary tree. Recursion . internal nodes on extended tree 11. a. When representing any algebraic expression E which uses only binary operations in a 2-tree. Identify the data structure which allows deletions at both ends of the list but insertion at only one end. ABDECF 12. Find out the pre order traversal c. To represent hierarchical relationship between elements.

The in order traversal of tree will yield a sorted listing of elements of tree in b. Then u and v are called d. In a Heap tree b. all of above 18. In a binary tree. A connected graph T without any cycles is called d.K. In a graph if e=[u. Values in a node is greater than every value in children of it 17. both b and c 20. certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. In a graph if e=(u. David Filo) Who helped to Denis Ritchi to make UNIX? (Ken Thompson) Who is the defense minister of India? (A. thread 15. If every node u in G is adjacent to every other node v in G.14. All of above 19. complete GK: (C) • • • • • How many centuries made by Sachin Tendulakar? (99) Who is the founder of yahoo? ( Jerry Yang. v].Antony) How many medals did India win in Common Wealth Games? (101) . A graph is said to be b. These special pointers are called d. v) means d. Binary search trees 16.

println(“ture”).alpha() can be used to call alpha method of class Cignex. which of the following option is true? Answer: Cinex. if(a instanceof Object) { System. Que:2 Class Test { public static void main(String args[]) { String a[]=new String[3]. .out.Technical: (C) Que:1 class Cignex { public static void alpha() { } void beta() { } } For the above code.

} else { System. which of the following option is true? • • Class Cignex has three constructors. Class Cignex has 1 default constructor.println(“false”). --> true .int) { } int Cignex(int. int) { } } For the above chunk of code.out. } } } What is the output of the problem? Que: 3 Class Cignex { Cignex() { } Cignex(int.

s1. (Answer) Class Cignex has one two argumented Constructors. } System. Write answer whether it is TRUE or FALSE?? s1==s2 String s1=”Cignex”.println(x + " " + y).• • Que: 4 Class Cignex has two Constructors. String s2=s1. int y= 0. z < 5. String s2=”cignex”. for (int z = 0.equals(s2) Que: 5 What will be the output of the program? class Test { public static void main(String [] args) { int x= 0. z++) { if (( ++x > 2 ) || (++y > 2)) { x++. String s1=new String(”Cignex”). . } } } Que: 6 Find the output of the program: String s1 = “CIGNEX”.out. int i1= 3.

out. Que: 7 What is the true option for method over loading? .int i2=7. So please be clear before answering.println(s1+(i1+i2)). Answer: CIGNEX10 Note: Now the questions are something tricky and based on theory concepts. System.

.

Garbage collector can only be requested.For Overloading: • • • • Overloaded methods MUST change the argument list. Que: 8 Which statement is incorrect? • • • • Garbage collector deletes the objects whose reference is not found. . You can’t force it. Overloaded methods CAN change the return type. Garbage collector can guarantee that finalize() method may never call. Overloaded methods CAN change the access modifier. Finalize() method is called only once before the garbage collection starts. Overloaded methods CAN declare new or broader checked exceptions.

Hence the required symbol is 8. Que: 10 Sorry. Train and Bus ? A. C.Que: 9 This Question was regarding the concept of polymorphism and inheritance. + and $. Which symbol will be on the face opposite to the face with symbol * ? A.) 1. somewhat IS-A and HAS-A test. I don’t remember this question…!!! Aptitude: (C) (total 10 questions but here are 9 of them. . D. the 10th one. $ + Answer & Explanation Answer: Option C Explanation: The symbols of the adjacent faces to the face with symbol * are @. I don’t remember. Which of the following diagrams indicates the best relation between Travelers. B. -. @ 8 B. 2.

E. If A's share is Rs. 5 . If 5% of the total profit goes to charity and A's share is Rs. 2E. 1500 Rs. 855. (1!)(2!)(1!)(1!)(1!) 4. A's share = Rs. 57. 95 x 3 = Rs. namely 1L. Rs. Rs. total profit = 100 57 x 855 = 1500. total profit = Rs. D. 1537. In how many ways can the letters of the word 'LEADER' be arranged? A. A and B invest in a business in the ratio 3 : 2. Answer & Explanation D. 855. 100. After paying to charity. 144 720 Answer & Explanation Answer: Option C Explanation: The word 'LEADER' contains 6 letters. 3.50 B. 1425 Rs. 57. Answer: Option C Explanation: Bus and Train are different from each other but some travelers travel by bus and some travel by train. 1A.C. 72 360 None of these B. 100. C. 1576 Answer & Explanation Answer: Option B Explanation: Let the total profit be Rs. If A's share Rs. the total profit is: A. D. Required number of ways = 6! = 360. 1D and 1R. C.

123. = 23 6. = Rs 1200 x 10 x1 100 5 C.I.50 Rs. 120. Two trains running in opposite directions cross a man standing on the platform in 27 seconds and 17 seconds respectively and they cross each other in 23 seconds. 3. The ratio of their speeds is: A. 1200 x 1+ 100 2 = Rs.5. 1200 = Rs. and length of the second train = 17y metres. E. 3:2 None of these Answer & Explanation Answer: Option B Explanation: Let the speeds of the two trains be x m/sec and y m/sec respectively. 27x + 17y x+ y 27x + 17y = 23x + 23y 4x = 6y x = y 2 3 . D. 1:3 3:4 B. Rs. D. 1200 for one year at 10% per annum reckoned half-yearly is: A. = Rs. 3 Rs. 2. C. length of the first train = 27x metres.I. . The difference between simple interest and compound on Rs. Rs. C. Then.75 None of these B. 4 Answer & Explanation Answer: Option B Explanation: S.

3 4 8 21 Answer & Explanation Answer: Option A Explanation: Total number of balls = (8 + 7 + 6) = 21. E. 3. This has 7 (6 + 1) letters of which R occurs 2 times and the rest are different. n(E) P(E) = n(S) 8. 3 7 C. n(E) = 7. we have CRPRTN (OOAIO). Let E = event that the ball drawn is neither red nor green = event that the ball drawn is blue. . 19 9 E. 21 D. C. 7. = 21 7 = 3 1 . D. we treat the vowels OOAIO as one letter.Difference = Rs. there are 8 red. One ball is picked up randomly. In a box.120) = Rs. In how many different ways can the letters of the word 'CORPORATION' be arranged so that the vowels always come together? A. (123 . What is the probability that it is neither red nor green? 1 A. 810 2880 5760 B. 1440 50400 Answer & Explanation Answer: Option D Explanation: In the word 'CORPORATION'. B. Thus. 7 blue and 6 green balls.

39 persons can repair a road in 12 days. can be arranged 5! in 3! Required number of ways = (2520 x 20) = 50400. 5 vowels in which O occurs 3 times and the rest are different. = 20 ways. In how many days will 30 persons. D. 2! Now. 13 15 Answer & Explanation Answer: Option B Explanation: Let the required number of days be x. . More days (Indirect Proportion) More working hours per day. working 5 hours a day. 10 14 B. 9. Less days (Indirect Proportion) Persons Working hours/day 30 : 39 :: 12 : x 6 : 5 30 x 6 x x = 39 x 5 x 12 (39 x 5 x 12) x= (30 x 6) x = 13. working 6 hours a day.Number of ways arranging these letters = 7! = 2520. complete the work? A. Less persons. C.

Sign up to vote on this title

UsefulNot useful- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_by Arabinda Parida
- data-structures-a-algorithms-multiple-choice-questions-mcqs-objective-set-2by trojan100t
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1by sridv774648
- MCQ's of Operating System (OS)by Anik

- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_
- data-structures-a-algorithms-multiple-choice-questions-mcqs-objective-set-2
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1
- MCQ's of Operating System (OS)
- Operating System Mcq
- Software Engineering Solved Mcqs
- DBMS.MCQs
- os-mcq
- c Multiple Choice Questions and Answers PDF
- Database Management System and Design MCQ
- Computer Networks mcq
- Typical Q&A- SOftware Engineering
- 600+ DBMS MCQs
- UNIX - MCQ
- Data Structures and Algorithms Multiple Choice Questions and Answers PDF
- Multiple Choice Question of Computer Networking
- Operating System Mcq Bank
- Computer Networks MCQs
- Software Engineering Quiz
- 1000+ MCQ on Microprocessor & Microcontroller
- Mcqs on Software Engineering
- Software Engineering MCQ Exam
- Theory of Computation MCQs
- multiple choice questions - OS,DS,N/W,DBMS ,CO,C,C++
- MCQ on Operating System
- Solved MCQ of Computer Security and Network Security
- Operating System MCQs-2
- Digital Electronics MCQ
- Operating System MCQS (GATE)
- Object Oriented Programming MCQs
- Data Structure MCQ

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd