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
Recent activity
0
votes
1
answer
1
ME Demo Test Q13
Consider the following statement: S : {$a^{n}b^{n+k} | n\geq 0,k\geq 1$} $\cup$ {$a^{n+k}b^{n} | n\geq 0,k\geq 3$} Which of the following is TRUE about S? (Also explain HOW) S is Regular, but not DCFL S is CFL, but not DCFL S is DCFL, but not Regular None of these
Jaideepyadav910
commented
in
Theory of Computation
22 minutes
ago
by
Jaideepyadav910
29
views
theory-of-computation
dcfl
24
votes
1
answer
2
GATE CSE 2002 | Question: 22
Construct all the parse trees corresponding to $i + j * k$ for the grammar $E \rightarrow E+E$ $E \rightarrow E*E$ $E \rightarrow id$ In this grammar, what is the precedence of the two operators $*$ and $+$? If only one parse tree is desired for any string in the same language, what changes are to be made so that the resulting LALR(1) grammar is unambiguous?
GateOverflow04
commented
in
Compiler Design
1 hour
ago
by
GateOverflow04
2.9k
views
gatecse-2002
compiler-design
parsing
normal
descriptive
0
votes
0
answers
3
Computer Networks
Number of packets readily available in the buffer are 10. 4 bit sequence number is used. The maximum number of outstanding frames are Answer given is: 10
GateOverflow04
asked
in
Computer Networks
1 hour
ago
by
GateOverflow04
7
views
computer-networks
test-series
33
votes
4
answers
4
GATE CSE 2005 | Question: 14
The grammar $A \rightarrow AA \mid (A) \mid \epsilon$ is not suitable for predictive-parsing because the grammar is: ambiguous left-recursive right-recursive an operator-grammar
Pranavpurkar
commented
in
Compiler Design
1 hour
ago
by
Pranavpurkar
17.9k
views
gatecse-2005
compiler-design
parsing
grammar
easy
61
votes
10
answers
5
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Pranavpurkar
comment edited
in
Compiler Design
2 hours
ago
by
Pranavpurkar
22.7k
views
gatecse-2003
compiler-design
parsing
easy
53
votes
7
answers
6
GATE CSE 1990 | Question: 7-b
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
samarpita
commented
in
Operating System
2 hours
ago
by
samarpita
13.7k
views
gate1990
descriptive
operating-system
virtual-memory
0
votes
1
answer
7
theory Regular Langauge
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
Pranavpurkar
answered
in
Theory of Computation
3 hours
ago
by
Pranavpurkar
17
views
theory-of-computation
strings
regular-expression
0
votes
1
answer
8
theory regular langauge
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
Aditya_
commented
in
Theory of Computation
3 hours
ago
by
Aditya_
28
views
theory-of-computation
strings
regular-expression
0
votes
1
answer
9
Malloc | Free | Dangling Pointer | Prog. & DS
MSQ Consider the following C snippet: #include <stdio.h> int main() { int *ptr = (int*) malloc(100*sizeof(int)); *ptr=33; printf("%d %d\n",ptr,*ptr); // Line X free(ptr); *ptr=37; printf("%d %d\n",ptr,* ... *ptr) is 0 as in Line Y, the allocated heap is freed, and we cannot update it anymore, as ptr is now a dangling pointer
Pranavpurkar
commented
in
Programming
3 hours
ago
by
Pranavpurkar
15
views
data-structures
pointers
programming-in-c
17
votes
15
answers
10
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
Shubhodeep
commented
in
Combinatory
5 hours
ago
by
Shubhodeep
13.9k
views
gatecse-2019
numerical-answers
combinatory
modular-arithmetic
20
votes
6
answers
11
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
Pranavpurkar
commented
in
Compiler Design
5 hours
ago
by
Pranavpurkar
20.5k
views
gate1999
compiler-design
parsing
easy
5
votes
1
answer
12
GATE CSE 1995 | Question: 8
Construct the $\text{LL(1)}$ table for the following grammar. $Expr \rightarrow \_Expr$ $Expr \rightarrow (Expr)$ $Expr \rightarrow Var\; ExprTail$ $ExprTail \rightarrow \_Expr$ $Expr \rightarrow \lambda$ $Var \rightarrow Id\; VarTail$ $VarTail \rightarrow (Expr)$ $VarTail \rightarrow \lambda$ $Goal \rightarrow Expr$
Pranavpurkar
commented
in
Compiler Design
6 hours
ago
by
Pranavpurkar
1.7k
views
gate1995
compiler-design
parsing
normal
descriptive
8
votes
2
answers
13
GATE CSE 1988 | Question: 10ia
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Construct the collection of sets of $\text{LR (0)}$ items for this grammar and draw its goto graph.
Pranavpurkar
commented
in
Compiler Design
6 hours
ago
by
Pranavpurkar
1.9k
views
gate1988
compiler-design
descriptive
grammar
parsing
1
vote
3
answers
14
GATE2016 CE-2: GA-2
He $\underline{\text{turned a deaf ear to}}$ my request. What does the underlined phrasal verb mean? Ignored Appreciated Twisted Returned
Nalla Shirisha
answered
in
Verbal Aptitude
6 hours
ago
by
Nalla Shirisha
1.0k
views
gate2016-ce-2
general-aptitude
english-grammar
phrasal-verb
6
votes
2
answers
15
TIFR CSE 2020 | Part A | Question: 1
Two balls are drawn uniformly at random without replacement from a set of five balls numbered $1,2,3,4,5.$ What is the expected value of the larger number on the balls drawn? $2.5$ $3$ $3.5$ $4$ None of the above
Shivani Shukla
commented
in
Probability
6 hours
ago
by
Shivani Shukla
1.6k
views
tifr2020
engineering-mathematics
probability
expectation
0
votes
0
answers
16
Fork System Call and Threads | OS | MSQ
MSQ Consider the following statements, which one of the following is/are TRUE In fork() system call, child process inherits all the open file descriptors of parent process In fork() system call, child process copies the code of the ... system call, child process shares the code of the parent process User level threads shares the code segment of the process
DebSujit
commented
in
Operating System
7 hours
ago
by
DebSujit
21
views
operating-system
fork-system-call
unix
process-and-threads
threads
multiple-selects
39
votes
4
answers
17
GATE CSE 2014 Set 2 | Question: 25
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a Token-Ring LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links within each $\text{ISP}$ and across the two $\text{ISP}$s, are all ... $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.
fred20978
commented
in
Computer Networks
8 hours
ago
by
fred20978
13.8k
views
gatecse-2014-set2
computer-networks
numerical-answers
lan-technologies
ethernet
token-ring
normal
33
votes
3
answers
18
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
Shubhodeep
commented
in
Combinatory
14 hours
ago
by
Shubhodeep
6.2k
views
gateit-2008
combinatory
normal
28
votes
4
answers
19
GATE CSE 1999 | Question: 6
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer. Given two finite automata $M1, M2$, outline an algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
Shreya2002
commented
in
Theory of Computation
16 hours
ago
by
Shreya2002
3.1k
views
gate1999
theory-of-computation
normal
regular-language
descriptive
67
votes
10
answers
20
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Abhrajyoti00
commented
in
Algorithms
17 hours
ago
by
Abhrajyoti00
18.1k
views
gatecse-2000
algorithms
asymptotic-notations
normal
2
votes
1
answer
21
Kenneth Rosen Edition 6th Exercise 1.1 Question 4 (Page No. 16)
Let p and q be the propositions p : I bought a lottery ticket this week. q : I won the million dollar jackpot. Express each of these propositions as an English sentence. $\neg p$ $p \vee q$ $p \rightarrow q$ $p \wedge q$ $p \leftrightarrow q$ $\neg p \rightarrow \neg q$ $\neg p \wedge \neg q$ $\neg p \vee (p \wedge q)$
DebSujit
commented
in
Mathematical Logic
17 hours
ago
by
DebSujit
2.6k
views
kenneth-rosen
mathematical-logic
9
votes
2
answers
22
GATE CSE 2000 | Question: 21
(a) Suppose you are given an empty $B^+$ tree where each node (leaf and internal) can store up to $5$ key values. Suppose values $1, 2,\ldots 10$ are inserted, in order, into the tree. Show the tree pictorially after $6$ insertions, and ... what approximately is the average number of keys in each leaf level node. in the normal case, and with the insertion as in (b).
harshbbeer
commented
in
Databases
18 hours
ago
by
harshbbeer
2.8k
views
gatecse-2000
databases
b-tree
normal
descriptive
0
votes
1
answer
23
problem from Kenneth Rosen's Discrete Mathematics and its Applications, Section 1.5 - 1.7
Please solve the question. Question: Express each of these system specifications using predicates, quantifiers, and logical connectives. a. Any user with a Gmail account can access services from any Google products. b. ... power failure. d. There is a node whose adjacent nodes are not connected to each other.
Akif
asked
in
Unknown Category
18 hours
ago
by
Akif
14
views
discrete-mathematics
mathematical-logic
first-order-logic
12
votes
3
answers
24
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
TusharRana
commented
in
DS
18 hours
ago
by
TusharRana
6.4k
views
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
34
votes
3
answers
25
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
gatecse
commented
in
Operating System
19 hours
ago
by
gatecse
10.6k
views
gate1999
operating-system
virtual-memory
easy
0
votes
0
answers
26
U = set-up time for circuit switch (seconds) Y = transmission delay per link (seconds) (also called “transfer delay”) L = message length (bits) >0 R = transmission rate (bits per second) >0 (also called “placement rate”) H = header size (bits) =>0 P = packet size (bits) >H (note that this is the total packet size, i.e. header + data) X = decision time per packet (also called “packet routing delay”) 1. If L=1000, Y=1, R=4000 and U=1, choose a value of X. What is the total transmission time in the circuit switch network and packet switched network? Consider P=125 and H=25. (3 marks)
ruchibhandari3107
asked
in
Computer Networks
19 hours
ago
by
ruchibhandari3107
14
views
computer-networks
packet-switching
routing
26
votes
2
answers
27
GATE CSE 1997 | Question: 17
An array $A$ contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ ... ◻ end else begin if(j-i) < min then min:=j-i; sum:=sum -A[i]; i:=i+1; end writeln (min +1); end.
Abdulhameed
commented
in
DS
19 hours
ago
by
Abdulhameed
3.9k
views
gate1997
data-structures
array
normal
descriptive
0
votes
0
answers
28
Theroy regular langauge
Write a regular expression for all strings of 0’s and 1’s in which at least one copy of the substring 01 occurs before any copy of the substring 10 occurs in the string. If there is no occurrence of the substring 10 then there need not be any copy of the substring 01.
moe12leb
asked
in
Theory of Computation
21 hours
ago
by
moe12leb
8
views
theory-of-computation
regular-expression
strings
0
votes
0
answers
29
OS Self doubt (Semaphore)
At the end of chapter 2, we studied a solution to the readers and writers problem, given below:- In this solution, as long as one reader is having the resource any new reader can get access to the resource. Thus, the writer will ... expressing interest the writer will also have to wait for all the existing resource-occupyingreader(s) to be done and release the resource.
legacy
asked
in
Operating System
22 hours
ago
by
legacy
13
views
self-doubt
semaphore
0
votes
0
answers
30
OS Self doubt(Memory management)
] Our CPU is currently idle and the current time is labeled time 0. Four processes arrive to the ready queue at the following times and with the following required run time: See image for Ariival time and Process info Simulate ... decision, and calculate the turnaround time for each process. Also calculate the average turnaround time for each scheduling algorithm.
legacy
asked
in
Operating System
22 hours
ago
by
legacy
14
views
operating-system
process-scheduling
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent activity
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...