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 Habibkhan
1
votes
391
MadeEasy Test Series: Algorithms - Time Complexity
#plz check??
#plz check??
765
views
answered
Dec 11, 2016
Algorithms
made-easy-test-series
algorithms
graph-algorithms
time-complexity
+
–
0
votes
392
DataStructure Hasing-No of Comparisons needed to insert an element
224
views
answered
Dec 11, 2016
5
votes
393
Parsers Complexity
1.2k
views
answered
Dec 11, 2016
Compiler Design
compiler-design
parsing
+
–
0
votes
394
comparison
Does insertion sort always better than selection sort?
Does insertion sort always better than selection sort?
361
views
answered
Dec 11, 2016
Algorithms
algorithms
sorting
+
–
30
votes
395
Expanding opcode technique
A CPU is designed to have 58 three-address instructions and 25 two-address instructions. The CPU is able to address a maximum of 16 memory locations. The length of machine code is the same for all instructions. If the list of the ... of twoaddress instructions iv) Determine the length of the machine code v) List the machine codes Detailed explanation would be helpful
A CPU is designed to have 58 three-address instructions and 25 two-address instructions. The CPU is able to address a maximum of 16 memory locations. The length of machin...
11.0k
views
answered
Dec 10, 2016
CO and Architecture
co-and-architecture
machine-instruction
+
–
7
votes
396
counting
how many number are possible of 4 digits whose sum is 12.
how many number are possible of 4 digits whose sum is 12.
1.5k
views
answered
Dec 10, 2016
Combinatory
discrete-mathematics
+
–
2
votes
397
operating system
A system has 32 bit Virtual adress and 8KB page size.main memory is 128 MB..the size of page table, when page table ,when pt entry has 1 valid bit 1 modified bit and frame bits is_____(MB) p.s what is frame bits..is it the frame entry size?
A system has 32 bit Virtual adress and 8KB page size.main memory is 128 MB..the size of page table, when page table ,when pt entry has 1 valid bit 1 modified bit and fram...
1.9k
views
answered
Dec 10, 2016
12
votes
398
TOC-Linear Grammar
1.3k
views
answered
Dec 10, 2016
Theory of Computation
theory-of-computation
linear
grammar
+
–
22
votes
399
MadeEasy Test Series: CO & Architecture - Cache Memory
Suppose that in 250 memory references there are 30 misses in first level cache and 10 misses in second level cache. Assume that miss penalty from L$_2$ cache memory are 50 cycles. The hit time of L$_2$ cache is 10 cycles. The ... with given misses = 1800 stall cycles = 1800-1250 = 550 number of stalls/instruction= 550/200 = 2.75 please verify
Suppose that in 250 memory references there are 30 misses in first level cache and 10 misses in second level cache. Assume that miss penalty from L$_2$ cache memory are 5...
3.9k
views
answered
Dec 9, 2016
CO and Architecture
made-easy-test-series
co-and-architecture
cache-memory
+
–
4
votes
400
trees
629
views
answered
Dec 9, 2016
DS
binary-tree
+
–
2
votes
401
GF TOC Assessment test
393
views
answered
Dec 9, 2016
Theory of Computation
gateforum-test-series
theory-of-computation
closure-property
identify-class-language
+
–
3
votes
402
Lossy join decomposition
1.4k
views
answered
Dec 9, 2016
Databases
databases
database-normalization
decomposition
+
–
4
votes
403
cobinatory
Caption
Caption
620
views
answered
Dec 9, 2016
Mathematical Logic
engineering-mathematics
+
–
6
votes
404
MadeEasy Test Series: Theory Of Computation - Decidability
@arjun sir please help how is it recognizable?
@arjun sir please helphow is it recognizable?
1.9k
views
answered
Dec 8, 2016
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
3
votes
405
MadeEasy Test Series: Probability
we need to see that max number among all selected coupons shud be 9 they said its (9/15)^7 but i think its 7C1 (1/15)(9/15)^6 please verify
we need to see that max number among all selected coupons shud be 9they said its (9/15)^7but i think its 7C1 (1/15)(9/15)^6please verify
431
views
answered
Dec 8, 2016
Probability
made-easy-test-series
probability
+
–
6
votes
406
Virtual Gate Test Series: Theory Of Computation - Regular Languages
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$ Note$:-$ $aba ∈ L $since $'aba'$ contains $1$ occurrence of $'ab'$ and $1$ occurrence of $'ba'$ but $ abab ∉ L$
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$Note$:-$ $aba ∈ L $since $'a...
4.3k
views
answered
Dec 8, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-language
virtual-gate-test-series
+
–
2
votes
407
Which of the following features cannot be captured by CFG?
Which of the following features cannot be captured by CFG? Syntax of if - then – else statements Whether a variable is declared before its use Syntax of recursive procedures Matching nested parenthesis pls explain about first option.how is it CFG possible??
Which of the following features cannot be captured by CFG? Syntax of if - then – else statements Whether a variable is declared before its use Syntax of recursive pr...
3.4k
views
answered
Dec 8, 2016
Theory of Computation
compiler-design
theory-of-computation
context-free-language
+
–
3
votes
408
COA part 2 Madeeasy test q13
what is speed up?
what is speed up?
506
views
answered
Dec 7, 2016
0
votes
409
#digitalCircuit
how it works??
how it works??
1.8k
views
answered
Dec 7, 2016
2
votes
410
ME test series
Suppose that the partition algorithm of quick sort always produce a 9-to-1 proportional split. Then the Running time of algorithm over an unsorted array of n-elements is ____________________? a) O(n2) b) O(nlogn) c) O(n) d) None
Suppose that the partition algorithm of quick sort always produce a 9-to-1 proportional split. Then the Running time of algorithm over an unsorted array of n-elements is ...
2.3k
views
answered
Dec 7, 2016
Algorithms
made-easy-test-series
quick-sort
time-complexity
+
–
2
votes
411
PDA membership
666
views
answered
Dec 7, 2016
1
votes
412
virtual gate
314
views
answered
Dec 7, 2016
0
votes
413
databases
418
views
answered
Dec 6, 2016
3
votes
414
Calicut Gate Academy Test Series | DAA Time complexity Q2
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;
466
views
answered
Dec 6, 2016
Algorithms
test-series
gate-academy-test-series
algorithms
time-complexity
+
–
Page:
« prev
1
...
9
10
11
12
13
14
15
16
17
18
19
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
