ISRO CSE 2013

Question 1
Let A(1:8, -5:5, -10:5) be a three dimensional array. How many elements are there in the array A?
A
1200
B
1408
C
33
D
1050
Data Structure   Array
Question 2
The number of rotations required to insert a sequence of elements 9, 6, 5, 8, 7, 10 into an empty AVL tree is?
A
0
B
1
C
2
D
3
Data Structure   AVL Tree
Question 3
Opportunistic reasoning is addressed by which of the following knowledge representation?
A
Script
B
Blackboard
C
Production Rules
D
Fuzzy Logic
   
Question 4
The following steps in a linked list
p = getnode() 
info(p) = 10 
next (p) = list 
list = p
result in which type of operation?
A
Pop operation in stack
B
Removal of a node
C
Inserting a node
D
Modifying an existing node
Data Structure   Link List
Question 5
Shift reduce parsing belongs to a class of
A
Bottom up parsing.
B
Top down parsing.
C
Recursive parsing.
D
Predictive parsing.
Compiler Design   Parsing
Question 6
Which of the following productions eliminate left recursion in the productions given below:
S \rightarrow Aa \mid b
A \rightarrow Ac \mid Sd \mid \epsilon
A
S \rightarrow Aa \mid b, \;\; A \rightarrow bdA', \;\; A' \rightarrow A'c \mid A'ba \mid A \mid \epsilon
B
S \rightarrow Aa \mid b, \;\; A \rightarrow A' \mid bdA', \;\; A' \rightarrow cA' \mid adA' \mid \epsilon
C
S \rightarrow Aa \mid b, \;\; A \rightarrow A'c \mid A'd ,\;\; A' \rightarrow bdA' \mid cA \mid \epsilon
D
S \rightarrow Aa \mid b, \;\; A \rightarrow cA' \mid adA' \mid bdA',\;\; A' \rightarrow A \mid \epsilon
Compiler Design   Parsing
Question 7
Consider the following psuedocode:
x: integer := 1  
y: integer := 2   
procedure add  
    x:= x + y    
procedure second (P: Procedure)  
    x: integer := 2      
    p()   
procedure first  
    y: integer := 3
    second (add) 
first () 
write_integer(x)
What does it print if the language uses dynamic scoping with deep binding?
A
2
B
3
C
4
D
5
C Programming   Function
Question 8
Which logic gate is used to detect overflow in 2's compliment arithmetic?
A
OR gate
B
AND gate
C
NAND gate
D
XOR gate
Digital Logic   Number System
Question 9
In an array 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 array were 1-ordered?
A
1
B
2
C
N/2
D
2N-1
Data Structure   Array
Question 10
If the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the R,G,B components, what would be the size of the lookup table?
A
24 bytes
B
1024 bytes
C
768 bytes
D
256 bytes
   
There are 10 questions to complete.

Leave a Comment