If you are a student in the third year of the Bachelor of Computer Science program at Savitribai Phule Pune University (SPPU), you might find Theoretical Computer Science (TCS) to be a tough subject. To help you prepare for your exams, we offer previous years' solved question papers for TCS. These papers are important because they give you an idea of the exam format, the marking system, and the topics that have been covered in past exams. In this article, you will find these question papers for TYBCS in PDF format.
Why You Should Download SPPU TY BCS Solved Papers PDF?
- Exam Pattern: Learn how the TYBCS semester exam is organized and what format it follows.
- Important Topics: Pay attention to the subjects that often come up in exams, especially the long answer questions.
- Problem-Solving Speed: Doing practice papers will help you manage your time better and solve questions more efficiently.
- Confidence:- With available solutions, you can clarify doubts and improve your understanding of difficult concepts.
Syllabus Overview of Theoretical Computer Science (TCS) for TY BCS
- Symbol, Alphabet, String, Prefix and Suffix of Strings, Formal Language, Operations on Languages.
- Deterministic Finite Automaton – Definition, DFA as Language Recognizer, DFA as Pattern Recognizer.
- Non-deterministic Finite Automaton – Definition and Examples.
- NFA To DFA (Myhill-Nerode Method)
- NFA with ε – Transitions Definition and Examples.
- NFA with ε – Transitions to DFA and Examples
- Finite Automaton with Output – Mealy and Moore Machine, Definition and Examples.
- Minimization of DFA, Algorithm and Problem using Table Method.
2. Regular Expressions and Languages (06 Lectures)
- Regular Expressions (RE) – Definition and Examples.
- Regular Expressions Identities.
- Regular Language – Definition and Examples.
- Conversion of RE to FA – Examples.
- Pumping Lemma for Regular Languages and Applications.
- Closure Properties of Regular Languages.
3. Context-Free Grammars and Languages (10 Lectures)
- Grammar – Definition and Examples.
- Derivation – Reduction – Definition and Examples.
- Chomsky Hierarchy.
- CFG – Definition and Examples. LMD, RMD, Parse Tree.
- Ambiguous Grammar – Concept and Examples.
- Simplification of CFG – Removing Useless Symbols, Unit Production, ε-Production and Nullable Symbol.
- Normal Forms – Greibach Normal Form (GNF) and Chomsky Normal Form (CNF).
- Regular Grammar – Definition.
- Left Linear and Right Linear Grammar – Definition and Example.
- Equivalence of FA and Regular Grammar.
- Construction of Regular Grammar Equivalent to a given DFA.
- Construction of a FA from the given Right Linear Grammar.
4. Pushdown Automata (05 Lectures)
- Definition of PDA and Examples.
- Construction of PDA using Empty Stack and Final State Method – Examples using Stack Method.
- Definition DPDA and NPDA, their Correlation and Examples of NPDA.
- CFG to DPDA – Conversion Examples and Examples of CFG Converted to PDA.
- Construction of PDA Equivalent to given CFG.
5. Turing Machine (05 Lectures)
- The Turing Machine Model, Definition, and Design of TM.
- Problems on Language Recognizers.
- Language Accepted by TM.
- Types of Turing Machines (Multitrack TM, Two-way TM, Multitape TM, Non-deterministic TM).
- Introduction to LBA (Basic Model) and CSG, (Without Problems).
List of Solved Question Papers Available for Download
| Solved Question Paper | Download PDF |
|---|---|
| Solved Question Paper 1 | Download PDF |
| 6 Question papers In 1 Pdf | Download PDF |
| Solved Question Paper 3 | Download PDF |
| Solved Question Paper 4 | Download PDF |
| Solved Question Paper 5 | Download PDF |
How to Download TY BCS Solved Question Papers PDF?
You can easily download BCS solved question papers in PDF format by clicking on the links above. These PDFs are free and simple to download, and they can help you prepare for your upcoming exams. If you’re looking for SPPU TY BCS solved papers or SPPU Computer Science exam papers, we have everything you need.
Conclusion
FAQ
1. How many backlogs are allowed in SPPU?
Ans:- Students can attempt backlog exams a maximum of 3 times for odd semesters and 2 times for even semesters.
2. Who is eligible for BSc computer science at Pune University?
Ans:- Candidates must have completed Class 12 in Science with Mathematics, securing at least 45% marks (40% for reserved categories) from a recognized board.
3. What are the subjects in BSc computer science first year Pune University?
Ans:- Savitribai Phule Pune University offers a Three Year Degree Course that strengthens programming skills through courses in Statistics, Mathematics, Electronics, Data Structures, and Object-Oriented Programming.