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
Recent activity by aehkn
3
answers
1
My personal doubt
if s is a binary semaphore and the initial value of s is 1 then can 'signal' be performed on s ? what will happen if signal(s) is performed?
if s is a binary semaphore and the initial value of s is 1 then can 'signal' be performed on s ? what will happen if signal(s) is performed?
1.2k
views
commented
Mar 24, 2018
Operating System
operating-system
semaphore
+
–
2
answers
2
OSI - Layer
Encode / Decode data for physical transmission is done by which layer of OSI reference model?
Encode / Decode data for physical transmission is done by which layer of OSI reference model?
3.6k
views
commented
Mar 24, 2018
Computer Networks
osi-model
computer-networks
+
–
1
answer
3
#CareerGuidance
Hey friends, please help me in deciding which line i should go for now. Go for gate 2019 self preparation look for a job first and prepare simultaneously I am a 2015 CSE pass-out, while working I joined Ravindra Babu Ravula classes in Nov, 2016 and gave ... gate 2019 completely is correct or not. Please advice me the best option to go for. Need of immediate help. Thanks in advance!
Hey friends, please help me in deciding which line i should go for now.Go for gate 2019 self preparationlook for a job first and prepare simultaneouslyI am a 2015 CSE pas...
327
views
answered
Mar 15, 2018
1
answer
4
Regarding Admission
I Got 45.67 marks and current GATE Score according to PRAGY App is 594.67 . Which NITs I could expext and how to prepare for Inteview . Please Suggest . Thanking you...
I Got 45.67 marks and current GATE Score according to PRAGY App is 594.67 . Which NITs I could expext and how to prepare for Inteview . Please Suggest . Thanking you...
746
views
answered
Mar 5, 2018
NITs
admissions
career-advice
+
–
1
answer
5
IISC/IIT admissions.
#admissions If anyone receives any update regarding opening of admission process in any IIT please comment. If there is any existing post then let us know. IISc has started it. IITB not yet. IITD/IITM not sure.
#admissionsIf anyone receives any update regarding opening of admission process in any IIT please comment.If there is any existing post then let us know.IISc has started ...
642
views
answered
Mar 2, 2018
IISc/IITs
admission
iit
+
–
0
answers
6
GATE 18 RESPONSE SHEET
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
2.8k
views
commented
Feb 14, 2018
6
answers
7
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $12...
21.6k
views
commented
Feb 14, 2018
Computer Networks
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
+
–
7
answers
8
GATE CSE 2018 | Question: 37
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$. $T_1: a?(b \mid c)^\ast a$ $T_2: b?(a \mid c)^\ast b$ ... the string $bbaacabc$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs? $T_1T_2T_3$ $T_1T_1T_3$ $T_2T_1T_3$ $T_3T_3$
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$.$T_1: a?(b \mid c)^\ast a$$T_2: b?(a \mid c...
21.4k
views
commented
Feb 14, 2018
Compiler Design
gatecse-2018
compiler-design
lexical-analysis
normal
2-marks
+
–
7
answers
9
GATE CSE 2018 | Question: 45
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers.Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else {...
13.3k
views
commented
Feb 14, 2018
Algorithms
gatecse-2018
numerical-answers
algorithms
recursion
2-marks
+
–
2
answers
10
Time Quantum Overhead1.1
Consider 4 processes sharing the CPU in a round robin fashion. Assuming that each process takes 5 seconds. What must be the maximum quantum size P. Such that the overhead resulting from process switching is minimized but at same time each process is guaranteed to gets its turn at CPU at-least every 40 seconds ________ (upto 2 decimal place).
Consider 4 processes sharing the CPU in a round robin fashion. Assuming that each process takes 5 seconds. What must be the maximum quantum size P. Such that the overhead...
793
views
commented
Dec 6, 2017
Operating System
process-scheduling
+
–
3
answers
11
michael sipser chp 1, 3rd edition, Q 12 , dfa
let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab } give a DFA with Five states that recognizes D and a regular expression that generates D.
let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab }give a DFA with Five states that recognizes D and a regular express...
3.7k
views
commented
Nov 12, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
12
ME Workbook
1. How many minimum tables required which satisfy 1NF. 2. How many minimum tables required which satisfy BCNF. 3. How many minimum tables required which satisfy 4NF.
1. How many minimum tables required which satisfy 1NF.2. How many minimum tables required which satisfy BCNF.3. How many minimum tables required which satisfy 4NF.
2.0k
views
commented
Nov 11, 2017
Databases
er-diagram
model
databases
+
–
1
answer
13
#Decidability
L={<G> | G is CFG and G is not ambiguous}.Most restrictive set of languages L belongs to is a) CFL b) TM decidable c) TM recognizable d) not TM recognizable
L={<G | G is CFG and G is not ambiguous}.Most restrictive set of languages L belongs to isa) CFLb) TM decidablec) TM recognizabled) not TM recognizable
706
views
commented
Nov 6, 2017
2
answers
14
MadeEasy Subject Test: Theory of Computation - Turing Machine
Consider the following statements: S1: Turing machine can write the blank symbol on its tape. S2: Tape alphabet Γ can never be same as input alphabet Σ. S3: Turing machine's head can ever be in the same location ... . S4: Turing machine contain atleast two states. How many of the above statements are correct? Please give explanation too
Consider the following statements:S1: Turing machine can write the blank symbol on its tape.S2: Tape alphabet Γ can never be same as input alphabet Σ.S3: Turing machine...
3.9k
views
commented
Nov 5, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
turing-machine
+
–
0
answers
15
data base
consider the following transactions T1:r1(A)w1(A)r1(B)w1(B) T2:r2(B)w2(B)r2(A)w2(A) a)how many schedules serializable as T1-->T2 what this question is asking??
consider the following transactionsT1:r1(A)w1(A)r1(B)w1(B)T2:r2(B)w2(B)r2(A)w2(A)a)how many schedules serializable asT1 >T2what this question is asking??
249
views
commented
Nov 3, 2017
Databases
databases
+
–
1
answer
16
ME test
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ? A) Ω(n2) B) O(n) C) θ(n) D) None
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ?A) Ω(n2)B) O(n)C) θ(n)D) None
948
views
commented
Nov 1, 2017
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
0
answers
17
MadeEasy Subject Test: Programming & DS - Hashing
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944 Answer given is : 40/121
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
718
views
commented
Oct 30, 2017
DS
made-easy-test-series
data-structures
hashing
+
–
1
answer
18
Online Test series
Ques: Can Round Robin algorithm be non-preemptive ? My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptive Am I right ? Please corret me if am wrong.
Ques: Can Round Robin algorithm be non-preemptive ?My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptiveAm I right ? Please corre...
455
views
commented
Oct 30, 2017
Operating System
round-robin-scheduling
+
–
7
answers
19
GATE CSE 1996 | Question: 1.7
Let $Ax = b$ be a system of linear equations where $A$ is an $m \times n$ matrix and $b$ is a $m \times 1$ column vector and $X$ is an $n \times1$ column vector of unknowns. Which of the following is false? The system has a solution if and ... a unique solution. The system will have only a trivial solution when $m=n$, $b$ is the zero vector and $\text{rank}(A) =n$.
Let $Ax = b$ be a system of linear equations where $A$ is an $m \times n$ matrix and $b$ is a $m \times 1$ column vector and $X$ is an $n \times1$ column vector of unknow...
21.5k
views
commented
Oct 18, 2017
Linear Algebra
gate1996
linear-algebra
system-of-equations
normal
+
–
0
answers
20
#GATE
Packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets?
Packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets?
330
views
commented
Oct 15, 2017
Computer Networks
go-back-n
sliding-window
+
–
2
answers
21
Compiler_design_LL(1)
Given answer is 3. I am getting Two entries.Check it once.
Given answer is 3. I am getting Two entries.Check it once.
470
views
commented
Sep 27, 2017
Compiler Design
ll-parser
test-series
+
–
1
answer
22
test series
A student can take one or more courses and courses can be offered to any number of students. Which of the following represents given scenario in ER-model which is correct?
A student can take one or more courses and courses can be offered to any number of students. Which of the following represents given scenario in ER-modelwhich is correct?...
883
views
answered
Sep 27, 2017
1
answer
23
Ace Test Series: Graph Theory - Graph Connectivity
728
views
answered
Sep 27, 2017
Graph Theory
ace-test-series
graph-theory
graph-connectivity
+
–
4
answers
24
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
897
views
answered
Sep 26, 2017
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
13
answers
25
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.9k
views
commented
Sep 19, 2017
Databases
er-diagram
databases
er-to-relational
relational
+
–
2
answers
26
2 Phase Locking
State True or False and Tell reason 1) 2PL is always conflict serializable 2)Timestamp protocol is conflict and view serializable
State True or False and Tell reason1) 2PL is always conflict serializable2)Timestamp protocol is conflict and view serializable
2.9k
views
commented
Sep 18, 2017
Databases
-2phaselocking
serializability
+
–
1
answer
27
block size of B tree and B+ tree( doubt)
Will block size of B tree and B+ tree same for same key size and pointer size One more doubt For B+ tree at leaf(Key and Record Pointer) and at non leaf node(Block pointer and Key) So for B+ tree order for leaf node and non leaf ... and Record pointer) But for B tree Order of leaf node and non leaf node is same Why please say please clear my doubt Thank you
Will block size of B tree and B+ tree same for same key size and pointer sizeOne more doubt For B+ tree at leaf(Key and Record Pointer) and at non leaf node(Block pointer...
1.5k
views
commented
Sep 17, 2017
Databases
databases
b-tree
+
–
0
answers
28
Foreign Key
How one to many relation refers a foreign key?
How one to many relation refers a foreign key?
505
views
commented
Sep 16, 2017
Databases
foreign
keys
+
–
1
answer
29
Operating system -paging
Consider a system using paging with TLB.What hit ratio is required to reduce the effective memory access time from 200 ns to 140 ns , by assuming TLB access time of 20 ns. a)85% b)80% c)90% d)95%
Consider a system using paging with TLB.What hit ratio is required to reduce the effective memory access time from 200 ns to 140 ns , by assuming TLB access time of 20 ns...
1.7k
views
answered
Sep 16, 2017
1
answer
30
4-way -tree
A full quaternary tree is a tree with every node having 0 or 4 children and all leafs are at same level. If there are n leaf nodes in a full quaternary tree at height h then how many node are present in the tree (root node a height 0)?(consider root as internal node) A.(n-1)/2 B. (n-1)/3 C. (n-1)/4 D. (n-1)/5
A full quaternary tree is a tree with every node having 0 or 4 children and all leafs are at same level. If there are n leaf nodes in a full quaternary tree at height h t...
437
views
answered
Sep 16, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register