A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?
Previous 10 Questions — UGC NET Computer Science Nov 2020 (Paper II)
Nearest first
1
2
3
4
5
6
7
8
9
10
A Software project was estimated at 864 Function Points. A six person team will be assigned to project consisting of a …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
A company has a choice of two languages $L_1$ and $L_2$ to develop a software for their client. Number of LOC required …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Modifying the software by restructuring is called
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Which of the following UML diagrams has a static view?
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an i-node con…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider a disk system having $60$ cylinders. Disk requests are received for cylinders $10,22,20,2,40,6,38$ in that ord…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and$\langle A,B,C…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider a relational schema$S=(U,V,W,X,Y,Z)$on which the following functional dependencies hold:$\{U\to V,\ VW\to X,\ …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
The data node and name node in HADOOP are
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Next 10 Questions — UGC NET Computer Science Nov 2020 (Paper II)
Ascending by ID
1
2
3
4
5
6
7
8
9
10
In a binary max heap containing n numbers, the smallest element can be found in ____ time.
Topic: UGC NET Computer Science Nov 2020 (Paper II)
If algorithm A and another algorithm B take $\log_2(n)$ and $\sqrt n$ microseconds, respectively, to solve a problem, t…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a v…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider $L=L_1\cap L_2$ where$L_1=\{0^m1^m20^n1^n\mid m,n\ge 0\}$$L_2=\{0^m1^n2^k\mid m,n,k\ge 0\}$Then, the language …
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Let $L_1$ and $L_2$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a^*+b)^*$ and $(a+b)^*$…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Which of the following statements is true?
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Which of the following is not an intermediate code form?
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Consider a code with only four valid code words:$0000000000,\ 0000011111,\ 1111100000,\ 1111111111$This code has distan…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Using RSA public key cryptosystem, if $p=3,\ q=11$ and $d=7$, find the value of $e$ and encrypt the number $19$.
Topic: UGC NET Computer Science Nov 2020 (Paper II)
Protocols in which the sender sends one frame and then waits for an acknowledgement before proceeding for next frame ar…
Topic: UGC NET Computer Science Nov 2020 (Paper II)
