4 answers
3
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
7 answers
5
5 answers
8
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
9 answers
10
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
3 answers
11
Consider a relational database containing the following schemas.$$\overset{\text{Catalogue}} {\begin{array}{|c|c|c|} \hline \underline{\text{sno}} & \underline{\text{pno}...
3 answers
14
3 answers
15
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit?BCD codeGray code$8421$ codeExcess-$3$ code
2 answers
16
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$$4$$5$$3$$6$
2 answers
22
18 answers
25
If every non-key attribute is functionally dependent on the primary key, then the relation is in ________First normal formSecond normal formThird normal formFourth normal...
12 answers
26
If every non-key attribute functionally dependent on the primary key, then the relation will be inFirst normal formSecond normal formThird normal formFourth Normal form
2 answers
27
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2...
4 answers
29
The hardware implementation which provides mutual exclusion isSemaphoresTest and set instructionsBoth optionsNone of the options
5 answers
30
If $x+2y=30$, then $\left(\dfrac{2y}{5}+\dfrac{x}{3} \right) + \left (\dfrac{x}{5}+\dfrac{2y}{3} \right)$ will be equal to$8$$16$$18$$20$