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 sripo
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 . ....
answered
in
GATE
Jan 18, 2019
942
views
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$
answered
in
Quantitative Aptitude
Jan 16, 2019
4.8k
views
gatecse-2011
quantitative-aptitude
cost-market-price
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 December-January? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
answered
in
Study Resources
Dec 26, 2018
844
views
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?
answered
in
Compiler Design
Dec 21, 2018
5.4k
views
compiler-design
compiler-tokenization
test-series
1
vote
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$
answered
in
Quantitative Aptitude
Nov 23, 2018
2.1k
views
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
answered
in
Algorithms
Nov 14, 2018
1.6k
views
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?
answered
in
Theory of Computation
Nov 14, 2018
454
views
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.
answered
in
Theory of Computation
Nov 14, 2018
516
views
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
answered
in
Compiler Design
Nov 10, 2018
11.6k
views
gatecse-2018
compiler-design
easy
compilation-phases
1-mark
1
vote
10
Number of Tokens
answered
in
Compiler Design
Nov 10, 2018
3.7k
views
compiler-design
compiler-tokenization
test-series
0
votes
11
Algorithms::Ace academy test series question
Can anyone explain me the answer in detail?
answered
in
Algorithms
Nov 10, 2018
768
views
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..
answered
in
Algorithms
Nov 10, 2018
271
views
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.
answered
in
Theory of Computation
Nov 10, 2018
662
views
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$
answered
in
Theory of Computation
Oct 16, 2018
17.3k
views
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
1
vote
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 _________
answered
in
Set Theory & Algebra
Oct 6, 2018
5.1k
views
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??
answered
in
Operating System
Jan 14, 2018
7.6k
views
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:...