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
Answers by srestha
1
votes
121
Sums on Adder
$1)$3-bit ripple adder, which adds two 3-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, ... both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder?
$1)$3-bit ripple adder, which adds two 3-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemente...
3.0k
views
answered
Aug 30, 2018
Digital Logic
digital-logic
adder
+
–
6
votes
122
Test-Series
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? Assume the cost toupdate the TLB, the page table, and the frame table (if needed) is negligible. 1. 3777.5ns 2. 30220ns 3. 15110ns 4. 7555ns
Suppose: TLB lookup time = 20 nsTLB hit ratio = 80%Memory access time = 75 nsSwap page time = 500,000 ns50% of pages are dirtyOS uses a single level page tableWhat is the...
3.5k
views
answered
Aug 29, 2018
5
votes
123
MADE EASY COMBINATORICS
518
views
answered
Aug 25, 2018
1
votes
124
Time Complexity
1.6k
views
answered
Aug 14, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
0
votes
125
Test Datastructure
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair of nodes. Which of the following statements is(are) true? I. We can use Depth First Search to ... correct result only if the given graph is a tree. Only I and II Only II and IV Only III and IV Only II and III
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair...
1.0k
views
answered
Aug 12, 2018
Algorithms
algorithms
graph-algorithms
+
–
0
votes
126
Who is responsible for changing the mode bit in CPU ?
When we switch from user mode to kernel mode , via an interrupt it is done , Now is this a privileged instruction or a non-priviledged instruction which changes the mode bit . Also we say that while switching from kernel mode ... mode and change the mode bit . Also is it the kernel which triggers this unprivileged instruction to change its bit .
When we switch from user mode to kernel mode , via an interrupt it is done , Now is this a privileged instruction or a non-priviledged instruction which changes the mode ...
2.0k
views
answered
Aug 8, 2018
Operating System
operating-system
+
–
9
votes
127
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
answered
Jul 30, 2018
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
2
votes
128
Kenneth Rosen Edition 6th Exercise 6.1 Question 4 (Page No. 400)
Show that the sequence {an} is a solution of the recurrence relation an = -3an-1 + 4an-2 if a) an = 0 b) an = 1 c) an = (-4)n d) an = 2(-4)n + 3 In the question What is sequence {an} ?? And how to solve this kind of question?
Show that the sequence {an} is a solution of the recurrence relation an = -3an-1 + 4an-2 ifa) an = 0b) an = 1c) an = (-4)nd) an = 2(-4)n + 3In the question What is sequen...
6.5k
views
answered
Jul 28, 2018
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
1
votes
129
Ace Programming
What is the output of the following C program? main() { printf("%d%d%d", sizeof('3'), sizeof("3"), sizeof(3)); } a) 111. b)222 c)666 d)333
What is the output of the following C program? main() { printf("%d%d%d", sizeof('3'), sizeof("3"), sizeof(3)); }a) 111. b)222 c)666 d)333
1.5k
views
answered
Jul 26, 2018
Programming in C
programming-in-c
+
–
0
votes
130
digital logic Floating point number
A 32-bit floating-point number(follows IEEE STANDARD) is represented by a 8-bit signed exponent, and a 23-bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________, if the scale factor is represented in excess-64 format.
A 32-bit floating-point number(follows IEEE STANDARD) is represented by a 8-bit signed exponent, and a 23-bit fractional mantissa. The base of the scale factor is 16,The ...
1.8k
views
answered
Jul 20, 2018
Digital Logic
floating-point-representation
digital-logic
ieee-representation
+
–
0
votes
131
Hennessy and Patterson
Assume that we have three scenarios - is a fully associative cache, is a two way set associative cache and is a direct mapped cache. The cache size is 256 bytes. T The cache line size is 8 bytes. All variables are 4 bytes. Assume we have separate instruction and data caches.Assumption -- assign a[1024] ... { 2.b += q*a[64*i]; 3.} 4.for(i=0;i<16;i++){ 5.c += r*a[64*i]; 6.}
Assume that we have three scenarios - is a fully associative cache, is a two way set associative cache and is a direct mapped cache. The cache size is 256 bytes. TThe cac...
687
views
answered
Jul 20, 2018
CO and Architecture
cache-memory
+
–
1
votes
132
Self Doubt
How to evaluate this quickly? $\large\sum^{20}_{r=0}(-1)^r\binom{r+2}{r}\\OR\\\large\sum^{20}_{r=0}(-1)^r(r+2)(r+1)$
How to evaluate this quickly?$\large\sum^{20}_{r=0}(-1)^r\binom{r+2}{r}\\OR\\\large\sum^{20}_{r=0}(-1)^r(r+2)(r+1)$
427
views
answered
Jul 11, 2018
Combinatory
combinatory
+
–
0
votes
133
Uniform Random variable-Self Doubt
I was reading the uniform random variable from sheldon ross it is given that X is a uniform random variable on the interval $(\alpha,\beta)$ ... My query is how they derived the distribution function from the density function?
I was reading the uniform random variable from sheldon rossit is given that X is a uniform random variable on the interval $(\alpha,\beta)$ if the probability density fun...
728
views
answered
Jul 9, 2018
Probability
random-variable
probability
+
–
0
votes
134
MADEEASY TEST SERIES
Which of the following procedure is suitable to find the longest path from a given vertex to any other given vertex in a directed acyclic graph (weighted) with few negative edge weights. A Divide and conquer B Greedy approach C Dynamic programming. D All of these ANSWER GIVEN IS C but why not gredy
Which of the following procedure is suitable to find the longest path from a given vertex to any other given vertex in a directed acyclic graph (weighted) with few negat...
1.9k
views
answered
Jul 1, 2018
Algorithms
made-easy-test-series
graph-algorithms
+
–
0
votes
135
Kenneth Rosen Edition 6th Exercise 7.1 Question 35 (Page No. 473)
Let $R_1,R_4,R_6$ be relations on the set of real numbers to the set of real numbers $R_1=\{(a,b) \in R^2 \, | \, a>b\}$ $R_4=\{(a,b) \in R^2\, | \, a \leq b\}$ $R_6=\{(a,b) \in R^2 \, | \, a \neq b\}$ Find (d) $R_4 o R_1$ (g)$R_4 o R_6$
Let $R_1,R_4,R_6$ be relations on the set of real numbers to the set of real numbers$R_1=\{(a,b) \in R^2 \, | \, a>b\}$$R_4=\{(a,b) \in R^2\, | \, a \leq b\}$$R_6=\{(a,b)...
588
views
answered
Jun 29, 2018
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
relations
+
–
0
votes
136
#selfdoubt
Find the time complexity? for(i=1;i<=n;i++) { for(j=1;j<i;j++) { if((i℅j)==0) { for (k=1;k<=n;k++) { sum+=k; } } } }
Find the time complexity?for(i=1;i<=n;i++) { for(j=1;j<i;j++) { if((i℅j)==0) { for (k=1;k<=n;k++) { sum+=k; } } } }
819
views
answered
Jun 29, 2018
Algorithms
time-complexity
+
–
0
votes
137
Kenneth Rosen Edition 6th Exercise 6.6 Question 11 (Page No. 457)
In how many different ways can seven different jobs be assigned to four different employees so that each employee is assigned at least one job and the most difficult job is assigned to the best employee? I got the first ... 4 elements. But how to deal with the second part that most difficult job is assigned to the best employee?
In how many different ways can seven different jobs be assigned to four different employees so that each employee is assigned at least one job and the most difficult job ...
2.7k
views
answered
Jun 28, 2018
Combinatory
discrete-mathematics
inclusion-exclusion
kenneth-rosen
combinatory
+
–
0
votes
138
Kenneth Rosen Edition 6th Exercise 6.4 Question 47 e (Page No. 443)
Find the sequence with each of these functions as its exponential generating function g(x) = $e^{-2x} - \frac{1}{1-x}$ ... according to rosen's answer $a_0$ should exist but in my answer $a_0$ is 0. Please let me know where I am missing something.
Find the sequence with each of these functions as its exponential generating functiong(x) = $e^{-2x} - \frac{1}{1-x}$so I expanded it like$\sum_{r=0}^{\infty}\frac{(-2^r)...
834
views
answered
Jun 26, 2018
Combinatory
kenneth-rosen
generating-functions
discrete-mathematics
+
–
4
votes
139
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?
3.4k
views
answered
Jun 25, 2018
DS
data-structures
heap-sort
+
–
0
votes
140
Kenneth Rosen Edition 6th Exercise 5.3 Question 31 (Page No. 362)
The english alphabet contains 21 consonants and five vowels.How many strings of six lowercase letters of the English alphabet contain (b)Exactly two vowels (d)At least two vowels For (b) part I solved it like choose 2 vowels from 5 ... and both of my answers don't match with the key in Rosen. Please let me know where I am wrong.
The english alphabet contains 21 consonants and five vowels.How many strings of six lowercase letters of the English alphabet contain(b)Exactly two vowels(d)At least two ...
945
views
answered
Jun 24, 2018
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
2
votes
141
Virtual memory
How does the virtual memory separates the logical memory as perceived by users from physical memory? Is it because we can load program with larger address space then physical memory but still we need physical memory to load our pages don't we ? Then what does the above statement actually trying to convey ?
How does the virtual memory separates the logical memory as perceived by users from physical memory?Is it because we can load program with larger address space then physi...
1.1k
views
answered
Jun 20, 2018
Operating System
operating-system
virtual-memory
memory-management
+
–
0
votes
142
Paging
For a computer architecture with multi level paging, a page size of $4 \hspace{0.1cm}KB$, and $64 \hspace{0.1cm} bit$ Physical and Virtual address: What is the smallest possible size for a page table entry, rounded up to a power of $2$? using your result ... fits into a single page, How many levels of Page tables would be required to completely map the $64 \hspace{0.1cm} bit$ virtual space?
For a computer architecture with multi level paging, a page size of $4 \hspace{0.1cm}KB$, and $64 \hspace{0.1cm} bit$ Physical and Virtual address:What is the smallest po...
3.3k
views
answered
Jun 18, 2018
Operating System
co-and-architecture
paging
+
–
0
votes
143
Self Doubt
How far is Defining a function and macro related with each other?
How far is Defining a function and macro related with each other?
592
views
answered
Jun 17, 2018
Programming in C
programming-in-c
+
–
0
votes
144
IIT M video questions
P(x,y,z), xy=z, Universe is interger; write in logic form If xy=x for all y, then x =0. Thank you
P(x,y,z), xy=z, Universe is interger;write in logic formIf xy=x for all y, then x =0.Thank you
484
views
answered
Jun 14, 2018
Mathematical Logic
propositional-logic
first-order-logic
logical-reasoning
+
–
0
votes
145
TIFR CSE 2015 | Part B | Question: 13
Two undirected graphs $G_{1}=(V_{1}, E_{1})$ and $G_{2}= (V_{2}, E_{2})$ are said to be isomorphic if there exist a bijection $\pi: V_{1} \rightarrow V_{2}$ such that for all $u, v \in V_{1}, (u, v) \in E_{1}$ ... $L$ is $NP$- hard. $L$ is undecidable. Only $(i)$ Only $(ii)$ Only $(iii)$ $(i)$ and $(ii)$ $(ii)$ and $(iii)$
Two undirected graphs $G_{1}=(V_{1}, E_{1})$ and $G_{2}= (V_{2}, E_{2})$ are said to be isomorphic if there exist a bijection $\pi: V_{1} \rightarrow V_{2}$ such that for...
1.0k
views
answered
Jun 14, 2018
Algorithms
tifr2015
graph-theory
graph-isomorphism
p-np-npc-nph
non-gate
+
–
2
votes
146
how >> and << works
#include <stdio.h> int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(b,a,a+b); printf("%d%d",a,b); return 0; } int make_it(int x,int y, int z){ x*=y+z; y=x<<1; z=x+y; }
#include <stdio.h int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(b,a,a+b); printf("%d%d",a,b); return 0; } int make_it(int x,int y, int z){ x*=y+z; y=x<<1; z...
875
views
answered
Jun 13, 2018
Programming in C
programming-in-c
+
–
0
votes
147
GATE CSE 1990 | Question: 1-iv-b
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$ The range of the exponent is ___________, if the scale factor is represented in excess-$64$ format.
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$The range of the ex...
3.9k
views
answered
Jun 13, 2018
Digital Logic
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
+
–
0
votes
148
probability ques
474
views
answered
Jun 11, 2018
Probability
probability
+
–
2
votes
149
Definite Integral
$\displaystyle S = \int_{0}^{2\pi } \sqrt{4\cos^{2}t +\sin^{2}t} \, \, dt$ Please explain how to solve it.
$\displaystyle S = \int_{0}^{2\pi } \sqrt{4\cos^{2}t +\sin^{2}t} \, \, dt$Please explain how to solve it.
952
views
answered
Jun 11, 2018
Calculus
calculus
integration
engineering-mathematics
integrals
+
–
2
votes
150
Perfect Matching
Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (EXACTLY one appearance). So for n vertices perfect matching will have n/2 edges and there won't be any perfect matching if n is ... t know whether i got it properly or not. Can please anybody explain the Perfect matching in a complete graph with simpler examples ?
Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (EXACTLY one appearance). So for n vertices perfect match...
1.0k
views
answered
Jun 10, 2018
Graph Theory
graph-matching
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
36
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register