Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Filter by Categories
nmims post
Objective Type Set
Online MCQ Assignment
Question Solution
Solved Question
Uncategorized

# Multiple choice question for engineering

## Set 1

1. (a,b) what is a?
a) Domain
b) Range
c) All of the mentioned
d) None of the mentioned

Answer: a [Reason:] A is called the domain.

2. (a,b) what is b?
a) Domain
b) Range
c) All of the mentioned
d) None of the mentioned

Answer: b [Reason:] B is called the Range.

3. R is said to be reflexive if aRa is true for every a in A;
a) True
b) False

Answer: a [Reason:] All the elements of A are related with itself by relation R, hence it is a reflexive relation.

4. If every aRb implies bRa then a relation R will be a symmetric relation.
a) True
b) False

Answer: a [Reason:] a is related to b by R, and if b is also related to a by the same relation R).

5. If every aRb and bRc implies aRc, then the relation is transitive
a) True
b) False

Answer: a [Reason:] a is related to b by R, and b is related to c by R, and similarly for a and c.

6. The smallest set A such that A ∪ {1, 2} = {1, 2, 3, 5, 9} is
a) {2,3,5}
b) {1, 2, 5, 9}
c) {3, 5, 9}
d) None of the mentioned

Answer: c [Reason:] Given A ∪ {1, 2} = {1, 2, 3, 5, 9}. Hence A = {3,5,9}.

7. If a set A has n elements, then the total number of subsets of A is.
a) N
b) 2n
c) N2
d) 2n

Answer: c [Reason:] Number of subsets of A = nC0 + nC1+ . . . . . + nCn = 2n.

## Set 2

1. Non-Linear grammar has has two non-terminals on the right-hand side.
a) True
b) False

Answer: a [Reason:] The above stated grammar is non-linear because it has two non-terminals on the right-hand side.

2. S → SS S → λ S → aSb S → bSa which type of grammar is it?
a) Linear
b) Nonlinear
c) Both of the mentioned
d) None of the mentioned

Answer: a [Reason:] Grammar is non-linear because one of the rules (the first one) has two non-terminals on the right-hand side.

3. Linear grammar has more than one non-terminal on the right-hand side.
a) True
b) False

Answer: a [Reason:] Grammar is linear because no rule has more than one non terminal on the right-hand side.

4. In Right-Linear grammars, all productions have the form: A → xB
a) True
b) False

Answer: a [Reason:] Right-Linear grammars, following are the form of productions: A → xB or A → x where x is some string of terminals.

5. S → abS S → a is which grammar
a) Right Linear Grammar
b) Left Linear Grammar
c) Right & Left Linear Grammar
d) None of the mentioned

Answer: a [Reason:] grammars in which all of the rules contain only one non-terminal on the left-hand side, and where in every case that non-terminal is the first symbol are called right Linear.

6. What are the two types of Linear Grammar?
a) Right Linear
b) Left Linear
c) None of the mentioned
d) Right & Left Linear

Answer: d [Reason:] Linear grammar is of 2 types Left and Right Linear Grammar

7. Which Grammar is it?
a) Right Linear
b) Left Linear
c) None of the mentioned
d) Right & Left Linear

Answer: b [Reason:] In Left-Linear grammars, all productions have the form: A→Bx or A→ x where x is some string of terminals.

8. Which Type of Grammar is it?
S → Aa A → Aab | λ
a) Right Linear
b) Left Linear
c) None of the mentioned
d) Right & Left Linear

Answer: b [Reason:] In this case they both correspond to the regular expression (ab)*a.

9. A Regular Grammar is any right-linear or left-linear grammar.
a) True
b) False

Answer: a [Reason:] As it turns out the languages that can be generated by Regular Grammars is equivalent to those that can be specified by Regular Expressions.

10. Regular Grammars generate Regular Languages.
a) True
b) False

Answer: a [Reason:] That’s why they are called regular languages.

## Set 3

1. The load instruction is mostly used to designate a transfer from memory to a processor register known as_______
a) Accumulator
b) Instruction Register
c) Program counter
d) Memory address Register

Answer: a [Reason:] Accumulator is the process register.

2. A group of bits that tell the computer to perform a specific operation is known as________
a) Instruction code
b) Micro-operation
c) Accumulator
d) Register

Answer: a [Reason:] Instruction code is the set of specific tasks to be performed

3. The time interval between adjacent bits is called the__________
a) Word-time
b) Bit-time
c) Turnaround time
d) Slice time

Answer: b [Reason:] Bit time is the interval time here

4. A k-bit field can specify any one of__________
a) 3k registers
b) 2k registers
c) K2 registers
d) K3 registers

Answer: b [Reason:] 2k is the answer

5. MIMD stands for __________
a) Multiple instruction multiple data
b) Multiple instruction memory data
c) Memory instruction multiple data
d) Multiple information memory data

Answer: a [Reason:] MIMD stands for multiple instructions multiple data

6. Logic gates with a set of input and outputs are arrangement of___________
a) Computational circuit
b) Logic circuit
c) Design circuits
d) Register

Answer: a [Reason:] The answer is computational circuit

7. The average time required to reach a storage location in memory and obtain its contents is called__________
a) Latency time
b) Access time
c) Turnaround time
d) Response time

Answer: b [Reason:] Access time is the time from the start of one storage device access to the time when the next access can be started.

8. The BSA instruction is___________
a) Branch and store accumulator
b) Branch and save return address
c) Branch and shift address
d) Branch and show accumulator

Answer: b [Reason:] BSA is branch and save return address

9. A floating point number that has an O in the MSB of mantissa is said to have__________
a) Overflow
b) Underflow
c) Important number
d) Undefined

Answer: b [Reason:] It is an underflow condition.

10. Translation from symbolic program into Binary is done in__________
a) Two passes
b) Directly
c) Three passes
d) Four passes

Answer: a [Reason:] Two passes are required

## Set 4

1. The instruction ‘ORG O’ is a______
a) Machine Instruction
b) Pseudo instruction
c) High level instruction
d) Memory instruction

Answer: b [Reason:] It is a pseudo instruction

2. ‘Aging registers’ are _______
a) Counters which indicate how long ago their associated pages have been Referenced.
b) Registers which keep track of when the program was last accessed
c) Counters to keep track of last accessed instruction
d) Counters to keep track of the latest data structures referred

Answer: a [Reason:] This is known as aging

3. Memory unit accessed by content is called______
a) Read only memory
b) Programmable Memory
c) Virtual Memory
d) Associative Memory

Answer: d [Reason:] Associative Emory is accessed by content

4. _________ register keeps tracks of the instructions stored in program stored in memory.
a) AR (Address Register)
b) XR (Index Register)
c) PC (Program Counter)
d) AC (Accumulator)

Answer: c [Reason:] Program counter keeps a track

5. N bits in operation code imply that there are ___________ possible distinctOperators.
a) 2n
b) 2n
c) n/2
d) n2

Answer: b [Reason:] 2n possible combinations

6. A three input NOR gate gives logic high output only when_____
a) One input is high
b) One input is low
c) Two input are low
d) All input are high

Answer: d [Reason:] All inputs are high

7. The circuit converting binary data in to decimal is_____
a) Encoder
b) Multiplexer
c) Decoder
d) Code converter

Answer: d [Reason:] It is the code converter

8. The multiplicand register & multiplier register of a hardware circuit implementing booth’s algorithm have (11101) & (1100). The result shall be ______
a) (812)10
b) (-12)10
c) (12)10
d) (-812)10

Answer: a [Reason:] On multiplying we get 81210

9. PSW is saved in stack when there is a _____
a) Interrupt recognized
b) Execution of RST instruction
c) Execution of CALL instruction
d) All of these

Answer: a [Reason:] It can be interrupted

10. In computers, subtraction is carried out generally by____
a) 1’s complement method
b) 2’s complement method
c) signed magnitude method
d) BCD subtraction method

Answer: b [Reason:] Subtraction done by 2’s complement

## Set 5

1. Which of the following is not a feature of compiler?
a) Converts it into machine code
b) None of the mentioned
c) Slow for debugging
d) Execution time is more

Answer: d [Reason:] No specified execution time.

2. Parsing is also known as
a) Lexical analysis
b) Syntax analysis
c) Semantic analysis
d) Code generation

Answer: b [Reason:] Another name for parsing is Syntax Analysis.

a) Is same as the loader
b) Create a load module
c) Both of the mentioned
d) None of the mentioned

Answer: b [Reason:] It creates a module to be loaded.

4. Predictive parsers can be
a) Recursive
b) Constructive
c) Non recursive
d) Both a and b

Answer: a [Reason:] The nature of predictive parsers can be Recursive.

5. Producer consumer problem can be solved using
a) Semaphores
b) Event counters
c) Monitors
d) All of the mentioned

Answer: d [Reason:] The famous producer consumer problem can be solved by a semaphores event counters as well as monitors.

6. Bottom up parsing involves
a) Shift reduce
b) Handle pruning
c) None of the mentioned
d) Both of the mentioned

Answer : d [Reason:] The bottom up parsing involves Shift reduce operation and Handle pruning.

7. An example of intermediate language is
a) SNOBOL
b) PASCAL
c) COBOL
d) UNCOL

Answer: d [Reason:] Others are HLL.

8. In a two pass assembler the object code generation is done during the
a) Second pass
b) First pass
c) Zeroth pass
d) Not done by assembler

Answer: a [Reason:] I second pass object code is generated.

9. A programming language is to be designed to run on a machine that does not have a big memory.
a) Prefer a 2 pass compiler
b) Prefer an interpreter
c) Not support recursion
d) All of the mentioned