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 Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Prashant.
3
votes
121
self_doubt
what is page fault service time ? what are its factor and how it is related/not related with the memory access time?? plss help with suitable example
answered
in
Operating System
Nov 25, 2016
761
views
2
votes
122
ace test 1
If IP header is 20 bytes, TCP header is 20 bytes and Ethernet header is 26 bytes. The Ethernet size required to send 1 byte of applicaton layer data is________(bytes)
answered
in
Computer Networks
Nov 24, 2016
254
views
1
vote
123
Digital
2's complement of $-(96.75)_{10}$?
answered
in
Digital Logic
Nov 23, 2016
708
views
digital-logic
number-representation
3
votes
124
Output of SQL query
The innermost query select those projects which have employees working under it; hence NOT EXISITS will select those Pid's that do not have any employees working under it. The second innermost query will select those Pid's which doesn't have any ... . Hence the outermost query will select 2 also along with other pid's. Doesn't that make option c correct?
answered
in
Databases
Nov 23, 2016
580
views
sql
databases
2
votes
125
Is Thomas's write rule and basic write rule followed here?
Here Read_TS(X) = 30 when T1 reads X; Now when T3 goes to write X, it's timestamp is 20. Hence TS(T) = 20 But Read_TS(X) > TS(T) . Both rules don't allow this! How is b correct?
answered
in
Databases
Nov 23, 2016
818
views
databases
0
votes
126
MIT QUIZ
answered
in
Algorithms
Nov 23, 2016
586
views
uniform-hashing
mit-quiz
4
votes
127
MadeEasy Test Series: Compiler Design - Parsing
How many conflicts are present in LR(0) parser..i am getting 3.
answered
in
Compiler Design
Nov 23, 2016
672
views
made-easy-test-series
compiler-design
parsing
lr-parser
4
votes
128
Verbal Ability
answered
in
Verbal Aptitude
Nov 20, 2016
534
views
verbal-aptitude
statement-argument
4
votes
129
Verbal Ability
answered
in
Verbal Aptitude
Nov 20, 2016
613
views
verbal-aptitude
statement-argument
3
votes
130
ME test
answered
in
Theory of Computation
Nov 19, 2016
359
views
theory-of-computation
55
votes
131
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
answered
in
Compiler Design
Nov 19, 2016
14.3k
views
gate1990
match-the-following
compiler-design
compilation-phases
2
votes
132
complement of (0+1)*
What will be the complement of (0+1)*...Is it {}=ϕ or {ϕ}. And also what is the difference between the two?
answered
in
Theory of Computation
Nov 19, 2016
1.6k
views
theory-of-computation
1
vote
133
ACE Computer Networks Grand Test-1
answered
in
Computer Networks
Nov 17, 2016
262
views
3
votes
134
# doubt
Q. Which of the following clause in SQL, shall sort the colums as selected? A. Sort by B. Order by C. Select D. Group by
answered
in
Databases
Nov 17, 2016
274
views
1
vote
135
Programming and DS
answered
in
Programming in C
Nov 17, 2016
631
views
4
votes
136
programming and DS
answered
in
Programming in C
Nov 17, 2016
200
views
2
votes
137
TOC question
answered
in
Theory of Computation
Nov 17, 2016
429
views
theory-of-computation
5
votes
138
ME-FST2-Q50
answered
in
Theory of Computation
Nov 15, 2016
733
views
4
votes
139
MADE EASY TEST SERIES
Suppose 10 processes P1 to P10 share 7 identical resource units which can be reserved and release 1 at are time the maximum resource requirement of a processs P i is SP where SP is greater then 0. The maximum value of that ensures deadlock does not occurs is ________ .
answered
in
Operating System
Nov 15, 2016
1.1k
views
deadlock-prevention-avoidance-detection
2
votes
140
ME-FST2-38
answered
in
Computer Networks
Nov 15, 2016
226
views
6
votes
141
ME-FST2-Q33
I think none correct..anybody please check
answered
in
Compiler Design
Nov 15, 2016
321
views
compiler-design
lexical-analysis
numerical-answers
made-easy-test-series
12
votes
142
No of Tokens
Find no of Tokens in bellow program int main() { a=b+c; "printf("%d%d%d,a,b,c")"; } nd my other doubt is if we replace a=b+c to "a=b+c or a=b+c" will it give lexical error nd if ,then in which case.
answered
in
Compiler Design
Nov 15, 2016
2.8k
views
compiler-tokenization
compiler-design
4
votes
143
self_doubt
can we say that: TCP uses only selective/independent acknowledgment not cumulative as it uses selective reject protocol??? and go back N uses both independent and cumulative acknowledgment?
answered
in
Computer Networks
Nov 15, 2016
2.6k
views
2
votes
144
GATE1987-14a
The state transition given below is realized by a clocked JK flip-flop state transition $Q_{n}$ $Q_{b+1}$ 0 0 0 1 1 0 1 1 The JK input to realize the transition is: (A) JK 0$\emptyset$ 1$\emptyset$ $\emptyset$1 $\emptyset$0 (B) JK $\emptyset$0 $\emptyset$ ... $\emptyset$ $\emptyset$0 $\emptyset$1 1$\emptyset$ (D) JK 1$\emptyset$ $\emptyset$0 0$\emptyset$ $\emptyset$1
answered
in
Others
Nov 15, 2016
266
views
29
votes
145
GATE CSE 2005 | Question: 84b
We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ and a deadline $d_i$. Profit $P_i$ is earned if the task is completed before the end ... $} & \text{$3$} \\\hline \end{array}$ What is the maximum profit earned? $147$ $165$ $167$ $175$
answered
in
Algorithms
Nov 15, 2016
4.9k
views
gatecse-2005
algorithms
greedy-algorithm
process-scheduling
normal
3
votes
146
me/test
logic behind it ????
answered
in
Programming in C
Nov 15, 2016
490
views
19
votes
147
GATE CSE 1987 | Question: 10e
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
answered
in
Mathematical Logic
Nov 15, 2016
5.1k
views
gate1987
mathematical-logic
propositional-logic
proof
descriptive
39
votes
148
GATE CSE 1987 | Question: 9a
How many binary relations are there on a set $A$ with $n$ elements?
answered
in
Set Theory & Algebra
Nov 14, 2016
5.8k
views
gate1987
set-theory&algebra
relations
descriptive
2
votes
149
GATE CSE 1987 | Question: 9c
Show that the number of odd-degree vertices in a finite graph is even.
answered
in
Graph Theory
Nov 14, 2016
1.8k
views
gate1987
graph-theory
degree-of-graph
descriptive
proof
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
21
next »
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:...