Register

Recent questions tagged drdocse-2022-paper1

1 votes
0 answers
31
DRDO CSE 2022 Paper 1 | Question: 24
Given a truth table of the full adder for three inputs. Draw a full adder circuit with a decoder and two $\text{OR}$ ...
Given a truth table of the full adder for three inputs. Draw a full adder circuit with a decoder and two $\text{OR}$ gates.$$\begin{array}{|c|c|c|c|c|}\hline \mathrm{X} &...
User Avatar
1 votes
1 answer
32
DRDO CSE 2022 Paper 1 | Question: 25
Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$
Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$
User Avatar
1 votes
0 answers
33
DRDO CSE 2022 Paper 1 | Question: 26 (a)
Provide the correct data structures for the following: ________ is used for delimiter checking and recursion.
Provide the correct data structures for the following:________ is used for delimiter checking and recursion.
User Avatar
1 votes
1 answer
34
DRDO CSE 2022 Paper 1 | Question: 27
Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also need to draw each such tree.
Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also nee...
User Avatar
1 votes
2 answers
35
DRDO CSE 2022 Paper 1 | Question: 28
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
User Avatar
1 votes
0 answers
37
DRDO CSE 2022 Paper 1 | Question: 30
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
User Avatar
2 votes
0 answers
38
DRDO CSE 2022 Paper 1 | Question: 31
How many topological sortings (or topological orderings) does the given directed graph have?
How many topological sortings (or topological orderings) does the given directed graph have?
User Avatar
1 votes
0 answers
40
DRDO CSE 2022 Paper 1 | Question: 33 (a)
Consider the following graph. How many nodes (apart from $s$) does the Breadth First Search algorithm discover before discovering $t$ when starting from $s$.
Consider the following graph.How many nodes (apart from $s$) does the Breadth First Search algorithm discover before discovering $t$ when starting from $s$.
User Avatar
Page: