Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Home
Computer Science
computer-science-multiple-choice-questions-and-answers-22

Questions

1 Consider a hash table of size seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here “__” denotes an empty location in the table.

A 3, 10, 1, 8, __ , __ , __

B 1, 3, 8, 10, __ , __ , __

C 1, __ , 3, __ , 8, __ , 10

D 3, 10, __ , __ , 8, __ , __

Answer & Explanation

Answer: Option [A]

2 In Artificial Intelligence (AI), an environment is uncertain if it is ________.

A Not fully observable and not deterministic

B Not fully observable or not deterministic

C Fully observable but not deterministic

D Not fully observable but deterministic

Answer & Explanation

Answer: Option [B]

3 In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.

A current percept, completely ignoring rest of the percept history

B rest of the percept history, completely ignoring current percept

C both current percept and complete percept history

D both current percept and just previous percept

Answer & Explanation

Answer: Option [D]

4 In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others, which should we choose ?

A h(n)=max{h1(n),....,hm(n)}

B h(n)=min{h1(n),....,hm(n)}

C h(n)=avg{h1(n),....,hm(n)}

D h(n)=sum{h1(n),....,hm(n)}

Answer & Explanation

Answer: Option [A]

5 Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence ? B w C

A 10

B 12

C 15

D 16

Answer & Explanation

Answer: Option [B]

6 Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How many atomic events are there in the joint probability distribution ?

A 2, 598, 960

B 3, 468, 960

C 3, 958, 590

D 2, 645, 590

Answer & Explanation

Answer: Option [B]

7 E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :

A O (E∗f)

B O (E2∗f)

C O (E∗f2)

D O (E2∗f2)

Answer & Explanation

Answer: Option [B]

8 Which of the following statements is false about convex minimization problem ?

A If a local minimum exists, then it is a global minimum

B The set of all global minima is convex set

C The set of all global minima is concave set

D For each strictly convex function, if the function has a minimum, then the minimum is unique

Answer & Explanation

Answer: Option [B]

9 Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be S={0, 1, 2, .........., 32} where the sample j denote that j of the buffers are full and 1 p(i) (33 i) 561 = − . Let A denote the event that the even number of buffers are full. Then p(A) is :

A 0.515

B 0.785

C 0.758

D 0.485

Answer & Explanation

Answer: Option [B]

10 The equivalence of ¬ ∃ x Q (x) is :

A ∃ x ¬ Q (x)

B x ¬ Q (x)

C ¬ ∃ x ¬ Q (x)

D x Q (x)

Answer & Explanation

Answer: Option [B]

11 If Ai={−i, ... −2,−1, 0, 1, 2, . . . . . i} then i i 1 A ∞ = ∪ is :

A Z

B Q

C R

D C

Answer & Explanation

Answer: Option [A]

12 Which of the following is an equivalence relation on the set of all functions from Z to Z ?

A { (f, g) ? f (x)−g (x)=1 x e Z }

B { (f, g) ? f (0)=g (0) or f (1)=g (1) }

C { (f, g) ? f (0)=g (1) and f (1)=g (0) }

D { (f, g) ? f (x)−g (x)=k for some k e Z }

Answer & Explanation

Answer: Option [B]

13 Which of the following statements is true ?

A (Z, ≤ ) is not totally ordered

B The set inclusion relation ⊆ is a partial ordering on the power set of a set S

C (Z, ≠ ) is a poset

D The directed graph is not a partial order

Answer & Explanation

Answer: Option [D]

14 CMOS is a Computer Chip on the motherboard, which is :

A RAM

B ROM

C EPROM

D Auxillary storage

Answer & Explanation

Answer: Option [A]

15 In RS flip-flop, the output of the flip-flop at time (t+1) is same as the output at time t, after the occurance of a clock pulse if :

A S=R=1

B S=0, R=1

C S=1, R=0

D S=R=0

Answer & Explanation

Answer: Option [B]

16 The hexadecimal equivalent of the binary integer number 110101101 is :

A D24

B 1 B D

C 1 A E

D 1 A D

Answer & Explanation

Answer: Option [B]

17 Perform the following operation for the binary equivalent of the decimal numbers (−14)10+(−15)10 The solution in 8 bit representation is :

A 11100011

B 00011101

C 10011101

D 11110011

Answer & Explanation

Answer: Option [B]

18 Which of the following mapping is not used for mapping process in cache memory ?

A Associative mapping

B Direct mapping

C Set-Associative mapping

D Segmented - page mapping

Answer & Explanation

Answer: Option [B]

19 Relations produced from E - R Model will always be in ________.

A 1 NF

B 2 NF

C 3 NF

D 4 NF

Answer & Explanation

Answer: Option [B]

20 Simplify the following using K-map : F (A, B, C, D) = Σ (0, 1, 2, 8, 9, 12, 13) d (A, B, C, D) = Σ (10, 11, 14, 15) d stands for don’t care condition.

A A B D BC + +

B A B D B C + +

C A B C +

D A B C B D

Answer & Explanation

Answer: Option [B]

junior administrative assistant jaa test series