Week 1 Assignment 1

Due date for this assignment: 2017-08-07, 23:59 IST.

Answer the following questions ( 1 mark )
1 point
Time taken by a n-bit ripple carry adder is proportional to

(a) O(n)

(b) O(log n)

(c) O(n*log n)

(d) O(n2)
1 point
The carry look ahead operation (*) can be used to reduce the time complexity of addition operation because of
which of these properties of the operation

(a) commutativity

(b) associativity

(c) distributivity

(d) closure
1 point
The depth of a hardware circuit is evaluated using which of the following techniques

(a) Divide and Conquer

(b) Depth First Search

(c) Topological Sorting

(d) Branch and Bound

1 point
A Segmentation Fault while generating a user-written program is gener-ated by

(a) Operating System

(b) Compiler

(c) High-Level Language

(d) Interpreter
1 point
Size of virtual memory is limited by

(a) Size of RAM

(b) Size of External Memory

(c) Size of the operating system

 (d) Size of the address bus
1 point
Task switching is handled by the

(a) Compiler

(b) Task

(c) Operating System

(d) Interpreter
1 point
The C-programming language is a

High-Level Language

Middle-level language

Low level language

1 point
Functions like printf() in C-programming language transfers the program control to the

Compiler

Operating system

Interpreter

Hardware

1 point
The most important constraint of a real-time system is

Space

Memory

Electricity

Time
1 point
Size of a circuit is

Area of a circuit

Width of circuit
 Number of connections

Number of combinational elements

You may submit any number of times before the due date. The final submission will be considered for grading.

1 point
Time taken by a n-bit carry look-ahead adder is proportional to

(a) O(n)

(b) O(log n)

(c) O(n*log n)

(d) O(n2)
1 point
Space taken by a n-bit carry look-ahead adder is proportional to

(a) O(n)

(b) O(log n)

(c) (n*log n)

(d) O(n2)
1 point
Number of full adders that will be used in multiplication of two 4-bit binary numbers using the carry save based
multiplication technique are

(a) 10

(b) 9

(c) 3

(d) 12
1 point
The depth of the Wallace Tree that computes the product of two n-bit numbers is proportional to

O(n)

O(log n)

O(n^2)

O(n^3)
1 point
x(j+1) (*) x(j), when x(j+1)= k and x(j)=g, where g refers to the generate operation, k refers to the kill operation
and (*) refers to the look ahead operation is

(a) k

(b) g

(c) p

(d) t
1 point
Partial products are generated by performing a __________ operation between a bit and the other operand.

AND

OR

XOR

NAND

The addressing modes involved in the following instruction are

MOV EAX, 0x10

Register, Register

Register , Memory

Register, Immediate

Immediate, Memory
1 point
What does the following instruction result in ?
DIV EAX

Compiler Error

Syntax Error

Divides EAX by 1

Divides EAX by EAX

1 point
The remainder of the DIV operation is stored in which of the following registers?

EAX

EBX

ECX
 EDX
1 point
Which of the following characterizes the memory in x86 architecture?

bit-addressible

byte-addressible

long-addressible

double-addressible
1 point
Which of the following characterizes the x86 architecture?

Simple Instruction Set Architecture

Reduced Instruction Set Architecture

Extended Instruction Set Architecture

Complex Instruction Set Architecture

1 point
PF, the parity flag checks for which of these?

If number of 1's in the bit is even

If the number of 1's is greater than number of 0's

If all the bits are 0

If all the bits are 1

1 point
ADD AL, [0x1000] is a

4-bit instruction

8-bit instruction

16-bit instruction

32-bit instruction
1 point
Which of the following is the correct definition of accuracy?

How is the measured value to the true value?

How close are results from different experiments?

1 point
In 32-bit IEEE 754 floating point format, the exponents are stored in which of the following formats?

decimal
 excess-127

excess-64

exponent as integer
1 point
What kind of processor is x86?

RISC

CISC

DISC

None of the above

You may submit any number of times before the due date. The final submission will be considered for grading.