87 past-paper questions on Data structures from ISC Class 12 Computer Science papers (2026-2017), newest first, in full. Questions 61-80 are on this page, 20 to a page. Tap "Show answer" under a question to see its answer.
Nothing matches. Try fewer letters.
Answer the following in short.
Answer the following questions from the binary tree.
Answer the following questions from the binary tree.
Answer the following questions from the binary tree.
Answer the following in short.
Differentiate between the following.
Differentiate between the following.
Answer the following about the data structure described.
Answer the following about the data structure described.
void pushadd(String n)
{
if (end == size)
System.out.println("NO SPACE");
else
{
Q[end] = n;
end++;
}
}
String popadd()
{
if (start == end)
return "?????";
else
{
String val = Q[start];
start++;
return val;
}
}Answer the following questions from the binary tree.
Answer the following questions from the binary tree.
Answer the following in short.
Answer the following questions from the binary tree.
Write the program described below.
class Node
{
int num;
Node next;
}void SumEvenNode( Node str )void SumEvenNode(Node str)
{
int sum = 0;
Node temp = str;
while (temp != null)
{
if (temp.num % 2 == 0)
sum = sum + temp.num;
temp = temp.next;
}
System.out.println("Sum of even integers = " + sum);
}Write the program described below.
void push(String n)
{
if (top == cap - 1)
System.out.println("OVERFLOW");
else
{
top++;
stud[top] = n;
}
}
String pop()
{
if (top == -1)
return "$$";
else
{
String val = stud[top];
top--;
return val;
}
}Answer the following questions from the binary tree.
Answer the following questions from the binary tree.
Answer the following.
class Node
{
int n;
Node link;
}void FindNode(Node str, int b)
{
Node temp = str;
while (temp != null)
{
if (temp.n == b)
{
System.out.println(b + " is found");
return;
}
temp = temp.link;
}
System.out.println(b + " is not found");
}Answer the following.
Write the program described below.