Aspire Faculty ID #15033 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
UGC NET Computer Science 26 June 2025 (Paper II)

List I List II
A. Overloading III. Supports compile-time polymorphism
B. Early Binding II. Since function call is resolved during compilation time, the execution is much faster
C. Overriding I. Since function call is resolved during run time, the execution is slow
D. Late Binding IV. Supports run-time polymorphism

Solution

  • Overloading → Compile-time polymorphism (III)
  • Early Binding → Done at compile time (II)
  • Overriding → Run-time binding; slower (I)
  • Late Binding → Supports run-time polymorphism (IV)

Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Nearest first
1
Which of the following algorithms use the Greedy strategy?A. Dijkstra’s algorithmB. Kruskal’s algorithmC. Huffman codin…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Consider the following statements regarding Agent systems:A. Agent system comprises of an agent and an environment on w…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Which of the following statements are TRUE about encryption techniques?A. In symmetric key cryptography, the secrecy/pr…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Only legal pointer operations:A. pointer + number → pointerB. pointer – number → numberC. pointer + pointer → pointerD.…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Consider the following steps used by a knowledge base designer to represent a world:A. Selects atoms to represent propo…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Which of the following cohesions are better than the Procedural Cohesion?A. Functional CohesionB. Sequential CohesionC.…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Which of the following is not a requirement elicitation technique?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
int x = 128, y = 110;do {    if (x > y) x = x - y;    else       y = y - x;}…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Match List I with List II List I (Grammar Type) List II (Production Form) A. Type 3 Grammar …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Which of the following gates do not give output 1 when both inputs are 0?A. NAND gateB. NOR gateC. XOR gateD. XNOR gate
Topic: UGC NET Computer Science 26 June 2025 (Paper II)

Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Ascending by ID
1
Consider T1(A,B,C,D,E) with FDs { EB→C, D→E, EA→B } and T2(A,B,C,D) with FDs { C→A, A→B, A→D }. Which is TRUE?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Once a process is executing on the CPU, which events could not occur?A. Issues an I/O request and then placed in the Re…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Let m and n be positive integers.(A) If n ≠ 1, then m < mn.(B) If k is composite, then k = mn where 1 < m, n >…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Right sequence of CPU program to input data:A. Read status registerB. Check flag bitC. Read data registerD. Transfer da…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Estimation of software development effort for organic software in basic COCOMO is:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Which of the following technique is used for Clipping?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Which of the followings shows the correct hierarchy of a layered file system in an operating system?A. Logical File Sys…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Choose the correct statement for a group G:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Considering the following statements:A. A non-serial schedule is said to be conflict-serializable, if it is conflict-eq…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Consider the following DFAWhich of the following NFA is valid for the given DFA?(a) (b) (c) 
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...