MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 49 Mcqs, each offering curated multiple-choice questions to sharpen your Aspiring Minds knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Input/output function prototypes and macros are defined in which header file? |
| A. | conio.h |
| B. | stdlib.h |
| C. | stdio.h |
| D. | dos.h |
| Answer» D. dos.h | |
| 2. |
Which table shows the electrical state of a digital circuit's output for every possible combination of electrical states in the inputs ? |
| A. | Function table |
| B. | Truth table |
| C. | Routing table |
| D. | ASCII table |
| Answer» B. Truth table | |
| 3. |
A toggle operation cannot be performed using a single |
| A. | NOR gate |
| B. | AND gate |
| C. | NAND gate |
| D. | XOR gate |
| Answer» C. NAND gate | |
| 4. |
How many lines the truth table for a four-input NOR gate would contain to cover all possible input combinations ? |
| A. | 4 |
| B. | 8 |
| C. | 12 |
| D. | 16 |
| Answer» E. | |
| 5. |
The output of NOR gate is |
| A. | High if all of its inputs are high |
| B. | Low if all of its inputs are low |
| C. | High if all of its inputs are low |
| D. | High if only of its inputs is low |
| Answer» D. High if only of its inputs is low | |
| 6. |
The digital multiplexer is basically a combination logic circuit to perform the operation |
| A. | AND-AND |
| B. | OR-OR |
| C. | AND-OR |
| D. | OR-AND |
| Answer» D. OR-AND | |
| 7. |
Parallel adders are |
| A. | combinational logic circuits |
| B. | sequential logic circuits |
| C. | both (a) and (b) |
| D. | None of these |
| Answer» B. sequential logic circuits | |
| 8. |
Which combination of gates does not allow the implementation of an arbitrary boolean function? |
| A. | OR gates and AND gates only |
| B. | OR gates and exclusive OR gate only |
| C. | OR gates and NOT gates only |
| D. | NAND gates only |
| Answer» B. OR gates and exclusive OR gate only | |
| 9. |
An OR gate can be imagined as |
| A. | Switches connected in series |
| B. | Switches connected in parallel |
| C. | MOS transistors connected in series |
| D. | None of these |
| Answer» C. MOS transistors connected in series | |
| 10. |
A demultiplexer is used to |
| A. | Route the data from single input to one of many outputs |
| B. | Perform serial to parallel conversion |
| C. | Both (a) & (b) |
| D. | Select data from several inputs and route it to single output |
| Answer» D. Select data from several inputs and route it to single output | |
| 11. |
Which of the following gates are added to the inputs of the OR gate to convert it to the NAND gate ? |
| A. | NOT |
| B. | AND |
| C. | OR |
| D. | XOR |
| Answer» B. AND | |
| 12. |
Which of the following expressions is not equivalent to X ' ? |
| A. | X NAND X |
| B. | X NOR X |
| C. | X NAND 1 |
| D. | X NOR 1 |
| Answer» E. | |
| 13. |
Which of the following statements is wrong ? |
| A. | Propagation delay is the time required for a gate to change its state |
| B. | Noise immunity is the amount of noise which can be applied to the input of a gate without causing the gate to change state |
| C. | Fan-in of a gate is always equal to fan-out of the same gate |
| D. | Operating speed is the maximum frequency at which digital data can be applied to a gate |
| Answer» D. Operating speed is the maximum frequency at which digital data can be applied to a gate | |
| 14. |
Which of the following gates would output 1 when one input is 1 and other input is 0 ? |
| A. | OR gate |
| B. | AND gate |
| C. | NAND gate |
| D. | both (a) and (c) |
| Answer» E. | |
| 15. |
What is the minimum number of two-input NAND gates used to perform the function of two input OR gate ? |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» D. four | |
| 16. |
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then |
| A. | deadlock can never occur |
| B. | deadlock may occur |
| C. | deadlock has to occur |
| D. | none of these |
| Answer» B. deadlock may occur | |
| 17. |
The methods for dealing with the deadlock problem is |
| A. | Use a protocol to make sure that the system never enters in to the deadlock state. |
| B. | Allow the system to enter a deadlock state and then recover. |
| C. | Ignore the problem, and pretend that deadlocks never occur in the system. The UNIX operating system uses this solution. |
| D. | all of these |
| Answer» E. | |
| 18. |
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is |
| A. | 11 |
| B. | 12 |
| C. | 13 |
| D. | 14 |
| Answer» B. 12 | |
| 19. |
'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up |
| A. | deadlock can never occur |
| B. | deadlock may occur |
| C. | deadlock has to occur |
| D. | none of these |
| Answer» B. deadlock may occur | |
| 20. |
A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 1 |
| Answer» D. 1 | |
| 21. |
A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then |
| A. | deadlocked state is unsafe |
| B. | unsafe state may lead to a deadlock situation |
| C. | deadlocked state is a subset of unsafe state |
| D. | all of these |
| Answer» E. | |
| 22. |
The mix of investments in IS applications developed to support basic business functions is |
| A. | business systems planning |
| B. | critical success factors |
| C. | applications |
| D. | information technology architecture |
| Answer» C. applications | |
| 23. |
A comprehensive business process driven methology for information systems planning is |
| A. | business systems planning |
| B. | critical success factors |
| C. | application portfolio |
| D. | information technology architecture |
| Answer» B. critical success factors | |
| 24. |
AI systems that use neuron structures to, recognize patterns in data, is |
| A. | neural network |
| B. | fuzzy logic |
| C. | intelligent agent |
| D. | genetic algorithms |
| Answer» B. fuzzy logic | |
| 25. |
Which one of the following can either buy a completely developed expert system package, develop one with an expert system shell, or develop one from scratch by custom programming? |
| A. | knowledge engineer |
| B. | system development |
| C. | expert system shell |
| D. | inference engine |
| Answer» C. expert system shell | |
| 26. |
The systems which can preserve and reproduce the knowledge of experts but have a limited application focus, is |
| A. | expert system |
| B. | applications |
| C. | benefits and limitations |
| D. | knoweldge base |
| Answer» D. knoweldge base | |
| 27. |
A knowledge-based information system that acts as an expert consultant to users in a specific application area, select one answer, |
| A. | expert system |
| B. | applications |
| C. | benefits and limitations |
| D. | knowledge base |
| Answer» B. applications | |
| 28. |
At the time of system study, flow of charts are drawn using |
| A. | non standard symbols |
| B. | general symbols |
| C. | abbreviated symbols |
| D. | specific symbols |
| Answer» C. abbreviated symbols | |
| 29. |
The first step of the implementation phase is |
| A. | select the computer |
| B. | announce the implementation project |
| C. | implementation planning |
| D. | prepare physical facilities |
| Answer» D. prepare physical facilities | |
| 30. |
System implementation phase entails |
| A. | system checkouts |
| B. | pilot run |
| C. | parallel runs |
| D. | all of these |
| Answer» B. pilot run | |
| 31. |
The relational model feature is that there |
| A. | Is no need for primary key data |
| B. | Is much more data independence than some other database models |
| C. | Are explicit relationships among records |
| D. | Are tables with many dimensions |
| Answer» C. Are explicit relationships among records | |
| 32. |
The property / properties of a database is / are : |
| A. | It is an integrated collection of logically related records. |
| B. | It consolidates separate files into a common pool of data records. |
| C. | Data stored in a database is independent of the application programs using it |
| D. | All of the above |
| Answer» E. | |
| 33. |
A report generator is used to |
| A. | Update files. |
| B. | Print files on paper |
| C. | Data entry. |
| D. | Delete files. |
| Answer» C. Data entry. | |
| 34. |
The way a particular application views the data from the database that the application uses is a |
| A. | Module. |
| B. | Relational model. |
| C. | Schema. |
| D. | Sub schema. |
| Answer» E. | |
| 35. |
The database environment has all of the following components except: |
| A. | Users. |
| B. | Separate files |
| C. | Database. |
| D. | Database administrator |
| Answer» C. Database. | |
| 36. |
A logical schema |
| A. | Is the entire database. |
| B. | describe data in terms of relational tables and columns, object-oriented classes, and XML tags. |
| C. | Describes how data is actually stored on disk. |
| D. | Both (A) and (C) |
| Answer» B. describe data in terms of relational tables and columns, object-oriented classes, and XML tags. | |
| 37. |
In tuple relational calculus P1 → P2 is equivalent to |
| A. | ¬ P1 ∨ P2 |
| B. | P1 ∨ P2 |
| C. | P1 ∧ P2 |
| D. | P1 ∧ ¬P2 |
| Answer» B. P1 ∨ P2 | |
| 38. |
Choose the correct statements |
| A. | All The elements of the array should be of the same data type and storage class |
| B. | The number of subscripts determines the dimension of the array |
| C. | The array elements need not be of the same storage class |
| D. | In an array definition. the subscript can be any expression yielding a non-zero integer value |
| Answer» C. The array elements need not be of the same storage class | |
| 39. |
The const feature can be applied to |
| A. | an identifier |
| B. | an array |
| C. | an array argument |
| D. | All of these |
| Answer» E. | |
| 40. |
The minmum number of inter changes needed to convert the array 89,19,40,17,12,10,2,5,7,11,6,9,70 into a heap with maximum element at the root is |
| A. | 1 |
| B. | 2 |
| C. | 4 |
| D. | None of these |
| Answer» C. 4 | |
| 41. |
In which of the following cases, linked list implementation of sparse matrices consumes the same memory space as the conventional way of storing the entire array? |
| A. | 5x6 matrix with 9 non-zero entries |
| B. | 5x6 matrix with 10 non-zero entries |
| C. | Efficient in accesing an entry |
| D. | Efficient if the sparse matrix is a band matrix |
| Answer» D. Efficient if the sparse matrix is a band matrix | |
| 42. |
The information about an array used in a program will be sorted in |
| A. | Symbol table |
| B. | Activation record |
| C. | Both (a) and (b) |
| D. | Dope vector |
| Answer» E. | |
| 43. |
Minimun number of comparison required to compute the largest and second largest element in array is |
| A. | n-[log₂n]-2 |
| B. | n+[log₂n-2] |
| C. | log₂n |
| D. | None of these |
| Answer» C. log₂n | |
| 44. |
Which of the following is an illegal array definition? |
| A. | Type COLOGNE:(LIME,PINE,MUSK,MENTHOL); var a:array[COLOGNE]of REAL; |
| B. | var a:array[REAL]of REAL; |
| C. | var a:array[A..Z]of REAL; |
| D. | var a:array[BOOLEAN]of REAL; |
| Answer» C. var a:array[A..Z]of REAL; | |
| 45. |
Minimum number of interchange needed to convert the array 89,19,40,14,17,12,10,2,5,7,11,6,9,70, into a heap with the maximum element at the root is |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 46. |
A one dimensional array A has indices 1....75.Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is |
| A. | 1167 |
| B. | 1164 |
| C. | 1264 |
| D. | 1169 |
| Answer» D. 1169 | |
| 47. |
Size of the array need not be specified, when |
| A. | Initialization is a part of definition |
| B. | It is a declaratrion |
| C. | It is a formal parameter |
| D. | All of these |
| Answer» B. It is a declaratrion | |
| 48. |
If S is an array of 80 characters, then the value assigned to S through the statement scanf("%s",S) with input 12345 would be |
| A. | "12345" |
| B. | nothing since 12345 is an integer |
| C. | S is an illegal name for string |
| D. | %s cannot be used for reading in values of S |
| Answer» B. nothing since 12345 is an integer | |
| 49. |
If x is an array of interger, then the value of &x[i] is same as |
| A. | &x[i-1] + sizeof (int) |
| B. | x + sizeof (int) * i |
| C. | x+i |
| D. | none of these |
| Answer» B. x + sizeof (int) * i | |