Midterm Review CSE116A,B
Date and Format 10/2/2002 In class, 50 minute exam Closed book Some multiple choice, others regular question and answer; some code writing Topics: Ch.1, Ch.2 and Ch.4, all the topics covered during lectures and recitations, project 1 concepts. Ch.4: only Stacks and Queues Excluded: Analysis of algorithms
Topics Primitive data types and wrappers: int, Integer, double, Double etc. Array: definition, manipulation: single and multidimensional Types, interfaces, abstract classes, concrete classes. Inheritance hierarchy and polymorphic dispatch.
Topics (contd.) Recursion as a problem solving tool. Java ArrayList: use of it Stack and Queue ADT: definition, and application Algorithmic problem solving. Exception handling We will review each of these during the help session on 9/30, 215 NSC, 6-7.50pm