# Algorithm/Algorithm Mcq Set 1 Sample Test,Sample questions

1. left shift

2.right shift

3. greater than

4.less than

1. accumulator

2.multiplicand

3. quotient

4.multiplier

1. 8B2

2.F8B2

3.2B8

4.8C2

1.128

2.8

3.24

4.256

1. Flowchart

2.Flow

3.Algorithm

4.Syntax

1.432

2.543

3.345

4.777

1.Queue

2. LL

3. Stack

4. Union

1.Stack

2.Queue

4.Array

## Question: `Another name for 1-D arrays.`

1.Linear arrays

2.Lists

3.Horizontal array

4.Vertical array

1.0

2.1

3.2

4.10

## Question: `Boothâ€™s Algorithm is applied on ______`

1. decimal numbers

2.binary numbers

4.octal Numbers

1.10

2.12

3.-12

4. -10

1.m=nâ€™

2. m=nâ€™+1

3. m=nâ€™-1

4.m=n

## Question: `If you are given a word of size n bits, the range of 2â€™s complement of binary numbers is ________`

1.-2n+1 to +2n+1

2.-2n-1 to +2n-1

3.-2n-1 to +2n+1

4.-2n-1 to +2n-1-1

1. LSB

2.MSB

3.0

4.1

1. 1110

2.1111

3.0111

4.1,1101

1.4

2.8

3.16

4.32

1.4

2.3

3. 7

4. 8

1. 0001

2.0

3. 1001

4.1110

## Question: `The 1â€™s complement of 1111111110.101 is ______`

1. 1.010

2. 0000000000.010

3.1111111110.101

4.1.101

1. 1234

2.3421

3.3124

4.3420

1.010

2.001

3.000

4.111

1.11101

2.10100

3. 01101

4. 01000

## Question: `The complement of any number can be given by a general term ______`

1. Bn â€“ 1 â€“ N

2. Bn -1 + N

3.Bn +1 â€“ N

4. Bn +1 + N

1. IEEE 260

2.IEEE 488

3.IEEE 754

4.IEEE 610

1.Dividend

2.Quotient

3.Multiplicand

4. Multiplier

1. 1

2.11

3.9

4.23

1.1

2.11

3.9

4.23

1. 11101

2.11011

3. 1101

4. 1011

1.01000

2.01111

3.00011

4.11111111

1.0

2.1

3.11

4.10

1. 0

2.1

3.invalid

4.10

1.NaN

2.Underflow

3. Smallest

4.Mantissa

1.00001001

2. 11111001

3.10001001

4.11001

1. -011

2. 011

3. 010

4.-010

1.Process

2.Evaluation

3.Running

4.Input

## Question: `This characteristic often draws the line between what is feasible and what is impossible.`

1. Performance

2.System Evaluation

3.Modularity

4.Reliability

## Question: `What do you call the intermediate terms in binary multiplication?`

1. Multipliers

2.Mid terms

3.Partial Products

4.Multiplicands

## Question: `What does the data transfer instruction STA stand for?`

1. Store Accumulator

2.Send Accumulator

3. Send Action

4.Store Action

1.Not arithmetic

2.Not arithmetic

3. Not a number

4.Not a Node

1.11010

2.11011

3. 00110

4. 00101

1. 0

2. 1

3.0000

4.00000

1.2

2.3

3.4

4.0

1.6

2. -6

3.-2

4. -3

1.Flowchart

2. Program

3.Pseudo code

4.Syntax

## Question: ```Which of the following is incorrect? Algorithms can be represented:```

1.as pseudo codes

2.as syntax

3.as programs

4.as flowcharts

1.64-bit

2.8-bit

3.32-bit

4.128-bit

## Question: `Which of the following is used for binary multiplication?`

1.Restoring Multiplication

2.Boothâ€™s Algorithm

3.Pascalâ€™s Rule

4.Digit-by-digit multiplication