Questions
1
Consider the following pseudocode segment : K:=0 for i1:= l to n for i2:= 1 to i1 : : : for im:= 1 to im–1 K:= K+1 The value of K after the execution of this code shall be
Answer: Option [A]
3
The concept of pipelining is most effective in improving performance if the tasks being performed in different stages :
Answer: Option [D]
5
Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’s law is
Answer: Option [B]
6
If two fuzzy sets A and B are given with membership functions µA(x) = {0.2, 0.4, 0.8, 0.5, 0.1} µB(x) = {0.1, 0.3, 0.6, 0.3, 0.2} Then the value of µ ––– A∩B will be
Answer: Option [B]
7
Which level of Abstraction describes what data are stored in the Database ?
Answer: Option [B]
8
The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________.
Answer: Option [B]
9
In an image compression system 16384 bits are used to represent 256 × 256 image with 256 gray levels. What is the compression ratio for this system ?
Answer: Option [B]
11
Which of the following can be used for clustering of data ?
Answer: Option [A]
13
If the pixels of an image are shuffled then the parameter that may change is
Answer: Option [D]
14
The common property of functional language and logical programming language :
Answer: Option [A]
15
Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as (i) ∃y∀x Q(x, y) (ii) ∀x∃y Q(x, y) where x & y are real numbers. Then which of the following is valid ?
Answer: Option [B]
16
Consider a schema R(A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition R1(A, B) and R2(C, D) is
Answer: Option [B]
19
A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set
Answer: Option [B]
20
The transform which possesses the highest ‘energy compaction’ property is
Answer: Option [B]
