Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.

Slides:



Advertisements
Similar presentations
Template created by Terri Street Copyright, 2000 Questions developed by QMSS Copyright, 2008.
Advertisements

Object Oriented Programming with Java
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Java Review Interface, Casting, Generics, Iterator.
Written by: Dr. JJ Shepherd
Stacks, Queues, and Deques. 2 A stack is a last in, first out (LIFO) data structure Items are removed from a stack in the reverse order from the way they.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Recommendation: Play the game and attempt to answer the questions yourself without looking at the answers. You’ll learn much less if you just look at the.
Cmp Sci 187: Midterm Review Based on Lecture Notes.
1 Lecture 26 Abstract Data Types – IV Overview  The List ADT  Implementing Stacks as Linked List  Linked List Implementation of Queues .  Preview:
Stacks, Queues, and Deques
Stacks, Queues, and Deques
16-Aug-15 Air Force Institute of Technology Electrical and Computer Engineering Object-Oriented Programming in Java Topic : Interfaces, Copying/Cloning,
Principles of Computer Programming (using Java) Review Haidong Xue Summer 2011, at GSU.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
1 Identifiers  Identifiers are the words a programmer uses in a program  An identifier can be made up of letters, digits, the underscore character (
Introduction to Object Oriented Programming. Object Oriented Programming Technique used to develop programs revolving around the real world entities In.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
1 Object-Oriented Software Engineering CS Interfaces Interfaces are contracts Contracts between software groups Defines how software interacts with.
Object Oriented Programming: Java Edition By: Samuel Robinson.
Template created by Terri Street Copyright, 2000 Questions developed by BPI Copyright, 2008.
The Java Programming Language
Information and Computer Sciences University of Hawaii, Manoa
Inheritance. Introduction Inheritance is one of the cornerstones of object-oriented programming because it allows the creation of hierarchical classifications.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
CS/ENGRD 2110 SPRING 2015 Lecture 6: Consequence of type, casting; function equals 1.
Hello.java Program Output 1 public class Hello { 2 public static void main( String [] args ) 3 { 4 System.out.println( “Hello!" ); 5 } // end method main.
Template created by Terri Street for OKTechMasters Copyright, 2000.
RIT Computer Science Dept. Goals l Inheritance l Modifiers: private, public, protected l Polymorphism.
Page: 1 การโปรแกรมเชิงวัตถุด้วยภาษา JAVA บุรินทร์ รุจจนพันธุ์.. ปรับปรุง 15 มิถุนายน 2552 Keyword & Data Type มหาวิทยาลัยเนชั่น.
Created by Terri Street Copyright,  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street for OK TechMasters Copyright, 2000.
OOP: Encapsulation,Abstraction & Polymorphism. What is Encapsulation Described as a protective barrier that prevents the code and data being randomly.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street © 2000 Background images courtesy of abc.com.
Created by Terri Street; inspired by the work of Jennifer Wagner; revisions courtesy of Stephanie Novack. © 2000, 2009 Background images courtesy of abc.com.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
COP 2800 Lake Sumter State College Mark Wilson, Instructor.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Chapter 8 Class Inheritance and Interfaces F Superclasses and Subclasses  Keywords: super F Overriding methods  The Object Class  Modifiers: protected,
 In the java programming language, a keyword is one of 50 reserved words which have a predefined meaning in the language; because of this,
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Quick Review of OOP Constructs Classes:  Data types for structured data and behavior  fields and methods Objects:  Variables whose data type is a class.
POLYMORPHISM Chapter 6. Chapter Polymorphism  Polymorphism concept  Abstract classes and methods  Method overriding  Concrete sub classes and.
CS 46B: Introduction to Data Structures July 23 Class Meeting Department of Computer Science San Jose State University Summer 2015 Instructor: Ron Mak.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Polymorphism 1. Reuse of code: every time a new sub-class is defined, programmers are reusing the code in a super-class. All non-private members of a.
Created by Terri Street Copyright, 2000  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000.
Last Revision. Question1 Novice Java programmers often write code similar to, class C { public int x;... }... C[] a = new C[10]; for(int i = 0; i < a.length;
Advanced Programming Practice Questions Advanced Programming. All slides copyright: Chetan Arora.
BY:- TOPS Technologies
Modern Programming Tools And Techniques-I
OOP: Encapsulation &Abstraction
Inheritance and Polymorphism
Object Oriented Programming (OOP) LAB # 8
CSC 113 Tutorial QUIZ I.
null, true, and false are also reserved.
Introduction to Java Programming
Object-Oriented Programming
JavaScript Reserved Words
Java Programming, Second Edition
Topics OOP Review Inheritance Review Abstract Classes
មជ្ឈមណ្ឌលកូរ៉េ សហ្វវែរ អេច អ ឌី
Inheritance and Polymorphism
Presentation transcript:

Created by Terri Street Copyright, 2000

 1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000  8,0008,000  4,0004,000  2,0002,000  1,0001,000    

Click to return to question, Cont-P to switch to the pen, cross out two incorrect answers, then Cont-A to switch back to pointer.

Click to return to the question and poll the class

Click on link to Google, or click on this oval to return to question and ask a friend

 A. decimal A. decimal  C. char C. char  B. int B. int  D. double D. double Which of these is not a primitive data type?

Back to Board  A. decimal

 A. multiplier A. multiplier  C. incrementor C. incrementor  B. extender B. extender  D. equalizer D. equalizer Fill in the blank: for({initialization};{exit condition};{________})

Back to Board C. incrementor

 A. break A. break  C. package C. package  B. case B. case  D. const D. const Which keyword is used to create individual arguments in a switch statement?

Back to Board B. case

 A. parent classes can have several A. parent classes can have several children classes  C. children classes can have several C. children classes can have several parent classes  B. parent classes can only have a B. parent classes can only have a single child class  D. A and C D. A and C Which of the following is true in java?

Back to Board A. parent class can have several children classes

 A. public final main(Char [] Object) A. public final main(Char [] Object)  C. private static final main(String args) C. private static final main(String args)  B. private static void main(Char [] args) B. private static void main(Char [] args)  D. public static void main(String [] args) D. public static void main(String [] args) What is the correct syntax for a main method?

Back to Board D. public static void main(String [] args)

 A. initializes a class A. initializes a class  C. pops the top of a stack C. pops the top of a stack  B. pops a linked-list B. pops a linked-list  D. pops the top of a queue D. pops the top of a queue What does the pop() method do?

Back to Board C. pops the top of a stack

 A. shortens A. shortens  C. creates C. creates  B. implements B. implements  D. extends D. extends To use an interface,you must write a class that ______ the interface.

Back to Board B. implements

 A. Deletion of elements A. Deletion of elements  C. Direct access to elements C. Direct access to elements  B. fixed size B. fixed size  D. complex insertion D. complex insertion What is an advantage of using an array over a linked list?

Back to Board C. Direct access to elements

 A. NoSuchElement A. NoSuchElement  D. RuntimeComplexity D. RuntimeComplexity Which of the following is not a common exception?  C. ArrayIndexOutOfBounds C. ArrayIndexOutOfBounds  B. NullPointer B. NullPointer

Back to Board D. RuntimeComplexity

Which kind of class does not “pollute” the name space of the package?  A. Hidden Class A. Hidden Class  C. Super Class C. Super Class  D. Outer class D. Outer class  B. Inner class B. Inner class

Back to Board B. Inner Class

 A. Delegation A. Delegation What technique would allow a object to “change” class over time?  C. Recursion C. Recursion  B. Polymorphism B. Polymorphism  D. Anamorphism D. Anamorphism

Back to Board A. Delegation

 B. GridBag Layout B. GridBag Layout Which of the following is a Layout Manager?  A. Container Layout A. Container Layout  C. Panel Layout C. Panel Layout  D. Frame Layout D. Frame Layout

Back to Board B. GridBag Layout

 C. Overrides C. Overrides  A. Hides A. Hides  B. Overloads B. Overloads  D. Equals D. Equals Superclass Instance Method Superclass Static Method Subclass Instance Method ????????Generates a compile-time error Subclass Static Method Generates a compile-time error Hides

Back to Board C. Overrides

 D. next D. next Fill in the blank: private Node getLastNode() Node cNode=this.first; Node pNode=null; while(cNode != null){ pNode=cNode; cNode=cNode. _____; } return pNode; }  A. null A. null  C. first C. first  B. data B. data

Back to Board D. next

 A. Because the recursion happens A. Because the recursion happens on nodes, not lists. In implementing a linked list recursively, why do some methods require helper functions?  B. Because the recursion happens B. Because the recursion happens on stacks, not lists.  D. Because the recursion happens D. Because the recursion happens on queues, not stacks.  C. Because the recursion happens C. Because the recursion happens on lists, not nodes.

 A. Because the recursion happens on nodes, not lists.

Sorry, try again!

Thanks for playing! Good Luck!