1. Function overloading is done at
Ans. Compile time
2. OLAP is an acronym for
Ans. Online Analytical Processing
3. Architectural design involves in SE
Ans. DFD- Data Flow Diagrams
4. An EDP auditor must be an expert in
Ans. Computerised Business Systems
5. If no exception is thrown
Ans. All catch blocks coded will be bypassed
6. Consider the following pseudo-code :
IF ((A > B) AND (C > D)) THEN
A = A + 1
B = B + 1
ENDIF
The cyclomatic complexity of the pseudo-code is
Ans. 3
7. Which of the following testing methods is normally used as the
acceptance test for a software system ?
Ans. Functional testing
8. Match the following
I. The beginning of the function code 1. (
)
II. The preprocessor directive always starts with 2. &
III. The symbol for the address operator 3. {
IV. The name of a function s
ends with
4. #
I II
III IV
Ans. 3 4
2 1
9. Match the following :
1. Data Link Layer i. The
lowest layer whose function is to activate, deactivate and maintain the circuit
between DTE and DCE
2. Physical Layer ii. Perform
routing
3. Presentation iii.
Detection and Layer recovery of errors in the transmitted data
4. Network Layer iv. Provides
syntax for the data
Ans. 1 – iii, 2 – i, 3 – iv, 4 – ii
10. Match the following :
I. 0 (log n) 1. Heap sort
II. 0 (n) 2.
DFS
III. 0 (n log n) 3. Binary search
IV. 0 (n2) 4.
Bubble sort
Ans. I – 3, II – 2, III – 1, IV – 4
11. The string accepted by the following finite
Automaton
where
a, b are alphabets, q0, q1, and q2 are states and q2 is final state
Ans. ab (a + b)*
12. What is the maximum number of different Boolean
functions involving n Boolean variables ?
Ans. 22n
Choose
the category of following SQL operations INSERT, DELETE and UPDATE
Ans. DML
14. Let G be a simple graph all of whose vertices
have degree 3 and |E| = 2 |V| - 3 what can be said about G ?
(A) G has ‘6’ vertices and 9 edges
15. Which of the following graph is isomorphic to
given below graph ?
16. Consider the join of a relation R with a relation
S. If R has m tuples and S has n tuples, then the maximum and minimum sizes of
the join respectively are
Ans. mn
and 0
17. Assertion A : The
technique of building new classes from the existing classes is called polymorphism.
Reason R : Polymorphism
requires postponement of binding of a function call to the member function
until runtime.
Ans. Only (R) is true and (A) is false
18. Suppose a tree has d1 vertices of degree 1, 2 vertices of degree 2, 4
vertices of degree 3 and 3 vertices of degree 4 then d1 value is
Ans. 12
19. A Binary Search Tree (BST) stores values on the
range 37 to 573. Consider the following sequence of keys
i.
81, 537, 102, 439, 285, 376, 305
ii.
52, 97, 121, 195, 242, 381, 472
iii.
142, 248, 520, 386, 345, 270, 307
iv.
550, 149, 507, 395, 463, 402, 270
Which of the following statements is TRUE ?
Ans. ii is an inorder sequence of some BST where
121 is the root and 52 in a leaf
20. Assertion A : Implicit
type conversion in C++ can lead to errors keeping into the program, if adequate
care is not taken.
Reason R : Use of explicit type
conversion is recommend in mixed mode expression.
Ans. Both (A) and (R) are true and (R) is the
reason for (A)
21. If X is a Boolean variable, then among following
what are the statements true according to Idempotent law ?
I.
X + X = X
II.
X . X = X
III.
X . 1 = X
IV.
X + 1 = 1
Ans. I and II are correct
22. Exterior Gateway Protocol is
Ans.
To exchange routing information between gateway hosts
23. Find the following statements in the context of
software testing are TRUE or FALSE
S1
: Statement coverage cannot guarantee execution of loops in a program under
test.
S2
: Use of independent path testing criterion guarantees execution of each loop
in a program under test
more
than once.
Ans. True, False
24. Match the following :
I.
To add 2 bits 1. Full adder
II.
To add 3 bits 2. Left shift by 1 bit
III.
To multiply by 2 3. Right shift by 1 bit
IV.
To divide by 2 4. Half adder
I
II III IV
Ans. 4 1
2 3
25. A medium access control technique for multiple
access transmission media is
Ans. ALOHA
26. In a software project, COCOMO (Constructive
Cost Model) is used to estimate
Ans. Effort and duration based on the size of the
software
27. The gray code for decimal 7 is
Ans. 1011
28. Error detection at the data link level is
achieved by
Ans. Cyclic redundancy codes
29. In Unix, the file descriptor returned by open
system call is of type
Ans. Integer
30. The string 1101 does not belong to the set
represented by
Ans. (10)* (01)* (00 + 11)*
31. Which of the following tool is known as ‘parser’
generator ?
Ans.
YAAC
32. The task of the Lexical Analysis phase is
(A)
To parse the source program into the basic elements or tokens of the language
(B)
To build a literal table and an identifiertable
(C)
To build a uniform symbol table
Ans. All of the above
33. Match the following :
I.
The processes ID 1. grep
II.
Editor 2. ps
III.
Searching in files 3. cat
IV.
Printing a file 4. vi
I
II III IV
Ans. 2
4 1 3
34. Consider this C code to swap two integers and
these five statements:
void
swap (int * px, int * py)
{
* px = *px – *py ;
*py = *px + *py;
*px = *py – *px;
}
S1
: Will generate a compilation error
S2
: May generate a segmentation fault at runtime depending on the arguments
passed
S3
: Correctly implement the swap procedure for all input pointers referring to
integers stored in memory
locations
accessible to the process
S4
: Implements the swap procedure correctly for some but not all valid input
pointers.
S5
: May add or subtract integers and pointers.
Ans. S2 and S3
35. A compiler for a high level language that runs
on one machine and produces code for a different machine is called
Ans. Cross compiler
36. Match the following :
I.
Deadlock avoidance 1. Shortest job
first algorithm
II.
CPU scheduling 2. LRU algorithm
III.
Mutual exclusion 3. Banker’s
algorithm
IV.
Page replacement 4. Peterson’s
algorithm
I
II III IV
Ans. 3
1 4 2
37. Match the following:
P. Regular expression
1. Syntax analysis
Q. Pushdown automata
2. Code generation
R. Dataflow analysis
3. Lexical analysis
S. Register allocation
4. Code optimization
Ans. P – 3, Q – 1, R – 4, S – 2
38. Reasoning with uncertain knowledge can be dealt
with
Ans. Non-monotonic reasoning
39. Which of the following eliminates transitive
dependency?
Ans. BCNF
40. Electronic credit cards can be in
(A)
Unencrypted
(B)
Encrypted
Ans. Both A and B
41. Consider the following two statements
i.
A Hash function is an injective function which is often used for computing digital
signature
ii.
An encryption technique DES performs a permutation on the elements of its input
alphabet Which of the following is valid for the above two statements?
Ans. Both are true
42. Select A, B, C from loan table
consisting
of fields A, B, C, D, E, F
óABC(loan)
43. The number of flipflops required in a decade
counter is
Ans.
4
44. Which of the following is a non-linear data
structure?
i.
Stack ii. Queue
iii.
Tree iv. Graph
v.
Doubly linked list
Ans.
iii&iv
45. Consider the following statements :
P :
A page fault occurs when the required page is not available in the main memory.
Q :
There exists a situation that, there is no space available in the main memory.
Which
of the following is true ?‘
Ans. Both P and Q are true, and Q is also a reason
for P
46. Which of the following propositions is a
tautology ?
Ans. pv∨(p->q)
47. Fense Register is used for
Ans. File protection
48. SQL stands for
(A)
Structured Query Language
49. Active X control can be added to a webpage by
using
Ans.
< OBJECT> tag
50. Consider 4 processes P1, P2, P3 and P4 Process Arrival time Time units required
P1 0 5
P2 1 7
P3 3 4
P4 4 6
Find
the completion order of the 4 processes if round robin policy applies (round
robin with the quantum
of
2 time units)
Ans.
P3P1P4P2
No comments:
Post a Comment