In a priority queue, insertion and deletion takes place at __________
A. front, rear end B. only at rear end C. only at front end D. any position Submitted By : Ahsan Ali Soomro
Data Structure and Algorithms
A ______ is a linear list in which insertions and deletions are made to from either end of the structure.
A. circular queue B. random of queue C. priority D. dequeue Submitted By : Ahsan Ali Soomro
A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ______.
A. Singly Linked List B. Circular Linked List C. Doubly Linked List D. Linear Linked List Submitted By : Ahsan Ali Soomro
The way in which the data item or items are logically related defines _____.
A. storage structure B. data structure C. data relationship D. data operation Submitted By : Ahsan Ali Soomro
Operations on a data structure may be ______.
A. creation B. destruction C. selection D. all of the above Submitted By : Ahsan Ali Soomro
A data structure where elements can be added or removed at either end but not in the middle is called _____.
A. linked lists B. stacks C. queues D. dequeue Submitted By : Ahsan Ali Soomro
When new data are to be inserted into a data structure, but there is not available space; this situation usually called ______.
A. Underflow B. overflow C. houseful D. saturated Submitted By : Ahsan Ali Soomro
Which of the following data structure store the homogeneous data elements?
A. Arrays B. Records C. Pointers D. Lists Submitted By : Ahsan Ali Soomro
Which of the following data structures are indexed structures?
A. Linear arrays B. Linked lists C. Queue D. Stack Submitted By : Ahsan Ali Soomro
_____is a directed tree in which outdegree of each node is less than or equal to two.
A. Unary tree B. Binary tree C. Trinary tree D. Both B and C Submitted By : Ahsan Ali Soomro