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
Questions by shreshtha5
2
votes
2
answers
1
sql query
362
views
asked
Jan 20, 2016
Databases
sql
+
–
0
votes
0
answers
2
hit ratio
a byte addressable computer has a small data cache capable of holding eight 32 bit words.Each cache block consists of two 32 bit words.For the following sequence of addresses( in hex), the hit ratio if the two way set associative LRU cache is used is.... 200,204,208, 20C,2F4,2F0,2F4,2F0,21C,218,21C
a byte addressable computer has a small data cache capable of holding eight 32 bit words.Each cache block consists of two 32 bit words.For the following sequence of addre...
377
views
asked
Jan 20, 2016
1
votes
1
answer
3
cache miss
760
views
asked
Jan 20, 2016
0
votes
0
answers
4
cache miss
143
views
asked
Jan 20, 2016
0
votes
1
answer
5
p&c
six balls have to be placed in the squares such that each row has atleast one ball . no of ways of doing this is-
six balls have to be placed in the squares such that each row has atleast one ball . no of ways of doing this is-
656
views
asked
Dec 28, 2015
Combinatory
combinatory
+
–
1
votes
1
answer
6
TCP
let the size of the congestion window of a TCP connection be 32KB.When time out occurs the maximum segment size used is 2KB.If the time taken by the TCP connection to get 32 KB congestion window size is 480 ms than the RTT is??
let the size of the congestion window of a TCP connection be 32KB.When time out occurs the maximum segment size used is 2KB.If the time taken by the TCP connection to get...
625
views
asked
Dec 8, 2015
1
votes
2
answers
7
window size
the round trip delay between sender and receiver is 160ms and the bottleneck bandwidth of the link is 256 kbps.Sender uses sliding window protocol to send a 64 byte packet.The optimal size of the window that sender should use is ?
the round trip delay between sender and receiver is 160ms and the bottleneck bandwidth of the link is 256 kbps.Sender uses sliding window protocol to send a 64 byte packe...
824
views
asked
Dec 8, 2015
2
votes
1
answer
8
regular
233
views
asked
Dec 6, 2015
13
votes
4
answers
9
VirtualGate Test Series: Theory Of Computation - Regular Languages
Consider the following subsets of $\left\{a, b, \$ \right\}^*$ $A=\left\{xy\, |\, x,y\in\left\{a,b\right\}^*,\#a(x)=\#b(y)\right\},$ $ ... are true? $A$ and $B$ both are regular $A$ is regular but $B$ is not $A$ is not regular but $B$ is regular Both are non-regular
Consider the following subsets of $\left\{a, b, \$ \right\}^*$$A=\left\{xy\, |\, x,y\in\left\{a,b\right\}^*,\#a(x)=\#b(y)\right\},$$B=\left\{x\$y\, |\, x,y\in\left\{a,b\r...
1.6k
views
asked
Dec 5, 2015
Theory of Computation
theory-of-computation
regular-language
virtual-gate-test-series
+
–
3
votes
3
answers
10
Virtual Gate Test Series: Theory Of Computation - Languages
Consider the following context-sensitive productions $\\S\rightarrow bSb\, |\, AcA \\Ab\rightarrow A,\, Ab\rightarrow b \\bA\rightarrow b,\, bA\rightarrow A$ Let $G$ be grammar given by all the rules except the last, and let $G'$ be the ... is regular Both $L(G)$ and $L(G')$ are regular None of $L(G)$ and $L(G')$ are regular
Consider the following context-sensitive productions$\\S\rightarrow bSb\, |\, AcA \\Ab\rightarrow A,\, Ab\rightarrow b \\bA\rightarrow b,\, bA\rightarrow A$Let $G$ be gra...
673
views
asked
Dec 5, 2015
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
3
votes
2
answers
11
Regular/Non-regular Language
Given a set $A\subseteq \left\{0,1 \right \}^*,$ let $A' = \left\{ xy\; |\;x1y\in A\right\}.$ That is, $A'$ consistes of all the strings obtained from a string in $A$ by deleting in $A$ by deleting exactly one $1$. if $A$ is regular, then $A'$ is (A) Regular (B) Context free but not regular (C) Recursive but not context free (D) None of the above.
Given a set $A\subseteq \left\{0,1 \right \}^*,$ let$A' = \left\{ xy\; |\;x1y\in A\right\}.$ That is, $A'$ consistes of all the strings obtained from a string in $A$ by d...
741
views
asked
Dec 5, 2015
Theory of Computation
identify-class-language
regular-language
+
–
2
votes
2
answers
12
pipeline
is 2ns?(in MIPS)
is 2ns?(in MIPS)
415
views
asked
Dec 5, 2015
1
votes
0
answers
13
pipeline
suppose there is unpipelined processor with a cycle time of 30ns which is evenly divided into 5 pipeline stages.The total latch latency of the pipeline will be
suppose there is unpipelined processor with a cycle time of 30ns which is evenly divided into 5 pipeline stages.The total latch latency of the pipeline will be
224
views
asked
Dec 5, 2015
1
votes
0
answers
14
clock cycle
the maximum clock frequency at which the data path can operate is ??
the maximum clock frequency at which the data path can operate is ??
277
views
asked
Dec 5, 2015
1
votes
1
answer
15
NP complete
Q). Which of the following can we infer from the fact that the travelling salesperson problem is $NP$-complete.if we assume that $P$ is not equal to $NP$ ? A). There does not exist an algorithm that solves arbitrary instances of $TSP$ problem. B). ... algorithm that efficiently solves arbitrary instances of the $TSP$ problem , but no one has been able to find it. D). None of these
Q). Which of the following can we infer from the fact that the travelling salesperson problem is $NP$-complete.if we assume that $P$ is not equal to $NP$ ?A). There does ...
815
views
asked
Dec 3, 2015
Algorithms
p-np-npc-nph
+
–
1
votes
2
answers
16
asymtotic notations
Q). Consider the following functions $f_1 = n^{\frac{4}{3}}$ $f_2=2^{2^n}$ $f_3= 2^{n^2}$ $f_4= n!$ $f_5=2^n$ Which of the following is true? A). $f_1$ is $\Omega(f_2)$ B). $f_2$ is $O(f_3)$ C). $f_1<f_5<f_4<f_2<f_3$ D). $f_4$ is $O(f_3)$
Q). Consider the following functions$f_1 = n^{\frac{4}{3}}$$f_2=2^{2^n}$$f_3= 2^{n^2}$$f_4= n!$$f_5=2^n$Which of the following is true?A). $f_1$ is $\Omega(f_2)$B). $f_2$...
704
views
asked
Dec 3, 2015
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
1
answer
17
multivalued dependency
find multivalued dependency in this table?
find multivalued dependency in this table?
1.3k
views
asked
Dec 2, 2015
1
votes
1
answer
18
BST
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons when we randomly request one of the records?
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons w...
568
views
asked
Nov 30, 2015
DS
binary-search-tree
numerical-answers
+
–
1
votes
2
answers
19
inverion pairs
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
493
views
asked
Nov 30, 2015
Algorithms
sorting
numerical-answers
+
–
1
votes
1
answer
20
no. of gates
616
views
asked
Nov 30, 2015
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register