WBJECA 2025 — Computer PYQ

Q: How do I solve WBJECA 2025 Computer questions?

Practice WBJECA 2025 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

Q: What is the difficulty level of WBJECA Computer questions?

WBJECA Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Q: Are WBJECA previous year papers available for free?

Yes. Mathem Solvex provides free access to WBJECA previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

Question

WBJECA 2025 — Computer PYQ

WBJECA | Computer | 2025

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

Choose the correct answer:

Explanation

In data structures, the choice between an array and a linked list depends on the operational requirements. The statement in option (B) is false because linked lists do not support random access, making element access slower compared to arrays.

Array Access: Arrays are stored in contiguous memory locations, allowing for $O (1)$ constant time access using an index:
$A ccess_A r r a y = A dd r es s_{ba se} + (I n d e x \times S i z e_{e l e m e n t})$
Linked List Access: Linked lists consist of nodes scattered in memory, requiring sequential traversal from the head, resulting in $O (n)$ time complexity:
$A ccess_L i s t = i = 1 \sum n T (t r a v er s a l_t o_n o d e_{i})$

Where $n$ is the position of the desired element.

Why (A) is true: Linked lists require sequential traversal; there is no direct address calculation for an arbitrary index.
Why (C) is true: Arrays exhibit spatial locality because elements are adjacent in memory, which significantly benefits CPU cache performance.
Why (D) is true: Linked list insertions and deletions involve simply updating pointers, whereas arrays often require shifting elements, which costs $O (n)$ time.

Since option (B) incorrectly claims that linked lists are faster for access, it is the correct answer to the question asking for the "not true" statement.