The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by akshat sinha
User akshat sinha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akshat sinha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
5
answers
1
GATE2008IT42
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

4.6k
views
gate2008it
digitallogic
boothsalgorithm
normal
2
answers
2
Kenneth Rosen Edition 6th Exercise 1.1 Question 20 (Page No. 18)
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 email ... 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

355
views
kennethrosen
discretemathematics
mathematicallogic
4
answers
3
GATE201523
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? ... 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

2.5k
views
gate20152
mathematicallogic
normal
logicalreasoning
0
answers
4
#KUROSE computer network
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

28
views
computernetworks
throughput
12
answers
5
GATE200539
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

7.4k
views
gate2005
algorithms
sorting
normal
6
answers
6
GATE20002.11
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

1.8k
views
gate2000
digitallogic
kmap
normal
5
answers
7
GATE199101iii
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.3k
views
gate1991
digitallogic
numberrepresentation
normal
4
answers
8
GATE20001.6
The number $43$ in $2's$ complement representation is $01010101$ $11010101$ $00101011$ $10101011$
answered
May 12, 2018
in
Digital Logic

3.2k
views
gate2000
digitallogic
numberrepresentation
easy
5
answers
9
GATE20002.10
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

2k
views
gate2000
digitallogic
booleanalgebra
easy
5
answers
10
GATE200609, ISRO200935
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

4.7k
views
gate2006
coandarchitecture
machineinstructions
easy
isro2009
5
answers
11
GATE200639
We consider the addition of two $2's$ complement numbers $ b_{n1}b_{n2}\dots b_{0}$ and $a_{n1}a_{n2}\dots a_{0}$. A binary adder for adding unsigned binary numbers is used to add the two numbers. The sum is denoted by $ c_{n1}c_{n2}\dots c_{0}$ ... $ c_{out}\oplus c_{n1}$ $ a_{n1}\oplus b_{n1}\oplus c_{n1}$
commented
Apr 7, 2018
in
Digital Logic

6.9k
views
gate2006
digitallogic
numberrepresentation
normal
1
answer
12
MadeEasy Test Series: Probability
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

127
views
madeeasytestseries
probability
5
answers
13
GATE2005IT12
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

3.3k
views
gate2005it
datastructures
normal
binarysearchtree
1
answer
14
tag directory size in direct mapping
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

678
views
cachememory
directmapping
1
answer
15
workbook
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

350
views
regularexpressions
1
answer
16
TIFR2015MathsA8
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

205
views
tifrmaths2015
calculus
continuity
1
answer
17
Integration
commented
Dec 30, 2017
in
Calculus

717
views
2
answers
18
Digital Logic  Need help simplifying Boolean expression with DeMorgan's theorem.
answered
Dec 28, 2017
in
Digital Logic

308
views
digitallogic
booleanalgebra
digitalcircuits
logic
0
answers
19
Tower of Hanoi
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

219
views
recursion
towersofhanoi
5
answers
20
GATE19982.19
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. ... D. $\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

5.2k
views
gate1998
databases
relationalcalculus
normal
6
answers
21
GATE1999218, ISRO200846
Raid configurations of the disks are used to provide Faulttolerance High speed High data density (A) & (B)
answered
Dec 5, 2017
in
Operating System

4k
views
gate1999
operatingsystem
disks
easy
isro2008
2
answers
22
APTITUDE
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

350
views
50,741
questions
57,232
answers
197,993
comments
104,578
users