PRASHNIKAप्रश्निका

Data structures - ISC Class 12 Computer Science Questions with Answers

71 past-paper questions on Data structures from ISC Class 12 Computer Science papers (2026-2017), newest first. Open one to see its answer.

Practise these questions with filters

Answer the following questions from the diagram of a Binary Tree given below: Write the post-order traversal of the above tree… 2026 · 3 marks · Short answer
A linked list is formed from the objects of the class Word. The structure of the class Word is given below: … Write an Algorithm… 2026 · 2 marks · Program
Answer the following questions based on the diagram of a Binary Tree given below: Write the pre-order traversal of the above… 2026 · 3 marks · Short answer
Convert the following infix notation to prefix form. $(P + Q / R) * (S + T / U) / V$ 2026 · 2 marks · One word
A linked list is formed from the objects of the class Node. The structure of the class Node is given below: … Write an Algorithm… 2026 · 2 marks · Short answer
Convert the following infix notation to prefix form. $P / Q + (S * F + X / R)$ 2026 · 2 marks · One word
A class CustomerService is defined to resolve customer service requests in the order in which they are received. The details of… 2026 · 5 marks · Program
In any internet browser, a user can visit new webpages and go back to previously visited webpages. Each new webpage URL is stored… 2026 · 5 marks · Long answer
Refer to the Binary Tree given below and answer the questions that follow: Write the post-order traversal of the above tree… 2025 · 3 marks · Short answer
A circular queue is a linear data structure that allows data insertion at the rear and removal from the front, with the rear end… 2025 · 5 marks · Program
___________ is called a Self-Referential Data structure. 2025 · 1 mark · MCQ
A linked list is formed from the objects of the class Cell. The class structure of the Cell is given below: … Write an Algorithm… 2025 · 2 marks · Short answer
Answer the following questions based on the Binary Tree given below: Write the in-order traversal of the right subtree. State the… 2025 · 3 marks · Short answer
The Central Processing Unit (CPU) scheduling follows the principle of _________ data structure. 2025 · 1 mark · MCQ
Recycle is an entity which can hold at the most 100 integers. The chain enables the user to add and remove integers from both the… 2025 · 5 marks · Program
Answer the questions based on the binary trees: Observe the following binary tree and identify its type. Justify your answer… 2025 · 5 marks · Short answer
A linked list is formed from the objects of class VotersList. The class structure is given below. … Write an Algorithm OR a… 2025 · 2 marks · Program
Answer the following questions from the diagram of a Binary Tree given below: Name the root of the left sub tree and its… 2025 · 3 marks · Short answer
A circular queue is a linear data structure that allows data insertion at the rear and removal from the front, with the rear end… 2025 · 5 marks · Program
For the given Binary Tree, which traversal order will arrange the elements in ascending order? 2025 · 1 mark · MCQ
Convert the following infix notation to postfix form. $(A * B\text{^}C) + (D * E) \quad \text{where } B\text{^}C = B^C$ 2025 · 2 marks · One word
Convert the following infix notation to prefix form. $(A - B) / C * (D + E)$ 2025 · 2 marks · One word
At Get It All supermarket, a POS (Point of Sale) system is designed. The cart management is visible to the POS operator. The… 2025 · 5 marks · Short answer
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2025 · 2 marks · Short answer
Convert the following infix notation to postfix form. $(A - B / C) + (D * E / F) * G$ 2025 · 2 marks · One word
Answer the following questions based on the diagram of a Binary Tree given below: Name the external nodes of the tree. State the… 2024 · 3 marks · Short answer
Answer the following questions from the diagram of a Binary Tree given below: Name the external nodes of the right sub tree… 2024 · 3 marks · Short answer
Recursive data structure follows the LIFO principle. 2024 · 1 mark · Assertion-reason
CardGame is a game of mental skill, built on the simple premise of adding and removing the cards from the top of the card pile… 2024 · 5 marks · Program
Convert the following infix notation to postfix form. ( A / B + C ) / ( D * ( E − F ) 2024 · 2 marks · One word
Shelf is a kind of data structure which can store elements with the restriction that an element can be added from the rear end… 2024 · 5 marks · Program
Convert the following infix notation to postfix form. $(P + Q * R - S) / T * U$ 2024 · 2 marks · One word
What is the importance of the reference part in a Linked List? 2023 · 1 mark · Short answer
Answer the following questions from the diagram of a Binary Tree given below: Write the pre-order traversal of the above tree… 2023 · 3 marks · Short answer
A linked list is formed from the objects of the class given below: … Write an Algorithm OR a Method to add a node at the end of… 2023 · 2 marks · Program
Answer the following questions from the diagram of a Binary Tree given below: Write the in-order traversal of the above tree… 2023 · 3 marks · Short answer
Holder is a kind of data structure which can store elements with the restriction that an element can be added from the rear end… 2023 · 5 marks · Program
Convert the following infix notation to prefix notation. $(A - B) / C * (D + E)$ 2023 · 2 marks · One word
Differentiate between a stack and a queue. 2023 · 1 mark · Short answer
Convert the following infix notation to postfix form. $( P / Q - R ) * ( S + T )$ 2023 · 2 marks · One word
A double ended queue is a linear data structure which enables the user to add and remove integers from either ends i.e., from… 2023 · 4 marks · Program
What is a linked list? 2023 · 1 mark · Short answer
A linked list is formed from the objects of the class: … Write an Algorithm OR a Method to insert a node at the beginning of an… 2023 · 2 marks · Short answer
A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out). Define a class Queue… 2022 · 4 marks · Program
Convert the following infix notation to postfix notation: $A * (B + C / D) - E / F$ 2022 · 2 marks · Short answer
State the principle by which the stack data structure works. 2022 · 1 mark · Short answer
Answer the following question on the diagram of a Binary Tree given below: State the degree of the nodes C and G. Also, state the… 2022 · 2 marks · Short answer
Answer the following question on the diagram of a Binary Tree given below: Write the pre order and post order traversal of the… 2022 · 2 marks · Short answer
Answer the following questions from the diagram of a Binary Tree given below: Name the Root and the leaves of the tree. Write the… 2020 · 3 marks · Short answer
Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and… 2020 · 5 marks · Program
Answer the following questions from the diagram of a Binary Tree given below: Write the post-order traversal of the left subtree… 2020 · 3 marks · Short answer
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2020 · 2 marks · Short answer
State the difference between a Binary Tree structure and a single Linked List. 2020 · 2 marks · Short answer
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2020 · 2 marks · Short answer
Convert the following infix notation to prefix form: $(X + Y) / (Z * W / V)$ 2020 · 2 marks · Short answer
A Circular queue is a linear data structure which works on the principle of FIFO, enables the user to enter data from the rear… 2020 · 5 marks · Program
Convert the following infix notation to postfix notation: $A * ( B / C ) / E + F$ 2020 · 2 marks · Short answer
Differentiate between Stack data structure and Queue data structure. 2020 · 2 marks · Short answer
A linear data structure enables the user to add address from rear end and remove address from front. Define a class Diary with… 2019 · 5 marks · Program
State the difference between internal nodes and external nodes of a binary tree structure. 2019 · 2 marks · Short answer
Convert the following infix notation to postfix form: $( A + B * C ) – ( E * F / H ) + J$ 2019 · 2 marks · One word
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2019 · 2 marks · Short answer
Answer the following questions from the diagram of a Binary Tree given below: Write the pre-order traversal of the above tree… 2019 · 3 marks · Short answer
Register is an entity which can hold a maximum of 100 names. The register enables the user to add and remove names from the top… 2018 · 5 marks · Program
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2018 · 2 marks · Short answer
Convert the following infix notation to postfix form: $A + ( B - C * ( D / E ) * F )$ 2018 · 2 marks · One word
Answer the following questions from the diagram of a Binary Tree given below: Write the inorder traversal of the above tree… 2018 · 3 marks · Short answer
Queue is an entity which can hold a maximum of 100 integers. The queue enables the user to add integers from the rear and remove… 2017 · 5 marks · Program
Convert the following infix expression to postfix form: $P * Q / R + (S + T)$ 2017 · 2 marks · One word
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2017 · 2 marks · Program
Answer the following questions from the diagram of a Binary Tree given below: Write the postorder traversal of the above tree… 2017 · 3 marks · Short answer

Data structures - ISC Class 12 Computer Science Questions with Answers

Other Computer Science chapters