MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1917 Mcqs, each offering curated multiple-choice questions to sharpen your UGC-NET knowledge and support exam preparation. Choose a topic below to get started.
| 201. |
Which of the following is the process by which a user’s privileges ascertained ? |
| A. | Authorization |
| B. | Authentication |
| C. | Access Control |
| D. | None of these |
| Answer» B. Authentication | |
| 202. |
Tuple in relational algebra refers to: |
| A. | Row |
| B. | Column |
| C. | Table |
| D. | Relation |
| Answer» B. Column | |
| 203. |
A recursive foreign key is a: |
| A. | references a relation |
| B. | references a table |
| C. | references its own relation |
| D. | references a foreign key |
| Answer» D. references a foreign key | |
| 204. |
Specialization is a ............... process. |
| A. | Top - down |
| B. | Bottom -Up |
| C. | Both a and b |
| D. | None of the above |
| Answer» B. Bottom -Up | |
| 205. |
Let R1(a, b, c) and R2(x, y, z) be two relations in which a is the foreign key of R1 that refers to the primary key of R2. Consider following four options.(a) Insert into R1 (b) Insert into R2(c) Delete from R1 (d) Delete from R2Which of the following is correct about the referential integrity constraint with respect to above? |
| A. | Operations (a) and (b) will cause violation. |
| B. | Operations (b) and (c) will cause violation. |
| C. | Operations (c) and (d) will cause violation. |
| D. | Operations (d) and (a) will cause violation. |
| Answer» E. | |
| 206. |
Which level of Abstraction describes what data are stored in the Database ? |
| A. | Physical level |
| B. | View level |
| C. | Abstraction level |
| D. | Logical level |
| Answer» E. | |
| 207. |
A superkey for an entity consists of: |
| A. | one attribute only |
| B. | at least two attributes |
| C. | at most two attributes |
| D. | one or more attributes |
| Answer» E. | |
| 208. |
The “PROJECT” operator of a relational algebra creates a new table that has always |
| A. | More columns than columns in original table |
| B. | More rows than original table |
| C. | Same number of rows as the original table |
| D. | Same number of columns as the original table |
| Answer» D. Same number of columns as the original table | |
| 209. |
Which normal form is considered as adequate for usual database design? |
| A. | 2NF |
| B. | 3NF |
| C. | 4NF |
| D. | 5NF |
| Answer» C. 4NF | |
| 210. |
Immediate updates as a recovery protocol is preferable, when: |
| A. | Database reads more than writes |
| B. | Writes are more than reads |
| C. | It does not matter as it is good in both the situations |
| D. | There are only writes |
| Answer» C. It does not matter as it is good in both the situations | |
| 211. |
The SQL ExpressionSelect distinct T. branch name from branch T, branch S where T. assets > S. assets and S. branch-city = DELHI,finds the name of |
| A. | all branches that have greater asset than any branch located in DELHI. |
| B. | all branches that have greater assets than allocated in DELHI. |
| C. | the branch that has the greatest asset in DELHI. |
| D. | any branch that has greater asset than any branch located in DELHI. |
| Answer» B. all branches that have greater assets than allocated in DELHI. | |
| 212. |
Manager's salary details are to be hidden from Employee Table. This Technique is called as |
| A. | Conceptual level Datahiding |
| B. | Physical level Datahiding |
| C. | External level Datahiding |
| D. | Logical level Datahiding |
| Answer» D. Logical level Datahiding | |
| 213. |
The completeness constraint has rules: |
| A. | Supertype, Subtype |
| B. | Total specialization, Partial specialization |
| C. | Specialization, Generalization |
| D. | All of the above |
| Answer» C. Specialization, Generalization | |
| 214. |
Consider the following schemas :Branch_Schema = (branch_name, assets, city)Customer_Schema = (cutstomer_name, street, city)Deposit_Schema = (branch_name, account_number, customer_name, balance)Borrow_Schema = (branch_name, loan_number, customer_name, amount)Which of the following tuple relational calculus finds all customers who have loan amount more than Rs 12,000 ? |
| A. | {t(customer_name) | t∈borrow[?] t[amount]>12000} |
| B. | {t |t(customer_name) | t∈borrow[?] t[amount]>12000} |
| C. | {t |[?] ∈ borrow (t(customer_name=s(customer_ name))[?] [amount]>12000} |
| D. | {t |[?] ∈ borrow (t(customer_name)[?] s[amount] >12000} |
| Answer» D. {t |[?] ∈ borrow (t(customer_name)[?] s[amount] >12000} | |
| 215. |
A relation R = {A, B, C, D, E, F} is given with following set of functional dependencies:F = {A→B, AD→C, B→F, A→E}Which of the following is candidate key ? |
| A. | A |
| B. | AC |
| C. | AD |
| D. | None of these |
| Answer» D. None of these | |
| 216. |
Data warehouse contains ............... data that is never found in operational environment. |
| A. | Summary |
| B. | Encoded |
| C. | Encrypted |
| D. | Scripted |
| Answer» B. Encoded | |
| 217. |
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that: |
| A. | R1∩R2→R1 is in F+ |
| B. | R1∩R2→R2 is in F+ |
| C. | both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+ |
| D. | at least one from R1∩R2→R1 and R1∩R2→R2 is in F+ |
| Answer» E. | |
| 218. |
What is Granularity ? |
| A. | The size of database |
| B. | The size of data item |
| C. | The size of record |
| D. | The size of file |
| Answer» C. The size of record | |
| 219. |
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form? |
| A. | - 42 |
| B. | - 22 |
| C. | - 21 |
| D. | - 106 |
| Answer» C. - 21 | |
| 220. |
The absorption law in Boolean algebra say that |
| A. | X + X = X |
| B. | X . X = X |
| C. | x + x . y = x |
| D. | None of the above |
| Answer» D. None of the above | |
| 221. |
The function represented by the kmap given below is |
| A. | A.B |
| B. | AB+BC+CA |
| C. | A.B.C |
| D. | None of the above |
| Answer» E. | |
| 222. |
A Boolean operator Ө is defined as follows:1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? |
| A. | Always false |
| B. | Always true |
| C. | Sometimes true |
| D. | True when x, y, z are all true |
| Answer» C. Sometimes true | |
| 223. |
Simplified Boolean equation for the following truth table is: |
| A. | F = yz’ + y’z |
| B. | F = xy’ + x’y |
| C. | F = x’z + xz’ |
| D. | F = x’z + xz’ + xyz |
| Answer» D. F = x’z + xz’ + xyz | |
| 224. |
The answer of the operation (10111)2 * (1110)2 in hex equivalence is |
| A. | 150 |
| B. | 241 |
| C. | 142 |
| D. | 101011110 |
| Answer» D. 101011110 | |
| 225. |
If an integer needs two bytes of storage, then the maximum value of a signed integer is |
| A. | 216 – 1 |
| B. | 215 – 1 |
| C. | 216 |
| D. | 215 |
| Answer» C. 216 | |
| 226. |
One of the main features that distinguish microprocessor from micro-computers is |
| A. | words are usually larger in microprocessors |
| B. | words are shorter in microprocessors |
| C. | microprocessor does not contain I/O devices |
| D. | None of the above |
| Answer» D. None of the above | |
| 227. |
The Excess-3 decimal code is a self-complementing code because |
| A. | The binary sum of a code and its 9's complement is equal to 9 |
| B. | It is a weighted code |
| C. | Complement can be generated by inverting each bit pattern |
| D. | The binary sum of a code and its 10's complement is equal to 9 |
| Answer» D. The binary sum of a code and its 10's complement is equal to 9 | |
| 228. |
A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of |
| A. | 3m bits |
| B. | m + n bits |
| C. | 3m + n bits |
| D. | 3m + n + 30 bits |
| Answer» E. | |
| 229. |
Which of the following logic operations is performed by the following given combinational circuit ? |
| A. | EXCLUSIVE-OR |
| B. | EXCLUSIVE-NOR |
| C. | NAND |
| D. | NOR |
| Answer» B. EXCLUSIVE-NOR | |
| 230. |
Which of the following is the most efficient to perform arithmetic operations on the numbers? |
| A. | Sign-magnitude |
| B. | 1’s complement |
| C. | 2’s complement |
| D. | 9’s complement |
| Answer» D. 9’s complement | |
| 231. |
The Karnaugh map for a Boolean function is given below. The simplified Boolean equation for this above Karnaugh Map is |
| A. | AB + CD + AB’ + AD |
| B. | AB + AC + AD + BCD |
| C. | AB + AD + BC + ACD |
| D. | AB + AC + BC + BCD |
| Answer» C. AB + AD + BC + ACD | |
| 232. |
The Boolean expression x’y’z+yz+xz is equivalent to: |
| A. | x |
| B. | y |
| C. | z |
| D. | x+y+z |
| Answer» D. x+y+z | |
| 233. |
ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into __________. |
| A. | Race condition |
| B. | Saturation |
| C. | Delay |
| D. | High impedance |
| Answer» C. Delay | |
| 234. |
If an integer needs two bytes of storage, then the maximum value of unsigned integer is |
| A. | 2^16 – 1 |
| B. | 2^15 – 1 |
| C. | 2^16 |
| D. | 2^15 |
| Answer» B. 2^15 – 1 | |
| 235. |
The simplified form of the Boolean expression (X+Y+XY)(X+Z) is |
| A. | X + Y + ZX + Y |
| B. | XY – YZ |
| C. | X + YZ |
| D. | XZ + Y |
| Answer» D. XZ + Y | |
| 236. |
The Simplified form of a Boolean equation (AB'+AB'C+Ac)(A'C' +B') is |
| A. | AB' |
| B. | AB'C |
| C. | A'B |
| D. | ABC |
| Answer» B. AB'C | |
| 237. |
The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ................. and ................ respectively. |
| A. | 8 bits and 16 bits |
| B. | 16 bits and 32 bits |
| C. | 32 bits and 64 bits |
| D. | 64 bits and 128 bits |
| Answer» D. 64 bits and 128 bits | |
| 238. |
The octal number 326.4 is equivalent to |
| A. | (214.2)10 and (D6.8)16 |
| B. | (212.5)10 and (D6.8)16 |
| C. | (214.5)10 and (D6.8)16 |
| D. | (214.5)10 and (D6.4)16 |
| Answer» D. (214.5)10 and (D6.4)16 | |
| 239. |
What is decimal equivalent of BCD 11011.1100? |
| A. | 22.0 |
| B. | 22.2 |
| C. | 20.2 |
| D. | 21.2 |
| Answer» C. 20.2 | |
| 240. |
The Boolean function [~ (~p˄q)˄~(~p˄~q)]˅(p˄r) is equal to the Boolean function: |
| A. | q |
| B. | p˄r |
| C. | p˅q |
| D. | p |
| Answer» E. | |
| 241. |
How many 1’s are present in the binary representation of3 × 512 + 7 × 64 + 5 × 8 + 3 |
| A. | 8 |
| B. | 9 |
| C. | 10 |
| D. | 11 |
| Answer» C. 10 | |
| 242. |
Match the following identities/laws to their corresponding name:(a) x + x = xx • x = x i. Dominance(b) x + 0 = xx • 1 = x ii. Absorption(c) x + 1 = 1x • 0 = 0 iii. Idempotent(d) x • (x + y) = x iv. IdentityCodes: (a) (b) (c) (d) |
| A. | iii iv i ii |
| B. | iv iii i ii |
| C. | iv iii ii i |
| D. | iii iv ii i |
| Answer» B. iv iii i ii | |
| 243. |
Which of the following 2 input Boolean logic functions is linearly inseparable?(a) AND (b) OR(c) NOR (d) XOR(e) NOT XOR |
| A. | (a) and (b) |
| B. | (b) and (c) |
| C. | (c), (d) and (e) |
| D. | (d) and (e) |
| Answer» E. | |
| 244. |
Match the following:List – I List – IIa. Controlled Inverter i. a circuit that can add 3 bitsb. Full adder ii. a circuit that can add two binary numbersc. Half adder iii. a circuit that transmits a binary word or its 1’s complementd. Binary adder iv. a logic circuit that adds 2 bitsCodes : a b c d |
| A. | iii ii iv i |
| B. | ii iv i iii |
| C. | iii iv i ii |
| D. | iii i iv ii |
| Answer» E. | |
| 245. |
X – = Y + 1 means |
| A. | X = X – Y + 1 |
| B. | X = –X – Y – 1 |
| C. | X = –X + Y + 1 |
| Answer» B. X = –X – Y – 1 | |
| 246. |
The hexadecimal equivalent of the octal number 2357 is: |
| A. | 2EE |
| B. | 2FF |
| C. | 4EF |
| D. | 4FE |
| Answer» D. 4FE | |
| 247. |
How many different Boolean functions of degree 4 are there? |
| A. | 2^4 |
| B. | 2^8 |
| C. | 2^12 |
| D. | 2^16 |
| Answer» E. | |
| 248. |
Convert the octal number 0.4051 into its equivalent decimal number. |
| A. | 0.5100098 |
| B. | 0.2096 |
| C. | 0.52 |
| D. | 0.4192 |
| Answer» B. 0.2096 | |
| 249. |
The three outputs x1x2x3 from the 8x3 priority encoder are used to provide a vector address of the form 101x1x2x300. What is the second highest priority vector address in hexadecimal if the vector addresses are starting from the one with the highest priority? |
| A. | BC |
| B. | A4 |
| C. | BD |
| D. | AC |
| Answer» C. BD | |
| 250. |
What will be the output of the following logic diagram? |
| A. | x OR y |
| B. | x AND y |
| C. | x NOR y |
| D. | x XNOR y |
| Answer» D. x XNOR y | |