ISC Class 12th Computer Science Chapter 4 - Data structures Important Questions with Answers

You should focus on solving ISC Class 12th Computer Science Chapter 4: Data structures important questions, especially to help you score high marks. By solving ISC Class 12th Computer Science 4 questions, you will be solving exam-oriented questions only.

Never Miss an Exam Update

Prepare thoroughly with the most important questions of ISC Class 12th Computer Science Chapter 4 - Data structures. You can first cover the ISC Class 12th Computer Science syllabus to understand the key topics and then start solving the ISC Class 12th Computer Science Chapter 4 - Data structures Important Question to get a better understanding of your preparation level. Start practicing now.

The keyword used by a class to acquire the properties of an interface is:

import

implements

extends

include

Question 2.

State the principle by which the stack data structure works.

Question 3.

Convert the following infix notation to postfix notation:

A * (B + C / D ) – E / F

Question 4.

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 level of these nodes when the root is at level 0.

Question 5.

Answer the following question on the diagram of a Binary Tree given below:

Write the pre-order and post-order traversal of the above tree structure.

Question 6.

A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out).

Define a class Queue with the following details:

Class name	Queue
Data member/instance variable:
dat[ ]	array to hold the integer elements
cap	stores the maximum capacity of the queue
front	to point the index of the front
rear	to point the index of the rear
Member functions/methods:
Queue(int max)	constructor to initialize the data member cap = max, front = rear = 0 and create the integer array
void add_dat(int v)	to add integers from the rear index if possible else display the message(“Queue full”)
int pop_dat( )	to remove and return elements from front, if any, else returns -999
void display()	to display elements of the queue

Specify the class Queue giving the details of void add_dat(int) and int pop_dat( ). Assume that the other functions have been defined.

The main( ) function and algorithm need NOT be written.

Question 7.

Convert the following infix notation to postfix form.

(P + Q * R - S)/T * U

Question 8.

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.

The details of the class CardGame are given below.

Class name	CardGame
Data members/instance variables:
cards[]	array to store integers as cards
cap	to store the maximum capacity of array
top	to store the index of the topmost element of the array
Methods/Member functions:
CardGame(int cc)	constructor to initialise cap=cc and top= -1
void addCard(int v)	to add the card at the top index if possible, otherwise display the message “CARD PILE IS FULL”
int drawCard( )	to remove and return the card from the top index of the card pile, if any, else return the value -9999
void display( )	to display all the cards of card pile

Specify the class CardGame giving details of the functions void addCard(int) and int drawCard( ). Assume that the other functions have been defined.
The main() function and algorithm need NOT be written.
Name the entity described above and state its principle.

Question 9.

Answer the following questions based on the diagram of a Binary Tree given below:

Name the external nodes of the tree.
State the degree of node M and node L.
Write the post-order traversal of the above tree structure.

Question 10.

Convert the following infix notation to prefix form.

( A – B ) / C * ( D + E )

Question 1.

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 ends i.e. front and rear.

Define a class ReCycle with the following details:

Class name	ReCycle
Data members/instance variables:
ele[ ]	the array to hold the integer elements
cap	stores the maximum capacity of the array
front	to point the index of the front
rear	to point the index of the rear
Methods / Member functions:
ReCycle (int max)	constructor to initialize the data cap = max, front = rear = 0 and to create the integer array.
void pushfront(int v)	to add integers from the front index if possible else display the message(“full from front”).
int popfront( )	to remove the return elements from front. If array is empty then return-999
void pushrear(int v)	to add integers from the front index if possible else display the message(“full from rear”).
int poprear( )	to remove and return elements from rear. If the array is empty then return-999.

Specify the class ReCycle giving details of the functions void pushfront(int) and int poprear( ). Assume that the other functions have been defined.
The main( ) function and algorithm need NOT be written.
Name the entity described above and state its principle.