1. Which
of the following does not define a tree?

(A) A
tree is a connected acyclic graph.

(B) A
tree is a connected graph with n-1 edges where ’n’ is the number of vertices in
the graph.

(C) A
tree is an acyclic graph with n-1 edges where ’n’ is the number of vertices in
the graph.

(D) A tree is a graph with no cycles.

Answer: D

2. The
complexity of Kruskal’s minimum spanning tree algorithm on a graph with ‘n’
nodes and ‘e’ edges is :

(A) O(n) (B)
O(n log n)

(C) O(e log n) (D) O(e)

Answer: C

3. If
a code is t-error correcting, the minimum Hamming distance is equal to:

(A) 2t+1 (B)
2t

(C) 2t-1 (D) t-1

Answer: A

4. The
set of positive integers under the operation of ordinary multiplication is:

(A) not a monoid (B) not a group

(C) a group (D)
an Abelian group

Answer: D

5. In
a set of 8 positive integers, there always exists a pair of numbers having the
same remainder when divided by:

5.(A)
7 (B)
11

(C) 13 (D)
15

Answer: A

6. An
example of a tautology is:

(A) x v y (B)
x v (~y)

(C) x v (~x) (D)
(x=>y)˄(x<=y)

Answer: C

7. Among
the logic families RTL, TTL, ECL and CMOS, the fastest family is:

(A) ECL (B)
CMOS

(C) TTL (D) RTL

Answer: A

8. The
octal equivalent of the hexadecimal number FF is:

(A) 100 (B)
150

(C) 377 (D) 737

Answer: C

9. The
characteristic equation of a T flip flop is given by:

(A) Q

_{N+1}=TQ_{N}(B) Q_{N+1}=T+Q_{N}
(C) Q

_{N+1}=T**⊕**Q_{N}(D) Q_{N+1}=T’+Q_{N}
Answer: C

10. The
idempotent law in Boolean algebra says that:

(A) ~(~x)=x (B)
x+x=x

(C) x+xy=x (D)
x(x+y)=x

Answer: B

11. What
is the effect of the following C code?

for(int i=1; i≤5; i=i+½)

printf(“%d,”,i);

(A) It prints 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5,
5, and stops

(B) It prints 1, 2, 3, 4, 5, and stops

(C) It prints 1, 2, 3, 4, 5, and repeats
forever

(D) It prints 1, 1, 1, 1, 1, and repeats
forever

Answer: D

12. Consider
the following declaration in C:

char a[];

char *p;

Which of the following statement is not a
valid statement?

(A) p=a; (B)
p=a+2;

(C) a=p; (D)
p=&a[2];

Answer: C

13. Consider
the following C code:

{ int a=5, b=9;

float r;

r=b/a; }

What is the value of r ?

(A) 1.8 (B)
1.0

(C) 2.0 (D)
0.0

Answer: B

14. Function
overloading is a concept in which:

(A) a function is used to implement lots of
tasks at the same time.

(B) a function is called too many number of
times by another function.

(C) a function provides common interface to
the user to carry out possibly different functions in each call.

(D) a function is computationally too
expensive for the system to handle.

Answer: C

15. Which
of the following is true?

(A) A “static” member of a class cannot be
inherited by its derived class.

(B) A “static” member of a class can be
initialized only within the class it is a member of.

(C) A “static” member of a class can be initialized
before an object of that class is created.

(D) Since “static” member of a class is
actually a global element, it does not require a class/object qualifier to access
it independently of class/object.

Answer: C

16. A
superkey for an entity consists of:

(A) one attribute only

(B) at least two attributes

(C) at most two attributes

(D) one or more attributes

Answer: D

17. Which
of the following set of keywords constitutes a mapping in SQL?

(A) SELECT, FROM, TABLE

(B) SELECT, FROM, WHERE

(C) CONNECT, TABLE, CREATE

(D) SELECT, TABLE, INSERT

Answer: B

18. If
a relation is in 2NF then:

(A) every candidate key is a primary key

(B) every non-prime attribute is fully
functionally dependent on each relation key

(C) every attribute is functionally
independent

(D) every relational key is a primary key

Answer: B

19. Which
of the following is true?

(A) A relation in 3NF is always in BCNF

(B) A relation in BCNF is always in 3NF

(C) BCNF and 3NF are totally different

(D) A relation in BCNF is in 2NF but not in
3NF

Answer: B

20. Consider
the query : SELECT student_name FROM student_data WHERE rollno (SELECT rollno
FROM student_marks WHERE SEM1_MARK=SEM2_MARK);

Which of the following is true ?

(A) It gives the name of the student whose
marks in semester 1 and semester 2 are same.

(B) It gives all the names and roll nos of those students whose marks in semester 1
and semester 2 are same.

(C) It gives the names of all the students
whose marks in semester 1 and semester 2 are same.

(D) It gives roll numbers of all students
whose marks in semester 1 and semester 2 are same.

Answer: C

21. Which
of the following data structures is most efficient in terms of both space and
time to reverse a string of characters?

(A) Linked list (B) Stack

(C) Array (D)
Tree

Answer: B

22. Which
of the following can be the sequence of nodes examined in a binary search tree
while searching for key 98?

(A) 100, 50, 75, 60, 98

(B) 100, 120, 90, 95, 98

(C) 200, 70, 100, 95, 98

(D) 75, 150, 90, 80, 98

Answer: C

23. Which
of the following is true for a sorted list with ‘n’ elements?

(A) Insertion in a sorted array takes
constant time.

(B) Insertion in a sorted linear linked list
takes constant time.

(C) Searching for a key in a sorted array can
be done in O(log n) time.

(D) Searching for a key in a sorted linear
linked list can be done in O(log n) time.

Answer: C

24. Files
that are related to input/output and are used to model serial I/O devices such
as terminals, printers and networks are called :

(A) regular files (B) character special files

(C) directories (D) block special files

Answer: D

25. An
example of a possible file attribute is:

(A) minimum size (B) permanent flag

(C) archive flag (D) EBCDIC flag

Answer: C

26. The
ATM cells are ................ bytes long.

(A) 48 (B)
53 (C) 64 (D) 69

Answer: B

27. For
slotted ALOHA, the maximum channel utilization is :

(A) 100% (B)
50%

(C) 36% (D) 18%

Answer: C

28. For
a channel of 3 KHz bandwidth and signal to noise ratio of 30 dB, the maximum
data rate is:

(A) 3000 bps (B)
6000 bps

(C) 15000 bps (D)
30000 bps

Answer: D

29. An
example of a public key encryption algorithm is:

(A) Caesar cipher algorithm

(B) DES algorithm

(C) AES algorithm

(D) Knapsack algorithm

Answer: D

30. With
reference to hierarchical routing, the optimum number of levels for an m router
subnet is:

(A)

*m*^{2}(B)*m*
(C)

*ln**m*(D)*√m*
Answer: C

**Part 1**

**Part 2**

Question 1-----Answer should be D

ReplyDeleteAn undirected graph is a tree iff

1.the graph is connected

2.there is no cycle

means

A TREE is connected,acyclic(no cycles) graph...

In option D----word connected is missing so it is not defined.....