Back to Subject

Unit 2 - Practice Quiz

CSE205 50 Questions
0 Correct 0 Wrong 50 Left
0/50

1 What are the two main components of a node in a singly linked list?

A. Data and Next Pointer
B. Data and Index
C. Head and Tail
D. Value and Reference Count

2 Which of the following best describes the memory allocation of a linked list?

A. Static and Non-contiguous
B. Dynamic and Contiguous
C. Static and Contiguous
D. Dynamic and Non-contiguous

3 What is the time complexity to access the Nth element in a singly linked list?

A. O(1)
B. O(log n)
C. O(n^2)
D. O(n)

4 Which pointer is required to maintain access to the entire linked list?

A. Tail pointer
B. Middle pointer
C. Head pointer
D. Null pointer

5 In C, which function is commonly used to dynamically allocate memory for a new node?

A. alloc()
B. new()
C. create()
D. malloc()

6 What is the value of the 'next' pointer in the last node of a grounded singly linked list?

A. NULL
B. Address of the Head
C. Garbage value
D. Address of the previous node

7 Which of the following is a disadvantage of a singly linked list compared to an array?

A. Expensive insertion at the beginning
B. Memory wastage due to pointers
C. Fixed size
D. Cannot expand dynamically

8 In a self-referential structure definition for a node, what is the data type of the pointer member?

A. char*
B. struct node*
C. int*
D. void*

9 What condition indicates that a singly linked list is empty?

A. head == tail
B. head->next == NULL
C. head == NULL
D. head->data == 0

10 What is the time complexity for inserting a node at the beginning of a singly linked list?

A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)

11 When traversing a singly linked list, what is the condition to stop the loop?

A. ptr == NULL
B. ptr->data == NULL
C. ptr->next == NULL
D. ptr == head

12 Which scenario results in an 'Overflow' condition in a linked list?

A. The head pointer is lost
B. The list contains a loop
C. The Free Storage Pool (Avail List) is empty
D. The list is empty

13 What is the correct order of operations to insert a node 'NEW' between node 'A' and node 'B' (where A->next is B)?

A. A->next = NEW; NEW->next = B;
B. NEW->next = B; A->next = NEW;
C. B->next = NEW; NEW->next = A;
D. NEW->next = A; A->next = B;

14 What is the time complexity of deleting the last node in a singly linked list (without a tail pointer)?

A. O(n^2)
B. O(n)
C. O(log n)
D. O(1)

15 Which function is used to release the memory of a deleted node back to the system?

A. delete()
B. remove()
C. free()
D. dalloc()

16 What is a 'Header Linked List'?

A. A list with two pointers per node
B. A list where the last node points to the head
C. A list sorted in ascending order
D. A list that contains a special node at the beginning containing metadata

17 In a 'Grounded' Header Linked List, what does the last node point to?

A. Random Memory
B. The First Data Node
C. NULL
D. The Header Node

18 In a 'Circular' Header Linked List, what does the last node point to?

A. NULL
B. The First Data Node
C. The Header Node
D. The Last Node itself

19 What is the primary advantage of using a Header node?

A. It uses less memory
B. It automatically sorts data
C. It simplifies insertion and deletion algorithms by removing special cases for the first node
D. It allows binary search

20 What defines a Circular Linked List (without a header)?

A. Nodes are arranged in a circle visually only
B. Last node points to the first node
C. Head is NULL
D. Last node points to NULL

21 What is the loop termination condition when traversing a circular linked list starting from head?

A. ptr->next == head
B. ptr == head (after starting)
C. ptr->next == NULL
D. ptr == NULL

22 Which data structure allows traversal in both forward and backward directions?

A. Circular Singly Linked List
B. Stack
C. Two-way (Doubly) Linked List
D. Singly Linked List

23 How many pointers does a standard node in a Doubly Linked List contain?

A. Three
B. Zero
C. One
D. Two

24 What is the memory overhead of a Doubly Linked List compared to a Singly Linked List?

A. Requires double the data space
B. 50% less
C. Same
D. Requires one extra pointer per node

25 In a Doubly Linked List, to delete a node P (not first/last), which operations are needed?

A. P->prev->next = P->prev; P->next->prev = P->next;
B. head = P->next;
C. P->prev->next = P->next; P->next->prev = P->prev;
D. P->next = NULL; P->prev = NULL;

26 What is the time complexity to delete a node in a Doubly Linked List if the pointer to that node is given?

A. O(log n)
B. O(1)
C. O(n log n)
D. O(n)

27 Which list is best suited for implementing a 'Back' and 'Forward' button in a browser?

A. Circular Linked List
B. Singly Linked List
C. Doubly Linked List
D. Queue

28 In a Circular Doubly Linked List, what does the left (prev) pointer of the first node point to?

A. The second node
B. The last node
C. NULL
D. The first node

29 Which condition indicates 'Underflow' in a linked list?

A. Allocating NULL
B. Traversing past the end
C. Inserting into a full memory
D. Deleting from an empty list

30 If a Singly Linked List is effectively used as a Stack, which end is most efficient for Push and Pop?

A. Push at Start, Pop at End
B. Push at End, Pop at End
C. Push at Start, Pop at Start
D. Push at End, Pop at Start

31 Can Binary Search be effectively applied to a standard Linked List?

A. Yes, with O(log n) complexity
B. No, because random access is not allowed
C. Yes, with O(n) complexity
D. No, because it's not sorted

32 What happens if you free a node without updating the pointers pointing to it?

A. List becomes circular
B. Memory Leak
C. Stack Overflow
D. Dangling Pointer

33 What is the logical structure of a linked list?

A. Non-Linear
B. Linear
C. Hierarchical
D. Grid

34 In a Doubly Linked List, if p points to a node, what is p->next->prev equivalent to (assuming p is not last)?

A. NULL
B. p->prev
C. p->next
D. p

35 Which algorithm is commonly used to detect a cycle (loop) in a linked list?

A. Quick Sort
B. Binary Search
C. Floyd’s Cycle-Finding Algorithm (Tortoise and Hare)
D. Dijkstra's Algorithm

36 To reverse a singly linked list, how many pointers are typically required during the traversal?

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

37 What is a Sentinel node?

A. A node with NULL data
B. A dummy node (like a header) used to simplify boundary conditions
C. The last node in a list
D. A node responsible for memory allocation

38 Which polynomial operation is most efficiently handled by linked lists?

A. Evaluation
B. Roots finding
C. Graphing
D. Addition of sparse polynomials

39 In a Two-way list, inserting a node at the beginning requires changing how many existing pointers (excluding the new node's pointers)?

A. 1
B. 0
C. 3
D. 2

40 What data type is head typically declared as?

A. struct node
B. struct node*
C. void
D. int

41 If ptr is a pointer to a node, how do you access the data of that node in C?

A. *ptr.data
B. ptr->data
C. &ptr.data
D. ptr.data

42 Which operation typically runs faster on a Circular Linked List than a standard Singly Linked List?

A. Binary Search
B. Sorting
C. Finding the Nth node
D. Deleting the first node while maintaining a pointer to the last node

43 Which of the following is NOT a type of linked list?

A. Singly Linked List
B. Indexed Linked List
C. Doubly Linked List
D. Circular Linked List

44 Memory for a linked list node is allocated from which segment?

A. Code Segment
B. Data Segment
C. Heap
D. Stack

45 What is the main disadvantage of a Circular Linked List?

A. Risk of infinite loops during traversal if not handled carefully
B. Insertion is O(n)
C. Cannot traverse backwards
D. Requires double memory

46 To concatenate two singly linked lists (List A and List B) into one, what operation is required?

A. Copy all nodes of B to A
B. Make head of A point to head of B
C. Traverse A to the end and make the last node point to head of B
D. Traverse B to end and point to A

47 How do you represent a Polynomial using a linked list?

A. Nodes store value of x
B. Array of integers
C. Nodes store only coefficients
D. Nodes store coefficient and exponent: [3,2] -> [5,0] -> NULL

48 In a doubly linked list, what does head->prev point to?

A. Random garbage
B. The second node
C. The tail
D. NULL

49 When deleting a node from a linked list, why is a temporary pointer often used?

A. To allocate new memory
B. To speed up deletion
C. To store the address of the node to be freed so links can be rewired first
D. It is required by the C syntax

50 Which complexity best describes sorting a Linked List using Merge Sort?

A. O(1)
B. O(n log n)
C. O(n^2)
D. O(n)
Previous MCQ
Unit 1
Next MCQ
Unit 3