Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer
Q. The advantages of linked list over an array for representing a list is________
a. space used is less
b. deletion is easier
c. insertion is easier
d. both (a) and (b)
Q. The address returned by malloc()is type casted because
a. malloc returns integers pointer
b. malloc returns void pointer
c. malloc returns an integer value
d. none of these
Q. Which function returns a void pointers?
a. malloc returns integers pointer
b. calloc
c. both (a)and(b)
d. none of these
Q. Select the correct statement
a. free is used to release memory allocated by malloc
b. free is used to release memory allocated by calloc
c. both (a)and(b)
d. only(a)but not(b)
Q. The____linked list can be processed in either direction.
a. singly
b. singly circular
c. doublyly
d. none of these
Q. A polynominal in single variable should be handled using__
a. an array of structure
b. singly linked list
c. gll
d. both (a) and (b)
Q. A node of doubly linked contains
a. pointer to predecessor
b. pointer to sucessor
c. both (a)and(b)
d. only(a)
Q. Each node in a linear list contains an item called____which points to the next node in the list.
a. node
b. link
c. variable
d. null
Q. Which is not dynamic memory allocation function?
a. malloc returns integers pointer
b. calloc
c. alloc
d. free
Q. The function that allocates requested size of bytes and returns a pointer to the first byte of the allocated space is
a. realloc
b. malloc
c. free
d. none of these
Q. NULL link is not present in…
a. singly linked list
b. doubly linked list
c. circular linked list
d. none of these
Q. 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 permitte
Q. 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
Q. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
a. deleting a node whose location in given
b. searching of an unsorted list for a given item
c. inverting a node after the node with given location
d. traversing a list to process each node
Q. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the last node of the linked lis
a. i and ii
b. i and iii
c. i,ii and iii
d. i,ii and iv