UGC NET Computer Science Computer Previous Year Questions (PYQs) – Page 3 of 9
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Arrange the process of virtualization in cloud environments.
A. Hypervisor installed on physical server
B. Virtual machines created
C. Resources allocated to Virtual machines
D. Virtual machines run isolated workloads
1
2
3
4
Solution
Step 1 – Install hypervisor on the physical server.
Step 2 – Create virtual machines.
Step 3 – Allocate resources (CPU, RAM, etc.) to each VM.
Step 4 – VMs run isolated workloads.
Considering the following statements:
A. Data transformation is involved in Data mining process.
B. Online database is used in Data warehouse.
C. Classification is a measure of accuracy.
D. K-means clustering algorithm is based on the concept of minimizing the within-cluster variance.
E. Pattern evaluation is a process to identify knowledge based on interestingness measure.
1
2
3
4
Solution
B – True: Data warehouses are used for online analytical processing (OLAP).
D – True: K-means minimizes within-cluster sum of squares (variance).
E – True: Pattern evaluation identifies useful patterns using interestingness measures.
A – Data transformation happens before mining (in preprocessing).
C – Classification is a process, not a measure of accuracy.
Match List I with List II
| List I (Operations on Fuzzy Sets) | List II (Description) |
|---|---|
| A. Intersection | IV. $\min(\mu_A(x), \mu_B(x))$ |
| B. Bounded Sum | III. $\min(1, \mu_A(x) + \mu_B(x))$ |
| C. Bounded Difference | II. $\max(0, \mu_A(x) - \mu_B(x))$ |
| D. Algebraic Sum | I. $\mu_A(x) + \mu_B(x) - \mu_A(x)\mu_B(x)$ |
Choose the correct answer from the options given below:
1
2
3
4
Solution
Explanation:
- A → IV → Intersection → $\min(\mu_A(x), \mu_B(x))$
- B → III → Bounded Sum → $\min(1, \mu_A(x) + \mu_B(x))$
- C → II → Bounded Difference → $\max(0, \mu_A(x) - \mu_B(x))$
- D → I → Algebraic Sum → $\mu_A(x) + \mu_B(x) - \mu_A(x)\mu_B(x)$
The write operation in I/O operation does the following -
1
2
3
4
Solution
In an I/O write operation, data is transferred from memory to an I/O device (for example, when the CPU sends output to a printer or display).
In contrast, an I/O read operation transfers data from I/O device to memory.
| List I | List II |
|---|---|
| A. Circular Queue | III. Dijkstra algorithm |
| B. Priority Queue | II. CPU Scheduling |
| C. Double Ended Queue | I. Print Queue |
| D. Simple Queue | IV. Palindrome checking |
Choose the correct answer from the options given below:
1
2
3
4
Solution
| List I (RAID Levels) | List II (Description) |
|---|---|
| A. RAID Level 2 | IV. Also known as Memory style error correcting code organization |
| B. RAID Level 3 | III. Bit interleaved parity |
| C. RAID Level 5 | I. Block interleaved distribution parity |
| D. RAID Level 6 | II. Also known as P+Q redundancy scheme |
Choose the correct answer from the options given below:
1
2
3
4
Solution
A→III, B→IV, C→I, D→II
int i, j;
for(i = 1; i < 5; i += 2)
for(j = 1; j < i; j += 2)
printf("%d", j);
1
2
3
4
Solution
For i = 1, inner loop condition j < i → 1 < 1 → false → no output.
For i = 3, inner loop runs with j = 1, prints 1, then j = 3 → condition fails.
Hence, final output is 1.
The computer needs to process each instruction with the following sequence of steps:
A. Calculate the effective address
B. Fetch the instruction from memory
C. Decode the instruction
D. Fetch the operands from the memory
E. Execute the instruction
1
2
3
4
Solution
First fetch the instruction (B), then decode it (C). If required, compute the effective address (A), fetch the operands (D), and finally execute the instruction (E).
Consider the following DFA that generates set of strings over Σ = {a, b, c}.
Identify the best description of the language for the DFA.
1
2
3
4
Solution
The automaton has two “phases” connected by the path recognizing a→b→c. Each time the substring “abc” is seen, the DFA moves to the other phase, toggling parity. The start phase (no “abc” yet) is accepting (count 0), and after every additional “abc” the parity flips; therefore the accepting states correspond to an even number of occurrences of “abc”. Options 1 and 2 describe Σ* (all strings), and option 3 does not match the transitions.
Which of the following are examples of data encoding schemes?
A. Non-Return to Zero (NRZ)
B. Manchester Encoding
C. Amplitude Modulation
D. Hamming code
E. Bipolar AMI
1
2
3
4
Solution
NRZ, Manchester, and Bipolar AMI are line/data encoding schemes used on digital links.
Amplitude Modulation is a carrier modulation scheme (analog).
Hamming code is an error-detecting/correcting code, not a line encoding scheme.
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
