Tutorials
PPTs
Lecture Notes
Objective Questions
Lab ProgramsObjective Type Questions & Answers
Data Structures Objective Type Question Bank-Unit-1
1. What is a data structure?
A . A programming language
B . A collection of algorithms
C . A way to store and organize data
D . A type of computer hardware
2. Which data structure is used for implementing recursion?
A . Stack
B . Queue
C . List
D . Array
3. Which data structure is needed to convert infix notation to postfix notation?
A . Tree
B . Hashing
C . Stack
D . Queue
4. What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
A . Stack
B . Linked List
C . Tree
D . Queue
5. In linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
A . Pointer to character
B . Pointer to integer
C . Pointer to node
D . Node
6. Which of these is not an application of a linked list?
A . To implement file systems
B . For separate chaining in hash-tables
C . To implement non-binary trees
D . Random Access of elements
7. Which of the following real world scenarios would you associate with a stack data structure?
A . piling up of chairs one above the other
B . people standing in a line to be serviced at a counter
C . offer services based on the priority of the customer
D . tatkal Ticket Booking in IRCTC
8. What does ‘stack underflow’ refer to?
A . accessing item from an undefined stack
B . adding items to a full stack
C . removing items from an empty stack
D . index out of bounds exception
9. Array implementation of Stack is not dynamic, which of the following statements supports this argument?
A . space allocation for array is fixed and cannot be changed during run-time
B . user unable to give the input for stack operations
C . a runtime exception halts execution
D . improper program compilation
10. In linked list implementation of a queue, where does a new element be inserted?
A . At the head of link list
B . At the centre position in the link list
C . At the tail of the link list
D . At any position in the linked list
11. In a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
A . Only front pointer
B . Only rear pointer
C . Both front and rear pointer
D . No pointer will be changed
12. In a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
A . Only front pointer
B . Only rear pointer
C . Both front and rear pointer
D . No pointer will be changed
13. In linked list implementation of a queue, from where is the item deleted?
A . At the head of link list
B . At the centre position in the link list
C . At the tail of the link list
D . Node before the tail
14. In a queue, the important condition for a queue to be empty is?
A . FRONT is null
B . REAR is null
C . LINK is empty
D . FRONT==REAR-1
15. The elements of a linked list are stored
A . In a structure
B . In an array
C . Anywhere the computer has space for them
D . In contiguous memory locations
16. The prefix form of A-B/ (C * D ^ E) is?
A . -A/B*C^DE
B . -A/BC*^DE
C . -ABCD*^DE
D . -/*^ACBDE
17. The type of expression in which operator succeeds its operands is?
A . Infix Expression
B . Prefix Expression
C . Postfix Expression
D . Both Prefix and Postfix Expressions
18. In infix to postfix conversion algorithm, the operators are associated from?
A . right to left
B . left to right
C . centre to left
D . centre to right
Fill in the Blanks
19. ......... form of access is used to add and remove nodes from a queue.
20. New nodes are added to the ......... of the queue
21. The term push and pop is related to ............
22. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as .........
23. A stack, if implemented using an array of size MAX_SIZE, stack gets full when ...........
24. Convert the following infix expressions into its equivalent postfix expressions (A + B * D)/(E – F)+G ............
25. In a stack, if a user tries to remove an element from an empty stack it is called ............
26. What is the value of the postfix expression 6 3 2 4 + – *?
Relevant Materials :
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
Similar Materials :
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]
☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]
☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]
☞ Java Programming Objective Type Question Bank - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]