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
madeesay test series
eyeamgj
asked
in
Theory of Computation
Aug 23, 2018
236
views
0
votes
0
votes
explain the reasons??
eyeamgj
asked
in
Theory of Computation
Aug 23, 2018
by
eyeamgj
236
views
answer
comment
Follow
share this
share
3 Comments
by
Deepanshu
commented
Aug 23, 2018
reply
Follow
share this
1ST IS RECURSIVE
2ND RECURSIVE ENUMERABLE.
NOT GETTING 3RD CONCEPT CLEARLY
0
0
by
himgta
commented
Aug 23, 2018
reply
Follow
share this
I think 3rd one is not recursive b/c for the strings not present in the language it might fall into infinite loop
0
0
by
Deepanshu
commented
Aug 23, 2018
reply
Follow
share this
@
himgta
THANKS .
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
2
votes
2
votes
1
answer
1
Ankit Gupta 5
asked
in
Computer Networks
Dec 6, 2018
3,431
views
Madeesay Test Series
Consider TCP implements an extension that allows window size much larger than 64KB. Suppose you are using this extended TCP over a 1Gbps link with a latency of 50ms to transfer a 10 MB file and TCP receive window is 1MB. If TCP sends 1KB packet ... multiplied by link latency, then effective throughput of transfer is x Mbps. Find x. (Assuming no congestion and no lost packets)
Ankit Gupta 5
asked
in
Computer Networks
Dec 6, 2018
by
Ankit Gupta 5
3.4k
views
tcp
computer-networks
0
votes
0
votes
0
answers
2
eyeamgj
asked
in
Graph Theory
Nov 21, 2018
248
views
madeesay test series
eyeamgj
asked
in
Graph Theory
Nov 21, 2018
by
eyeamgj
248
views
graph-theory
made-easy-test-series
0
votes
0
votes
1
answer
3
eyeamgj
asked
in
Algorithms
Jun 14, 2018
2,116
views
madeesay work book
An algorithm processes an input of size n if n=4,096 and the run time=512 milliseconds. If n=16,384, run time is 8,192 MS. What is the efficiency in big O notation? O(n^1/2) O(n) O(n^2) O(nlogN)
eyeamgj
asked
in
Algorithms
Jun 14, 2018
by
eyeamgj
2.1k
views
made-easy-booklet
time-complexity
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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
