Skip to content

Category Archives: UGC-NET

In a ternary tree, the number of internal nodes of degree 1, 2 and 3 is 4, 3 and 3 respectively. The number of leaf… Read More
The relation​ ​ ≤ and < on a boolean algebra are defined as : x ≤ y and only if x ∨ y = y… Read More
Match List 1 with List 2 and choose the correct answer from the code given below. (A) (a)-(iv), (b)-(iii), (c) -(ii), (d)-(i) (B) (a)-(i), (b)-(iv),… Read More
A legacy software system has 940 modules. The latest release require that 90 of these modules be changed. In addition, 40 new modules were added… Read More
Dirty bit is used to show the (A) Page with low frequency occurrence (B) Wrong page (C) Page with corrupted data (D) Page that is… Read More
Data Scrubbing is (A) A process to upgrade the quality of data after it is moved into a data warehouse. (B) A process to upgrade… Read More
Consider the C/C++ function f() given below: void f(char w [ ] ) { int x = strlen(w); //length of a string char c; For… Read More
Match each UML diagram in List 1 with Appropriate description in List 2 (A) (a)-(i), (b)-(iv), (c) -(iii), (d)-(ii) (B) (a)-(iv), (b)-(ii), (c) -(i), (d)-(iii)… Read More
Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner… Read More
​If a graph (G) has no loops or parallel edges and if the number of vertices(n) in the graph is n≥3, then the graph G… Read More
The boolean expression A’⋅B+A.B’+A.B is equivalent to (A) A+B (B) A.B (C) (A+B)’ (D) A’.B Answer: (A) Explanation: = A'.B + A.B' + A.B =… Read More
Match the following secret key algorithm (List 1) with the corresponding key lengths (List 2) and choose the correct answer from the code given below.… Read More
Consider the following two statements: S1: TCP handles both congestion and flow control. S2: UDP handles congestion but not flow control. Which of the following… Read More
Consider the following statements S1:​ A heuristic is admissible if it never overestimates the cost to reach the goal. S2:​ A heuristic is monotonous if… Read More
Consider the following problems: (i) Whether a finite automaton halts on all inputs? (ii) Whether a given Context Free Language is Regular? (iii) Whether a… Read More

Start Your Coding Journey Now!