Objective Questions(101-110)

101. Which logic family dissipates the minimum power ?
(A) DTL (B) TTL
(C) ECL (D) CMOS

102. If a packet arrive with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, then it is ______ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above

M-bit flag value is 1 which indicates fragments are there and and here offset value is 0 which indicated its a first segment.
if M-bit flag value is 1 and fragment offset is non zero then its a middle fragment.
and if M bit flag value is 0 then its a last fragment.

103. The minimum number of nodes in a binary tree of depth d (root is at level 0) is
(A) 2d – 1 (B) 2d + 1 – 1
(C) d + 1 (D) d

104. Which normal form is considered as adequate for usual database design ?

(A) 2NF
(B) 3NF (C) 4NF
(D) 5NF

105. Any binary relation is in
A. 1NF
B. 4NF
C. 3NF
D. BCNF

106. Consider a fuzzy set A defined on the interval X = [0, 10] of integers by the membership Junction
µA(x) =x/x+2
Then thn α cut corresponding to
α = 0.5 will be
(A) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
(B) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
(C) {2, 3, 4, 5, 6, 7, 8, 9, 10}
(D) { }

For numbers 2, µA(x)=2/(2+2)=0.5, for all numbers from 2 to 10, µA(x)>=0.5

107. Which one of the following is not an
informed search technique ?
(A) Hill climbing search
(B) Best first search
(C) A* search
(D) Depth first search

hill climbing ,A* ,best first search are informed search technique.....
depth first search and breadth first search are uninformed search technique
so ans is d

UNINFORMED SEARCH :- they are given no information about the problem other than it's definition

INFORMED SEARCh :- one that have some idead about where to look for solution

108. The string containing certain required formatting information is called
a) argument
b)character array
c)character string
d)control string

109. IN LR(k) grammar handle is
a. A string of variables and terminals
b. string of variables
c. string of terminals
d. None of the above

110. The regular sets are closed under. . ??
1) union
2) concatenation
3) kleenes closure
4) all