Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Questions
1 High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences ?
A Morphological
B Syntactic
C Semantic
D Pragmatic

Answer: Option [D]
2 The objective of ________ procedure is to discover at least one ________ that causes two literals to match.
A unification, validation
B unification, substitution
C substitution, unification
D minimax, maximum

Answer: Option [B]
3 If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if
A h* is equal to h
B h* overestimates h
C h* underestimates h
D none of these

Answer: Option [C]
4 The mean-end analysis process centers around the detection of differences between the current state and goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator can not be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called
A backward planning
B goal stack planning
C operator subgoaling
D operator overloading

Answer: Option [C]
5 In alpha-beta pruning, _________ is used to cut off the search at maximizing level only and _________ is used to cut off the search at minimizing level only.
A alpha, beta
B beta, alpha
C alpha, alpha
D beta, beta

Answer: Option [B]
6 If A and B are two fuzzy sets with membership functions μA(x) = {0.2, 0.5, 0.6, 0.1, 0.9} μB(x) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of μA ∩ B will be
A {0.2, 0.5, 0.6, 0.7, 0.9}
B {0.2, 0.5, 0.2, 0.1, 0.8}
C {0.1, 0.5, 0.6, 0.1, 0.8}
D {0.1, 0.5, 0.2, 0.1, 0.8}

Answer: Option [D]
7 The height h(A) of a fuzzy set A is defined as h(A) = sup A(x) x ∈ A Then the fuzzy set A is called normal when
A h(A) = 0
B h(A) < 0
C h(A) = 1
D h(A) < 1

Answer: Option [C]
8 An artificial neuron receives n inputs x1, x2,...., xn with weights w1, w2,...., wn attached to the input links. The weighted sum ________ is computed to be passed on to a non-linear filter φ called activation function to release the output.
A Σ wi
B Σ xi
C Σ wi + Σ xi
D Σ wi ⋅ xi

Answer: Option [D]
9 Consider the formula in image processing R D = 1 – 1 CR Where CR = n1 n2 C R is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative _________ of the first data set.
A Data Compression
B Data Redundancy
C Data Relation
D Data Representation SEND + MORE MONEY Can be solved efficiently using

Answer: Option [B]
10 Find the false statement :
A In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption
B The symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product
C The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits
D Public key algorithms use two different keys for Encryption and Decryption

Answer: Option [C]
11 The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message that should be transmitted is
A 110010011001
B 11001001
C 110010011001001
D 11001001011

Answer: Option [D]
12 _________ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.
A 2n – 2
B n + floor (lg n) – 2
C floor ⎝ ⎜ ⎛ ⎠ ⎟ ⎞3n 2 – 2
D 2 lg n – 2

Answer: Option [C]
13 Let A and B be two n × n matrices. The efficient algorithm to multiply the two matrices has the time complexity
A O(n3)
B O(n2.81)
C O(n2.67)
D O(n2)

Answer: Option [B]
14 The recurrence relation T(n) = m T⎝ ⎜ ⎛ ⎠ ⎟ ⎞n 2 tan2 is satisfied by
A O(n2)
B O(n1g m)
C O(n2 lg n)
D O(n 1g n)

Answer: Option [A]
15 The longest common subsequence of the sequences X = and Y = has lengthAssuming there are n keys and each key is in the range [0, m – 1]. The run time of bucket sort is
A 3
B 4
C 5
D 2

Answer: Option [C]
16 Assuming there are n keys and each key is in the range [0, m – 1]. The run time of bucket sort is
A O(n)
B O(n lgn)
C O(n lgm)
D O(n + m)

Answer: Option [D]
17 A _________ complete subgraph and a _________ subset of vertices of a graph G = (V, E) are a clique and a vertex cover respectively.
A minimal, maximal
B minimal, minimal
C maximal, maximal
D maximal, minimal

Answer: Option [D]
18 Pumping lemma for context-free languages states : Let L be an infinite context free language. Then there exists some positive integer m such that any w ∈ L with |w| ≥ m can be decomposed as w = uv xy Z with |vxy| _________ and |vy| _________ such that uv . z xy. z Z ∈ L for all .z = 0, 1, 2, ....... .
A ≤ m, ≤ 1
B ≤ m, ≥ 1
C ≥ m, ≤ 1 (
D ≥ m, ≥ 1

Answer: Option [B]
19 The Greibach normal form grammar for the language L = {an bn + 1 | n ≥ 0} is
A S → a SB, B → bB | λ
B S → a SB, B → bB | b
C S → a SB | b, B → b
D S → a Sb | b

Answer: Option [C]
20 Given the following statements : S 1 : Every context-sensitive language L is recursive. S 2 : There exists a recursive language that is not context sensitive. Which statement is correct ?
A S1 is not correct and S2 is not correct
B S1 is not correct and S2 is correct
C S1 is correct and S2 is not correct
D S1 is correct and S2 is correct

Answer: Option [D]