Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sripo
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 . ....
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 .......
943
views
answered
Jan 18, 2019
GATE
gate-preparation
isro-preparation
+
–
8
votes
2
GATE CSE 2011 | Question: 63
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$
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...
4.9k
views
answered
Jan 16, 2019
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
cost-market-price
normal
+
–
1
votes
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 December-January? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
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 Dece...
876
views
answered
Dec 26, 2018
Study Resources
test-series
preparation
study-resources
+
–
0
votes
4
Tokens, Lexeme and Pattern
There are 40 tokens in this question. But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the above program is _______ " OR "The number of ... - Keyword, Operators, Identifiers, Constant, Punctuation Symbol and String Constants. How token and lexeme are different from each other?
There are 40 tokens in this question.But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the abov...
5.4k
views
answered
Dec 21, 2018
Compiler Design
compiler-design
compiler-tokenization
test-series
+
–
1
votes
5
GATE2012 AR: GA-6
A value of $x$ that satisfies the equation $\log x + \log (x – 7) = \log (x + 11) + \log 2$ is $1$ $2$ $7$ $11$
A value of $x$ that satisfies the equation $\log x + \log (x – 7) = \log (x + 11) + \log 2$ is$1$ $2$ $7$ $11$
2.1k
views
answered
Nov 23, 2018
Quantitative Aptitude
gate2012-ar
quantitative-aptitude
numerical-computation
logarithms
+
–
3
votes
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
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
1.6k
views
answered
Nov 14, 2018
Algorithms
recurrence-relation
algorithms
time-complexity
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?
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...
468
views
answered
Nov 14, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
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.
Decidable or Undecidable? Given a Turing machine M, a string s and an integer k, M accepts s within k steps.Please elaborate.
525
views
answered
Nov 14, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
2
votes
9
GATE CSE 2018 | Question: 8
Which one of the following statements is FALSE? Context-free grammar can be used to specify both lexical and syntax rules Type checking is done before parsing High-level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
Which one of the following statements is FALSE?Context-free grammar can be used to specify both lexical and syntax rulesType checking is done before parsingHigh-level lan...
11.7k
views
answered
Nov 10, 2018
Compiler Design
gatecse-2018
compiler-design
easy
compilation-phases
1-mark
+
–
1
votes
10
Number of Tokens
3.7k
views
answered
Nov 10, 2018
Compiler Design
compiler-design
compiler-tokenization
test-series
+
–
0
votes
11
Algorithms::Ace academy test series question
Can anyone explain me the answer in detail?
Can anyone explain me the answer in detail?
727
views
answered
Nov 10, 2018
Algorithms
ace-test-series
time-complexity
+
–
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..
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ...
285
views
answered
Nov 10, 2018
Algorithms
algorithms
time-complexity
+
–
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 EX-OR of L1 and L2, couldn't visualize as how it will be cfl. please help.
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 thatL= (L1 U L2 ) – (L1 ꓵ ...
658
views
answered
Nov 10, 2018
Theory of Computation
test-series
theory-of-computation
+
–
0
votes
14
GATE CSE 1998 | Question: 2.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$
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$...
17.4k
views
answered
Oct 16, 2018
Theory of Computation
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
1
votes
15
GATE CSE 1994 | Question: 2.3
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
5.1k
views
answered
Oct 6, 2018
Set Theory & Algebra
gate1994
set-theory&algebra
normal
relations
fill-in-the-blanks
+
–
7
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??
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??
7.7k
views
answered
Jan 14, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register