Scribd
Upload
2 views6 pages

More Mcqs Data Structure and Algorithms [Set 9]

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA), focusing primarily on linked lists, their properties, and operations. Key topics include underflow, circular lists, node structures, and the time complexity of various operations. Answers to each question are provided, indicating the correct choice for each query.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views6 pages

More Mcqs Data Structure and Algorithms [Set 9]

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA), focusing primarily on linked lists, their properties, and operations. Key topics include underflow, circular lists, node structures, and the time complexity of various operations. Answers to each question are provided, indicating the correct choice for each query.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Data Structure and Algorithms (DSA)

9 of 14 sets

401. _______ refers to situation where one wants to delete data form a data
structure that is empty.
A. free storage
B. underflow
C. overflow
D. compaction
Answer:B

402. ________ is an organization that provides faster request and return time
response.
o m
A. stack
. c
B. queue
te
C. buddy system
a
D. recursion

q M
Answer:C
c
M of fragmentation by moving all the allocated
403. _______ attacks the problem
blocks to one end of memory, thus combining all the holes.
A. garbage collection
B. garbage compaction
C. buddy system
D. queue
Answer:B

404. A _______ list structure can be traversed in two directions-- in the forward
direction from beginning of the list to end, or in the backward direction, from the
end of the list to the beginning.
A. one way
B. linear array
C. two way
D. header
Answer:C

405. _________ header list combines the advantages of a two-way list and a
circular header list.
A. one way
B. two way circular
C. two way
D. header
Answer:B

406. In linked list,a node contain


A. node,adrees field and data field
B. node number and data field
C. next adress field and information field
D. none of the above
Answer:C

407. In linked list,the logical order of elements


A. is same as their physical arrangement
B. is not necessarily equivalent to their physical arrangement
C. is determined by their physical arrangement
D. none of the above
Answer:B

408. Null pointer is used to tell


A. end of linked list
B. empty pointer field of a structure
C. the linked list is empty
D. all of the above
Answer:D

409. List pointer variable in linked list contains address of the


A. following node in the first
B. current node in the first
C. first node in the first
D. none of the above

View all MCQ's at McqMate.com


Answer:C

410. Because of linear structure of linked list having linear ordering,there is


similarity between linked list and array in
A. insertion of a node
B. deletion of a node
C. traversal of elements of list
D. none of the above
Answer:C

411. Searching of linked list requires linked list to be created


A. in stored order only
B. in any order
C. without underflow condition
D. none of the above
Answer:B

412. A circular list can be used to represent


A. a stack
B. a queue
C. a tree
D. both a and b
Answer:D

413. To insert a node in a circular list at rear end it should be inserted at …...of the
queue
A. front position
B. front-1position
C. rear position
D. rear-1 position
Answer:C

414. In a circularly linked list organisation ,insertion of a record involves the


modifications of
A. no pointer
B. 1 pointer

View all MCQ's at McqMate.com


C. 2 pointer
D. 3 pointer
Answer:B

415. What is true about linked kist?


A. it is a linked structure,where each data gives the address of the next data
B. it is a dynamic data structure
C. it is a static data structure
D. both (a) and (b)
Answer:A

416. A node of linked list contains_______


A. data field
B. a self referential pointer
C. both (a)and(b)
D. only b
Answer:C

417. Which nodes contains a null pointer in a linked list?


A. first node
B. middle node
C. last node
D. both (a) and (b)
Answer:C

418. Deletion of a node from an empty linked list will cause________


A. underflow
B. overflow
C. run time error
D. all of the above
Answer:A

419. Insertion in a linked list requires modification of____pointers


A. 1
B. 2

View all MCQ's at McqMate.com


C. 3
D. 4
Answer:B

420. Deletion in a linked list requeries modification of______pointers


A. 1
B. 2
C. 3
D. 4
Answer:A

421. Accessing time of nth node in a linked list is______


A. 0(n)
B. 0(1)
C. 0(n2)
D. 0(log n)
Answer:A

422. An array is referenced by its name.Similarly,a linked list is referenced by____


A. address of the first node
B. address of the last node
C. both (a)and(b)
D. none of these
Answer:A

423. Time required to search an element in a linked list is____


A. 0(n)
B. 0(log n)
C. 0(n2)
D. 0(n log n)
Answer:A

424. Time required to search an element in a sorted linked list is______


A. 0(n)
B. 0(log n)

View all MCQ's at McqMate.com


C. o(n2)
D. 0(n log n)
Answer:A

425. Time required to delete a node with given address in a linked list is____
A. 0(n)
B. 0(log n)
C. 0(1)
D. 0(n log n)
Answer:A

View all MCQ's at McqMate.com

You might also like