Cse 1341: Java I

Front 1

Linear Search

Back 1

This is a very straightforward loop comparing every element in the array with the key. As soon as an equal value is found, it returns. If the loop finishes without finding a match, the search failed and -1 is returned.

Front 2

Binary Search

Back 2

A fast way to search a sorted array is to use a binary search. The idea is to look at the element in the middle. If the key is equal to that, the search is finished. If the key is less than the middle element, do a binary search on the first half. If it's

Front 3

Exception

Back 3

indication of a problem that occurs during execution.

Front 4

Exception handling

Back 4

allows the program to continue executing the code

Front 5

Java API

Back 5

lists exceptions thrown by each method

Front 6

java.lang.Exception

Back 6

All exceptions extend this class.

Front 7

Boolean

Back 7

T/F - logical expressions evaluate to this

Front 8

Sentinel Controlled Loop

Back 8

uses a special value to determine when it should terminate repetition

Front 9

Objects

Back 9

Have attributes and behaviours

Front 10

Inheritance

Back 10

a relationship between two classes where a class absorbs characteristics of a previously defined class as well as adding its own attributes and behaviours.

Front 11

UML

Back 11

Unified Modeling Language

Front 12

Modularization

Back 12

divide-and-conquer approach to problem solving.
more software reusibility

Front 13

Static Methods

Back 13

Do not require an object to perform task

Front 14

The Principle of Least Priviledge

Back 14

Code should only have the amount of access as it needs to complete the task.