Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
gauravkc
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by gauravkc
1
answer
1
gate dummy question
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
1.2k
views
commented
Feb 3, 2019
1
answer
2
GATE2019
Answer for Minimum no of nor gates question
Answer for Minimum no of nor gates question
1.9k
views
commented
Feb 3, 2019
0
answers
3
Last question please
Why they are not multiplying H1 with T1 And H2 with T2?? please clarify this ASAp
Why they are not multiplying H1 with T1 And H2 with T2??please clarify this ASAp
371
views
commented
Feb 2, 2019
2
answers
4
made easy test series
please provide a detailed solution
please provide a detailed solution
567
views
commented
Feb 1, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
1
answer
5
Relation algebra Query
Consider the following relation and instance of relation: Supply(sid,Sname) #sid is key Parts(pid,Pname,Pcolor) #pid is the key Catalog(sid,pid) #sid,pid is the key Number of tuples returned by the above Query is ……...
Consider the following relation and instance of relation:Supply(sid,Sname) #sid is keyParts(pid,Pname,Pcolor) #pid is the keyCatalog(sid,pid) #sid,pid is the keyNumber...
665
views
commented
Jan 28, 2019
Databases
databases
relational-algebra
made-easy-test-series
+
–
1
answer
6
Cache Organization
Can any one help me out with this question : This was asked in MadeEasy CBT held on 23rd jan
Can any one help me out with this question :This was asked in MadeEasy CBT held on 23rd jan
986
views
commented
Jan 28, 2019
CO and Architecture
cache-memory
co-and-architecture
effective-memory-access
+
–
1
answer
7
made easy test
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from stack at 3rd position are _______ (assume one element enter in stack only one time).
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from s...
1.7k
views
commented
Jan 27, 2019
0
answers
8
made easy test series
377
views
commented
Jan 26, 2019
0
answers
9
made easy test series
What is the number of generators in a group G, such that Ο(G) = 87?
What is the number of generators in a group G, such that Ο(G) = 87?
1.1k
views
commented
Jan 26, 2019
9
answers
10
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question - our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones.Missing the “...
4.0k
views
answered
Jan 26, 2019
Revision
mistakes
preparation
+
–
2
answers
11
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
673
views
commented
Jan 26, 2019
Algorithms
graph-algorithm
dijkstras-algorithm
programming-in-c
made-easy-test-series
+
–
0
answers
12
TestBook_FLT
Frames of 20000Bytes are sent over a 10Megabytes per second duplex link between two hosts.Propagation time is 45ms(One-way). Suppose that the sliding window protocol is used with the sender window size of 16 and acknowledgements are always piggybacked.After sending 35 frames, what is the minimum time the sender will have to wait before starting transmission of next frame?
Frames of 20000Bytes are sent over a 10Megabytes per second duplex link between two hosts.Propagation time is 45ms(One-way).Suppose that the sliding window protocol is us...
315
views
commented
Jan 25, 2019
Computer Networks
computer-networks
+
–
1
answer
13
#Combinatorics
414
views
commented
Jan 24, 2019
0
answers
14
Made Easy CBT
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8 KB, page table entry contain 1 valid bit, 2 protection bit and 1 reference bit. Then the approximate page table size in (MB) is ________.
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8KB, page table entry contain 1 valid bit, 2 protection bit and ...
625
views
commented
Jan 24, 2019
Operating System
operating-system
paging
virtual-memory
+
–
0
answers
15
Decidability
Consider the following language over $\sum=\{0,1\}$ $L=\{<M>|$ M is a turing machine that accepts all strings of length atmost 5 $\}$ Since, this is a non-trivial property of TM, so surely it is undecidable. Now, Applying Rice’s Theorem part 2, $T_{yes}=\{0,1\}$ and $T_{no}=\sum^*$ and $T_{yes} \subset T_{no}$ so this is NOT RE. Have I correctly applied property 2?
Consider the following language over $\sum=\{0,1\}$$L=\{<M>|$ M is a turing machine that accepts all strings of length atmost 5 $\}$Since, this is a non-trivial property ...
661
views
commented
Jan 22, 2019
Theory of Computation
decidability
theory-of-computation
+
–
0
answers
16
ME TEST
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is_____ 100,108, 114 ... what will be the address partition look like. 1. tag(7) set(1) offset(4) 2. tag(7) set(1) offset(2)
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main ...
364
views
commented
Jan 21, 2019
CO and Architecture
co-and-architecture
cache-memory
least-recently-used
+
–
3
answers
17
probability
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
3.8k
views
commented
Jan 21, 2019
Mathematical Logic
probability
engineering-mathematics
conditional-probability
random-variable
+
–
1
answer
18
Database
minimum no fo relation require for this ER diagram i am thinking 3 relation but given answer is______something else
minimum no fo relation require for this ER diagrami am thinking 3 relation but given answer is______something else
458
views
commented
Jan 19, 2019
Databases
databases
+
–
4
answers
19
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
how many view equivalent schedules are possible for the Sch given below:
2.3k
views
commented
Jan 18, 2019
Databases
databases
view-serializable
transaction-and-concurrency
+
–
2
answers
20
made easy test series
Consider the following language:? L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’} Is L regular? If so, please provide a DFA for L.
Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...
3.2k
views
commented
Jan 18, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
0
answers
21
Made Easy Mock
In the given network system, station A needs to send a payload of 1600B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is?
In the given network system, station A needs to send a payload of 1600B from its network layer to station B. If fragmentation is done, then the actual data size to be tra...
1.1k
views
commented
Jan 18, 2019
1
answer
22
Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n)O(n log n)O(n)^2O(n^2 log n)The an...
1.2k
views
commented
Jan 18, 2019
Algorithms
algorithms
time-complexity
algorithm-design
+
–
0
answers
23
ME mock test
Why option A is wrong?
Why option A is wrong?
217
views
commented
Jan 18, 2019
0
answers
24
Self Doubt
Can a tuple in unary-relationship set be in relation with itself. For example, take a tuple T1 in an entity E1 and this entity E1 is related to itself. Now can the Tuple T1 be in relation to tuple T1 ?
Can a tuple in unary-relationship set be in relation with itself. For example, take a tuple T1 in an entity E1 and this entity E1 is related to itself. Now can the Tuple ...
203
views
commented
Jan 16, 2019
0
answers
25
made easy test series
The output of the program if dynamic scoping is used__?
The output of the program if dynamic scoping is used__?
495
views
commented
Jan 14, 2019
0
answers
26
MadeEasy Test Series: Theory of Computation- Indentify Class Language
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
591
views
commented
Jan 13, 2019
Theory of Computation
regular-language
theory-of-computation
made-easy-test-series
+
–
0
answers
27
APPLIED-COURSE-MOCKTEST-2
How many 5 digit numbers can be formed if either (a) every successive digit exceeds its predecessor ,or (b) every successive digit is smaller than it’s predecessor Note:leading 0’s don’t count ,like 04521 is not a 5-digit number._
How many 5 digit numbers can be formed if either (a) every successive digit exceeds its predecessor ,or(b) every successive digit is smaller than it’s predecessor Note:...
459
views
commented
Jan 9, 2019
13
answers
28
GATE CSE 2004 | Question: 82
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if ( ... The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program...
20.0k
views
commented
Jan 9, 2019
Algorithms
gatecse-2004
algorithms
time-complexity
normal
+
–
1
answer
29
Testbook Test Series: Computer Networks - Stop And Wait
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What will be the link utilization (%) if a probability of single frame error is $0.001?$ $\text{Note – Here Frame size is 8000 K- bits i.e 8}*10^6 \ bits$
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What ...
577
views
answered
Jan 6, 2019
Computer Networks
testbook-test-series
computer-networks
stop-and-wait
+
–
1
answer
30
raman classes
In an examination of 9 papers a candidate has to pass in more papers than the number of papers in which he fails in order to be successful.the number of ways in which he can be unsuccesful is ?
In an examination of 9 papers a candidate has to pass in more papers than the number of papers in which he fails in order to be successful.the number of ways in which he ...
691
views
commented
Jan 3, 2019
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register