UTpaper

Free mock tests & test series

Question 58Asked in DSSSB TGT Computer Science (Technical), 12 Sep 2025, Shift 1 (9:00 AM)

In singly linked list, each node of the list consists of ___________.

  1. Adata value and address of next node
  2. BNULL and address of the next node
  3. CNULL and address of the previous node
  4. Ddata value and address of previous node
Show answerHide answer

Correct answer: (A) data value and address of next node

Explanation

Each node of a singly linked list holds the data and a pointer (address) to the next node; the last node's pointer is NULL. A previous-node pointer is used in doubly linked lists.

From DSSSB TGT Computer Science PYQ (Technical), 12 Sep 2025, Shift 1 (9:00 AM)

This is question 58 of DSSSB TGT Computer Science PYQ (Technical), 12 Sep 2025, Shift 1 (9:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.