Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tonystark007
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by tonystark007
1
answer
1
Finding Hit Ratio when memory references are given in Hex
A byte addressable computer has a small data cache capable of holding eight 32 bit words. Each cache block consist of two 32 bit words. For the following sequence of addresses (in hexa decimal ). Find the hit ratio if two way ... is conflicting. You can check it here - https://gateoverflow.in/29182/cache-miss-in-two-way-set-associative ]
A byte addressable computer has a small data cache capable of holding eight 32 bit words. Each cache block consist of two 32 bit words. For the following sequence of addr...
2.3k
views
commented
Nov 19, 2018
CO and Architecture
cache-memory
memory-management
co-and-architecture
+
–
0
answers
2
Number of spanning Trees
Hi, As all of us knows number of spanning tree of simple labeled graph could be computed by the Kirchhoff's theorem. But is there any other method (other than Brute force) to compute the number of spanning tree of given general graph ? Formula for ... respectively. If anyone can state simple proof for above mentioned formula then it will great help.
Hi, As all of us knows number of spanning tree of simple labeled graph could be computed by the Kirchhoff's theorem. But is there any other method (other than Brute force...
5.4k
views
commented
Jul 26, 2018
Graph Theory
spanning-tree
algorithms
graph-theory
+
–
1
answer
3
What is the sequence of memory access/operations when TLB, 2-level Page Table, Cache and Memory are in picture?
My understanding and doubts are First of all TLB is accessed.If there is TLB hit, do we consider this asHit for 1-level PT only and search the TLB again for 2-level PT, o...
912
views
commented
Jan 22, 2018
Operating System
memory-management
+
–
1
answer
4
Ace Test series: Digital Logic - Multiplexer
627
views
commented
Jan 3, 2018
Digital Logic
digital-logic
ace-test-series
multiplexer
+
–
1
answer
5
digital logic
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
813
views
commented
Jan 3, 2018
4
answers
6
GATE CSE 2004 | Question: 63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ $$\begin{array}{|l|l|c|} \hline \text {Instruction} & \t...
28.9k
views
commented
Dec 24, 2017
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
4
answers
7
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
18.7k
views
commented
Dec 18, 2017
Theory of Computation
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
+
–
2
answers
8
[Doubt] Conversion of finite automata to regular expression
How to convert given finite state automaton into regular expression.
How to convert given finite state automaton into regular expression.
1.3k
views
commented
Dec 8, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
answer
9
gate academy test series
Which of the following are the criteria for CPU scheduling algorithm evaluation. A. Maximum CPU utilization under the constraint that maximum response time is one second. B. Maximum throughput such that turnaround time is (on an average) linearly proportional to total execution time. C. Both D. None
Which of the following are the criteria for CPU scheduling algorithm evaluation.A. Maximum CPU utilization under the constraint that maximum response time is one second.B...
1.8k
views
answer selected
Nov 8, 2017
Operating System
test-series
operating-system
+
–
3
answers
10
Master theorem details?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?
2.7k
views
commented
Sep 24, 2017
Algorithms
algorithms
master-theorem
+
–
2
answers
11
GATE CSE 1999 | Question: 2.13
Consider the following program in a language that has dynamic scooping: var x: real; procedure show: begin print(x);end; procedure small; var x: real; begin x: = 0.125; show; end; begin x:=0.25 show; small end. Then the output of the program is: 0.125 0.125 0.25 0.25 0.25 0.125 0.125 0.25
Consider the following program in a language that has dynamic scooping:var x: real; procedure show: begin print(x);end; procedure small; var x: real; begin x: = 0.125; sh...
5.7k
views
commented
Sep 16, 2017
Programming in C
gate1999
programming
variable-binding
normal
out-of-syllabus-now
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register