Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
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
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
763
views
answered
Nov 25, 2016
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)
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)
256
views
answered
Nov 24, 2016
1
votes
123
Digital
2's complement of $-(96.75)_{10}$?
2's complement of $-(96.75)_{10}$?
730
views
answered
Nov 23, 2016
Digital Logic
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?
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...
600
views
answered
Nov 23, 2016
Databases
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?
Here Read_TS(X) = 30 when T1 reads X; Now when T3 goes to write X, it's timestamp is 20. Hence TS(T) = 20But Read_TS(X) TS(T) . Both rules don't allow this!How is b corr...
824
views
answered
Nov 23, 2016
Databases
databases
+
–
0
votes
126
MIT QUIZ
590
views
answered
Nov 23, 2016
Algorithms
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.
How many conflicts are present in LR(0) parser..i am getting 3.
674
views
answered
Nov 23, 2016
Compiler Design
made-easy-test-series
compiler-design
parsing
lr-parser
+
–
4
votes
128
Verbal Ability
547
views
answered
Nov 20, 2016
Verbal Aptitude
verbal-aptitude
statement-argument
+
–
4
votes
129
Verbal Ability
644
views
answered
Nov 20, 2016
Verbal Aptitude
verbal-aptitude
statement-argument
+
–
3
votes
130
ME test
368
views
answered
Nov 19, 2016
Theory of Computation
theory-of-computation
+
–
55
votes
131
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...
14.4k
views
answered
Nov 19, 2016
Compiler Design
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?
What will be the complement of (0+1)*...Is it {}=ϕ or {ϕ}.And also what is the difference between the two?
1.6k
views
answered
Nov 19, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
133
ACE Computer Networks Grand Test-1
267
views
answered
Nov 17, 2016
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
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
284
views
answered
Nov 17, 2016
1
votes
135
Programming and DS
632
views
answered
Nov 17, 2016
4
votes
136
programming and DS
199
views
answered
Nov 17, 2016
2
votes
137
TOC question
446
views
answered
Nov 17, 2016
Theory of Computation
theory-of-computation
+
–
5
votes
138
ME-FST2-Q50
777
views
answered
Nov 15, 2016
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 ________ .
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 w...
1.1k
views
answered
Nov 15, 2016
Operating System
deadlock-prevention-avoidance-detection
+
–
2
votes
140
ME-FST2-38
241
views
answered
Nov 15, 2016
6
votes
141
ME-FST2-Q33
I think none correct..anybody please check
I think none correct..anybody please check
319
views
answered
Nov 15, 2016
Compiler Design
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.
Find no of Tokens in bellow programint 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 n...
2.9k
views
answered
Nov 15, 2016
Compiler Design
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?
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 cumulativ...
2.7k
views
answered
Nov 15, 2016
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
The state transition given below is realized by a clocked JK flip-flopstate transition$Q_{n}$$Q_{b+1}$00011011The JK input to realize the transition is:(A) JK0$\emptyset$...
274
views
answered
Nov 15, 2016
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$
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$...
5.0k
views
answered
Nov 15, 2016
Algorithms
gatecse-2005
algorithms
greedy-algorithm
process-scheduling
normal
+
–
3
votes
146
me/test
logic behind it ????
logic behind it ????
488
views
answered
Nov 15, 2016
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))$
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
5.2k
views
answered
Nov 15, 2016
Mathematical Logic
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?
How many binary relations are there on a set $A$ with $n$ elements?
5.9k
views
answered
Nov 14, 2016
Set Theory & Algebra
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.
Show that the number of odd-degree vertices in a finite graph is even.
1.9k
views
answered
Nov 14, 2016
Graph Theory
gate1987
graph-theory
degree-of-graph
descriptive
proof
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register