Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Questions
1 Which of the following is a correct predicate logic statement for “Every Natural number has one successor” ?
A ∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
B ∀x∃y (succ(x, y) ∨ (∃z succ(x, z) ⇒ equal (y, z)))
C ∃y∀x (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
D ∀x∃y succ (x, y)

Answer: Option [A]
2 α – β cutoffs are applied to ______
A Depth first search
B Best first search
C Minimax search
D Breadth first search

Answer: Option [B]
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: Option [D]
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: Option [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: Option [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: Option [B]
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: Option [B]
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: Option [B]
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: Option [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: Option [B]
11 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: Option [A]
12 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: Option [B]
13 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: Option [D]
14 Assume, L is regular language. Let statements S1 and S2 be defined as : S 1 : SQRT(L) = { x| for some y with |y| = |x|2, xy ∈L}. S 2 : 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: Option [A]
15 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: Option [B]
16 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: Option [B]
17 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 (abb*a)
D {a} U L(ab*a)

Answer: Option [B]
18 Assume statements S1 and S2 defined as : S 1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S 2 : 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: Option [B]
19 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: Option [B]
20 Consider a single perception with weights as given in the following figure : and f (t) defined as f (t) = ⎩ ⎪ ⎨ ⎪ ⎧ 1, t > 0 0, t ≤ 0 The above perception can solve
A OR problem
B AND problem
C XOR problem
D All of the above

Answer: Option [B]