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
Recent activity by adeebafatima1
1
answer
1
Engineering Mathematics - Discrete Mathematics
Every satisfiable propositional formula is not tautology. True/False
Every satisfiable propositional formula is not tautology.True/False
1.1k
views
edited
Mar 14, 2019
Mathematical Logic
discrete-mathematics
propositional-logic
mathematical-logic
+
–
0
answers
2
SudoGate Test Series - Virtual Memory
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 level of paging is applied. i am getting 270 ns
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 l...
608
views
retagged
Mar 14, 2019
Operating System
operating-system
translation-lookaside-buffer
virtual-memory
+
–
1
answer
3
Theory of computation - Grammer
here answer is given is A won''t it be B? as with A we cannot get 100 string,but with B we can
here answer is given is A won''t it be B?as with A we cannot get 100 string,but with B we can
364
views
edited
Mar 14, 2019
Theory of Computation
theory-of-computation
grammar
+
–
2
answers
4
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these
which of the following cannot be solved using masters theorem?a) T(n) = 2T(n/2) + n/lognb) T(n) = 2T(n/2) + lognc)T(n)=T(n/2)+lognd) non of these
2.1k
views
edited
Mar 14, 2019
Algorithms
made-easy-test-series
recurrence-relation
master-theorem
+
–
0
answers
5
Computer Networks - Csma Cd
If CSMA transmits 8 stations network data in single channel whats is the chip code for station 5 {Assume that W1=[+1]} how to solve it solution given is. 1111-1-1-1-1.
If CSMA transmits 8 stations network data in single channel whats is the chip code for station 5 {Assume that W1=[+1]}how to solve itsolution given is. 1111-1-1-1-1.
285
views
edited
Mar 14, 2019
Computer Networks
computer-networks
csma-cd
+
–
1
answer
6
AceTestSeries: Operating System - Process Schedule
746
views
edited
Mar 14, 2019
Operating System
operating-system
process-scheduling
+
–
1
answer
7
MadeEasy Test Series: Digital Logic - Multiplexer
please explain how to start solving such circuital questions..I always get confused..plzz help someone asap. What will be the final output?
please explain how to start solving such circuital questions..I always get confused..plzz help someone asap.What will be the final output?
932
views
retagged
Mar 14, 2019
Digital Logic
made-easy-test-series
digital-logic
decoder
multiplexer
+
–
0
answers
8
Databases - Superkeys
How to calculate super key of any relation? Pls explain with example.
How to calculate super key of any relation?Pls explain with example.
368
views
edited
Mar 14, 2019
Databases
databases
superkeys
+
–
0
answers
9
MadeEasy Workbook: Algorithms - Graph Algorithms
Approach for Q8 and Q9 please
Approach for Q8 and Q9 please
481
views
edited
Mar 14, 2019
Algorithms
algorithms
graph-algorithms
+
–
0
answers
10
Digital Logic - Min Sum Of Products Form
What is the minimum SOP expression for the following f(a,b,c,d) = Σm(8, 10, 11, 12, 13, 15) + Σd(7, 9 , 14)? I’m getting only “a” as the answer, but the answer given is “a + bcd”. My doubt – the “Dont care term” generating the expression “bcd” is NOT necessary, and it is NOT considered as an Essential Prime Implicant. Please correct if I’m wrong
What is the minimum SOP expression for the followingf(a,b,c,d) = Σm(8, 10, 11, 12, 13, 15) + Σd(7, 9 , 14)?I’m getting only “a” as the answer, but the answer give...
488
views
edited
Mar 14, 2019
Digital Logic
digital-logic
min-sum-of-products-form
+
–
2
answers
11
Programming & DS - Binary Tree
Whats wrong with option B? Give an example?
Whats wrong with option B?Give an example?
691
views
recategorized
Mar 14, 2019
DS
data-structures
binary-tree
+
–
1
answer
12
Dennis Ritchie Doubt
Lines from Dennis Ritchie 1) The variables named in a structure are called members. A structure member or tag and an ordinary (i.e., non-member) variable can have the same name without conflict, since they can always be distinguished by context. ... p1;} Here p2 is only not copying inside p1 and also incrementing value How copying and incrementing done same time in structures?
Lines from Dennis Ritchie1)The variables named in a structure are called members. A structure member or tag and an ordinary (i.e., non-member) variable can have the same ...
548
views
retagged
Mar 14, 2019
Programming in C
programming-in-c
structure
+
–
1
answer
13
General Topic Doubt <Operating System>:<Schaum's PDF>
Does anybody have pdf of Schaum's Outline of Operating System?
Does anybody have pdf of Schaum's Outline of Operating System?
3.6k
views
recategorized
Mar 14, 2019
Study Resources
operating-system
study-resources
+
–
1
answer
14
MadeEasy Workbook: Engineering Mathematics - Eigen value
Let $A$ be a $3\times 3$ matrix with Eigen values $-1,1,0$.Then $\mid A^{100}+I\mid$ is...
Let $A$ be a $3\times 3$ matrix with Eigen values $-1,1,0$.Then $\mid A^{100}+I\mid$ is...
692
views
edited
Mar 14, 2019
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
0
answers
15
AceTestSeries: Programming & DS - Programming in C
301
views
edited
Mar 14, 2019
Programming in C
programming-in-c
programming
pointers
+
–
4
answers
16
AceTestSeries 2018: Computer Networks - Network Switching
Consider a packet switched network the propagation delay is 20 msec per hop and the packet size is 1000 bits and the data rate is 52 kbps. assuming all packet follow the same 4 hop path, then the delay in sending an 100000 bit message is________
Consider a packet switched network the propagation delay is 20 msec per hop and the packet size is 1000 bits and thedata rate is 52 kbps. assuming all packet follow the ...
1.1k
views
edited
Mar 14, 2019
Computer Networks
ace-test-series
computer-networks
network-switching
+
–
0
answers
17
Pure ALOHA
I have done the calculations as shown below but I do not know if my approach is correct. I would appreciate if I get some feedback Part 1 Consider a network based on pure ALOHA with Poisson distributed traffic. If the success probability is equal to P ... channel if there are 50, 500, and 5000 terminals connected? Calculate the throughput of the network for the given number of terminals.
I have done the calculations as shown below but I do not know if my approach is correct. I would appreciate if I get some feedbackPart 1Consider a network based on pure A...
4.5k
views
retagged
Mar 14, 2019
Computer Networks
computer-networks
pure-aloha
throughput
+
–
3
answers
18
Theory of Computation - Finite Automata
Can someone please help me understand these two points about minimum DFA and Minimum NFA, thank you
Can someone please help me understand these two points about minimum DFA and Minimum NFA, thank you
561
views
edited
Mar 14, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
19
Multi Processing OS
In Multi Processing OS Maximum CPU Utilization can be achieved. Maximum throughput is achieved. which of the following is true ? a) 1 only b) 2 only c) both d) none ANS - A) 2 only Please explain it ?
In Multi Processing OSMaximum CPU Utilization can be achieved.Maximum throughput is achieved.which of the following is true ?a) 1 only b) 2 only c) both d) noneANS - A...
1.5k
views
retagged
Mar 14, 2019
Operating System
operating-system
multi-processing-os
throughput
+
–
1
answer
20
galvin os
explain answer c and e.
explain answer c and e.
911
views
retagged
Mar 14, 2019
Operating System
operating-system
segmentation
+
–
1
answer
21
Algorithms - Matrix Chain Ordering
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
520
views
edited
Mar 14, 2019
Algorithms
algorithms
matrix-chain-ordering
+
–
0
answers
22
General Topic Doubt <CO & Architecture>:<solution-manual>
Greetings gate aspirants!..Does anyone have computer architecture--carl hamacher 5th edition or solution manual to 6th edition?...I am having the book of 6th edition and I was able to get a manual of 5th edition.Question no and solutions not tagging hence not able to match anwsers..Please forward me link if you know...thanks
Greetings gate aspirants!..Does anyone have computer architecture carl hamacher 5th edition or solution manual to 6th edition?...I am having the book of 6th edition and I...
376
views
edited
Mar 14, 2019
Study Resources
co-and-architecture
carl-hamacher
solution-manual
+
–
1
answer
23
MadeEasy Subject Test: Programming & DS - Programming in C
965
views
edited
Mar 14, 2019
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
2
answers
24
Theory of computation - Closure Property
Cfl is closed under intersection with regular language. Then resultant languages will be regular or cfl ? Let X is cfl Y is regular language L=X intersection Y Then L is what?
Cfl is closed under intersection with regular language.Then resultant languages will be regular or cfl ?Let X is cflY is regular language L=X intersection YThen L is what...
595
views
edited
Mar 14, 2019
Theory of Computation
theory-of-computation
closure-property
+
–
0
answers
25
Finding cache size for virtually indexed physically addressed cache
231
views
retagged
Mar 14, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
2
answers
26
Operating System: Fork
A process executes the following segment of code: int main() { fork(); fork() && fork(); } The number of new processes created is __________ Can someone pls explain me the solution
A process executes the following segment of code:int main() { fork(); fork() && fork();}The number of new processes created is __________Can someone pls explain...
1.8k
views
edited
Mar 14, 2019
Operating System
operating-system
fork-system-call
+
–
3
answers
27
#madenotes
A B C 1 1 1 1 1 0 2 3 2 2 3 2 FIND NON-TRIVIAL DEPENDENCY
ABC111110232232 FIND NON-TRIVIAL DEPENDENCY
486
views
edited
Mar 14, 2019
Databases
database-normalization
+
–
1
answer
28
KORTH
T1 T2 T3 W(X) R(X) W(Y) W(X) R(Y) W(X) W(X) W(Y) W(X) W(Y) R(X) W(X) R(Y) W(Y) Number of blind write in given schedule
T1T2T3W(X) R(X) W(Y) W(X) R(Y) W(X) W(X) W(Y) W(X) W(Y) R(X) W(X) R(Y) W(Y) Number of blind write in given schedule
260
views
retagged
Mar 14, 2019
Databases
databases
transaction-and-concurrency
+
–
0
answers
29
General Topic Doubt Aptitude Verbal Ability
How to prepare Verbal ability in a short span of time for Gate 2018? Please give some suggestion and if u have some (or u know about) video lectures or websites, Plz share the link. It will be helpful for all gate aspirants.
How to prepare Verbal ability in a short span of time for Gate 2018? Please give some suggestion and if u have some (or u know about) video lectures or websites, Plz shar...
279
views
recategorized
Mar 14, 2019
Study Resources
verbal-aptitude
general
+
–
1
answer
30
No of strings of fixed length possible with a given grammar
What is the number of terminal string of length <= 6 generated by the CFG shown below? S -> 0A1 A -> BB1/B B ->A/0/1 Do you have any semantic method to solve such questions based on some pattern that can ... question it is 6,quite simple to derive but I am wondering what if it had been asked no of strings of length n Thanks
What is the number of terminal string of length <= 6 generated by the CFG shown below?S - 0A1A - BB1/BB ->A/0/1Do you have any semantic method to solve such questions bas...
380
views
edited
Mar 14, 2019
Theory of Computation
theory-of-computation
context-free-grammar
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register