UGC NET Paper 2 Computer Science – June 2024 (Re-Exam) – Question Paper with Answer Key

Which of the following statements about pointers in C are TRUE.

(A) Pointers can be used to access array elements

(B) Pointers can store the address of another pointer

(C) Pointers are automatically deferenced in expression

(D) Pointers cannot be used to access structure members

Cal(a, b) {
  if (b != 1) {
    if (a != 1) {
      printf("*");
      Cal(a/2, b);
    }
    else {
      b = b - 1;
      Cal(10, b);
    }
  }
}

Consider the following relations on {1, 2, 3, 4}. Which of them are reflexive? (A) R₁ = {(1,1), (1,2), (2,1), (2,2), (3,4), (4,1), (4,4)} (B) R₂ = {(1,1), (1,2), (2,1)} (C) R₃ = {(1,1), (1,2), (1,4), (2,1), (2,2), (3,3), (4,1), (4,4)} (D) R₄ = {(2,1), (3,1), (3,2), (4,1), (4,2), (4,3)} (E) R₅ = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,3), (2,4), (3,3), (3,4), (4,4)}

Arrange the following steps of Feature Drive Development (FDD) process in the correct sequence :

(A) Develop an overall model

(B) Build by feature

(C) Plan by feature

(D) Design by feature

(E) Build a feature list

Consider the number (45)ᵧ, where y is the base. Some possible values of y are: (A) 5 (B) 6 (C) 7 (D) 8

#include<stdio.h>
int main() {
  int x[] = {2,4,6,8,10};
  int a, b = 0, *y = x + 4;
  for (a = 0; a < 5; a++) {
    b = b + (*y - a) - *(y - a);
  }
  printf("%d\n", b);
  return 0;
}

Match List - I with List - II.

Match List - I with List - II.

Which of the following are Agile Process Models ?

(A) Extreme Programming (XP)

(B) Waterfall

(C) Scrum

(D) Spiral

(E) Incremental

Consider the Grammar:

T → Qx

Q → RS

R → y ∣ ϵ

S → z ∣ ϵ Here x, y, z are terminals and T, Q, R, S are non- terminals. What will be the follow set of the non-terminal R?

Host A (on TCP/IPv4 Networks) send an IP Datagram D to host B (also on TCP/IPv4 network). Assume that no error occured during transmission of D, when D reaches B. Which of following header field may differ from that of original datagram D ?

(A) TTL

(B) Checksum

(C) Fragment offset

(D) Source IP

(E) Destination IP

Arrange the following phases of the Agile process in the correct sequence :

(A) Design

(B) Release

(C) Testing

(D) Development

(E) Planning

Which of the following are TRUE about constructors in C++ ?

(A) A constructor can be overloaded.

(B) A constructor does not have a return type.

(C) A constructor must be declared as a friend function.

(D) A constructor is called when an object is destroyed.

Let P be "It is hot day" and q be "The temperature is 48°C". Write in simple sentences the meaning of ¬p∧¬q.

Arrange the following steps in proper sequence involved in a Genetic Algorithm :

(A) Selection

(B) Initialization

(C) Crossover

(D) Mutation

(E) Evaluation

#include<stdio.h>
void f1(char *x, char *y) {
char *t1;
t1 = x;
x = y;
y = t1;
}
void f2(char **x, char **y) {
char *t1;
t1 = *x;
*x = *y;
*y = t1;
}
int main() {
char *a = "ONE", *b = "TWO";
f1(a, b);
printf("%s %s ", a, b);
f2(&a, &b);
printf("%s %s", a, b);
return 0;
}

Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T(n) = 3T(n/3) + n (D) T(n) = 2T(n/2) + √n (E) T(n) = T(n−1) + 1

Match List - I with List - II.

Find the correct sequence of the storage devices in descending order based on their access time.

(A) Registers

(B) Magnetic Disk

(C) Magnetic Tapes

(D) Main memory

(E) Optical Disk

A graph G with number of vertices greater and equal than three i.e. (n ≥ 3) is a Hamiltonian graph, if the degree of each vertex is greater and equal to . . . .

Consider transactions T1: r1(x); r1(z); w1(z) T2: r2(y); r2(z); w2(z) T3: r3(y); r3(x); w3(y), and schedules S1: r1(x); r3(y); r3(x); r2(y); r2(z); w3(y); w2(z); r1(z); w1(x); w1(z) and S2: r1(x); r3(y); r2(y); r3(x); r1(z); r2(z); w3(y); w1(x); w2(z); w1(z). Which statement is TRUE?

Match List - I with List - II.

Arrange the following steps in a proper sequence for the process of training a neural network.

(A) Weight initialization

(B) Feed forward

(C) Back Propagation

(D) Loss Calculation

(E) Weight Update

Consider the following statements regarding combinational and sequential circuits.

(A) Output of combinational circuits depends on the only current input.

(B) Output of combinational circuit depends on the both current input and previous output.

(C) Output of sequential circuit depends on the current input.

(D) Output of sequential circuit depends on both current input and previous output.

#include<iostream.h>
using namespace std;
void swap(int &x, int &y)
{
int temp=x;
x=y;
y=temp;
}
int main()
{
int a=5, b=10;
swap(a,b);
swap(a,b);
cout<<a<<" "<<b;
return 0;
}

What will be the output of the above code?

Which of the following are typical activities in the software process lifecycle?

(A) Requirement Analysis

(B) System Design

(C) Code Refactoring

(D) Deployment

(E) Substructure

A coin is tossed successively three times. Find the Probability (P), Event (E), Sample space (S) of getting exactly one head or two heads, where n is number of occurrence.

(A) n(S) = 8 and n(E) = 4

(B) n(E) = 6 and n(S) = 8

(C) P(E) = 3/4

(D) P(E) = 1/2

If p and q are two statements, which of the following equivalences hold? (A) ~(p ∧ q) ≡ ~p ∨ ~q (B) ~(p ∨ q) ≡ ~p ∧ ~q (C) p ∧ ~p ≡ T (D) ~(p ⇒ q) ≡ p ∧ ~q (E) p ∨ q ≡ ~p ∨ ~q

#include<iostream>
using namespace std;
class Base {
public:
  Base() { cout << "Base Const"; }
  virtual ~Base() { cout << "Base dest"; }
};
class Derived : public Base {
public:
  Derived() { cout << "Derived Const"; }
  ~Derived() { cout << "Derived dest"; }
};
int main() {
  Base *b = new Derived();
  delete b;
  return 0;
}

#include<stdio.h>
int temp = 0;
int fun(int x, int y) {
  int z; temp++;
  if (y == 3) return (x*x*x);
  else {
    z = fun(x, y/3);
    return (z*z*z);
  }
}
int main() {
  fun(4, 81);
  printf("%d", temp);
}

Which of the following tasks could be attained using syntax trees in compiler design ?

(A) Type Checking

(B) Code Generation

(C) Code Optimization

(D) Error Handling

Match List - I with List - II.

Match List - I with List - II.

Arrange the following steps of file handling in C in the correct order :

(A) Close the file

(B) Read from or write to the file

(C) Open the file

(D) Check for error

Match List - I with List - II.

(D) Priority Scheduling (IV) Select the process for execution with smallest next Burst time.

Arrange the following steps in a proper sequence for the typical process of a DNS query :

(A) Query authoritative DNS Server

(B) Query local DNS Server

(C) Local DNS Server Check Cache

(D) Query root DNS Server

(E) Query TLD DNS Server

Match List - I with List - II.

Select the Sorting Algorithms that are stable.

(A) Quick Sort

(B) Bubble Sort

(C) Insertion Sort

(D) Merge Sort

(E) Shell Sort

#include<stdio.h>
void main() {
  int arr[5] = {10,20,30,40,50};
  int *p = (int*)(&arr + 1);
  printf("%d %d", *(arr+1), *(p-1));
}

Match List - I with List - II.

Arrange the following phases of database design in the correct order :

(A) Physical Design

(B) Conceptual Design

(C) Logical Design

(D) Requirement Analysis

Consider the three way hand shaking process followed during TCP connection establishment between two hosts A and B . Let S and R be two random 32 -bit starting sequence numbers chosen by A and B, respectively. Suppose A sends a TCP segment having SYN bit =1, SEQ number = S and ACK bit =0 and B accepts the connection request. Which one of the following choices represents the information present in the TCP segment header that is sent by B to A ?

Two computers A and B are configured as follows : A has IP address 203.197.2.53 and subnet mask 255.255.128.0, B has IP address 203.197.75.201 and subnet mask 255.255.192.0. What one of the following statement is true?

Arrange the following stages of parsing in the correct order as they typically occur in the compilation process.

(A) Lexical Analysis

(B) Sematic Analysis

(C) Syntax Analysis

(D) Intermediate Code Generation

(E) Code Optimization

Match List - I with List - II.

List - I (Queries) List - II (Probability)

(A) A bag contains 6 (I) 3 / 68 white and 4 red balls. Two balls are drawn at random. What is the chance they will the same color?

Match List - I with List - II.

(D) Expert system (IV) A machine learning technique that finds the hyper plane that best separates different class in a feature space.

Match List - I with List - II.

#include<stdio.h>
void main()
{
int arr[ ] = {1, 2, 3, 4, 5};
int *p = arr;
printf("%d", *p++);
printf("%d", *(p+1));
}

Find the output of the above code?

Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hierarchy:

(A) Context-free languages

(B) Context-sensitive languages

(C) Regular languages

(D) Unrestricted Grammars

Match List - I with List - II.

Arrange the given steps required for a Direct Memory Access (DMA) transfer in the correct order.

(A) Initiate DMA transfer request

(B) Transfer data directly between peripheral and memory

(C) Processor grants DMA control over the system bus

(D) DMA controller completes data transfer and signals completion

Match List I (recurrence) with List II (complexity). List I: (A) T(n) = 2T(n/2) + n, (B) T(n) = T(n/2) + 1, (C) T(n) = 2T(n/2) + 1, (D) T(n) = T(n−1) + n. List II: (I) T(n) = Θ(n log n) (exact), (II) O(n²), (III) T(n) = Θ(n) (exact), (IV) O(n).

Translate into English: ∀x ∃y (x < y), where the domain of both variables is the real numbers.

Which of the following is a context-free language? (A) {wⁱ xʲ yᵏ zˡ | i + k = j + l, i, j, k, l ≥ 0} (B) {wⁱ xʲ yᵏ zˡ | i = j, k = l} (C) {wⁱ xʲ yᵏ zˡ | i = j = k and k ≠ l} (D) {wⁱ xʲ yᵏ zˡ | i = j = k + l} (E) {wⁱ xʲ yᵏ zˡ | i = j = l and k ≠ l}

What is the role of Back Propagation Algorithm?

Which of the following is/are the application area(s) of ANN ?

(A) Natural Language Processing

(B) Image Processing

(C) Pattern Recognition

(D) Speech Recognition

Artificial Neural Networks (ANNs) are inspired by :

Which of the following layers may be more than one in number ?

What is the significance of the Banker's algorithm in terms of resource management?