Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 2308 Exam II Review.

Published byBambang Cahyadi Modified over 6 years ago

Similar presentations

Presentation on theme: "CS 2308 Exam II Review."— Presentation transcript:

1 CS 2308 Exam II Review

2 Exam Format 80 Total Points
60 Points Writing Programs 20 Points Short Answer Similar to programming assignments and quizzes

3 Example Programming Problem
Given the TsuPod.h file at the end of the exam using the Linked List data representation write the method getRemainingMemory().

4 Example Tracing Problem
Draw and label the following struct Node { int data; Node *next; }; Node *head = NULL; Node *ptr = new Node; Node *temp; ptr->data = 42; temp = head; ptr->next = head; temp = ptr;

5 Example Short Answer Can we have more than one constructor for a class? If so, how would we know which one to use?

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

7 Structures 10 Points Declaration Use of the “.” operator
Arrays of structures tsuPod 2 Pointers to structures (*ptr).field ptr->field Structures used in Linked Lists

8 Classes and Objects 35 Points Fundamentals of class and objects
Declaration Constructors Destructors Instance variables Instance methods The “.” operator Objects as parameters to functions

9 Classes and Objects (cont.)
Overloading functions Constructors Operators Relational Other Using objects as data inside of linked lists

10 Linked Lists 30 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? Understand the tsuPod 3 linked list program

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

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

13 Questions

Download ppt "CS 2308 Exam II Review."

Similar presentations

1 Structures. 2 User-Defined Types C provides facilities to define one’s own types. These may be a composite of basic types ( int, double, etc) and other.

1 Structures. 2 User-Defined Types C provides facilities to define one’s own types. These may be a composite of basic types ( int, double, etc) and other.
Queues CS-240 & CS-341 Dick Steflik. Queues First In, First Out operation - FIFO As items are added they are chronologically ordered, items are removed.

Queues CS-240 & CS-341 Dick Steflik. Queues First In, First Out operation - FIFO As items are added they are chronologically ordered, items are removed.
Stacks CS-240 & CS-341 Dick Steflik. Stacks Last In, First Out operation - LIFO As items are added they are chronologically ordered, items are removed.

Stacks CS-240 & CS-341 Dick Steflik. Stacks Last In, First Out operation - LIFO As items are added they are chronologically ordered, items are removed.
 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.

 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.
Exam Format  130 Total Points  10 Points Short Answer  15 Points Fill in the Blank  25 Points T/F  60 Points Multiple Choice  20 Points Matching.

Exam Format  130 Total Points  10 Points Short Answer  15 Points Fill in the Blank  25 Points T/F  60 Points Multiple Choice  20 Points Matching.
Exam Format  90 Total Points  60 Points Writing Programs  25 Points Tracing Code/Algorithms and determining results  5 Points Short Answer  Similar.

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 3358. 120 Total Points – 60 Points Writing Programs – 20 Points Tracing Algorithms, determining results, and drawing pictures – 40 Points.

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 3358. 175 Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.

Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Exam Format  105 Total Points  25 Points Short Answer  20 Points Fill in the Blank  15 Points T/F  45 Points Multiple Choice  The above are approximations.

Exam Format  105 Total Points  25 Points Short Answer  20 Points Fill in the Blank  15 Points T/F  45 Points Multiple Choice  The above are approximations.
ICOM 4035 – Data Structures Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department.

ICOM 4035 – Data Structures Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department.
 140 Total Points ◦ 100 Points Writing Programs ◦ 24 Points Tracing Algorithms and determining results ◦ 16 Points Short Answer  Similar to quizzes.

 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.

 200 Total Points ◦ 75 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 35 Points Short Answer ◦ 30 Points Multiple Choice.
Class and Structure. 2 Structure Declare using the keyword struct purpose is to group data Default visibility mode is public A struct doesn't have a constructor.

Class and Structure. 2 Structure Declare using the keyword struct purpose is to group data Default visibility mode is public A struct doesn't have a constructor.
ENEE150 – 0102 ANDREW GOFFIN Project 4 & Function Pointers.

ENEE150 – 0102 ANDREW GOFFIN Project 4 & Function Pointers.
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.

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.
Final Exam Review CS 3358. 150 Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.

Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Linked list: a list of items (nodes), in which the order of the nodes is determined by the address, called the link, stored in each node C++ Programming:

Linked list: a list of items (nodes), in which the order of the nodes is determined by the address, called the link, stored in each node C++ Programming:
Exam 2 Review CS 3358 Data Structures. 90 Total Points – 50 Points Writing Programs – 25 Points Tracing Algorithms, determining results, and drawing pictures.

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 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.

CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.

Similar presentations

Ads by Google