Quiz Electronics Engineering
Each Question carries 1 Mark
Negative Marking: 1/4
Time: 10 Minutes
Q1. The number of address lines in the memory chip of size 8192 × 8 is –
Q2. Software that measures, monitors, analyzes and control real world events is called
(a) System Software
(b) Real-time software
(c) Scientific Software
(d) Business Software
Q3. Dividing a project into segments and smaller units in order to simplify analysis, design and programming efforts is called
(a) Modular approach
(b) Top down approach
(c) Bottom up approach
(d) Left-right approach
Q4. The Data Manipulation Language
(a) refers to data using physical addresses
(b) cannot interface with high-level programming language
(c) is used to define the physical characteristics of each record.
(d) none of these
Q5. A tuple in relational DBMS is equivalent to
Q6. Which one of the following set of gates are best suited for parity checking and parity generation?
(a) AND, OR, NOT
(b) EX-OR, EX-NOR
Q7. The library function exit() causes an exit from
(a) the loop in which it occurs
(b) the block in which it occurs
(c) the function in which it occurs
Q8. Can a DFA simulate NFA?
(d) depends on NFA
Q9. Queue serves a major role in
(a) simulation of recursion
(b) simulation of arbitrary linked list
(c) simulation of limited resource allocation
(d) expressive evaluation
Q10. A complete graph with ‘n’ vertices is
(b) (n/2) chromatic
(c) (n – 1) chromatic
(d) n chromatic
Sol. Each address consists of 8-bits. So, total addresses are 8192.
Let number of address lines be ‘n’.
Now, 2^n = 8192
2^n = 2^13
So, n = 13
Therefore, there are 13 address lines.
Sol. DML consists of SQL commands to manipulate & process data stored into database objects. It is used to store, modify, retrieve, delete and update data in a database. Examples of DML commands include Select, Insert, Update and Delete commands.
Sol. A tuple is simply a row contained in a table in the tablespace. A table usually consists of columns and rows in which row denotes records while column denotes attributes. A single row of a table that has a single record for such a relation is known as a tuple.
Sol. With the help of EX-OR and EX-NOR gates we can check whether number of 1’s are even in number or odd in number but remaining other gates cannot tell. So these two gates are best suited for parity checking and parity generation.
Sol. In the C Programming Language, exit() function terminates the program. File buffers are flushed, streams are closed, and temporary files are deleted.
Simulation of recursion uses stack data structure.
Simulation of arbitrary linked lists uses linked lists.
Simulation of resource allocation uses queue so that first entered data can be given first priority during resource allocation.
Simulation of heap sort uses heap data structure.
Sol. A complete graph with n vertices is n-chromatic, because all its vertices are adjacent.