BCT Engineering Notes

Total Days If Complete Newbie and Never Started, Don't Know Anything :-   Very Hard Days  to pass [7 Days Before Exam + 4 Days Mid Semester Study] Goal - Score Above 45 /80 in the finals  [Aim high if difficult question comes you can pass] The subject is 95% Numerical .This subject be finished for about 45-50 marks mid semester.  There are limited theory [5 % ]  don't expect to pass by studying just theory. It's impossible. This exam is the first exam of the semester so start a week ahead in advance try to finish 2 days before exam. You will certainly miss the mark and finish in the evening of the day before.  It will take you 1 and half day after sitting down to study to just start studying. Numerical & Theory Finish The Tutorial Question Listed below and  old question collection numericals.   As Numerical are connected with theory so see the theory carefully and practice the numerical carefully. Finish Numerical...

List of Important Topic OOP Note 1 OOP Note 2 OOP Note 3 OOP Note 4 File handling 1 File Handling 2 Old Question Old Question Collection Old Question Solution[63-70] Question Solution Tutorial 1 Tutorial 2 Programming All Syntax YouTube Videos Chapter 1 -  Introduction to OOP Chapter 3 -  C++ Language Constructs Chapter 4 -  Objects & Classes Chapter 5 -  Operator Overloading Chapter 6 -  Inheritance Chapter 7 -  Polymorphism & Dynamic Binding Chapter 8 -  File I/O Chapter 9 -  Templates Chapter 10 -  Exception Handling Lab Report Lab 1 Lab 2 Lab 3 Lab 4 Lab 5.1 Lab 5.2 Lab 6.1 Lab 6.2 Lab 7 Chapters Hours Marks distribution* 1, 2, 4 11 20 3 6 10 5 5 10 6 5 10 8 5 10 7, 9, 10 13 20 Total 45 80 Further Reading C++ by Dissection Thinking in C++ Vol1 Thinking in C++ Vol2 Robert Lafore-Object Oriented Programming in C

Syllabus List of Important Topics Chapter 1 - Introduction  Chapter 2 - Finite Automata   Chapter 3-  Context Free Grammar Chapter 4 - Turing Machine Chapter 5 - Undecidability Chapter 6 - Computational Complexity Handwritten Notes Chapter 1 -  Introductions Chapter 2 -  Finite Automata Push Down Automata Chapter 4 -  Turing Machine Tutorial Tutorial of Chapter 2 and 3 Tutorial of Chapter 4  Old Question Solution Old Question Collection Old Question Solution YouTube Chapter 1 -  Introduction Chapter 2 -  Finite Automata Chapter 3 -  Context Free Languages Chapter 4 -  Turing Machine Chapter 5 -  Undecidability Chapter 6 -  Computational Complexity Chapters Hours Marks distribution 1      4      7 2 12 21 3 12 21 4 10 17 5 5 9 6 2 5   Total      45 80