Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Habibkhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Habibkhan
7
votes
161
[Discrete maths] Spanning trees
True/False; 1. Every tree is spanning tree.
True/False;1. Every tree is spanning tree.
723
views
answered
Sep 16, 2017
Graph Theory
algorithms
spanning-tree
minimum-spanning-tree
+
–
4
votes
162
UGC NET CSE | December 2009 | Part 2 | Question: 10
How many 1’s are present in the binary representation of 3 × 512 + 7 × 64 + 5 × 8 + 3 (A) 8 (B) 9 (C) 10 (D) 11
How many 1’s are present in the binary representation of 3 × 512 + 7 × 64 + 5 × 8 + 3(A) 8(B) 9(C) 10(D) 11
1.2k
views
answered
Sep 16, 2017
Digital Logic
ugcnetcse-dec2009-paper2
digital-logic
number-representation
+
–
3
votes
163
ideal CPU memory
Consider a CPU that executes at a clock rate of 200MHZ(5ns per cycle)with a single level of cache .CPI execution (i.e) CPI with ideal memory is 1.1.Instruction mix are 50% arithmetic/logical ,30% load/store , 20% control instructions.Assume cache miss rate is 15%and a miss penalty of 5 cycles.The number of times CPU with ideal memory is faster when no miss occurs
Consider a CPU that executes at a clock rate of 200MHZ(5ns per cycle)with a single level of cache .CPI execution (i.e) CPI with ideal memory is 1.1.Instruction mix are 50...
1.3k
views
answered
Sep 16, 2017
3
votes
164
speed up gain
Consider the cache memory which is 30 times fasterthan main memory and it uses 90% of the total time. The speed up gain of cache memory ( in 2 decimal places)
Consider the cache memory which is 30 times fasterthan main memory and it uses 90% of the total time. The speed up gain of cache memory ( in 2 decimal places)
2.1k
views
answered
Sep 16, 2017
2
votes
165
Hit latencies
Consider two cache organisations.The first is 64KB 4 way associative with 64 byte block size.The second one is 64KB direct mapped cache.The size of address is 32 bits in both organisation.A 4 *1 MUX has latency of 0.8nsec which k bit comparator has latency of k/5 nsec.The difference between the hit latencies of both cache organisation
Consider two cache organisations.The first is 64KB 4 way associative with 64 byte block size.The second one is 64KB direct mapped cache.The size of address is 32 bits in ...
328
views
answered
Sep 16, 2017
1
votes
166
Probability doubt
A box contains 3 coins: two regular coins and one fake two headed P(H )= 1 .you pick up one at random and toss it and gets heads.the probability that it is a two headed coin is....
A box contains 3 coins: two regular coins and one fake two headed P(H )= 1 .you pick up one at random and toss it and gets heads.the probability that it is a two headed c...
3.1k
views
answered
Sep 16, 2017
2
votes
167
GATE 2017 MA
ANSWER GIVEN IS 4
ANSWER GIVEN IS 4
164
views
answered
Sep 16, 2017
3
votes
168
Mathematics: GATE 2017 MA
ANSWER GIVEN IS 0.27-0.37
ANSWER GIVEN IS 0.27-0.37
380
views
answered
Sep 16, 2017
Probability
discrete-probability
difficult
gate2017-ma
+
–
1
votes
169
GATE 2012 MA
ANSWER GIVEN 0.73-0.77
ANSWER GIVEN 0.73-0.77
294
views
answered
Sep 16, 2017
11
votes
170
control word and control address register
Consider a CPU where all the instructions require 6 clock cycles to complete their execution.Under the instruction set there are 215 instructions and a total of 125 control signalsare needed to be generated by the control unit.While ... field format is used for branch control logic.What is thhe minimum size of control word and control address register
Consider a CPU where all the instructions require 6 clock cycles to complete their execution.Under the instruction set there are 215 instructions and a total of 125 contr...
10.6k
views
answered
Sep 15, 2017
2
votes
171
bits to encode
Assume that there are 251 different opcode and 32 registers in the machine.Every instruction has 3 register as input and 1 register as output[opcode , R1 , R2 , R3 , R4].The number of bits to encode an instruction
Assume that there are 251 different opcode and 32 registers in the machine.Every instruction has 3 register as input and 1 register as output[opcode , R1 , R2 , R3 , R4]....
499
views
answered
Sep 15, 2017
2
votes
172
GATE 2015 MA
1.0k
views
answered
Sep 15, 2017
2
votes
173
GATE 2016 MA
THE GIVEN ANSWER KEY IS 0.65 to 0.71 I AM GETTING 0.40...
THE GIVEN ANSWER KEY IS 0.65 to 0.71 I AM GETTING 0.40...
294
views
answered
Sep 15, 2017
2
votes
174
Show the approach
Recurrence: $T\left ( n \right )\leq T\left ( \frac{n}{5} \right )+T\left ( \frac{7n}{10} \right )+\Theta \left ( n \right )$
Recurrence:$T\left ( n \right )\leq T\left ( \frac{n}{5} \right )+T\left ( \frac{7n}{10} \right )+\Theta \left ( n \right )$
375
views
answered
Sep 15, 2017
Algorithms
algorithms
recurrence-relation
+
–
13
votes
175
AVL tree
State If True or False. Give reason too Inserting in an AVL tree with n nodes requires $\Theta \left ( \log n \right )$ rotations
State If True or False. Give reason tooInserting in an AVL tree with n nodes requires $\Theta \left ( \log n \right )$ rotations
943
views
answered
Sep 15, 2017
DS
data-structures
avl-tree
true-false
+
–
3
votes
176
er diagram
2.6k
views
answered
Sep 14, 2017
Databases
databases
er-diagram
er-to-relational
+
–
10
votes
177
graph
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will become disconnected
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will bec...
3.7k
views
answered
Sep 14, 2017
4
votes
178
number of strings
COnsider a string of lngth 10 containing only 0 and 1 the number of strings containg exactly 3 0's or 3 1's is ____________
COnsider a string of lngth 10 containing only 0 and 1the number of strings containg exactly 3 0's or 3 1's is ____________
170
views
answered
Sep 14, 2017
3
votes
179
Self Doubt
If a language L is Context Free Language then what can we say about $L^-$ (Complement of L): 1. It is surely not Context Free Language? 2.It may or may not be Context Free Language?
If a language L is Context Free Language then what can we say about $L^-$ (Complement of L):1. It is surely not Context Free Language?2.It may or may not be Context Free ...
329
views
answered
Sep 14, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
1
votes
180
P & C doubt
Vijay wrote 4 different letter to send to 4 different addresses .for each letter, he prepared one envelope with its correct address. if the four letters are to be put into 4 envelopes at random in how many ways can we put the letters so that only two of the letter goes to the right envelope? 2 4 1 6
Vijay wrote 4 different letter to send to 4 different addresses .for each letter, he prepared one envelope with its correct address. if the four letters are to be put in...
204
views
answered
Sep 14, 2017
7
votes
181
relational algebra
1)retrieve all name of all employees whose salary is more than minimum salary 2)retrieve all name of all employees from all departments 3)retrieve all name of all employees from all who are working in works d) retrieve zero rows
1)retrieve all name of all employees whose salary is more than minimum salary2)retrieve all name of all employees from all departments3)retrieve all name of all employees...
518
views
answered
Sep 14, 2017
Databases
relational-algebra
+
–
2
votes
182
foreign key
567
views
answered
Sep 14, 2017
Databases
foreign
keys
+
–
4
votes
183
MadeEasy Subject Test: CO & Architecture - Conflict Misses
A computer system contains a main memory of 32 K size with 16-bit words. It also has a 4 K word cache divided into 4 slot sets with 64 words per slot. Assume that the cache is initially empty. The processor fetches ... ...4351 in that order repeatedly 10 times. Assume a LRU policy for block replacement. How many miss operations will occur?
A computer system contains a main memory of 32 K size with 16-bit words. It also has a 4 K word cache divided into 4 slot sets with 64 words per slot. Assume that the cac...
1.0k
views
answered
Sep 14, 2017
CO and Architecture
made-easy-test-series
co-and-architecture
conflict-misses
+
–
3
votes
184
Propositional Logic
Can someone please check if my solution is correct?
Can someone please check if my solution is correct?
645
views
answered
Sep 13, 2017
Mathematical Logic
propositional-logic
discrete-mathematics
first-order-logic
mathematical-logic
+
–
5
votes
185
GRAPH THEORY
maximum number of edges in a simple planar graph with 10 vertices which contains no triangle is?
maximum number of edges in a simple planar graph with 10 vertices which contains no triangle is?
815
views
answered
Sep 13, 2017
0
votes
186
theory of computation
EQ(P1,P2)={<P1,P2>∣P1 and P2 are pushdown automata such that L(P1)=L(P2)} EQN(D1,D2)={<D1,D2>∣D1 and D2 are DFAs such that |L(D1)|=|L(D2)|} Which of the following is correct? A. EQ(P1,P2) is decidable but EQN(D1,D2) is not B. EQN(D1, ... decidable but EQ(P1,P2) is not C. Both EQ(P1,P2) and EQN(D1,D2) are decidable D. Both EQ(P1,P2) and EQN(D1,D2) are not decidable
EQ(P1,P2)={<P1,P2>∣P1 and P2 are pushdown automata such that L(P1)=L(P2)} EQN(D1,D2)={<D1,D2>∣D1 and D2 are DFAs such that |L(D1)|=|L(D2)|}Which of the following is c...
982
views
answered
Sep 12, 2017
5
votes
187
probability
Suppose 3 dice are rolled. the probability that sum of the numbers of the dice is 10 is ____________
Suppose 3 dice are rolled. the probability that sum of the numbers of the dice is 10 is ____________
785
views
answered
Sep 11, 2017
2
votes
188
bipartite graph
a)G={V,E} be bipartite graph and vertex partition V={V1, V2} if suppose number of vertices in V1 is 3 and V2 is 4 then number of bipartite graphs from V1 to V2 is ____________ b)G={V,E} be bipartite graph and vertex partition V={V1, V2} if suppose number of vertices in V1 is 3 and V2 is 4 then number of complete bipartite graphs from V1 to V2 is ____________
a)G={V,E} be bipartite graph and vertex partition V={V1, V2} if suppose number of vertices in V1 is 3 and V2 is 4 then number of bipartite graphs from V1 to V2 is _______...
3.0k
views
answered
Sep 11, 2017
1
votes
189
Data types and sizes
714
views
answered
Sep 10, 2017
Programming in C
non-gate
+
–
2
votes
190
Boolean Algebra
Could someone solve this, i think i am making some mistake
Could someone solve this, i think i am making some mistake
309
views
answered
Sep 10, 2017
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register