Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions without answers
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
0
votes
0
answers
Gate overflow book
I am having a confusion in precedence order of logical operators. For e.g. consider the expression (a ∧ b) → (a ∧ c) ∨ d. Then how is the expression evaluated? Like is it ((a ∧ b) → (a ∧ c)) ∨ d or (a ∧ b) →((a ∧ c) ∨ d)? ... than implication, so the second one should be correct. But from the solution, I see it is the first one. Link to the question: https://gateoverflow.in/654
asked
10 hours
ago
in
Mathematical Logic
by
hadarsh
(
5
points)

7
views
discretemaths
0
votes
0
answers
An introduction to formal languages and automata peter linz
asked
22 hours
ago
in
Theory of Computation
by
kirtipurohit
(
5
points)

17
views
toclanguages
peterlinz
grammar
dfas
nfadfa
0
votes
0
answers
#algorithm #kruskal's algo
What is minimum separator lemma?
asked
22 hours
ago
in
Algorithms
by
Allica
(
13
points)

5
views
algorithms
0
votes
0
answers
Self doubt in instruction execution cycle /(CO) computer organization
asked
1 day
ago
in
CO & Architecture
by
Kavya sharma
(
11
points)

10
views
selfdoubt
0
votes
0
answers
GATE 2001 DBMS
Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length? A List of all vertices adjacent to a given vertex B ... of less than three vertices D List all vertices reachable from a given vertex *Please elaborate all the solutions of this question.
asked
1 day
ago
in
Databases
by
donniedarko
(
21
points)

10
views
databases
0
votes
0
answers
Directed Acyclic Graph in CD
Can anyone provide me good reference for solving Directed Acyclic Graphs(DAG) problems?
asked
1 day
ago
in
Compiler Design
by
nikhil856
(
13
points)

6
views
selfdoubt
0
votes
0
answers
Made Easy Test Series, DBMS, Normalization
Can anyone please explain how B) and D) are true? 2NF requires us to have no partial dependency on key for some nonkey attributes. 3NF requires us to have no transitive dependency OR X>Y non trivial dependencies where either X is SK or Y are all prime attributes. Can anyone please explain how this leads to options B and D being true? Thanks.
asked
1 day
ago
in
Databases
by
sankalpmittal
(
41
points)

8
views
databases
normalization
0
votes
0
answers
Made Easy Test Series
How to Differentiate Option A and B?
asked
1 day
ago
in
Algorithms
by
Parth27
(
9
points)

16
views
testseries
0
votes
0
answers
3DProjections Question (UGC NET June 2020)
Given below are different properties of 3D projections from AD. Identify the correct order on the basis of property true of (i) a perspective projection only (ii) an orthographic projection only (iii) both orthographic and projective transformations and (iv) neither ... correct answer from the options given below: D,C,B,A B,C,D,A D,C,A,B C,D,B,A
asked
2 days
ago
in
CBSE/UGC NET
by
dishendra
(
6
points)

9
views
ugcnet
0
votes
0
answers
Applied topic test
" if we assume uniform hashing, what is the probability that a collision will occur in a hash table with 100 buckets and 2 keys?" Doesn't this question means that we have a hash table in which there are already 2 keys, and we have ... probability of collision for the next insertion? Or it is asking the probability of collision in the table for these two keys insertion?
asked
2 days
ago
in
Programming
by
Ankita87077
(
9
points)

11
views
hashing
+1
vote
0
answers
Peter Linz 5e Ex2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)n_{b}(w))mod3>0$ }
asked
2 days
ago
in
Theory of Computation
by
aditi19
(
41
points)

17
views
peterlinz
toclanguages
dfas
+1
vote
0
answers
Selfdoubt sum series and logaritms.
These are what i ended up with while solving a couple of recurrance relation can anyone help to solve further. $(n^2) log(n/2^{k1}) + 2(n^2) log(n/2^{k2}) + 3(n^2) log(n/2^{k3}) + ...+ (n^2) log(n)$ $2. lg n + lg (n / 2) + lg (n / 4) + ... + lg (n / 2^{lg n})$ Note: Assume base 2 for log terms.
asked
2 days
ago
in
Mathematical Logic
by
donniedarko
(
21
points)

18
views
selfdoubt
0
votes
0
answers
Made easy booklet
Bag contains 5 black, 2 red and 3 white marbles. Three marbles are drawn simultaneously. Find probability that they're of different colour
asked
2 days
ago
in
Probability
by
farazbukhari0
(
5
points)

21
views
selfdoubt
0
votes
0
answers
Self Doubt Disks
when solving questions of disks 10KB is 1024*10B or 1000*10B? different sources are telling different things,even same sources are telling different things at different time.
asked
3 days
ago
in
Operating System
by
Nitinkumar.097
(
13
points)

13
views
selfdoubt
disks
0
votes
0
answers
Made easy test series
how? can u plese draw them?
asked
3 days
ago
in
Databases
by
Salla shivateja
(
19
points)

19
views
testseries
0
votes
0
answers
self doubt madeeasy test series
https://gateoverflow.in/311536/madeeasytestseriesbinarytree how tree will look like ...please see
asked
4 days
ago
in
DS
by
eyeamgj
(
25
points)

12
views
testseries
0
votes
0
answers
SELF DOUBT HASHING
https://gateoverflow.in/57653/cormen2ndeditionexercise1121 WHY WE CANT DO LIKE THIS …...NUMBER OF COLLISIONS(X) : 0 1 2 3 4 …………………...N1 P(X): 0/M 1/M 2/M…………………… … ………….(N1)/M
asked
4 days
ago
in
DS
by
eyeamgj
(
25
points)

8
views
hashing
0
votes
0
answers
ME test series
Which of the following statements are true? S1: Doubling the line size halves the number of tags in the cache. S2 : Doubling the associativity increases the number of tags in the cache. S3 : Doubling the line size usually reduce compulsory misses. How to approach such kind of question?
asked
4 days
ago
in
CO & Architecture
by
Abhineet Singh
(
23
points)

33
views
testseries
+1
vote
0
answers
ME test series
Consider a RISC processor with an ideal CPI, where 25% of the total instructions are load and store instruction. Time to accessing main memory is 100 clock cycles and accessing of the cache memory required 2 clock cycles and cache miss rate is 2%. Which of the following are ... misses is 2.9. D CPI for the handling cache hits is 2.45. How to solve this, unable to get any option...
asked
4 days
ago
in
CO & Architecture
by
Abhineet Singh
(
23
points)

38
views
testseries
0
votes
0
answers
ME test series
Which of the following are correct?(MSQ) A Compulsory misses can be reduced by increasing the block size. B The search concept used in associative memory is parallel search. C Conflict misses can be reduced by increasing block size. D Reducing block ... spatial locality. I'm having some trouble in approaching these type of questions. Please tell how to solve these type of questions
asked
4 days
ago
in
CO & Architecture
by
Abhineet Singh
(
23
points)

4
views
testseries
0
votes
0
answers
Book: Gate Overflow Question no. 4.7.20 in the Programming in C section
asked
5 days
ago
in
Programming
by
hadarsh
(
5
points)

13
views
pointers
programming
0
votes
0
answers
Tga mock test
MSQ Type question.
asked
5 days
ago
in
Digital Logic
by
Enolx.21
(
25
points)

16
views
selfdoubt
0
votes
0
answers
Need of cycle checking algorithm in minimum spanning tree algorithms
asked
5 days
ago
in
Algorithms
by
ashutoshbsathe
(
5
points)

12
views
algorithms
0
votes
0
answers
Elmsari Fundamentals , Normalisation
Consider the universal relation A = {P,Q,R,S,T,U,V,W,X,Y,Z} and the set of functional dependencies FD's = { PQ > R, R > ST, Q > U, U > VW, S> XY }. What is the key for A. Decompose A into 2NF and 3 NF relations
asked
6 days
ago
in
Databases
by
Lucifer2440
(
5
points)

10
views
databases
normalization
0
votes
0
answers
Joins in Relational Algebra (Self Doubt) while reading Elmasri Navathe
asked
6 days
ago
in
Databases
by
shubhojit1412
(
5
points)

15
views
joins
naturaljoin
0
votes
0
answers
Madeeasy Test series CN Q3
Which of the following is a valid multicast MAC Address ? 01:00:5E:00:00:00 01:00:5E:00:00:FF 01:00:5E:00:FF:FF 01:00:5E:FF:FF:FF
asked
6 days
ago
in
Computer Networks
by
Shivateja MST
(
45
points)

7
views
networks
0
votes
0
answers
Database management systems
If a schedule is given and it is asked whether the given schedule is serializable or not, is it asking about conflict serializability or view serializability? And when it is asked about the precedence graph, is it about the precedence graph that we draw to check conflict serializability or the one for view serializability?
asked
6 days
ago
in
Databases
by
Abhilash Behera
(
5
points)

10
views
selfdoubt
0
votes
0
answers
Geometric Progression
Finding the sum of the following series leads to two different answers with two different methods. The series is listed as: 1+2/3 + 4/9 + 6/27 + . (infinity) Method 1: Directly apply the formula> Sum=a/(1r), with a=1 and r=2/3. Here, we get ... ...(infinity) . ..(2) Subtracting (1) from (2) and solving further, we will get S=2.5 Kindly tell which method is correct.
asked
6 days
ago
in
Numerical Ability
by
sarkar
(
5
points)

24
views
aptitude
0
votes
0
answers
applied courses test
Are the given Bernstein’s Conditions necessary to be checked?
asked
6 days
ago
in
Operating System
by
Abhilash Behera
(
5
points)

12
views
testseries
0
votes
0
answers
operating systemAce test series
asked
Jan 9
in
Operating System
by
val_pro20
(
2
points)

45
views
testseries
0
votes
0
answers
Computer network (self doubt)
In datagrams fragmentation occurs at routers. What about in virtual circuits? As CPU bandwidth and buffers are reserved, is there a chance for fragmentation to occur in router?
asked
Jan 9
in
Computer Networks
by
Kishore7
(
5
points)

8
views
computernetwork
testseries
cidr
selfdoubt
0
votes
0
answers
Previous year question
In this previous year question https://gateoverflow.in/179371/, can someone PLEASE explain why is it wrong to say that if i have probability of success = $\frac{1}{26^{10}}$ ... ? Please give a proper reason like, the reason why we can't say the answer is B is because checking is a dependent event.
asked
Jan 9
in
Probability
by
reboot
(
5
points)

27
views
probability
0
votes
0
answers
General query on Gate preparation
How to start preparing for Gate 2022, I am second year engineeering Student ? i know this is a basic question , but whenever take those big books of dbms of sudharson,ds of kenneth rosen , i don’t thinks i cannot cover them,even when i start reading i cannot understand much , how ,where should i start preparing?
asked
Jan 9
in
Others
by
sheikh haji
(
5
points)

14
views
selfdoubt
0
votes
0
answers
Ace Test Series
I know A,B,C are valid answer But can anyone confirm if D is also valid..We have epsilon in RHS it should not be Operator Grammer so D should be also valid???...can i get help
asked
Jan 9
in
Compiler Design
by
vipin.gautam1906
(
5
points)

16
views
grammer
0
votes
0
answers
AVL PREVIOUS YEAR DATA STRUCTURE SELF DOUBT
https://gateoverflow.in/86224/gate199013a for tym complexity ..is it like …..n times we need to search position so O(nlogn) n insertion so O(n) and only two rotation so O(logn)...because i m not rotating for each iteration just doing at last so overall O(nlogn)...please look...
asked
Jan 8
in
DS
by
eyeamgj
(
25
points)

8
views
selfdoubt
0
votes
0
answers
Applied Test Series
Given a complete undirected graph (with all edges having positive and non negative weights) of $7$ vertices the cost of the MST is known to be $32$, the maximum weight one edge can take is ___. Ans. given is $27$ but shouldn’t it be $32$ because a graph can be constructed with $w \in \{0,32\}$?
asked
Jan 8
in
Algorithms
by
toxicdesire
(
543
points)

20
views
mst
0
votes
0
answers
tifr previous year self doubt loop invariant
https://gateoverflow.in/19251/tifr2010b37 by counter example like for a= 2 and b =1 the loop does not terminate thus remaining options are A and D. But I'm having problem getting D as answer my answer is A as at any random example say a ... *b , so I go with Option A. considering this comment of the.brahmin.guy how it is not terminating using a=2 nd b
asked
Jan 8
in
Programming
by
eyeamgj
(
25
points)

16
views
selfdoubt
0
votes
0
answers
Applied Gate Grand Test
Consider the following fragment of MIPS code: sw r16,12(r6) lw r16,8(r6) beq r5,r4,Label # Assume r5!=r4 add r5,r1,r4 slt r5,r15,r4 What are the total number of cycles for this instruction sequence in the 5stage(IF, ID, EX, MEM, WB) pipeline that only has one memory.
asked
Jan 7
in
CO & Architecture
by
anurags228
(
23
points)

8
views
pipelining
0
votes
0
answers
The database system then writes out enough information to disk
asked
Jan 7
in
Databases
by
Tara22
(
13
points)

12
views
databases
0
votes
0
answers
Gate applied course
If an ER model says E having at least one multivalued attribute is converted into relational model say R then what will be the number of simple candidate key possible in R if E has only single attribute as candidate key? A) 0 B) exactly 1 c) more than 1 d) can’t say
asked
Jan 6
in
Databases
by
Gopichandankem
(
5
points)

21
views
databases
Page:
1
2
3
4
...
157
next »
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent questions without answers
8,957
questions
3,118
answers
14,337
comments
95,787
users