1. Review
B.Ramamurthy
4/6/2019 BR

2. CS Cube of Enduring Principles, Developing Competence and Style
Structure/organization
large-scale, small-scale
Algorithmic efficiency, trade-off,
resource requirements
Software engineering
principles
4/6/2019 BR

3. CS1 (as in CSE115) CS1 Prog. Lang Algorithms BR Problem Solving
OO Design
Prog. Lang
Algorithms
-- Design
-- Tools
-- Techniques
-- Software Eng.
-- Class libraries
-- Class
-- Object
-- Methods
-- Attributes
-- Relationships
-- Encapsulation
-- Inheritance
-- Polymorphism
-- Elements
-- Control
Structures
-- Data
-- Sort
-- Search
Programming
Environment
Special Features
-- Design
using GUI
-- OS : Solaris 2.7
(unix-based)
-- JDK1.2.1
-- Application, Applets
4/6/2019 BR

4. Goals Major Goals Object-Oriented Principles - Encapsulation
- Inheritance &
Polymorphism
- Reusability and
Large-Scale Design
Problem Solving
Techniques
- Problem statement
to Design
- Design to Software
- Algorithms
- Special Techniques
Programming
Language : Java
- Data Structures
- Control Structures
- Syntax
- Semantics
- Good Programming
Practices
4/6/2019 BR

5. Topics covered Problem solving Techniques Abstract Data Types (ADT)
Java concepts
Algorithms
Software Engg.
- object
- class
- methods
- attributes
- modifiers
- object instantiation
- inheritance
-applets
-applications
-GUI : awt, swing
-Java2
- interface
- implementation
- package
- Class diagrams
- Recursion
- Abstraction
- Encapsulation
- Inheritance
- Polymorphism
- Vector
- Linked list
- Stack
- Queue
- Tree
- Heap
- Design, Definition,
Implementation,
Application
- Analysis
- Big O
notation
- Sort and
Search
algorithms
4/6/2019 BR

6. Material for Final Exam
Final exam is a comprehensive exam.
The exam is neither open book nor open notes.
But you may bring in 4 sheets any information handwritten by you.
4/6/2019 BR

7. Exam Format See the second exam format.
There will be 10 major questions each with many sub-questions.
Topics are as discussed in the next slide.
4/6/2019 BR

8. Topics for the Questions
Algorithmic analysis and Big-O notation
Heap and complete binary tree
Tree : Binary Trees
Linked List
Stacks and Queues
Arrays and vectors
Object and classes, inheritance and other OO principles
Problem solving: Class diagram
Algorithmic problem solving: Pseudo code
Recursion
4/6/2019 BR

9. How to Study?
With topics listed above as target, read the chapters from the text.
Prepare notes
Go through the exercises at the end of relevant chapters using only the notes.
You may need to update your notes.
Go through home work exercise. Update notes.
4/6/2019 BR

10. On Exam day Be on time. Bring extra pens, pencils and erasers.
Bring a calculator.
Don’t forget the four sheets of paper.
If you have any questions during the exam, do not hesitate to ask one of the proctors in the exam hall.
4/6/2019 BR

11. Exam Time and Location 18 December, Monday
147 Dienfendorf (South Campus)
8am to 11am
4/6/2019 BR

12. GOOD LUCK !
4/6/2019 BR