Question 1 |
Let A(1:8, -5:5, -10:5) be a three dimensional array. How many elements are there in the array A?
1200 | |
1408 | |
33 | |
1050 |
Question 1 Explanation:
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?
0 | |
1 | |
2 | |
3 |
Question 2 Explanation:
Question 3 |
Opportunistic reasoning is addressed by which of the following knowledge representation?
Script | |
Blackboard | |
Production Rules | |
Fuzzy Logic |
Question 3 Explanation:
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?
Pop operation in stack | |
Removal of a node | |
Inserting a node | |
Modifying an existing node |
Question 4 Explanation:
Question 5 |
Shift reduce parsing belongs to a class of
Bottom up parsing. | |
Top down parsing. | |
Recursive parsing. | |
Predictive parsing. |
Question 5 Explanation:
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
S \rightarrow Aa \mid b
A \rightarrow Ac \mid Sd \mid \epsilon
S \rightarrow Aa \mid b, \;\; A \rightarrow bdA', \;\; A' \rightarrow A'c \mid A'ba \mid A \mid \epsilon | |
S \rightarrow Aa \mid b, \;\; A \rightarrow A' \mid bdA', \;\; A' \rightarrow cA' \mid adA' \mid \epsilon | |
S \rightarrow Aa \mid b, \;\; A \rightarrow A'c \mid A'd ,\;\; A' \rightarrow bdA' \mid cA \mid \epsilon | |
S \rightarrow Aa \mid b, \;\; A \rightarrow cA' \mid adA' \mid bdA',\;\; A' \rightarrow A \mid \epsilon |
Question 6 Explanation:
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?
2 | |
3 | |
4 | |
5 |
Question 7 Explanation:
Question 8 |
Which logic gate is used to detect overflow in 2's compliment arithmetic?
OR gate | |
AND gate | |
NAND gate | |
XOR gate |
Question 8 Explanation:
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?
1 | |
2 | |
N/2 | |
2N-1 |
Question 9 Explanation:
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?
24 bytes | |
1024 bytes | |
768 bytes | |
256 bytes |
Question 10 Explanation:
There are 10 questions to complete.