Time Left - 10:00 mins
ISRO CS 2017 Exam Day -2: PDS Quiz-2
Attempt now to get your rank among 703 students!
Question 1
Consider a standard circular queue 'q' implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q [1] ,.... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added?
Question 2
Embedded pointer provides
Question 3
The queue data structure is to be realized by using stack. The number of stacks needed would be
Question 4
If the sequence of operations – push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values
Question 5
Average number of comparison required search for sequential search on ‘n’ items is:
Question 6
Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list?
Question 7
In general, the number of fields with each node of doubly linked list is
Question 8
A one dimensional Arrays A has indices 1.... 75. Each element is a string and takes up three memory words. The Arrays is stored at location 1120 decimal. The starting address of A [49] is
Question 9
The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is____________.
Question 10
Consider the following code
int P=0;
for (i=1;i<n;i++)
{
for( j=1;j<=n;j++)
{
P=P+1;
}
}
Printf (“%d”,P)
What is Time Complexity of this Program ?
- 703 attempts
- 1 upvote
- 9 comments
Apr 3GATE & PSU CS
