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 yg92
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by yg92
41
votes
7
answers
1
GATE CSE 2017 Set 1 | Question: 14
Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Server-side TCP responds by sending an ACK, which is ... TCP connection wait for the FIN from the server-side TCP? LAST-ACK TIME-WAIT FIN-WAIT-$1$ FIN-WAIT-$2$
asked
in
Computer Networks
Feb 14, 2017
13.8k
views
gatecse-2017-set1
computer-networks
tcp
0
votes
1
answer
2
Gate_2017_Set_1_9
asked
in
Operating System
Feb 14, 2017
435
views
operating-system
1
vote
1
answer
3
Gate2017_Set_1_6
asked
in
CO and Architecture
Feb 14, 2017
341
views
co-and-architecture
0
votes
3
answers
4
Gate 2017 Set-1 first order logic
Consider following first order logic $\forall x ( \exists y R( x, y ) )$ is equivalent to 1) $\exists y ( \exists x R( x, y ) )$ 2) $\exists y ( \forall x R( x, y ) )$ 3) $\forall y ( \exists x R( x, y ) )$ 4) $\neg \exists x ( \forall y \neg R(x,y) )$ Note: Not sure in the question was it equivalent to or which of these are implied by
asked
in
Mathematical Logic
Feb 12, 2017
2.3k
views
discrete-mathematics
first-order-logic
0
votes
1
answer
5
Gate 2017 Set 1 minimum Comparisons
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required in worst case by optimal algorithm?
asked
in
Programming in C
Feb 12, 2017
202
views
numerical-answers
algorithms
0
votes
1
answer
6
Gate 2017 Set-1 Min Reg/Nor gates
Could somone pls confirm what is the ans for min NOR gates and min number of Registers? Also what was the marks distribution for Memory Leal/Malloc DS question?
asked
in
Digital Logic
Feb 12, 2017
474
views
digital-logic
co-and-architecture
6
votes
6
answers
7
Gate ECE 2017 Eigen Value
For the given matrix A, one of the Eigenvalue is real $A=\begin{bmatrix} 1 &2 &3 &4 &5 \\ 5 &1 &2 &3 &4 \\ 4&5 &1 &2 &3 \\ 3&4 &5 &1 &2 \\ 2 &3 &4 &5 &1 \end{bmatrix}$ The real Eigen value is:
asked
in
Linear Algebra
Feb 8, 2017
5.2k
views
matrix
eigen-value
1
vote
1
answer
8
Count(*) when one of the tuple has null values in all column?
Ideally Count(*) will count no of rows in which atleast one column is Non NULL otherwise discard that row. Is this statement true? But when I am trying practically it is returning the count including the null tuple where all columns ... // Returning 2 rows which is correct select count(*) from stud; // Returning 4 rows. Is this correct?
asked
in
Databases
Feb 8, 2017
1.4k
views
databases
sql
4
votes
0
answers
9
Are CSL, RE, Recursive languages closed under Subset operation?
Regular languages are not closed under Subset - Example anbn is subset of a*b* which is non-regular. DCFL/CFL languages are not closed under Subset - Example anbncn is subset of anbnc* which is non-cfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?
asked
in
Theory of Computation
Feb 8, 2017
2.7k
views
theory-of-computation
recursive-and-recursively-enumerable-languages
context-sensitive
context-sensitive-languages
closure-property
1
vote
0
answers
10
Is the expressive power of LeftRecursive grammar equivalent to RightRecursive Grammar?
Can every left recursive grammar be converted to right recusrive grammar? We have rules for that. So I think the ans is YES. Do every DCFL has LL(1) grammar?? If a language is DCFL implies it is unambiguous ... to one correspondence with LR(1) grammar why does it not have one to one correspondence with LL(1) ?
asked
in
Compiler Design
Feb 8, 2017
323
views
compiler-design
parsing
dcfl
3
votes
1
answer
11
GeeksQuiz No of Linearly Independent Vector for Eigen value
The number of linearly independent eigen vector for eigen value 1 $\begin{bmatrix} 1 & 3 & 2 \\ 0 & 4 & 2\\ 0 &-3 & -1 \end{bmatrix}$ ... linearly independent Vector should be equal to Matrix Rank = 1 ? The ans given is No Of Unknown - Rank ( 3-1 = 2)
asked
in
Linear Algebra
Feb 5, 2017
1.5k
views
eigen-value
linear-algebra
engineering-mathematics
geeksforgeeks-test-series
0
votes
0
answers
12
How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices - 2nC2 No of Simple Undirected Graph with labelled vertices - ? No of Simple Undirected Connected Graph with unablled vertices - ? No of Simple Undirected Connected Graph with labelled vertices - ?
asked
in
Programming in C
Feb 5, 2017
440
views
graph-theory
graph-algorithms
data-structures
algorithms
combinatory
5
votes
2
answers
13
Understanding How to Identify Number of Tables for ER Diagram
Doubts - 1) When a ER diagram is given and no cardinalities are provided. How to determine relationship type 1:1 or 1:N or M:N ? Generally in such ER diagrams arrows are given. Referring to this article where arrow is a ... ternary relation? Is there a relationship between E3 and E2 via R1 in below example ? Question 1 - Question 2 -
asked
in
Databases
Jan 29, 2017
7.1k
views
databases
er-diagram
er-to-relational
1
vote
1
answer
14
Permutation and Combinations
The number of ways to choose n things from 2n things of which n are alike and rest are unlike?
asked
in
Combinatory
Jan 29, 2017
644
views
cbt-2017
discrete-mathematics
combinatory
0
votes
1
answer
15
Virtual Gate Test Series: Theory Of Computation - CFL Self Concatenation
Let $L$ be a given context-free language over the alphabet $\{a, b\}$ then $L_{2} = L·L$ is $\text{CFL.}$ Is $\text{CFL.}$ in general closed under $\text{self-concatenation?}$ If $L={ a^nb^n }$ then $L.L= { a^nb^na^nb^n }$ $\text{(or)}$ $L.L= { a^nb^na^mb^m } ?$
asked
in
Theory of Computation
Jan 25, 2017
473
views
theory-of-computation
regular-language
context-free-language
virtual-gate-test-series
2
votes
0
answers
16
Identify MOD of the Counter
Clock Q0 Q1 Q2 State 0 0 0 0 1 1 0 0 1 2 0 1 0 2 3 1 1 0 3 4 0 0 1 4 5 1 0 1 5 At clock t5 or lets say after 5 clock pulses Q0 and Q2 becomes 1 and through NAND gate they will become 0 and since preset ... connecting clock to the gate play any significance role? Doubt is similar to the one of the gate questions asked prviously : https://gateoverflow.in/1234/gate2007-36
asked
in
Digital Logic
Jan 22, 2017
4.5k
views
digital-logic
digital-counter
flip-flop
sequential
combinational-circuit
2
votes
1
answer
17
Recurrence relation for total no of n length English letter words, with even no of a’s
The recurrence relation for total no of n length English letter words, with even no of a's. Below is some parts I could build - Assumptions - 26 english letters and no epsilon Let us assume a string ... odd 'a's Could someone please guide how to proceed further and if things are correct till here?
asked
in
Combinatory
Jan 14, 2017
630
views
recurrence-relation
combinatory
1
vote
0
answers
18
Probablity Knockout Round
In a knockout tournament $2^n$ equally skilled players;S1,S2,...,S2^n are participating.In each round players are divided in pair at random and winner from each pair moves in the next round.If S2 reaches the semi-final then the probability that S1 wins ? Could someone please help with hints/approach to solve this?
asked
in
Probability
Jan 6, 2017
739
views
engineering-mathematics
probability
combinatory
testbook-test-series
2
votes
1
answer
19
Counting No of States in the DFA
Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's } over alphabet { 0,1,2,3 } The answer given is 8. Should not the ans be 16? Using the ... 2 can take either one. Is it possible to get 8 states after minimization for the above DFA? Any simpler way of finding that logically?
asked
in
Theory of Computation
Jan 1, 2017
4.8k
views
minimal-state-automata
finite-automata
theory-of-computation-
theory-of-computation
0
votes
1
answer
20
Testing Connectivity/LoopBack Address
A system is connected to n/w 192.168.1.0 with IP 192.168.1.2 . System will check its connectivity to Internet by sending control packet SIP- 192.168.1.2 DIP- ? 192.168.1.0 192.168.1.1 127.1.1.1 127.0.0 ... ? Nothing going through the loopback adapter goes out to the Internet, or leaves your system. The loopback adapter is completely contained within the system
asked
in
Computer Networks
Jan 1, 2017
867
views
network-addressing
computer-networks
ip-addressing
Page:
1
2
next »
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:...