Skip to main content
Home
Learn
Courses
Programming in C
Operating Systems
Mathematics
Digital Logic Design
Database Management System
Data Structures
Computer Organisation
Computer Networks
Compiler design
Algorithms
Theory of Computation
Practise
Doubts
Solved Examples
Virtual GATE
Quiz
Class Rooms
Blog
More
Reach to us
Contact Us
Request a Topic
Join us
Internship
Teach with Techtud
GATE 2018 Feedback
Your Interview
Professor's Interview
Research Scholar's Interview
Exam topper's interview
About
About Techtud
The Team
User Levels and Credentials
Benefits
Earn Techtud Tee
Search Courses, Topics, Classroom and Educators
Apply
Login
Register
Notes
Video
Example
Resource
Doubts
Quiz
Previous
Next
Gate1995_1.9
Mohit Lalwani
3 years 4 months
ago
Gate1996_1.8
Mohit Lalwani
3 years 4 months
ago
Gate1997_6.4
Mohit Lalwani
3 years 4 months
ago
Gate1998_1.9
Mohit Lalwani
3 years 4 months
ago
Gate2003_14
Mohit Lalwani
3 years 4 months
ago
Gate2007_74
Mohit Lalwani
3 years 4 months
ago
Gate2008_52
Mohit Lalwani
3 years 4 months
ago
Gate2010_39
Mohit Lalwani
3 years 4 months
ago
Solved Example on Regular Expressions
PREETI KAUR
3 years 9 months
ago
Which one of the following languages over the alphabet {0,1} : GATE-2009
Neha
4 years 3 weeks
ago
Let L = { w ∈ ( 0 + 1 )* | w has even number of 1s } , i.e. L is the set : GATE-2010
Neha
4 years 1 month
ago
The length of the shortest string NOT in the language (over S = {a,b}) : GATE-2014
Neha
4 years 1 month
ago
Pages
1
2
next ›
last »
