Log In

Recent activity by akshat sinha

5 answers
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$
answered Jan 5, 2019 in Digital Logic 5.8k views
2 answers
Write each of these statements in the form if p, then q in English. [Hint: Refer to the list of common ways to express conditional statements] I will remember to send you the address only if you send me an e-mail message. To be a citizen of this country, it ... . It is necessary to have a valid password to log on to the server. You will reach the summit unless you begin your climb too late.
answered Dec 7, 2018 in Mathematical Logic 480 views
4 answers
Consider the following two statements. $S_1$: If a candidate is known to be corrupt, then he will not be elected $S_2$: If a candidate is kind, he will be elected Which one of the following statements follows from $S_1$ and $S_2$ as per sound inference rules of logic? If a ... is not kind If a person is kind, he is not known to be corrupt If a person is not kind, he is not known to be corrupt
commented Nov 30, 2018 in Mathematical Logic 3.2k views
0 answers
While reading Kurose book of Computer Network, application layer, about throughput i came across a sentence "There’s an adage that says that one cannot be too rich, too thin, or have too much throughput!" Could anybody please suggest what exactly it means and why can't we have /what is the disadvantage of very high throughput?
commented Sep 2, 2018 in Computer Networks 46 views
13 answers
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
answered Sep 2, 2018 in Algorithms 9.6k views
6 answers
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
commented Aug 4, 2018 in Digital Logic 2.4k views
5 answers
Consider the number given by the decimal expression: $16^3*9 + 16^2*7 + 16*5+3$ The number of $1’s$ in the unsigned binary representation of the number is ______
answered May 13, 2018 in Digital Logic 1.8k views
4 answers
The number $43$ in $2's$ complement representation is $01010101$ $11010101$ $00101011$ $10101011$
answered May 12, 2018 in Digital Logic 4.6k views
5 answers
The simultaneous equations on the Boolean variables $x, y, z$ and $w$, $x + y + z = 1 $ $xy = 0$ $xz + w = 1$ $xy + \bar{z}\bar{w} = 0$ have the following solution for $x, y, z$ and $w,$ respectively: $0 \ 1 \ 0 \ 0$ $1 \ 1 \ 0 \ 1$ $1 \ 0 \ 1 \ 1$ $1 \ 0 \ 0 \ 0$
answered May 12, 2018 in Digital Logic 2.6k views
7 answers
A CPU has $24$-$bit$ instructions. A program starts at address $300$ (in decimal). Which one of the following is a legal program counter (all values in decimal)? $400$ $500$ $600$ $700$
answered Apr 19, 2018 in CO and Architecture 5.9k views
6 answers
We consider the addition of two $2's$ complement numbers $ b_{n-1}b_{n-2}\dots b_{0}$ and $a_{n-1}a_{n-2}\dots a_{0}$. A binary adder for adding unsigned binary numbers is used to add the two numbers. The sum is denoted by $ c_{n-1}c_{n-2}\dots c_{0}$ and the carry-out by $ c_{out}$ ... $ c_{out}\oplus c_{n-1}$ $ a_{n-1}\oplus b_{n-1}\oplus c_{n-1}$
commented Apr 7, 2018 in Digital Logic 8.3k views
1 answer
Q)A product is an assembly of 4 different components. The product can be sequentially assembled in two possible ways. If the 4 components are placed in a box and these are drawn at random from the box, then the probability of getting a correct sequence is ______.
commented Jan 27, 2018 in Probability 157 views
5 answers
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
answered Jan 15, 2018 in DS 4.1k views
1 answer
how to calculate tag directory size in direct cache mapping... is it number of lines * tag bits??
commented Jan 1, 2018 in CO and Architecture 835 views
1 answer
Which of the following pairs of regular expression are not equivalent? A. (a*+b)* and (a+b)* B. (ab)*a and a(ba)* C. (a+b)* and (a*b*)*b* D. none of the above
commented Dec 31, 2017 in Theory of Computation 567 views
1 answer
Let $f(x)=\frac{e^{\frac{-1}{x}}}{x}$, where $x \in (0, 1)$. Then on $(0, 1)$. $f$ is uniformly continuous. $f$ is continuous but not uniformly continuous. $f$ is unbounded. $f$ is not continuous.
commented Dec 30, 2017 in Calculus 224 views
1 answer
commented Dec 30, 2017 in Calculus 739 views
2 answers
The expression is: x + yz'+ (y + z) I need to obtain an equivalent ALL-NAND expression without minimization. Can someone help me out?
answered Dec 28, 2017 in Digital Logic 342 views
0 answers
how to Write a program in C which implements tower of Hanoi using recursion? and please explain lines of code if possible. It 'll be a great help.
commented Dec 16, 2017 in Algorithms 256 views
6 answers
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1. A. ... $\pi_{A_1} \left(\sigma_{C_1}\left(R_1\right)\right) \to \sigma_{C_1} \left(\pi_{A_1}\left(R_1\right)\right)$
commented Dec 14, 2017 in Databases 6.5k views
6 answers
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
answered Dec 5, 2017 in Operating System 5k views
2 answers
The sum of all numbers greater than 10,000 formed by using the digits 0,2,4,6,8 no digit being repeated in any number is??
commented Nov 16, 2017 in Numerical Ability 444 views