Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Shaikh727
3
answers
1
MADE EASY TEST SERIES 2024 #COA
Consider 16 bit CPU with 4 GB RAM supports 2 Address Instruction with Address 1 uses direct addressing mode Address2 uses indirect addressing mode. Opcode is designed as ADD operation with Address 1 used as Source1 and Destination, Address2 used ... operation consumes 4 cycles. Memory reference consumes 6 cycles. Time required to complete the instruction is in (ns).
Consider 16 bit CPU with 4 GB RAM supports 2 Address Instruction with Address 1 uses direct addressing mode Address2 uses indirect addressing mode. Opcode is designed as ...
434
views
asked
Jan 24
CO and Architecture
co-and-architecture
made-easy-test-series
addressing-modes
+
–
1
answer
2
Made easy test series
The minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using Sethi-Ullman Algorithm.
The minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using Sethi-Ullm...
1.5k
views
commented
Dec 16, 2022
Compiler Design
compiler-design
code-generation
made-easy-test-series
numerical-answers
+
–
3
answers
3
GATE CSE 2004 | Question: 22
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits and one parity bit? $600$ $800$ $876$ $1200$
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight d...
15.8k
views
commented
Dec 15, 2022
Computer Networks
gatecse-2004
computer-networks
serial-communication
normal
out-of-gate-syllabus
+
–
1
answer
4
GO Classes Test Series 2023 | Digital Logic | Test 3 | Question: 20
Consider the following circuit : If $A n, B n$ denote the next state corresponding to current states $A, B$ ... of states in the state transition diagram of this circuit that have a transition back to the same state is $2 .$
Consider the following circuit :If $A n, B n$ denote the next state corresponding to current states $A, B$ respectively, thenFor this circuit, which of the following is/a...
459
views
commented
Dec 4, 2022
Digital Logic
goclasses2024-dl-3-weekly-quiz
goclasses
digital-logic
sequential-circuit
flip-flop
multiple-selects
2-marks
+
–
2
answers
5
Bottom-Up Parsing
Consider the folllowing grammar $ S\rightarrow AaS \ |\ b$ $ A\rightarrow c \ |\ d \ |B$ $ B\rightarrow AgC \ |\ AhC \ | \ DgC | \ DhC$ $C\rightarrow c \ |\ d \ | \ D$ $ D\rightarrow eBf$ Which of the following are viable prefix ? $ \left ( 1 \right )Aab$ $ \left ( 2 \right )ca$ $ \left ( 3 \right )cab$ $\left ( 4 \right )AgCS$
Consider the folllowing grammar$ S\rightarrow AaS \ |\ b$$ A\rightarrow c \ |\ d \ |B$$ B\rightarrow AgC \ |\ AhC \ | \ DgC | \ DhC$$C\rightarrow c \ |\ d \ | \ D$$ D\rig...
2.8k
views
commented
Nov 22, 2022
Compiler Design
compiler-design
viable-prefix
parsing
+
–
5
answers
6
GATE CSE 2003 | Question: 60, ISRO2007-45
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ ... $\int_0^t f_1(x)f_2(t-x)dx$ $\max\{f_1(t),f_2(t)\}$
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
9.2k
views
comment edited
Nov 16, 2022
Probability
gatecse-2003
probability
normal
isro2007
probability-density-function
+
–
5
answers
7
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
13.0k
views
commented
Oct 12, 2022
Digital Logic
gate1996
normal
finite-automata
+
–
4
answers
8
TIFR CSE 2011 | Part A | Question: 6
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is. $4$ $3$ $6$ $10$ $5$
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for...
5.9k
views
commented
Sep 26, 2022
Probability
tifr2011
probability
expectation
+
–
8
answers
9
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...
33.1k
views
commented
Sep 26, 2022
Probability
gateit-2005
probability
binomial-distribution
expectation
normal
+
–
1
answer
10
GATE CSE 1998 | Question: 9
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one operation refers to a multiplication followed by an addition.
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one ...
3.3k
views
commented
Sep 24, 2022
Linear Algebra
gate1998
linear-algebra
system-of-equations
descriptive
+
–
4
answers
11
GATE CSE 2015 Set 2 | Question: GA-3
Consider a function $f(x) = 1- |x| \text{ on } -1 \leq x \leq 1$. The value of $x$ at which the function attains a maximum, and the maximum value of the function are: $0, -1$ $-1, 0$ $0, 1$ $-1, 2$
Consider a function $f(x) = 1- |x| \text{ on } -1 \leq x \leq 1$. The value of $x$ at which the function attains a maximum, and the maximum value of the function are:$0, ...
6.9k
views
commented
Sep 22, 2022
Calculus
gatecse-2015-set2
set-theory&algebra
functions
normal
maxima-minima
+
–
7
answers
12
GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following stat...
17.3k
views
commented
Sep 22, 2022
Calculus
gatecse-2015-set2
continuity
functions
normal
+
–
2
answers
13
MadeEasy Workbook question.
528
views
answered
Sep 20, 2022
Computer Networks
network-layer
subnetting
ip-address
+
–
11
answers
14
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
33.1k
views
comment edited
Sep 19, 2022
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
7
answers
15
GATE CSE 1994 | Question: 9
Following $7$ ... that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
Following $7$ bit single error correcting hamming coded message is received.$$\overset{7\qquad 6\qquad 5 \qquad 4\qquad 3 \qquad 2 \qquad 1}{\boxed{1 \qquad 0\qquad 0 \qq...
8.8k
views
commented
Sep 18, 2022
Computer Networks
gate1994
computer-networks
error-detection
hamming-code
normal
descriptive
+
–
4
answers
16
GATE CSE 1993 | Question: 17
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
8.2k
views
commented
Sep 3, 2022
Set Theory & Algebra
gate1993
set-theory&algebra
easy
set-theory
descriptive
+
–
8
answers
17
GATE CSE 2004 | Question: 73
The inclusion of which of the following sets into $S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3, 4, 5\right\} \right\} $ is necessary and sufficient to make $S$ a complete lattice under the partial order defined by ... $\{1\}, \{1, 3\}$ $\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$
The inclusion of which of the following sets into$S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3,...
12.9k
views
commented
Sep 2, 2022
Set Theory & Algebra
gatecse-2004
set-theory&algebra
partial-order
normal
+
–
5
answers
18
GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$
19.6k
views
commented
Sep 1, 2022
Set Theory & Algebra
gatecse-2007
group-theory
normal
+
–
6
answers
19
GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$, and a predicate$$P\left(x\right) = \neg \left(x=1\right)\wedge \forall y \left...
13.4k
views
commented
Aug 28, 2022
Mathematical Logic
gatecse-2011
mathematical-logic
normal
first-order-logic
+
–
9
answers
20
GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
Consider the following rooted tree with the vertex labeled $P$ as the root:The order in which the nodes are visited during an in-order traversal of the tree is$SQPTRWUV$$...
16.5k
views
commented
Jul 29, 2022
DS
gatecse-2014-set3
data-structures
tree
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register