lecture10

lecture10 - Monday, February 9 th Midterm Review 1. Classes...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Monday, February 9 th Midterm Review 1. Classes 2. Inheritance 3. Virtual functions, A.B.C.s 4. Class composition 5. Pointers and references 6. Dynamic memory allocation (new/delete) 7. Linked lists (doubly linked too) 8. Copy constructors and assignment operators 9. Stacks and Queues 10. Recursion! Fair game on the midterm: Review Time Once you have completed this review, you will be able to comprehend and control the Matrix! Review Problem #1 struct NODE { int val; NODE *next; }; Write a function called sum which is passed in a pointer to the head of a non-empty linked list and returns an integer. This function must return the sum of all the items in the linked list . For example, heres how your function might be used: void main() { NODE *ptr; // ptr points to the first node (e.g. head) of the linked list // code here creates a linked list with 10 in the first node, then 20 and then 30...
View Full Document

Page1 / 6

lecture10 - Monday, February 9 th Midterm Review 1. Classes...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online