Tuesday, 25 November 2014

UGC NET Computer Science Paper III Retest September 2013 - Part 1

1.       Which of the following is a correct predicate logic statement for “Every Natural number has one successor” ?
(A) xy (succ(x, y) (z succ(x, z) equal (y, z)))
(B) xy (succ(x, y) (z succ(x, z) equal (y, z)))
(C) yx (succ(x, y) (z succ(x, z) equal (y, z)))
(D) xy succ (x, y)
Answer: A
2.       α – β cutoffs are applied to .............
(A) Depth first search 
(B) Best first search
(C) Minimax search    
(D) Breadth first search
Answer: C
3.       Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem    CROSS
+ROADS
--------------
DANGER
--------------
Which of the following statement is true ?
(i) No two alphabets can have the same numeric value.
(ii) Any two alphabets may have the same numeric value.
(iii) D = 0
(iv) D = 1
(A) (i) and (iii)   (B) (i) and (iv)
(C) (ii) and (iii) (D) (ii) and (iv)
Answer: B
4.       Which of the following is not a part of an expert system shell ?
(A) Knowledge Base
(B) Inference Engine
(C) Explanation Facility
(D) None of the above
Answer: A
5.       The Blocks World Problem in Artificial Intelligence is normally discussed to explain a ..................
(A) Search technique
(B) Planning system
(C) Constraint satisfaction system
(D) Knowledge base system
Answer: B
6.       Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies ..................
(A) a forward search that can reduce the difference.
(B) a backward search that can reduce the difference.
(C) a bidirectional search that can reduce the difference.
(D) an operator that can reduce the difference.
Answer: D
7.       Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is ..............
(A) 0.05 second           (B) 0.1 second
(C) 0.2 second                         (D) 2.0 second
Answer: C
8.       Which of the following is the size of Network bits and Host bits of Class A of IP address?
(A) Network bits 7, Host bits 24
(B) Network bits 14, Host bits 16
(C) Network bits 15, Host bits 16
(D) Network bits 16, Host bits 16
Answer: A
9.       Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged ?
(A) TCP header length                      
(B) Window size
(C) Acknowledgement number        
(D) Urgent pointer
Answer: B

10.    Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ?
(A) 2500 bps     (B) 5000 bps
(C) 7500 bps     (D) 20000 bps
Answer: C
11.    Match the following :
(a) UDP                         (i) Message Transfer Protocol
(b) OSPF           (ii) Bit-oriented Protocol
(c) SMTP           (iii) Interior Gateway Routing Protocol
(d) HDLC           (iv) Connectionless Transport Protocol
Codes :
      (a)   (b)  (c)  (d)
(A) (iii)  (iv)  (ii)  (i)
(B) (iv)  (iii)  (ii)  (i)
(C) (iv)  (iii)  (i)  (ii)
(D) (iii)  (iv)  (i)  (ii)
Answer: C
12.    Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address ?
(A) 201.14.78.32         
(B) 201.14.78.64
(C) 201.14.78.65         
(D) 201.14.78.224
Answer: B
13.    If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is .................
(A) Alternative solution          
(B) Infeasible solution
(C) Unbounded solution       
(D) Degenerate solution
Answer: B
14.    An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of
(A) rows or columns
(B) rows + columns
(C) rows + columns – 1
(D) rows + columns + 1
Answer: A
15.    Which of the following is the minimum cost for an assignment problem given below ?
Answer: C
16.    Assume, L is regular language. Let statements S1 and S2 be defined as :
S1 : SQRT(L) = { x| for some y with |y| = |x|2, xy L}
S2 : LOG(L) = { x| for some y with |y| = 2|x|, xy L}
Which of the following is true ?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
Answer: B
17.    A regular grammar for the language L = {anbm | n is even and m is even}is given by
(A) S→aSb | S1; S1 → bS1a | λ
(B) S→aaS | S1; S1 → bSb | λ
(C) S→aSb | S1; S1 → S1ab | λ
(D) S→aaS | S1; S1 → bbS1 | λ
Answer: D
18.    Given the following productions of a grammar :
S→ aA| aBB;
A→aaA |λ ;
B→ bB| bbC;
C→ B
Which of the following is true ?
(A) The language corresponding to the given grammar is a set of even number of a’s.
(B) The language corresponding to the given grammar is a set of odd number of a’s.
(C) The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.
(D) The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s.
Answer: B
19.    The language accepted by the nondeterministic pushdown automaton
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with transitions
δ (q0 a, z) = { (q1 a), (q2 λ)};
δ (q1, b, a) = { (q1, b)}
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) = { (q2, λ)}
is
(A) L(abb*a)                  (B) {a} U L(abb*a)
(C) L(ab*a)                    (D) {a} U L(ab*a)
Answer: B
20.    The language L = {an bn am bm | n ≥ 0, m ≥ 0} is
(A) Context free but not linear
(B) Context free and linear
(C) Not Context free and not linear
(D) Not Context free but linear
Answer: A
21.    Assume statements S1 and S2 defined as :
S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2 : The set of all Turing machines is countable.
Which of the following is true ?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
Answer: B
22.    Non-deterministic pushdown automaton that accepts the language generated by the grammar: S→aSS | ab is
(A) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(B) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(C) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, S)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
(D) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
Answer: B
23.    Match the following :
(a) Dangling pointer    (i) Buffer replacement policy
(b) Page fault               (ii) Variable-length records
(c) List representation (iii) Object identifier
(d) Toss-immediate      (iv) Pointer-swizzling
Codes :
      (a)   (b)  (c)  (d)
(A) (iii)  (iv)  (ii)   (i)
(B) (iv)  (iii)  (ii)   (i)
(C) (iv)  (iii)  (i)   (ii)
(D) (iii)  (iv)  (i)   (ii)
Answer: A
24.    .................. constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation.
(A) Logical Integrity     (B) Referential Integrity
(C) Domain Integrity    (D) Data Integrity
Answer: B
25.    The SQL expression
Select distinct T, branch_name from branch T, branch S where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of
(A) All branches that have greater assets than some branch located in Mumbai.
(B) All branches that have greater assets than all branches in Mumbai.
(C) The branch that has greatest asset in Mumbai.
(D) Any branch that has greater assets than any branch in Mumbai.
Answer: A
26.    Let A be the set of comfortable houses given as
Then the set of comfortable and affordable houses is











Answer: A
27.    Support of a fuzzy set
within a universal set X is given as








Answer: D
28.    In a single perceptron, the updation rule of weight vector is given by
(A) w(n + 1)=w(n)+η[d(n)-y(n)]
(B) w(n + 1)=w(n)–η[d(n)-y(n)]
(C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
(D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
Answer: C
29.    ................ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values.
(A) Fault            (B) Failure
(C) Defect         (D) Error
Answer: D
30.    Which logic family dissipates the minimum power ?
(A) DTL (B) TTL
(C) ECL             (D) CMOS
Answer: D
31.    Which of the following electronic component is not found in IC’s ?
(A) Diode           (B) Resistor
(C) Transistor   (D) Inductor
Answer: D
32.    A given memory chip has 14 address pins and 8 data pins. It has the following number of locations.
(A) 28     (B) 214
(C) 26     (D) 212
Answer: B
33.    The instruction: MOV CL, [BX] [DI] + 8 represents the ............... addressing mode.
(A) Based Relative      (B) Based Indexed
(C) Indexed Relative   (D) Register Indexed
Answer: B
34.    The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by
(A) 34 mW         (B) 43 mW
(C) 4/3 mW        (D) 12 mW
Answer: D
35.    An astable multivibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have
(A) RA = 40.4 KΩ, RB = 17.25 KΩ,
C = 2000 pF
(B) RA = 17.25 KΩ, RB = 40.4 KΩ,
C = 2000 pF
(C) RA = 40.4 KΩ, RB = 17.25 KΩ,
C = 5000 pF
(D) RA = 17.25 KΩ, RB = 40.4 KΩ,
C = 5000 pF
Answer: Marks given to all
36.    A binary ripple counter is required to count up to 16383. How many flip-flops are required ?
(A) 16382          (B) 8191
(C) 512              (D) 14
Answer: D
37.    The time complexity of recurrence relation
T(n) = T(n/3) + T(2n/3) + O(n) is
(A) O(Ig n)         (B) O(n)
(C) O(n Ig n)     (D) O(n2 )
Answer: C
38.    How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year ?
(A) At least 23               (B) At least 183
(C) At least 366            (D) At least 730
Answer: A
39.    The number of possible parenthesizations of a sequence of n matrices is
(A) O(n)             (B) θ(n Ig n)
(C) Ω(2n)            (D) None of the above
Answer: C
40.    The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
(A) O(n)             (B) O(n Ig n)
(C) O(n2)            (D) None of the above
Answer: B

  Part 1   Part 2 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App