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
Answers by sripo
User sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Computer science gate psu
Which one test series should I purchase for that it will help me all types of computer science related exam like:: PSU,NVS,KVS,CIL,CRIS,BEL,BARC,ISRO ,IBPS SO,SBI SO . ....
answered
Jan 18, 2019
in
GATE

588
views
gatepreparation
isropreparation
+3
votes
2
GATE201163
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
answered
Jan 16, 2019
in
Numerical Ability

1.8k
views
gate2011
numericalability
costmarketprice
normal
+1
vote
3
Regarding When to take test series
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in DecemberJanuary? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
answered
Dec 26, 2018
in
Study Resources

186
views
testseries
preparation
studyresources
0
votes
4
[Test Series] Counting Number of tokens
I am getting 40 as answer,but correct answer given was 41. I have counted >>= as one token but ,in solution it was counted two.
answered
Dec 21, 2018
in
Compiler Design

2.3k
views
compilerdesign
tokens
lexeme
+1
vote
5
GATE2012 AR: GA6
A value of $x$ that satisfies the equation $\log x + \log (x – 7) = \log (x + 11) + \log 2$ is $1$ $2$ $7$ $11$
answered
Nov 23, 2018
in
Numerical Ability

337
views
gate2012ar
numericalability
numericalcomputation
logarithms
+1
vote
6
What is the value of T(n) for the given recurrence relation
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
answered
Nov 14, 2018
in
Algorithms

151
views
recurrence
algorithms
timecomplexity
jest
0
votes
7
Decidability
How to distinguish between a problem which is (undecidable) and which is (undecidable but partially decidable); or rather for a given problem how to say in which category it falls?
answered
Nov 14, 2018
in
Theory of Computation

81
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
+2
votes
8
Decidability
Decidable or Undecidable? Given a Turing machine M, a string s and an integer k, M accepts s within k steps. Please elaborate.
answered
Nov 14, 2018
in
Theory of Computation

92
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
+1
vote
9
GATE20188
Which one of the following statements is FALSE? Contextfree grammar can be used to specify both lexical and syntax rules Type checking is done before parsing Highlevel language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
answered
Nov 10, 2018
in
Compiler Design

2.8k
views
gate2018
compilerdesign
easy
compilationphases
+1
vote
10
Number of Tokens
answered
Nov 10, 2018
in
Compiler Design

651
views
compilerdesign
tokens
compilertokenization
0
votes
11
Algorithms::Ace academy test series question
Can anyone explain me the answer in detail?
answered
Nov 10, 2018
in
Algorithms

132
views
0
votes
12
why do we need O(n), we can do directy check if index is present or not in O(1) time. Please explain..
answered
Nov 10, 2018
in
Algorithms

34
views
algorithms
0
votes
13
test series
Consider the given below languages L1 and L2. L1= {pnqmrmsn  m,n ≥ 0} L2= {pnqnrmsm  m,n ≥ 0} Select the correct statement about, L such that L= (L1 U L2 ) – (L1 ꓵ L2 ) 1. L is CFL but not DCFL 2. L is regular 3. L is CSL but not CFL 4. L is DCFL but not regular i know that L is representing the EXOR of L1 and L2, couldn't visualize as how it will be cfl. please help.
answered
Nov 10, 2018
in
Theory of Computation

101
views
testseries
theoryofcomputation
0
votes
14
GATE19982.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
answered
Oct 16, 2018
in
Theory of Computation

4.2k
views
gate1998
theoryofcomputation
finiteautomata
normal
minimalstateautomata
0
votes
15
GATE19942.3
Amongst the properties $\left\{\text{reflexivity, symmetry, antisymmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2x \neq y\}$ satisfies _________
answered
Oct 6, 2018
in
Set Theory & Algebra

892
views
gate1994
settheory&algebra
normal
relations
descriptive
+5
votes
16
What is the average TAT??
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT??
answered
Jan 14, 2018
in
Operating System

1k
views
50,737
questions
57,324
answers
198,410
comments
105,176
users