The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged calicutgateacademytestseries
+3
votes
2
answers
1
Calicut Gate Academy Test Series  DAA Complexity
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$ $\Theta (n^{2})$ O(log n) None
asked
Jan 2, 2017
in
Algorithms
by
PEKKA
Active
(
2.2k
points)

175
views
testseries
calicutgateacademytestseries
algorithms
timecomplexity
0
votes
2
answers
2
Calicut Gate Academy Test Series  DAA Time complexity Q2
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;
asked
Dec 6, 2016
in
Algorithms
by
PEKKA
Active
(
2.2k
points)

114
views
testseries
calicutgateacademytestseries
algorithms
timecomplexity
+1
vote
1
answer
3
Calicut Gate Academy Test Series  DAA Find Complexity
Complexity of the below code snippet is .. for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } } $O(nlog n)$ $O(n^{2})$ $O(nloglog n)$ $O(n)$
asked
Dec 6, 2016
in
Algorithms
by
PEKKA
Active
(
2.2k
points)

76
views
testseries
calicutgateacademytestseries
algorithms
timecomplexity
0
votes
1
answer
4
Calicut Gate Academy Test Series  TOC Q32
Let ⟨M⟩ be the encoding of a Turing machine as a string over Σ={0,1} Let L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}. Then L is Recursively enumerable Not Recursively enumerable Recursive Udecidable (Multiple Options May be Correct . Mark them All )
asked
Dec 5, 2016
in
Theory of Computation
by
PEKKA
Active
(
2.2k
points)

152
views
testseries
calicutgateacademytestseries
theoryofcomputation
turingmachine
0
votes
1
answer
5
Calicut Gate Academy Test Series  TOC
L={ambnckdl  (nk ) is odd only if (ml) is odd , m,n,k,l >=0 } is best fit under which language class RL DCFL CFL CSL
asked
Dec 5, 2016
in
Theory of Computation
by
PEKKA
Active
(
2.2k
points)

84
views
testseries
calicutgateacademytestseries
theoryofcomputation
+1
vote
1
answer
6
Calicut Gate Academy Test Series
The Java language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
asked
Dec 5, 2016
in
Theory of Computation
by
PEKKA
Active
(
2.2k
points)

109
views
testseries
theoryofcomputation
calicutgateacademytestseries
+2
votes
2
answers
7
Calicut Gate Academy Test Series
Common Data For Questions 1 and Question 2 Direct Mapping cache given below 17tag  10block  5word , 2 to 1 MUX / OR has latency of 0.6ns ,kbit comparator has katency of k/10 ns Question 1 If a two way set associative cache is constructed ... Number of MUX/OR and Compators Needed in Direct Mapped Cache (#MUX/OR , Comparator) are (1,17) (17,1) (1024,1) None
asked
Dec 4, 2016
in
CO & Architecture
by
PEKKA
Active
(
2.2k
points)

364
views
testseries
coandarchitecture
cachememory
calicutgateacademytestseries
To see more, click for the
full list of questions
or
popular tags
.
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
IIT Gandhinagar review
Is DAIICT good for doing MTech ?
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
Follow @csegate
Recent questions tagged calicutgateacademytestseries
Recent Blog Comments
congrats man!!! u surely need guts to leave job...
You won't get M.Tech degree then
I have generic query , not just about iit gn but...
Thank you Abhishek
Heartliest Congratulation Abhishek Bhai. This was...
48,515
questions
52,763
answers
183,377
comments
68,234
users