CS 2308 Final Exam Review.

Slides:



Advertisements
Similar presentations
Review of Stacks and Queues Dr. Yingwu Zhu. Our Focus Only link-list based implementation of Stack class Won’t talk about different implementations of.
Advertisements

1 Pointers, Dynamic Data, and Reference Types Review on Pointers Reference Variables Dynamic Memory Allocation –The new operator –The delete operator –Dynamic.
Review for Midterm Chapter 1-9 CSc 212 Data Structures.
1 C++ Plus Data Structures Nell Dale Chapter 4 ADTs Stack and Queue Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus.
 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.
1 C++ Plus Data Structures Nell Dale Chapter 4 ADTs Stack and Queue Modified from the slides by Sylvia Sorkin, Community College of Baltimore County -
Exam Format  90 Total Points  60 Points Writing Programs  25 Points Tracing Code/Algorithms and determining results  5 Points Short Answer  Similar.
Exam 1 Review CS Total Points – 60 Points Writing Programs – 20 Points Tracing Algorithms, determining results, and drawing pictures – 40 Points.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Lecture 3 Classes, Structs, Enums Passing by reference and value Arrays.
Review of Stacks and Queues Dr. Yingwu Zhu. How does a Stack Work? Last-in-First-out (LIFO) data structure Adding an item Push operation Removing an item.
 140 Total Points ◦ 100 Points Writing Programs ◦ 24 Points Tracing Algorithms and determining results ◦ 16 Points Short Answer  Similar to quizzes.
 200 Total Points ◦ 75 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 35 Points Short Answer ◦ 30 Points Multiple Choice.
Chapter 6 Lists Plus. What is a Class Template? A class template allows the compiler to generate multiple versions of a class type by using type parameters.
1 Data Structures and Algorithms Stacks and Queues.
1 Classes II Chapter 7 2 Introduction Continued study of –classes –data abstraction Prepare for operator overloading in next chapter Work with strings.
CS 1308 Exam 2 Review. Exam Format 110 Total Points 24 Points Short Answer 28 Points Fill in the Blank 16 Points T/F 36 Points Multiple Choice The above.
April 27, 2017 COSC Data Structures I Review & Final Exam
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.
CS 1428 Exam I Review. Exam Format 130 Total Points – 40 Points Writing Programs – 30 Points Tracing Algorithms and determining results – 20 Points Short.
CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.
Final Exam Review CS 3358.
Introduction to Computers Computer Generations
CS 215 Final Review Ismail abumuhfouz Fall 2014.
Dr. Bernard Chen Ph.D. University of Central Arkansas
Homework 4 questions???.
C++ Plus Data Structures
CS 1428 Exam I Review.
Chapter 4 Linked Lists.
Stacks and Queues.
Exam 3 Review.
Chapter 1-4 CSc 212 Data Structures, Sec AB CCNY, Spring 2012
CS 1428 Exam II Review.
CS 1308 Exam 2 Review.
CMSC 341 Lecture 5 Stacks, Queues
Exam 2 Review CS 3358 Data Structures.
CS 2308 Exam I Review.
CS 2308 Exam II Review.
CS 2308 Exam II Review.
CS 2308 Exam II Review.
Exam 2 Review CS 3358 Data Structures.
CS 1428 Exam I Review.
Exam 1 Review CS 3358.
CS 2308 Exam I Review.
CS 1428 Exam II Review.
Lesson Objectives Aims
Pointers, Dynamic Data, and Reference Types
CS 2308 Exam I Review.
Exam 1 Review CS 3358.
Exam 2 Review CS 3358 Data Structures.
CS 2308 Exam II Review.
CS 1428 Final Exam Review.
EE 312 Software Design and Implementation I
Indirection.
CS 1428 Final Exam Review.
Pointers & Dynamic Data Structures
Introduction to Data Structure
EE 312 Exam I Review.
Fundamental Programming
C++ Plus Data Structures
EE 312 Final Exam Review.
CSI 1340 Introduction to Computer Science II
EE 312 Software Design and Implementation I
EE 312 Exam I Review.
Pointers, Dynamic Data, and Reference Types
CS 1428 Exam I Review.
CS 2308 Final Exam Review.
Chapter 1-4 CSc 212 Data Structures, Sec FG CCNY, 2009
EE 312 Exam I Review.
Presentation transcript:

CS 2308 Final Exam Review

Exam Format 200 Total Points 75 Points Writing Programs 60 Points Tracing Algorithms and determining results 35 Points Short Answer 30 Points Multiple Choice Will weigh more toward last third of course Similar to previous exams, quizzes, and programming assignments

Example Programming Problem Given the stack.h ADT, write a function that converts a decimal number to a binary string.

Example Tracing Problem What will the EXACT output of the following program be? int foo = 9; int *ptr = &foo; float foo2 = 5.7; *ptr = 2; foo2 = foo - foo2; if (foo > foo2) cout << "Hello!"; else if (foo < foo2) cout << foo2; else cout << foo; cout << endl; cout << "foo2 is: " << fixed << setprecision(1) << foo2 << endl;

Example Short Answer Of what order of magnitude is a Bubble Sort?

Arrays 40 points Relationship between arrays and pointers One and two-dimensional arrays Declaration of various types traversing Difference between physical and logical size Dynamic allocation Parallel arrays Passing arrays as parameters 2-D arrays Game of Life program Arrays of structures The tsuPod 1 program Arrays of Objects The tsuPod 2 program Relationship between arrays and pointers

Analysis of Algorithms 20 Points Be able to look at code or algorithm and make an educated guess at the order of magnitude Look to see if the statement that is executed the most is a function of the size of the data set Know which orders are faster and slower than the others Constant time algorithms are denoted as O(1) O(log2n), O(n), O(n2), O(2n) There are more

Searching and Sorting 15 Points May have to write sequential search, but not the others. Know the algorithms and the order of magnitude of each Sequential search Binary search Bubble sort Selection sort

Structures 15 Points Declaration Use of the “.” operator Arrays of structures tsuPod 2 Pointers to structures (*ptr).field ptr->field Use of structure as nodes in linked lists tsuPod 3 program

Classes and Objects 50 Points Fundamentals of class and objects Declaration Constructors Destructors Instance variables Instance methods Class (static) variables Class (static)methods The “.” operator Objects as parameters to functions

Classes and Objects (cont.) Overloading functions Constructors Operators Relational Other Using objects as data inside of linked lists Understand the Exam Grader 2 and the TsuPod projects that used classes.

Pointers 25 Points A pointer is a variable that holds the address of a memory location Declaration int *ptr; Assignment ptr = &foo; //& is the address function Dereferencing *ptr = 54; //same as foo=54; You can point to any kind of data type Using pointers to create linked lists

Linux 0 Points Know the basic commands you needed to complete the last program Know how to compile and run a C and C++ program in Linux Know how to create and move around the Linux file system Simple makefiles

Testing 0 Points Given a problem, be able to provide example inputs and outputs to test potential solutions Similar to tsuPod, but much smaller problem.

Linked Lists 50 Points Declaring a linked list Adding a node to a linked list Removing a node from a linked list Traversing a linked list What is the order of magnitude of each of the above operations? (Big O) Understand the tsuPod 3 linked list program

Stacks 10 Points Know the fundamental operations and how a stack works Push Pop isFull isEmpty A Last in First Out (LIFO) structure Will not have to code a stack Understand the Equation Checker program

Queues 5 points Understand the fundamental operations enQueue deQueue isFull isEmpty A First in First Out (FIFO) structure Will not have to code

C programming 10 Points Getting command line parameters Header files Equation Checker Header files I/O libraries printf and scanf No const No string data type Know how to manipulate arrays of characters Know how C string functions work No pass by reference No bool data type

How to Study Rewrite all the programs. Redo labs. Learn by doing and recognizing patterns. Don’t stay up late!! Get some sleep and eat a good breakfast.

What to bring Pencils and erasers We will provide scratch paper No calculators

Questions