The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Subham Nagar
User Subham Nagar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Subham Nagar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
Self Doubt on Counters
If in question it is given to find no. of counting states of a counter, does it mean that we need to find Mod of the counter or just the no. of distinct states that the counter can have?
asked
Jan 2, 2019
in
Digital Logic

38
views
digitalcounter
flipflop
+1
vote
0
answers
2
MadeEasy Test Series: Computer Networks  Flow Control Methods
Assume 2 computers are connected via a network. The network uses GoBack 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that has been sent through the network is lost. ... number of extra packets that has to be resent for transmitting 10 such packet through the network? With explanation.
asked
Dec 17, 2018
in
Computer Networks

378
views
madeeasytestseries
computernetworks
flowcontrolmethods
gobackn
0
votes
1
answer
3
B+ tree doubt
Consider a B+ tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a nonroot node? What will be the same in a BTree Please also refer the source from where clearcut formulae are given
asked
Dec 15, 2018
in
Databases

93
views
btree
databases
0
votes
0
answers
4
ACE Test Series
In FCFS CPU Scheduling, when a process with a long Burst Time occupies the CPU, which of the following is said to occur: Convoy Effect Starvation Logically speaking, it should be Starvation as other processes would have to wait for a long time. I just want a confirmation as the answer given is Convoy Effect.
asked
Dec 5, 2018
in
Operating System

58
views
operatingsystem
0
votes
0
answers
5
Interview
Is the 3 year M.Tech RA (January, sponsored) in IIT HYDERABAD course recently implemented? If anyone can give a review as I have been shortlisted for interview to be held on 26th November but i am not sure to attend or not
asked
Nov 20, 2018
in
Others

118
views
interview
admissions
mtech
0
votes
1
answer
6
Application Layer
Is SMTP connectionoriented or connectionless ?
asked
Nov 13, 2018
in
Computer Networks

96
views
applicationlayerprotocols
0
votes
1
answer
7
Test Series
What will be the minimum no. of states for DFA for the above NFA? Please explain.
asked
Sep 23, 2018
in
Theory of Computation

50
views
#dfa
minimalstateautomata
0
votes
0
answers
8
#Gate2016Question
https://gateoverflow.in/39700/gate2016146 In this question, there is a 4th option named "Syntax Error". So in such questions when do syntax error occurs? Is it related to grammar or something else?
asked
Sep 15, 2018
in
Compiler Design

77
views
gateoverflow
syntaxdirectedtranslation
0
votes
2
answers
9
Test Series
Is 1 a lattice?
asked
Sep 1, 2018
in
Set Theory & Algebra

166
views
testseries
lattice
partialorder
discretemathematics
+3
votes
3
answers
10
Test Series
Examine the structure of the EMPLOYEES table: EMPLOYEE_ID NUMBER Primary Key FIRST_NAME VARCHAR2(25) LAST_NAME VARCHAR2(25) Assume all the following four options are executed in the same sequence order. Which statement will not insert a row into the table? a. INSERT ... (employee_id) VALUES (1000); d. INSERT INTO employees (employee_id, first_name, last_name) VALUES ( 1000, John', ');
asked
Aug 1, 2018
in
Databases

191
views
sql
databases
relations
0
votes
3
answers
11
MadeEasy Test Series: CO & Architecture  Pipelining
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 performing multiplications, where Execution state for addition take 1 clock cycle,multiplication take 3 and division ... +51)*3 Am i doing wrong? Solution with explanation of formulae being used will be welcomed.
asked
Jun 9, 2018
in
CO and Architecture

631
views
madeeasytestseries
coandarchitecture
pipelining
0
votes
1
answer
12
Test Series
As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true. Correct me if I am wrong
asked
Jun 5, 2018
in
Theory of Computation

86
views
theoryofcomputation
0
votes
1
answer
13
Test Series
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong. Please if anyone can give the correct solution.
asked
May 6, 2018
in
Theory of Computation

113
views
testseries
finiteautomata
theoryofcomputation
0
votes
4
answers
14
Context Free Language
L= { $a^{n}b^{m}$  $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
asked
May 6, 2018
in
Theory of Computation

211
views
contextfreelanguages
theoryofcomputation
grammar
0
votes
2
answers
15
TheGateAcademy Test Series
In DFA, does each state need to have transition on "EACH" input alphabet? The answer was given "False" but I dont think so. Can anyone explain? Because if this statement is False, then there is no use of "Dead State"
asked
May 6, 2018
in
Theory of Computation

74
views
testseries
theoryofcomputation
0
votes
1
answer
16
Peter Linz Chapter 4.3 Exercise Q.20
I don't think it will be regular . Had the language been uwwRv the expression could have been (a+b)*(aa+bb)(a+b)* as there is no restriction on w. Is it correct? and if it isn't regular, is it a CFL?
asked
May 4, 2018
in
Theory of Computation

136
views
theoryofcomputation
regularlanguages
regularexpressions
0
votes
1
answer
17
Peter Linz Chapter 4
L = {a^n: n ≥ 2, is a prime number}. This is not a regular language. What about L*? Is it regular? Please explain.
asked
May 4, 2018
in
Theory of Computation

106
views
theoryofcomputation
regularexpressions
regularlanguages
0
votes
0
answers
18
BITS HD Application form
In the BITS HD entrance application form, they have also asked for relevant work experience, if any. So what documents should I upload in order to show that I am working. Presently I am working in a service based company and my experience is around 1.75 years.
asked
Apr 28, 2018
in
Written Exam

174
views
bits
admissions
+2
votes
2
answers
19
Sheldon Ross A first course in Probability
An urn contains 6 white and 9 black balls. If 4 balls are to be randomly selected without replacement, what is the probability that the first 2 selected are white and the last 2 black. I solved it in this manner : (6C2 * 9C2)/ (15C4)  getting 36 ... (6*5*9*8)/(15*14*13*12)  6/91 I cannot understand exactly why my approach is not working over here.
asked
Apr 17, 2018
in
Probability

179
views
probability
sheldonross
0
votes
1
answer
20
Context Free Languages
Answer with explanation will be acknowledged.
asked
Apr 13, 2018
in
Theory of Computation

83
views
contextfreelanguages
theoryofcomputation
0
votes
2
answers
21
Self Doubt
Q1. Find 1's and 2's complement of decimal number of 15 Q2. Find 1's and 2's complement of decimal number of 15 Answer with Explanation will be welcomed. :)
asked
Mar 25, 2018
in
Digital Logic

261
views
digitallogic
+1
vote
0
answers
22
BARC , General
Can anyone suggest a good platform for giving practice tests in order to prepare for BARC exam(100 questions in 120 minutes).
asked
Mar 25, 2018
in
BARC

262
views
testseries
0
votes
2
answers
23
Ace Test Series: Algorithms  Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$
asked
Mar 20, 2018
in
Algorithms

188
views
algorithms
acetestseries
timecomplexity
array
+2
votes
1
answer
24
MadeEasy Test Series 2018: Algorithms  Reccurence
Kindly help in solving the following recurrence relation. Solution is given by using Master's Theorem but can it be applied when the parameter 'b' is not an integer? IF not, then how to solve it? options are O(n), O(n^2), O(nlogn), O(n^2 logn)
asked
Jan 26, 2018
in
Algorithms

92
views
algorithms
recurrence
madeeasytestseries
+1
vote
0
answers
25
Sorting
Consider an execution of Quicksort with the first item of an array segment acting as pivot or splitter. After first pass of running quicksort on an array (Assume that we are sorting with increasing order)? 12,18,17,11,13,15,16,10 I want to know what will be the sequence for the first pass
asked
Dec 28, 2017
in
Algorithms

161
views
sorting
algorithms
50,741
questions
57,235
answers
197,995
comments
104,580
users