Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Questions
1 Bresenham line drawing algorithm is attractive because it uses
A Real arithmetic only
B Integer arithmetic only
C Floating point arithmetic
D Real and integer arithmetic

Answer: Option [A]
2 The refresh rate above which a picture stops flickering and fuses into a steady image is called _________.
A Crucial fusion frequency
B Current frequency fusion
C Critical fusion frequency
D Critically diffused frequency

Answer: Option [B]
3 In homogenous coordinate system (x, y, z) the points with z = 0 are called
A Cartesian points
B Parallel points
C Origin point
D Point at infinity

Answer: Option [D]
4 If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is
A 40 line-pairs per inch
B 80 line-pairs per inch
C 1600 lines per inch
D 40 lines per inch

Answer: Option [A]
5 Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is
A n × 8 MB
B n / 8 MB
C (1024 × 1024) / 8 MB
D 1024 MB

Answer: Option [B]
6 Arrays in C language can have _________ with reference to memory representation.
A n-subscripts
B two-subscripts
C only one subscript
D three subscripts only

Answer: Option [B]
7 Horn clauses are special kinds of propositions which can be described as
A Single atomic proposition on left side
B Single or multiple atomic proposition on left side
C A single atomic proposition on left side and a single atomic proposition on right side
D A single atomic proposition on left side or an empty left side

Answer: Option [B]
8 Which of the following is/are the fundamental semantic model(s) of parameter passing ?
A in mode
B out mode
C in-out mode
D all of the above

Answer: Option [B]
9 For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to
A ln|w|
B |w|
C |w|2
D |w|3

Answer: Option [B]
10 Which one of the following is not an addressing mode ?
A Register indirect
B Autoincrement
C Relative indexed
D Immediate operand

Answer: Option [B]
11 Computers can have instruction formats with
A only two address and three address instructions
B only one address and two address instructions
C only one address, two address and three address instructions
D zero address, one address, two address and three address instructions

Answer: Option [A]
12 Which is not a typical program control instruction ?
A BR
B JMP
C SHL
D TST

Answer: Option [B]
13 Interrupt which arises from illegal or erroneous use of an instruction or data is
A Software interrupt
B Internal interrupt
C External interrupt
D All of the above

Answer: Option [D]
14 The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is
A (W' + X') (Y' + Z') (X' + Z)
B (W' + X') (Y' + Z') (X' + Z')
C (W' + X') (Y' + Z) (X' + Z)
D (W' + X') (Y + Z') (X' + Z)

Answer: Option [A]
15 Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation ?
A Circular linked list
B Doubly linked list
C Linked list
D Dequeue

Answer: Option [B]
16 Binary symmetric channel uses
A Half duplex protocol
B Full duplex protocol
C Bit oriented protocol
D None of the above

Answer: Option [B]
17 Hamming distance between 100101000110 and 110111101101 is
A 3
B 4
C 5
D 6

Answer: Option [B]
18 Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is
A 11100010101
B 11100010100
C 1110001010
D 111000101

Answer: Option [B]
19 The number of distinct binary images which can be generated from a given binary image of right M × N are
A M + N
B M × N
C 2M + N
D 2M + N

Answer: Option [B]
20 If f(x, y) is a digital image, then x, y and amplitude values of f are
A Finite
B Infinite
C Neither finite nor infinite
D None of the above

Answer: Option [B]