Competitive Exams

## Vidyalankar Module 1_TCS

The GATE program will help you to overcome the common feeling of confusion about the exact scope of the syllabus. The course content will enable you to cover the course smoothly in the limited time at your disposal without wasting time on unnecessary details, without omitting any useful part. The program provides graded questions in every topic leading you to deeper and more intricate and basic concepts. This will help you to stimulate your own thinking and also makes the process of learning, enjoyable and highly efficient. The quick methods suggested to tackle questions and the practice that one has to put in while solving the problems develops in you the required skill of tackling tricky problems independently and confidently. We are sure you will be in a position to deal with every and any problem most successfully.
• Publisher: VIDYALANKAR
• Language: English
Total Price: 0
• Chapter 1

### THEORETICAL COMPUTER SCIENCE- FINITE STATE MACHINE Price 0.20  |  0.2 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.
• Chapter 2

### THEORETICAL COMPUTER SCIENCE- REGULAR EXPRESSIONS AND LANGUAGES Price 0.20  |  0.2 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.
• Chapter 3

### THEORETICAL COMPUTER SCIENCE -CONTEXT-FREE LANGUAGES AND PUSHDOWN AUTOMATA Price 0.20  |  0.2 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.
• Chapter 4

### THEORETICAL COMPUTER SCIENCE- TURING MACHINE Price 0.30  |  0.3 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.
• Chapter 5

### THEORETICAL COMPUTER SCIENCE- ANALYSIS OF ALGORITHMS AND COMPUTATIONAL COMPLEXITY Price 0.20  |  0.2 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.
• Chapter 6

### THEORETICAL COMPUTER SCIENCE- ID PROBLEMS PRACTICE PROBLEMS AND SOLUTIONS Price 0.20  |  0.2 Rewards Points

Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideâ€andâ€conquer. Graph search, minimum spanning trees, shortest paths.