Review

1
Review

• B.Ramamurthy

2
CS Cube of Enduring Principles, Developing
Competence and Style
3
CS1 (as in CSE115)
BR
CS1
Problem Solving
OO Design
Prog. Lang
Algorithms
-- Class -- Object -- Methods -- Attributes --
Relationships -- Encapsulation -- Inheritance --
Polymorphism
-- Design -- Tools -- Techniques -- Software
Eng. -- Class libraries
-- Elements -- Control Structures -- Data
Structures
-- Sort -- Search
Programming Environment
Special Features
-- Design using GUI
-- OS Solaris 2.7 (unix-based) --
JDK1.2.1 -- Application, Applets
4
Goals
Major Goals
Object-Oriented Principles - Encapsulation -
Inheritance Polymorphism - Reusability and
Large-Scale Design
Programming Language Java - Data Structures -
Control Structures - Syntax - Semantics - Good
Programming Practices
Problem Solving Techniques - Problem statement
to Design - Design to Software - Algorithms -
Special Techniques
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
- Vector - Linked list - Stack - Queue - Tree -
Heap - Design, Definition, Implementation,
Application
- Analysis - Big O notation - Sort and
Search algorithms
- Recursion - Abstraction - Encapsulation -
Inheritance - Polymorphism
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.

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.

8
Topics for the Questions

1. Algorithmic analysis and Big-O notation
2. Heap and complete binary tree
3. Tree Binary Trees
4. Linked List
5. Stacks and Queues
6. Arrays and vectors
7. Object and classes, inheritance and other OO
   principles
8. Problem solving Class diagram
9. Algorithmic problem solving Pseudo code
10. Recursion

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.

10
On Exam day

• Be on time.
• Bring extra pens, pencils and erasers.
• Bring a calculator.
• Dont 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.

11
Exam Time and Location

• 18 December, Monday
• 147 Dienfendorf (South Campus)
• 8am to 11am

12
GOOD LUCK !