menu
Recent questions and answers
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions and answers
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions and answers
0
votes
1
answer
170
views
DBMS Relations
Consider the following assumptions for the relation employee( eid , ename,dept,grade,sal,age,address) and find the candidate key of the relation. I. Each employee has unique id. II. An employee can work on one dept only III. Employees salary depends on his age and grade ... salary or can be of same age. a.eid only b.eid,(age,address) c.(grade,age) d.eid,dept Anyone please clarify.
anirbanroy.c
answered
in
Databases
3 days
ago
by
anirbanroy.c
5
points
170
views
databases
0
votes
1
answer
61
views
GATE2020 Practice Test 2: General Aptitude-3 Video Solution
Nitesh_Yadav
answered
in
Numerical Ability
May 4
by
Nitesh_Yadav
5
points
61
views
gate2020-practise-2
ratio-proportion
video-solution
0
votes
0
answers
19
views
kenneth h rosen chapter 1 section section 1.5 nested quatnifiers excercise 49
ykrishnay
asked
in
Mathematical Logic
Apr 20
by
ykrishnay
103
points
19
views
kenneth-rosen
combinatory
mathematical-logic
discrete-mathematics
propositional-logic
0
votes
0
answers
7
views
kenneth h rosen chapter 1 section "Nested quantifers" excercise 1.5 question 26's g
ykrishnay
asked
in
Mathematical Logic
Apr 18
by
ykrishnay
103
points
7
views
kenneth-rosen
combinatory
mathematical-logic
propositional-logic
discrete-mathematics
0
votes
1
answer
48
views
Book name:- computer networking top down approach
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other ... . Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
AlexDeLarge
answered
in
Computer Networks
Apr 17
by
AlexDeLarge
5
points
48
views
computer-networks
self-doubt
packet-switching
network-switching
0
votes
0
answers
6
views
kenneth h rosen chapter 1 section 1.5 excercise 1.5 question 18 e
ykrishnay
asked
in
Mathematical Logic
Apr 16
by
ykrishnay
103
points
6
views
kenneth-rosen
combinatory
mathematical-logic
propositional-logic
discrete-mathematics
0
votes
0
answers
19
views
Kenneth h rosen chapter 1 section 1.5 question 8
Let Q(x, y) be the statement student x has been a con- testant on quiz show y. Express each of these sentences in terms of Q(x, y), quantifiers, and logical connectives, where the domain for x consists of all students at ... a student from your school as a contestant. e) At least two students from your school have been con- testants on Jeopardy.
ykrishnay
asked
in
Mathematical Logic
Apr 12
by
ykrishnay
103
points
19
views
kenneth-rosen
discrete-mathematics
combinatory
mathematical-logic
propositional-logic
0
votes
0
answers
15
views
Operator
Question 4 * 12 + 20 -20 = 48; what is wrong with it . Ans = 47 how explain me please;
PrateekGiri
asked
in
Programming
Apr 12
by
PrateekGiri
5
points
15
views
programming-in-c
operators
0
votes
1
answer
57
views
confusion - computer networks
Do we actually need ip and Mac addresses both at same time for the computer for communication? Why we not use Mac instead of ip address since Mac is also the unique address globally? Why we not use ip instead of Mac Since both are unique but why we use both for computer networkws?
jdranpariya
answered
in
Computer Networks
Apr 4
by
jdranpariya
5
points
57
views
computer-networks
network-security
self-doubt
ip-addressing
subnetting
0
votes
0
answers
42
views
kenneth h rosen chapter 1 excercise 1.4 predicates and quantifiers question 46
ykrishnay
asked
in
Mathematical Logic
Mar 20
by
ykrishnay
103
points
42
views
kenneth-rosen
combinatory
mathematical-logic
propositional-logic
0
votes
0
answers
44
views
kenneth h rosen chapter 1 excercise 1.4 predicates ad quantifiers question 59 symbolic logic
ykrishnay
asked
in
Mathematical Logic
Mar 19
by
ykrishnay
103
points
44
views
discrete-mathematics
kenneth-rosen
combinatory
mathematical-logic
0
votes
0
answers
19
views
kenneth h rosen chapter 1 excercise 1.4 predicates and quantifiers question 33
ykrishnay
asked
in
Mathematical Logic
Mar 19
by
ykrishnay
103
points
19
views
discrete-mathematics
kenneth-rosen
combinatory
propositional-logic
mathematical-logic
0
votes
0
answers
27
views
kenneth h rosen chapter 1 excercise 1.4 predicated and quantifiers question 19
ykrishnay
asked
in
Mathematical Logic
Mar 18
by
ykrishnay
103
points
27
views
discrete-mathematics
kenneth-rosen
combinatory
propositional-logic
mathematical-logic
0
votes
0
answers
58
views
Help me for choosing NIT through Gate Score 398
Hello Dear, My Gate 2022 (Branch: Computer Science And Engineering) Marks is 28.67, Rank:6767 ,Score : 398. I belongs to Ews category . Can anyone tell me which Nit or iit is possible to getting by me ? And which College should choose for Batter placement package? Qualify marks for Gate 2022 General: 25 & Ews:22.5
Enolx.21
asked
in
NITs
Mar 17
by
Enolx.21
53
points
58
views
admission
iit
nit
self-doubt
0
votes
0
answers
26
views
Kenneth h rosen chapter 1 section 1.4 binding variables
ykrishnay
asked
in
Mathematical Logic
Mar 15
by
ykrishnay
103
points
26
views
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
combinatory
0
votes
1
answer
47
views
A 32-bit wide memory has a 22-bit address to be accessed. What is the maximum memory capacity in MB?
22
answered
in
CO & Architecture
Feb 26
by
22
5
points
47
views
cache-memory
0
votes
0
answers
57
views
kenneth h rosen chapter 1 excercise 1.2
hey i want to ask that in excercise 1.2 there are lots of logic puzzles quetions so it is important for gate or any exam like gate can i leave those questions or do ? please tell need an answer.
ykrishnay
asked
in
Mathematical Logic
Feb 17
by
ykrishnay
103
points
57
views
discrete-mathematics
kenneth-rosen
combinatory
propositional-logic
mathematical-logic
0
votes
0
answers
47
views
kenneth h rosen chapter 1 excercise 1.2 question 15 on page 23
ykrishnay
asked
in
Mathematical Logic
Feb 17
by
ykrishnay
103
points
47
views
discrete-mathematics
kenneth-rosen
propositional-logic
combinatory
mathematical-logic
1
vote
1
answer
95
views
Discrete mathematics Kenneth Rosen The foundation logic and proofs page 22 question 4
ykrishnay
answered
in
Mathematical Logic
Feb 15
by
ykrishnay
103
points
95
views
discrete-mathematics
kenneth-rosen
propositional-logic
0
votes
0
answers
44
views
kenneth h rosen chapter-1 section 1.1 propsitional logic excercise 1.1 question 23's d) and e)
ykrishnay
asked
in
Mathematical Logic
Feb 13
by
ykrishnay
103
points
44
views
discrete-mathematics
kenneth-rosen
combinatory
mathematical-logic
propositional-logic
0
votes
1
answer
56
views
IGNOU EXAM QUERIES
We use heuristics to reduce the number of plans considered and thereby to reduce the cost of query evaluation. Heuristic rule(s) for transforming relational algebra queries include. (1) Perform selection operations as early as possible (2) Perform projections early (3) Avoid cartesian products (4) All of the above
Abhineet
answered
in
GATE
Feb 8
by
Abhineet
5
points
56
views
0
votes
0
answers
176
views
Queries about standard book
Should i read 2 standard book for particular subject or i should rely on 1 standard book for one subject only
Vaishnavi Gadhe
asked
in
GATE
Jan 18
by
Vaishnavi Gadhe
5
points
176
views
self-doubt
0
votes
1
answer
102
views
made easy test series compiler design
I have a doubt in statement number 2 , why we can’t compute the strength reduction in 2nd statement
neel19
answered
in
Compiler Design
Dec 23, 2021
by
neel19
9
points
102
views
made-easy-test-series
compiler-design
0
votes
0
answers
51
views
made easy test series
which of the following statement is /are correct for deadlock avoidance algorithm? (a) every unsafe system leads to deadlock (b) every deadlock system implies unsafe © safe system at some point of time can lead to deadlock (d) unsafe system at some point of time can never result in safe state
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
51
views
made-easy-test-series
0
votes
0
answers
33
views
made easy test series
consider a disk has 150 cylinders numbered from 0 to 149. currently the disk arm is at 80 and moving towards higher cylinders. there is disk access requests for cylinders are 30, 78, 96, 123, 141 ,15, 13, 68. what will be the absolute difference traversed by R/w head whwn CSCAN and CLOOK is used?
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
33
views
made-easy-test-series
test-series
operating-system
0
votes
0
answers
32
views
made easy test series
consider a disk has 150 cylinders numbered from 0 to 149. currently the disk arm is at 80 and moving towards higher cylinders. there is disk access requests for cylinders are 30, 78, 96, 123, 141 ,15, 13, 68. what will be the absolute difference traversed by R/w head whwn CSCAN and CLOOK is used?
omshiv
asked
in
Operating System
Dec 23, 2021
by
omshiv
5
points
32
views
made-easy-test-series
test-series
operating-system
0
votes
2
answers
1.6k
views
Made Easy Test Series
Select the incorrect statement. Binary search trees (regardless of the order in which the values are inserted into the tree): a. Always have multiple links per node. b. Can be sorted efficiently. c. Always have the same shape for a particular set of data. d. Are nonlinear data structures. How a is right? ANS: c. Always have the same shape for a particular set of data
Anas khan
answered
in
Programming
Dec 23, 2021
by
Anas khan
5
points
1.6k
views
0
votes
0
answers
44
views
https://gateoverflow.in/348346/Gate-overflow-computer-networks-1-2
pradeep_reddy
asked
in
Computer Networks
Dec 19, 2021
by
pradeep_reddy
5
points
44
views
computer-networks
udp
self-doubt
transport-layer
0
votes
0
answers
39
views
Gate applied
Can some one please do a pumping lema on L = {a^(2n+1) | n>=0 } I know Finite automata can be easily made and hence it is a regular language, but the pumping lema test fails for this implying it is a non-regular language (I am sure I am doing the pumping lema wrong) can someone please do a pumping lema for this so that I compare my solution and rectify my mistake
pavan.varyani
asked
in
Theory of Computation
Dec 7, 2021
by
pavan.varyani
5
points
39
views
toc-languages
regular-expressions
pumping-lemma
0
votes
0
answers
85
views
MadeEasy 2022 OS question on concept of semaphores.
neel19
asked
in
Operating System
Dec 3, 2021
by
neel19
9
points
85
views
made-easy-test-series
operating-system
semaphores
test-series
0
votes
0
answers
65
views
made easy test series
In which cases we can apply strength reduction, for example can i apply strength reductio on : for(i=0 to n) { z=5*(i+1) }
Pankaj_Kumar
asked
in
Compiler Design
Dec 2, 2021
by
Pankaj_Kumar
5
points
65
views
made-easy-test-series
compiler-design
0
votes
1
answer
108
views
kenneth rosen chapter 8 section 8.4 exercise question 5 option (f)
Onika
answered
in
Mathematical Logic
Nov 14, 2021
by
Onika
71
points
108
views
kenneth-rosen
discrete-mathematics
generating-functions
0
votes
1
answer
73
views
applied gate test
how many states are in smallest possible DFA {0,1} * {$1^{10}$}
Onika
answered
in
Theory of Computation
Nov 14, 2021
by
Onika
71
points
73
views
toc-languages
regular-expressions
0
votes
2
answers
113
views
T(n)=T(n/2)+logn How to solve this without using masters theorem?
Onika
answered
in
Algorithms
Nov 14, 2021
by
Onika
71
points
113
views
self-doubt
algorithms
recurrence-relations
timecomplexity
0
votes
0
answers
32
views
#algorithms #timecomplexity
There a confusion about what should be the time complexity of the code... Involving modulo operator
Palash yadav
asked
in
Algorithms
Nov 12, 2021
by
Palash yadav
135
points
32
views
algorithms
time-complexity
0
votes
1
answer
93
views
Kenneth h rosen Q29. Chapter 1 section 1.3 Predicate logic
This_is_Nimishka
answered
in
Mathematical Logic
Nov 10, 2021
by
This_is_Nimishka
5
points
93
views
discrete-mathematics
kenneth-rosen
0
votes
1
answer
85
views
TOC - Regular Expressions
As for a Finite Automata, we say a finite automata accepts a language if it accepts all strings present in the language as well as REJECTS all strings which are not present in the language. Is the definition for a regular language the same as that ... all strings of the regular language as well as NOT represent any strings not part of the language ?? Pls clear this.
Awe111
answered
in
Theory of Computation
Oct 29, 2021
by
Awe111
5
points
85
views
toc-languages
regular-expressions
self-doubt
regular-languages
0
votes
1
answer
117
views
paging self-doubt
If page table size is greater than frame size then each entry in the page table occupy one total frame .Is this correct?
minalBallav
answered
in
Operating System
Oct 27, 2021
by
minalBallav
11
points
117
views
self-doubt
operating-system
0
votes
1
answer
491
views
The effective address of the following instruction is , MUL 5(R1,R2)
Crackca
answered
in
CO & Architecture
Oct 23, 2021
by
Crackca
5
points
491
views
addressing-modes
0
votes
0
answers
48
views
#MadeEasyTextBook #Permutation&Combinations
In the below shown question I am getting answer as 70 but the given answer in book is 35. Can anyone help me solving this question?
sarthakdarji
asked
in
Mathematical Logic
Oct 9, 2021
by
sarthakdarji
11
points
48
views
self-doubt
To see more, click for the
full list of questions
or
popular tags
.
Ask a Question
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.
Top Users
2022 May 23 - 29
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent questions and answers
Search GATE CSE Doubts