A queue is a ?
a) FIFO (First In First Out) list b) LIFO (Last In First Out) list. c) Ordered array d) Linear tree
The data structure required for Breadth First Search on a graph is?
a) Stack b) Array c) Queue d) Tree
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 a ?
a) Queue b) Stack c) Tree d) Linked list
Which of the following statement(s) about stack data structure is/are NOT correct?
(a) Stack data structure can be implemented using linked list (b) New node can only be added at the top of the stack (c) Stack is the FIFO data structure (d) The last node at the bottom of the stack …
Read more →
What is the type of the algorithm used in solving the 8 Queens problem?
(a)Greedy (b)Dynamic (c)Branch and Bound (d)Backtracking
What data structure is used to perform recursion?
(a) Queue (b) Linked list (c) Stack (d) Double Linked List
Instack,Insertion and deletion can be done only at the_____ element
A. Any B. Top C.(n-1) D. None of the above
Stack in data structure is _________.
a) FIFO b) None of these c) LILO d) LIFO
In the stack process of inserting an element in the stack is called as ___________.
A.Pop B.Push C.Evaluation D.Create
Process of removing element from the stack is called as _______.
A.Pop B. Delete C. Push D. Remove
In the stack, If user try to remove element from the empty stack then it called as _______
A.Garbage Collection B. Underflow of Stack C. Empty collection D. Overflow of stock.
User push 1 element in the stack having already five elements and having stack size as 5 then stack becomes ___________.
A.Underflow B.Overflow C.Crash D.User Flow
Linked lists are best suited _______
A. for relatively permanent collections of data. B. for the size of the structure and the data in the structure are constantly changing. C. data structure D. for none of above situation
A linear list in which the pointer points only to the successive node is ________
A. singly linked list B. circular linked list C. doubly linked list D. none of the above
A linear collection of data elements where the linear node is given by means of pointer is called
(A) linked list (B) node list (C) primitive list (D) None of these
In a circular linked list .
(A) components are all linked together in some sequential manner. (B) there is no beginning and no end. (C) components are arranged hierarchically. (D) forward and backward traversal within the list is permitted.