COMPUTER PROG II
COMPUTER PROG II CSC 220
Popular in Course
Popular in ComputerScienence
This 2 page Class Notes was uploaded by Ms. Nathen O'Keefe on Thursday September 17, 2015. The Class Notes belongs to CSC 220 at University of Miami taught by Staff in Fall. Since its upload, it has received 8 views. For similar materials see /class/205768/csc-220-university-of-miami in ComputerScienence at University of Miami.
Reviews for COMPUTER PROG II
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/17/15
Midterm Review CSC220 Programming H Data Structures Fall 2003 Dr Christian Al Duncan csc220 mai1csmiamiedu 1 Announcements 0 Midterm on Thursday I cannot attend but Nizar will be present to administer the test and answer your questions 0 Remember the test is open book and open notes You do not have to memorize every single detail but you do need to know and understand the details And if you are going to use the book to look up every detail you will certainly not have enough time to nish the test 0 For those wanting it we can go over some of the methods in previous homeworksi o The following is just a brief list of topics to knowi It is by no means comprehensive and you should use your previous lecture notes and the book Chapters 17 to get all the details 2 Chapter One Runtime Analysis and Testing Be sure to understand how BigOh notation works eg that 2n 5n2 7 is 0n2i Also practice looking at sample code and determining the worstcase running time 1711 try to give a few in c assi For testing I mean be able to understand what boundary cases are For example in testing the catenat ion method in DoubleArraySeq you would check examples where the two sequences have combi nations of 01 and several items As well as possibly the behavior when the sequences either one or both are nulli As well as when the two sequences are the exact same sequence same references 3 Chapter Two Java Classes This section is mostly review from CSClQOi You should already be familiar with it but if not review the chapter to make sure you understand all about the issues with such things as NullPointerExceptions parameter passing and the difference between and the equals method 4 Chapter Three Collection Classes 1 am certainly going to ask at least one question about the Bag class or some derivative of it such as Sequences or Setsi Basically a data structure which stores information in array formi Pay attention to how each method works For example why does the clone method need to make a copy of the array rather than just point to the same array 5 Chapter Four Linked Lists 1 will ask at least one question having something to do with linked listsi Be sure to understand how to insert delete move items in a linked list How about taking two link lists and doing a shuffle operation eg 1 2 3 4 and 5 6 7 8 would become 1 5 2 6 3 7 4 8 How about splitting a list into multiple pieces eigi even elements in one list and odd elements in a second list Basic examples like this demonstrate your ability to use and manipulate linked listsi Also understand the various types of linked lists and their advantages and disadvantages including o Linked Lists Over arrays in general singlyconnected linked lists Doublyconnected linked lists Circular lists tail points back to head Having just a head reference Having both a head and tail reference Chapter Five Generic Programming Understand the changes that need to be made when switching from a data structure storing primitive types and one storing Object types eg the need for equals operatori Know the difference between a shallow and deep clone and the problems with both Understand the basics of using an iterator or iterators to step through a data structure Chapter Six and Seven Stacks and Queues Know about the different ways of using stacks eigi push and pop operations Know about the different ways of using queues eigi enqueue and dequeue operations Know about the different ways of using priority queues same as above with a priority Know how each of the above data structures works both array and linked list versionsi Know some of the uses of these structures as well as being able to use themi For example stacks are good for evaluating an arithmetic expression In particular remember the simple stack algorithm to evaluate post x expressions
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'