Time Left - 10:00 mins
ISRO 2018: Programming & DS Booster Quiz- 1
Attempt now to get your rank among 1074 students!
Question 1
Given two statements
(i) Insertion of an element should be done at the last node in a circular linked list
(ii) Deletion of an element should be done at the last node of the circular linked list
(i) Insertion of an element should be done at the last node in a circular linked list
(ii) Deletion of an element should be done at the last node of the circular linked list
Question 2
In a doubly linked list, the number of pointers affected for an insertion operation will be
Question 3
The recurrence relation that arises in relation with the complexity of binary search is
Question 4
Which of the following number of nodes can form a full binary tree?. Assume full binary tree is a tree in which all levels have maximum nodes.
Question 5
The term Phong is associated with
Question 6
Which of the following operator(s) cannot be overloaded?
Question 7
Consider the following C function
void swap (int x, int y)
{
int tmp;
tmp = x;
x = y;
y = tmp;
}
In order to exchange the values of two variables a and b:
void swap (int x, int y)
{
int tmp;
tmp = x;
x = y;
y = tmp;
}
In order to exchange the values of two variables a and b:
Question 8
The following postfix expression with single digit operands is evaluated using a stack 8 2 3 ^ / 2 3 * + 5 1 * -. Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:
- 1074 attempts
- 7 upvotes
- 17 comments
Apr 6GATE & PSU CS
