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 robinofautumn
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by robinofautumn
2
answers
1
GATE CSE 2021 Set 1 | Question: 5
Consider the following statements. $S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$. $S_2:$ For any context-free grammar, there is a parser that takes at most $O(n^3)$ time to parse a ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
comment edited
in
Compiler Design
Jan 25, 2023
7.8k
views
gatecse-2021-set1
compiler-design
lr-parser
1-mark
2
answers
2
Conversion of regular grammar to FA
A->aB/bA/b B->aC/bB C->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
commented
in
Theory of Computation
Jan 16, 2023
4.5k
views
theory-of-computation
finite-automata
regular-grammar
0
answers
3
#selfdoubt
Let n players enter a chess tournament. How many tournament trees are possible? RULES: a player is eliminated after one loss and games are played until only one entrant is left(assume no ties) My approach: (please check if it is correct) there are 3 possible binary tree skeletons w.r.t ... )C2 * (n-4)C2 *...*1} * 2^(n-1) similarly we can do the remaining cases. Is the above method right?
asked
in
Combinatory
Jan 11, 2023
319
views
discrete-mathematics
graph-theory
combinatory
binary-tree
4
answers
4
GATE CSE 1998 | Question: 3a
Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If not, they will wait for 10 minutes or the end of the hour whichever is earlier and leave. What is the probability that the two will not meet?
commented
in
Probability
Jan 7, 2023
6.2k
views
gate1998
probability
normal
numerical-answers
uniform-distribution
1
answer
5
probability distribution
A arrives at office at 8-10am regularly; B arrives at 9-11 am every day. Probability that one day B arrives before A? [Assume arrival time of both A and B are uniformly distributed]
commented
in
Mathematical Logic
Jan 7, 2023
823
views
probability
random-variable
uniform-distribution
3
answers
6
GATE CSE 1998 | Question: 2.20
Suppose the domain set of an attribute consists of signed four digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form? $\text{80%}$ $\text{20%}$ $\text{60%}$ $\text{40%}$
commented
in
Digital Logic
Jan 6, 2023
6.8k
views
gate1998
digital-logic
number-representation
normal
4
answers
7
GATE CSE 1999 | Question: 1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
commented
in
Digital Logic
Jan 6, 2023
13.2k
views
gate1999
digital-logic
number-representation
booths-algorithm
normal
1
answer
8
GATE CSE 2022 | Question: 33
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main (int argc, char *argv[]) { int a[3][3][3] = {{1, 2, 3, 4, 5, 6, 7, 8, 9}, {10, 11, 12, 13, 14, 15, 16, 17, 18}, {19, 20, 21, 22, 23, 24, 25, 26, 27}} ... $\begin {array}{} 1 & 2 & 3 \\ 13 & 14 & 15 \\ 25 & 26 & 27 \end{array}$
commented
in
Programming in C
Jan 5, 2023
7.9k
views
gatecse-2022
programming
programming-in-c
array
output
2-marks
0
answers
9
MadeEasy Test Series: Compiler Design - Lexical Analysis
commented
in
Compiler Design
Dec 30, 2022
809
views
made-easy-test-series
compiler-design
lexical-analysis
1
answer
10
Static Linking
Compare Following Points between Static and Dynamic Linking :- 1. Program Startup. 2. Overall Page Fault Rate.
answered
in
Operating System
Dec 30, 2022
255
views
operating-system
linker
3
answers
11
GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .
answered
in
DS
Dec 27, 2022
14.8k
views
gatecse-2022
numerical-answers
data-structures
binary-search-tree
1-mark
15
answers
12
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
answered
in
Algorithms
Dec 27, 2022
26.3k
views
gatecse-2005
algorithms
sorting
normal
2
answers
13
GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 6
Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue is at the head of the list. What is the best possible worst-case ... $O(n)$ for dequeue. $O(n)$ for enqueue and $O(1)$ for dequeue. $O(n)$ for both functions.
commented
in
DS
Dec 26, 2022
604
views
goclasses2024-ds-3-weekly-quiz
goclasses
data-structures
queue
linked-list
1-mark
0
answers
14
Made Easy Test Series: Algorithm-Reverse Polish Notation
Consider the new-order strategy for traversing a binary tree: Visit the root Visit the right subtree using new-order Visit the left subtree using new-order The new-order traversal of expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + – What will be expression, any procedure for it??
commented
in
Compiler Design
Dec 26, 2022
596
views
infix-prefix
algorithms
time-complexity
1
answer
15
The number of different insertion sequences on the numbers
The number of different insertion sequences on numbers {1, 14, 26, 44, 60, 71} on an initially empty hash table H of size 6 and a hash function x%6 with linear probing scheme for collision resolution such that the end hash table should look like 60, 1, 14, 26, 44, 71 (The indices of numbers from left to right are 0 to 5) are ________
commented
in
DS
Dec 25, 2022
2.0k
views
data-structures
hashing
normal
1
answer
16
doubt regarding NUMBER OF INSERTION SEQUENCES IN HASH TABLE
commented
in
Algorithms
Dec 25, 2022
707
views
algorithms
hashing
linear-probing
numerical-answers
made-easy-test-series
2
answers
17
mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).
answered
in
Algorithms
Dec 19, 2022
605
views
made-easy-test-series
graph-theory
depth-first-search
graph-algorithm
1
answer
18
#selfdoubt
What will happen if we dereference a dangling pointer? will it lead to a segmentation fault(core dumped) or an invalid pointer error?
commented
in
Programming in C
Dec 10, 2022
501
views
programming-in-c
pointers
0
answers
19
#LinearAlgebra
Is this correct?
asked
in
Linear Algebra
Nov 24, 2022
350
views
linear-algebra
eigen-value
2
answers
20
what is the user identification number in process control block?
answered
in
Operating System
Nov 15, 2022
828
views
operating-system
0
answers
21
#selfDoubt
True or False: The application layer (layer 7) is responsible for all the services that the internet will provide. (if it is not the application layer then which layer?)
commented
in
Computer Networks
Nov 14, 2022
350
views
application-layer
computer-networks
osi-model
4
answers
22
GATE CSE 2022 | Question: 25
Consider the resolution of the domain name $\textsf{www.gate.org.in}$ by a $\text{DNS}$ resolver. Assume that no resource records are cached anywhere across the $\text{DNS}$ servers and that iterative query mechanism is used in the resolution. The number of $\text{DNS}$ query-response pairs involved in completely resolving the domain name is ________________.
commented
in
Computer Networks
Nov 13, 2022
11.1k
views
gatecse-2022
numerical-answers
computer-networks
1-mark
1
answer
23
#selfDoubt
How can Silly Window Syndrome cause Thrashing?
answer selected
in
Computer Networks
Nov 12, 2022
344
views
computer-networks
tcp
2
answers
24
MadeEasy Workbook question.
commented
in
Computer Networks
Nov 10, 2022
518
views
network-layer
subnetting
ip-address
0
answers
25
#selfDoubt
Are IP addresses, MTU, and MSS associated with the device or the link incorporated for the transmission over the Network or the Network Interface?
asked
in
Computer Networks
Nov 10, 2022
262
views
computer-networks
ip-address
network-layer
transport-layer
0
answers
26
Combinatorics : Distinct objects and Distinct boxes
How many ways are there to Distribute 7 distinct objects to 3 Distinct boxes and No box should be Empty Any box can be Empty
commented
in
Combinatory
Oct 19, 2022
475
views
combinatory
counting
1
answer
27
Indistinguishable objects and Indistinguishable boxes
Can please anybody explain how to solve the case for indistinguishable objects and indistinguishable boxes. Ques. How many ways are there to pack six copies of the same book into four identical boxes,where a box can contain as many as ... it's equivalent of writing n as the sum of at most k positive integers in non increasing order. How??
commented
in
Combinatory
Oct 19, 2022
1.8k
views
combinatory
1
answer
28
Kurose and Ross Edition 6 Exercise 1 Question P12 (Page No 73)
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other ... bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
answered
in
Computer Networks
Oct 17, 2022
3.5k
views
computer-networks
kurose-and-ross
network-layer
network-flow
network-switching
2
answers
29
Scheduling
A process spends 30% of its execution time waiting for completion of I/O operation. If there are 5 processes in memory at once, then the probability of CPU time utilized is _______ %. (Assume all I/O operations are overlapped). (Upto 2 decimal places)
commented
in
Operating System
Sep 2, 2021
4.2k
views
operating-system
process-scheduling
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:...