Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User 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 ?
commented
in
Verbal Aptitude
Feb 3, 2019
1.2k
views
1
answer
2
GATE2019
Answer for Minimum no of nor gates question
commented
in
Digital Logic
Feb 3, 2019
2.0k
views
0
answers
3
Last question please
Why they are not multiplying H1 with T1 And H2 with T2?? please clarify this ASAp
commented
in
Operating System
Feb 2, 2019
395
views
2
answers
4
made easy test series
please provide a detailed solution
commented
in
CO and Architecture
Feb 1, 2019
603
views
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 ……...
commented
in
Databases
Jan 28, 2019
707
views
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
commented
in
CO and Architecture
Jan 28, 2019
1.0k
views
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).
commented
in
DS
Jan 27, 2019
1.8k
views
0
answers
8
made easy test series
commented
in
Operating System
Jan 26, 2019
405
views
0
answers
9
made easy test series
What is the number of generators in a group G, such that Ο(G) = 87?
commented
in
Set Theory & Algebra
Jan 26, 2019
1.2k
views
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.
answered
in
Revision
Jan 26, 2019
4.1k
views
mistakes
preparation
2
answers
11
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
commented
in
Algorithms
Jan 26, 2019
703
views
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?
commented
in
Computer Networks
Jan 25, 2019
319
views
computer-networks
1
answer
13
#Combinatorics
commented
in
Combinatory
Jan 24, 2019
453
views
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 ________.
commented
in
Operating System
Jan 24, 2019
671
views
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?
commented
in
Theory of Computation
Jan 22, 2019
684
views
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)
commented
in
CO and Architecture
Jan 21, 2019
378
views
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?
commented
in
Mathematical Logic
Jan 21, 2019
3.9k
views
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
commented
in
Databases
Jan 19, 2019
490
views
databases
4
answers
19
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
commented
in
Databases
Jan 18, 2019
2.3k
views
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.
commented
in
Theory of Computation
Jan 18, 2019
3.3k
views
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?
commented
in
Computer Networks
Jan 18, 2019
1.2k
views
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?
commented
in
Algorithms
Jan 18, 2019
1.3k
views
algorithms
time-complexity
algorithm-design
0
answers
23
ME mock test
Why option A is wrong?
commented
in
Digital Logic
Jan 18, 2019
230
views
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 ?
commented
in
Databases
Jan 16, 2019
215
views
0
answers
25
made easy test series
The output of the program if dynamic scoping is used__?
commented
in
Programming in C
Jan 14, 2019
544
views
0
answers
26
MadeEasy Test Series: Theory of Computation- Indentify Class Language
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
commented
in
Theory of Computation
Jan 13, 2019
640
views
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._
commented
in
Combinatory
Jan 9, 2019
466
views
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)$
commented
in
Algorithms
Jan 9, 2019
20.2k
views
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$
answered
in
Computer Networks
Jan 6, 2019
589
views
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 ?
commented
in
Combinatory
Jan 3, 2019
722
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...