Time Left - 15:00 mins

Mission ISRO Subjects Revision Test-1 ( PDS & Algorithms)

Attempt now to get your rank among 398 students!

Question 1

In which of the following shading models of polygons, the interpolation of intensity values is done along the scan line?

Question 2

Access time of the symbol table will be logarithmic if it is implemented by

Question 3

Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are

Question 4

A Hash Function f is defined as f(key)=key mod 7. With linear probing, is used to insert the keys 37,38,72,48,98,11,56,into a table indexed from 0> In which location the key 11 will be stored.

Question 5

Algorithm design technique used in quick sort algorithm is

Question 6

Suppose there are eleven items in the sorted order in an array. How many searches are required on the average, if binary search is employed and all searches are successful in finding the item?

Question 7

In an Arrays of 2N elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the Arrays were 1-ordered?

Question 8

Consider the following binary search tree T given below. Which node contains the fourth smallest element in T?
Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image021.png

Question 9

The term Phong is associated with

Question 10

Data type1 & Data type2 are two different data type in programming .
What statement is/are false about Data type1 & Data type2
I) Pointer of type data type 1 never can point a data of data type 2 without void pointer & type casting
ii) Both may take same memory space .
iii) Data of data type 1 can be copied to data type 2 using type casting

Question 11

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:

Question 12

Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?

Question 13

How many different Spanning trees are there with four nodes A, B, C and D?

Question 14

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 15

Consider the following C program segment:

# include<stdio.h>
int main( )
{
char s1[7] = "1234", *p;
p = s1 + 2;
*p = '0' ;
printf ("%s", s1);
}


What will be printed by the program?
  • 398 attempts
  • 4 upvotes
  • 5 comments
Jul 26GATE & PSU CS