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 Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Arjun
1
answer
1
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$
commented
in
Theory of Computation
Sep 17
1.2k
views
gate1988
descriptive
theory-of-computation
finite-automata
difficult
1
answer
2
Trees
In GATE if questions just mention a tree then should we assume it to be a directed or undirected tree? Also, if we are having an undirected tree then does the child node contains a pointer to the parent node?
commented
in
DS
Sep 5
64
views
tree
1
answer
3
Cleaning up the mess
This is the 3rd year of GATE Overflow. In the first year only few people were here. But results were awesome as 5+ people got to top 100 and majority were first time takers and from final year. Last year majority of toppers here were ... a "Mark as Wrong" option for Answers. We cannot hide/delete wrong answers as they might follow good discussion as comments.
commented
in
Study Resources
Sep 5
1.4k
views
bad-question
gateoverflow
0
answers
4
Number representation
Does the formula(2^(k-1)) used for caculating the biasing value is correct?
commented
in
Digital Logic
Sep 4
49
views
digital-logic
ace-test-series
number-representation
3
answers
5
UGC NET CSE | January 2017 | Part 3 | Question: 12
If following sequence of keys are inserted in a B+ tree with K(=3) pointers: 8, 5, 1, 7, 3, 12, 9, 6 Which of the following shall be correct B+ tree?
retagged
in
Databases
Sep 4
6.2k
views
ugcnetcse-jan2017-paper3
databases
b-tree
0
answers
6
Computer Organization and Architecture
Please clarify the fourth option only. My doubt: if the same word in requires repeatedly, then for the first the word will be miss and there after it is continuously in use how it can be miss.
commented
in
CO and Architecture
Sep 3
36
views
co-and-architecture
ace-test-series
self-doubt
memory-management
0
answers
7
Self query
What book should i refer to understand the toc problems i just understand the basics of toc but not be able to solve the problem of toc and cd plz anyone suggest me what book should i follow even after saw the full playlist of toc i am not be able to solve the basic basic problems plz anyone suggest me something To make my toc and cd concept strong
commented
in
Theory of Computation
Sep 3
61
views
theory-of-computation
2
answers
8
GATE CSE 2021 Set 2 | GA Question: 7
A jigsaw puzzle has $2$ pieces. One of the pieces is shown above. Which one of the given options for the missing piece when assembled will form a rectangle? The piece can be moved, rotated or flipped to assemble with the above piece.
commented
in
Spatial Aptitude
Sep 3
2.4k
views
gatecse-2021-set2
spatial-aptitude
assembling-pieces
0
answers
9
NTA NET-JRF
Dear Sirs, Kindly update all papers of NTA NET-JRF after 2015.
commented
in
Others
Sep 2
24
views
ugcnet
ntanet
test-series
0
answers
10
Is Ipv6 protocol connectionless or connection oriented?
commented
in
Computer Networks
Sep 2
54
views
ipv6
computer-networks
1
answer
11
Operating System
On Solving manually I too getting 14 as answer. but on running more than 14 * are printed.
commented
in
Operating System
Sep 1
211
views
operating-system
ace-test-series
fork-system-call
2
answers
12
GO Classes Weekly Quiz 1 | General Aptitude | Question: 14
If the sum of an infinitely decreasing $\text{GP}$ is $3,$ and the sum of the squares of its terms is $9/2,$ the sum of the cubes of the terms is _________ $\frac{105}{13}$ $\frac{108}{13}$ $\frac{729}{8}$ None of these
answer edited
in
Quantitative Aptitude
Aug 31
138
views
goclasses_wq1
goclasses
quantitative-aptitude
infinite-geometric-progression
2-marks
2
answers
13
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular? A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => Reverse Please describe your answer.
commented
in
Theory of Computation
Aug 30
168
views
theory-of-computation
regular-language
2
answers
14
GATE CSE 2022 | Question: 40
The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are $\text{TRUE}?$ The chromatic number of the graph is $3.$ The graph has a Hamiltonian path. The following graph is isomorphic to the Peterson ... $3.$ (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)
answer edited
in
Graph Theory
Aug 30
1.7k
views
gatecse-2022
graph-theory
graph-isomorphism
multiple-selects
6
answers
15
GATE CSE 2015 Set 2 | Question: GA-7
Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distance of $2\;\text{km; N}$ is southeast of $\text{O}$ by $1\;\text{km}$. What is the distance between $\text{M}$ and $\text{P}$ in $\text{km}$? $5.34$ $6.74$ $28.5$ $45.49$
answer edited
in
Analytical Aptitude
Aug 30
9.2k
views
gatecse-2015-set2
analytical-aptitude
normal
direction-sense
0
answers
16
Asymptotic Functions
Consider f(n) and g(n) be asymptotic non-negative functions. So here can we say that min(f(n), g(n)) = Θ(f(n) + g(n)) My proof for this For f(n) = Θ(g(n)) c1*g(n) $\leq $ f(n) $\leq $ c2*g(n) such that c1, c2 >0 Considering the above definition ... ) So thus we can say that min(f(n), g(n)) = Θ(f(n) + g(n)) Is this the correct way? What would be the correct answer?
comment edited
in
Algorithms
Aug 29
112
views
algorithms
asymptotic-notations
4
answers
17
GATE CSE 2016 Set 1 | Question: 29
Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop. Step 3. If the outcomes are either (HEADS, HEADS) or (HEADS, TAILS), then output $N$ and stop. Step 4. If ... , TAILS), then go to Step $1.$ The probability that the output of the experiment is $Y$ is (up to two decimal places)
commented
in
Probability
Aug 29
8.1k
views
gatecse-2016-set1
probability
normal
numerical-answers
5
answers
18
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
commented
in
Probability
Aug 29
16.0k
views
gatecse-2017-set1
probability
numerical-answers
normal-distribution
2
answers
19
GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.
edited
in
Computer Networks
Aug 29
2.5k
views
gatecse-2022
numerical-answers
computer-networks
routing
distance-vector-routing
3
answers
20
GATE CSE 2022 | GA Question: 5
A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From the additional plates given in the options, which one of the combinations of additional plates would allow ... player should use all the five plates exactly once. The plates can be rotated in their plane. A. B. C. D.
edited
in
Spatial Aptitude
Aug 29
1.2k
views
gatecse-2022
spatial-aptitude
rotation
6
answers
21
GATE CSE 2022 | Question: 52
Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on these two queues are $\textsf{Enqueue (Q, element)}$ ... $\textsf{Final State}$ in the figure) without using any additional storage is________________.
edited
in
DS
Aug 28
5.5k
views
gatecse-2022
numerical-answers
data-structures
queue
1
answer
22
GATE CSE 2022 | Question: 30
Consider a digital display system $\text{(DDS)}$ shown in the figure that displays the contents of register $\text{X}.$ A $16 - \text{bit}$ code word is used to load a word in $\text{X},$ either from $\text{S}$ or from $\text{R}.$ $\text{S}$ is a $1024-$ ... $1:10$ de-multiplexer$; \quad \; \;\text{Q}$ is $1:5$ de-multiplexer$; \quad \text{T}$ is $2:1$ multiplexer
edited
in
Digital Logic
Aug 28
939
views
gatecse-2022
digital-logic
combinational-circuit
3
answers
23
GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.
edited
in
DS
Aug 28
1.9k
views
gatecse-2022
data-structures
linked-list
1
answer
24
Quiz
How many runs a batsman can score in one day match (50 overs / 300 balls) with no wides, no balls, no extras and no over throws?
commented
in
Others
Aug 28
79
views
general-aptitude
numerical-answers
4
answers
25
GATE CSE 2022 | Question: 46
Consider the relational database with the following four schemas and their respective instances. Student(sNo, sName, dNo) Dept(dNo, dName) Course(cNo, cName, dNo) Register(sNo, cNo) ... SELECT cNo FROM Register WHERE sNo = S.sNo) The number of rows returned by the above $\text{SQL}$ query is ____________.
edited
in
Databases
Aug 28
1.8k
views
gatecse-2022
numerical-answers
databases
sql
2
answers
26
UGC NET CSE | November 2017 | Part 2 | Question: 5
Consider the graph given below: Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are chosen is AD, AE, AG, GC, GB, BF GC, GB, BF, GA, AD, AE GC, AD, GB, GA, BF, AE AD, AG, GC, AE, GB, BF
answered
in
Algorithms
Aug 28
1.3k
views
ugcnetcse-nov2017-paper2
graph-algorithms
minimum-spanning-tree
6
answers
27
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
answer selected
in
Theory of Computation
Aug 27
4.7k
views
gate1996
theory-of-computation
context-free-language
easy
1
answer
28
Best Open Video Playlist for Recurrence relation Topic | Discrete Mathematics
Please list out the best free available video playlist for Recurrence relation Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom ... ones are more likely to be selected as best. For the full list of selected videos please see here
asked
in
Study Resources
Aug 8
98
views
missing-videos
go-classroom
free-videos
video-links
recurrence-relation
1
answer
29
A First Course In Probability, 9th Edition, Indian Version, Sheldon Ross, Chapter 2, Problems, 18.
A deck consists of 52 playing cards which is well shuffled. Draw 6 cards. Find the probability that among the cards there will be a representative of all suits? can someone get to this answer –-→ 6283420/20358520
answered
in
Probability
Jul 29
110
views
probability
sheldon-ross
1
answer
30
A question paper is divided into two parts A and B and each part contains 5 questions. In how many ways a student can answer the question paper, if he has to solve total 6 questions including atleast 2 from each section.
answered
in
Combinatory
Jul 3
92
views
combinatory
discrete-mathematics
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
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(645)
Exam Queries
(839)
Tier 1 Placement Questions
(17)
Job Queries
(73)
Projects
(9)
Unknown Category
(851)
Recent Blog Comments
"If you are dead tomorrow your GATE rank is not...
@saheb sarkar1997 Please check the Test...
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.