Quiz Electronics Engineering

Exam: NIC

Topic: Miscellaneous

Date: 29/05/2020

Each Question carries 1 Mark

Negative Marking: 1/4

Time: 10 Minutes

Q1. If the connection of two-port is such that the transmission matrix of the overall network is the product of the transmission matrices of the individual networks, what type of connection is it?

(a) Series Connection

(b) Parallel Connection

(c) Cascade Connection

(d) None of the above

Q2. A junction FET can be used as a Voltage Variable Resistor

(a) well below pinch-off condition

(b) beyond pinch-off voltage

(c) at pinch-off voltage

(d) for any value of V_DS

Q3. If 225_Y = 165_8, find the value of radix base.

(a) 11

(b) 8

(c) 9

(d) 7

Q4. Recursion uses more memory space than iteration because

(a) it uses stack instead of queue

(b) every recursive call has to be stored

(c) both (a) & (b)

(d) None of the above

Q5. If P(A ∩ B) = P(A)P(B), then events A and B are called

(a) independent

(b) dependent

(c) exhaustive

(d) None of the above

Q6. A balance factor in AVL tree is used to check

(a) what rotation to make

(b) if all child nodes are at same level

(c) when the last rotation occurred.

(d) if the tree is unbalanced.

Q7. In a compiler, keywords of a language are recognized during

(a) parsing of the program

(b) the code generation

(c) the lexical analysis of the program

(d) dataflow analysis

Q8. Which one of the following is not an approach to compute the Minimum spanning tree in a weighted graph?

(a) Kruskal

(b) Prim’s

(c) Boruvka’s

(d) Dijkstra’s

Q9. The addressing mode used in the instruction PUSH B is

(a) direct

(b) register

(c) register indirect

(d) immediate

Q10. Which of the following is the internal memory of the system(computer)?

(a) CPU register

(b) Cache

(c) Main memory

(d) All of the above

SOLUTIONS

S1. Ans.(c)

S2. Ans.(a)

Sol. In Triode region which is below the Pinch-off voltage the drain to source resistance is controlled by bias voltage(V_GS). Therefore, JFET can be used as Voltage Variable Resistor.

S3. Ans.(d)

Sol.

225_Y = 2 × Y^2 + 2 × Y^1 + 5 × Y^0 = 2Y^2 + 2Y^1 + 5

165_8 = 1 × 8^2 + 6 × 8^1 + 5 × 8^0 = 64 + 48 + 5 = 117

Now, 225_Y = 165_8

⇒ 2Y^2 + 2Y^1 + 5 = 117

⇒ 2Y^2 + 2Y^1 = 117 – 5 = 112

⇒ 2Y^2 + 2Y^1 – 112 = 0

So, Y = +7 & -8

Radix base cannot be negative.

Therefore, the value of radix base is 7.

S4. Ans.(c)

Sol. Recursion uses more memory compared to iteration because every time the recursive function is called, the function call is stored in stack.

S5. Ans.(a)

Sol. Two events A and B are said to be independent if the occurrence of one event has does not affect the probability that the other event will occur. If two events are independent then

P(A∩B) = P(A)P(B)

S6. Ans.(d)

Sol. AVL trees are height balancing binary search tree. It checks the difference of the height of the left and the right sub-trees and assures that it is not more than 1. This difference is called the Balance Factor. So. with the help of balance factor we check if tree is balanced or not.

S7. Ans.(c)

Sol. A keyword can also be called as Tokens. During the lexical analysis of the program a sequence of characters are converted into a sequence of tokens. Keywords are usually first recognized during lexical analysis in order to make parsing easier. Parsers are implemented by writing context-free grammars of tokens rather than of lexemes so it becomes easier to build parser after keywords are recognized.

S8. Ans.(d)

Sol. Prim’s, Kruskal’s and Boruvka’s algorithm are a Greedy algorithm. These all are used to compute the Minimum spanning tree in a weighted graph.

Prim’s Algorithm is used to find Minimum Spanning Tree (MST).

Dijkstra’s Algorithm is used to find the shortest path from source to all the other nodes in a weighted graph.

S9. Ans.(b)

Sol. In Register addressing mode, the operand is hold in the register memory mentioned in the instruction. So, In PUSH B Register addressing mode is used.

S10. Ans.(d)

Sol. All three are the internal memory of the system. CPU register is the smallest and Main memory is the largest internal memory. Registers are the smallest and the fastest memory in a computer. It hold instructions that are currently processed by the CPU.