Data Structures and Algorithms (PreLimQuiz-1&Quiz-2)
This course covers overview of C++, concepts of data structures, advance topics in C++ programming including its algorithm of the different data structures programs in C++.
Question 1
Question text
The situation when in a linked list START=NULL is ____________________.
Question 2
Question text
Each node in a linked list must contain at least ___________________.
Question 3
Question text
Value of first linked list index is _______________.
Question 4
Question text
A linear list in which the last node points to the first node.
Question 5
Question text
The operation of processing each element in the list is known as ________________.
Question 6
Question text
Which of the following is two way lists?
Question 7
Question text
What is a run list?
Question 8
Question text
Which is the pointer associated with the availability list?
Question 9
Question text
The dummy header in linked list contains ____________________.
Question 10
Question text
This is a linear list in which insertions and deletions are made to form either end of the structure.
Question 1
Question text
Stack follows the strategy of ________________.
Question 2
Question text
The elements are removal from a stack in _________ order.
Question 3
Question text
This form of access is used to add/remove nodes from a stack.
Question 4
Question text
The term used to insert an element into stack.
Question 5
Question text
Which of the following names does not relate to stacks?
Question 6
Question text
What happens when you push a new node onto a stack?
Question 7
Question text
A pointer variable which contains the location at the top element of the stack.
Question 8
Question text
Which is the pointer associated with the stack?
Question 9
Question text
What is a queue?
Question 10
Question text
In linked representation of stack, ___________ fields hold the elements of the stack.