Computer Literacy
18 previous year questions.
High-Yield Trend
Chapter Questions 18 MCQs
List I (Functional Blocks/Units) | List II (Related Units/Parameters) | ||
|---|---|---|---|
| A | Arithmetic logic unit (ALU) | I | Memory read/write |
| B | Instruction register | II | Memory address |
| C | Control unit | III | Opcode |
| D | Program counter | IV | Accumulator |
B. There are four types of rotations to balance the AVL trees.
C. Four types of traversals are possible on tree data structure
D. The smallest elements in binary search is the right most element.
E. The time complexity of binary sort algorithm is O (logn)
choose the correct answer from the options given below:
| List I | List II | ||
| A | I | ω(n) | |
| B | II | 0(2n) | |
| C | III | ω(2n) | |
| D | IV | 0(2n) |
A. Predicate Logic
B. Propositional Logic
C. Compound Logic
D. Machine Logic
Choose the correct answer from the options given below
(i) Only load and store instructions can have memory operands and
(ii) Arithmetic instructions can have only register or immediate operands. The value of x is______.
About Computer Literacy - CUET-PG
Computer Literacy is a vital chapter for CUET-PG aspirants. Mastering the concepts covered in this chapter is essential for securing a top rank.
By rigorously practicing the previous year questions associated with this chapter, you can identify high-yield topics, understand the examiner's perspective, and boost your confidence during the actual exam.
Frequently Asked Questions
Why focus on Computer Literacy PYQs?
Analyzing PYQs for this specific chapter reveals the most frequently tested concepts and the typical complexity of questions, allowing you to tailor your study plan efficiently.
How to best use this analysis?
Review the topic breakdown to see which sub-topics within Computer Literacy carry the most weight. Then, tackle the questions iteratively to solidify your understanding.