Toggle navigation
GATECSE
Home
Tools
Recent Changes
Special Pages
Upload a File
Log in
Category:Compact Notes for Reference of Understanding
Revision as of 18:22, 23 February 2014 by
Arjun Suresh
(
talk
|
contribs
)
(Created page with "
Category:GATE
")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Pages in category "Compact Notes for Reference of Understanding"
The following 9 pages are in this category, out of 9 total.
C
Closure Property of Language Families
Complexities of Basic Sorting Algorithms
G
Grammar: Decidable and Undecidable Problems
I
Identify the class of the language
N
NP, NP Complete, NP Hard
Number of Binary trees possible with n nodes
R
Rice's Theorem with Examples
S
Some Reduction Inferences
W
Which of the following logic statements are valid?
Category
:
GATE
GATECSE