Sikkim Manipal University

These are complete and well-structured Object Oriented Programming (OOP) class notes for SMIT MCA Semester 2. The notes are prepared in simple and easy language, making them perfect for quick understanding, revision, and exam preparation. Topics included: Classes & Objects, Encapsulation, Inheritance, Polymorphism, Abstraction, Constructors, Method Overloading & Overriding, and other key OOP concepts. These notes are ideal for SMIT MCA students who want structured and reliable study materi...

These are complete and well-structured Object Oriented Programming (OOP) class notes for SMIT MCA Semester 2. The notes are prepared in simple and easy language, making them perfect for quick understanding, revision, and exam preparation.

These are complete and well-structured Object Oriented Programming (OOP) class notes for SMIT MCA Semester 2. The notes are prepared in simple and easy language, making them perfect for quick understanding, revision, and exam preparation. Unit-wise organized content Covers all important OOP concepts Exam-oriented explanation Helpful for assignments, viva, and last-minute study Clear and concise format

Complete SMIT MCA Semester 2 OOP notes designed for scoring high in exams. These notes are unit-wise, easy to understand, and based on classroom lectures. Perfect for quick revision, concept clarity, assignments, and viva preparation. If you are looking for short, accurate, and exam-focused OOP notes, this document will save your time and help you study efficiently.

Complete SMIT MCA Semester 2 OOP notes designed for scoring high in exams. These notes are unit-wise, easy to understand, and based on classroom lectures. Perfect for quick revision, concept clarity, assignments, and viva preparation. If you are looking for short, accurate, and exam-focused OOP notes, this document will save your time and help you study efficiently.

These are complete classroom notes for MCA at Sikkim Manipal Institute of Technology (SMIT). The notes are unit-wise, easy to understand and exam-oriented. Includes important questions, key concepts and well-structured explanations based on the latest 2025–2026 syllabus. Helpful for quick revision, semester exams and last-minute preparation.

Very helpful document. Student are very helpful. Class notes.

This unit defines the technique of transform and conquers. It describes the method of presorting, the Gaussian elimination technique and the approach of AVL and 2-3 trees in balanced search trees. It also defines heap sort and the problem reduction strategy.

This unit explains the importance of space-time tradeoff in programming. It describes the process of sorting by counting and the input enhancement in string matching. It explains hashing technique the B-Tree technique with respect to space and time tradeoffs.

This unit explains the types of asymptotic notations. It lists the basic asymptotic efficiency classes. It also describes the efficient analysis of non recursive algorithms with illustrations.