Final Review B.Ramamurthy 5/8/2019 BR.

Slides:



Advertisements
Similar presentations
PROGRAMMING LANGUAGE (JAVA) UNIT 42 BY ROBERT BUTTERFIELD TELEPHONE Data Structures and Algorithms.
Advertisements

Review. What to know You are responsible for all material covered in lecture, the readings, or the programming assignments There will also be some questions.
CSCE 210 Data Structures and Algorithms
Data Structures and Programming.  John Edgar2.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
CSCA48 Course Summary.
Java Collections An Introduction to Abstract Data Types, Data Structures, and Algorithms David A Watt and Deryck F Brown © 2001, D.A. Watt and D.F. Brown.
CS Data Structures II Review & Final Exam. 2 Topics Review Final Exam.
11/23/2015B.Ramamurthy1 Exam1 Review CSE111 B.Ramamurthy.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
12/4/20151 Introduction To Computer Science Bina Ramamurthy.
1 CSC 427: Data Structures and Algorithm Analysis Fall 2006 See online syllabus (also available through Blackboard): Course goals:
Data Structures and Algorithms in Java AlaaEddin 2012.
Introduction to Objects and Encapsulation Computer Science 4 Mr. Gerb Reference: Objective: Understand Encapsulation and abstract data types.
 Saturday, April 20, 8:30-11:00am in B9201  Similar in style to written midterm exam  May include (a little) coding on paper  About 1.5 times as long.
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Exam 2 Review CS 3358 Data Structures. 90 Total Points – 50 Points Writing Programs – 25 Points Tracing Algorithms, determining results, and drawing pictures.
Final Exam Review CS 3358.
CSC 421: Algorithm Design & Analysis
CSCE 210 Data Structures and Algorithms
CSC 427: Data Structures and Algorithm Analysis
CSC 222: Computer Programming II
COMP9024: Data Structures and Algorithms
INTERMEDIATE PROGRAMMING WITH JAVA
CSc 020: Programming Concepts and Methodology II
Midterm Review.
CS 315 Data Structures B. Ravikumar Office: 116 I Darwin Hall Phone:
Exam Hints.
Final Review.
September 27 – Course introductions; Adts; Stacks and Queues
CSC 421: Algorithm Design & Analysis
Exam 2 Review CS 3358 Data Structures.
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
Exam 2 Review CS 3358 Data Structures.
Exam 1 Review CS 3358.
Exam 1 Review CS 3358.
Midterm Review CSE341 B. Ramamurthy 12/1/2018 B.Ramamurthy.
CS3901 Intermediate Programming & Data Structures Introduction
Midterm Review CSE321 B.Ramamurthy 12/3/2018 B.Ramamurthy.
Final Review CSE321 B.Ramamurthy 12/4/2018 B.Ramamurthy.
Final Exam Review CSE 241 B.Ramamurthy 12/5/2018 B.Ramamurthy.
Exam 2 Review CS 3358 Data Structures.
Introduction to Computer Science for Majors II
Exam1 Review CSE111 B.Ramamurthy 1/1/2019 B.Ramamurthy.
Final Review CSE321 B.Ramamurthy 1/1/2019 B.Ramamurthy.
Exam1 Review CSE113 B.Ramamurthy 2/16/2019 B.Ramamurthy.
Final Review CSE 421/521 B.Ramamurthy 2/19/2019 B.Ramamurthy.
Review CSE116 2/21/2019 B.Ramamurthy.
Midterm Review CSE4/521 B.Ramamurthy 2/23/2019 B.Ramamurthy.
Midterm Review CSE321 B.Ramamurthy 2/23/2019 B.Ramamurthy.
Midterm Review CSE321 B.Ramamurthy 4/4/2019 B.Ramamurthy.
CS 2430 Object Oriented Programming and Data Structures I
Final Review Dr. Yingwu Zhu.
Final Review Bina Ramamurthy 4/5/2019 BR.
Review B.Ramamurthy 4/6/2019 BR.
Exam1 Review CSE111 B.Ramamurthy 4/6/2019 B.Ramamurthy.
Midterm Review CSE321 B.Ramamurthy 4/8/2019 B.Ramamurthy.
Midterm Review CSE4/587 B.Ramamurthy 4/8/2019 4/8/2019 B.Ramamurthy
Review for Final Exam CSE462 B.Ramamurthy.
CSCE 221 Professor Lupoli TAMU CSCE 221 Intro.
Midterm Review CSE116A,B.
Midterm Review CSE321 B.Ramamurthy 4/13/2019 B.Ramamurthy.
Final Review Bina Ramamurthy 4/15/2019 BR.
Midterm Review CSE321 B.Ramamurthy 4/23/2019 B.Ramamurthy.
Final Review CSE321 B.Ramamurthy 4/27/2019 B.Ramamurthy.
CS114B Introduction to Computer Science II
CSCE156: Introduction to Computer Science II
Final Exam Review CSE 241 B.Ramamurthy 8/4/2019 B.Ramamurthy.
Final Exam Review CSE113 B.Ramamurthy 10/13/2019 B.Ramamurthy.
Presentation transcript:

Final Review B.Ramamurthy 5/8/2019 BR

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

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 5/8/2019 BR

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 5/8/2019 BR

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 -CRC card method - Class diagrams - Recursion - Abstraction - Encapsulation - Inheritance - Polymorphism - Vector - Linked list - Stack - Queue - Tree - Heap - Hash Table - Design, Definition, Implementation, Application - Analysis - Big O notation - Sort and Search algorithms 5/8/2019 BR

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. 5/8/2019 BR

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

Topics for the Major Questions 1. Analysis and Design : Problem Statement to class design & relationships. 2. OO Principle#1 : Encapsulation: Classes, methods, data and private and public access control. This will involve code writing. 3. OO Principle#2: Reuse, inheritance, polymorphism, interface and implementation: Design an ADT using existing classes Vector, Linked List, etc. Involves code writing. 4. Trees : Binary search tree, AVL balancing etc. 5/8/2019 BR

Topics for the Minor Questions 1. Recursion : Tracing code and writing code using recursion (Ex: Language recognizer) 2. Vectors, Linked List, Comparable interface. 3. Stacks, heaps and priority queues. 4. Tables and hashing, sorting. 5/8/2019 BR

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. 5/8/2019 BR

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. 5/8/2019 BR

Exam Time and Location Date : 12/14 Time : 8.00 - 11.00 AM Place : 104 O’Brian 5/8/2019 BR