# 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