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
textbook
[closed]
suneetha
asked
in
Theory of Computation
Jan 23, 2019
closed
Jan 23, 2019
by
suneetha
143
views
0
votes
0
votes
closed with the note:
ans came
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
suneetha
asked
in
Theory of Computation
Jan 23, 2019
closed
Jan 23, 2019
by
suneetha
by
suneetha
143
views
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
zshaikh
asked
in
Theory of Computation
May 10, 2023
216
views
Exercise 1.30 from the textbook "Introduction to the Theory of Computation" by Michael Sipser (3rd edition).
zshaikh
asked
in
Theory of Computation
May 10, 2023
by
zshaikh
216
views
0
votes
0
votes
2
answers
2
Pratik.patil
asked
in
Databases
Aug 31, 2023
440
views
Ace DBMS Textbook
Consider a relation R(A,B,C,D,E,F,G) and the following functional dependencies: (B->D, D->E, AB->C, AE-F, C -> A, F -> G } and choose the correct option: (A) Only A and B are prime attributes (D) Only A, B and C are prime attributes (B) Only B and C are prime attributes (C) Only A, B and F are prime attributes
Pratik.patil
asked
in
Databases
Aug 31, 2023
by
Pratik.patil
440
views
0
votes
0
votes
1
answer
3
Ray Tomlinson
asked
in
CO and Architecture
Aug 19, 2023
452
views
Computer Organisation Textbook Questions
Consider the case memory which has 0.8 and 0.9 hit ratio for read and write operation. Whenever there exist here miss either read or write 2 word block is to be moved from main memory to case memory. The case access time is ... time for read operation, 2. second find average access time for write operation, 3. average access time overall and throughput.
Ray Tomlinson
asked
in
CO and Architecture
Aug 19, 2023
by
Ray Tomlinson
452
views
co-and-architecture
reference-book
computer-architecture
cache-memory
carl-hamacher
0
votes
0
votes
1
answer
4
Aniket1710
asked
in
Algorithms
Jul 11, 2023
341
views
Ace textbook
What is the time complexity of best algorithm that decides whether a given directed graph represented as adjacency Matrix contains a sink or not ? (a)O(V^2) (b)O(VlogV) (c)O(V^2logV) (d)O(V)
Aniket1710
asked
in
Algorithms
Jul 11, 2023
by
Aniket1710
341
views
algorithms
time-complexity
matrix
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