Computer Science Quiz - Programming Concepts

CS 180 Final Study Guide

• This guide covers topics for the Programming I (Purdue University) final exam.
• It includes Java basics/foundations, data types, selection, repetition, methods, classes, arrays, file I/O, exceptions, interfaces/inheritance, concurrency, network I/O, GUI's, polymorphism, dynamic data structures, and recursion.
• Each section is numbered (e.g., 1. Java Basics/Foundations) and page ranges are indicated (e.g., 2-5).

Java Basics/Foundations

• Algorithms provide step-by-step instructions to solve problems.
• Abstraction creates concepts from specific examples.
• Von Neumann architecture is the structure of modern computers.
• Key components include input/output devices and the CPU.
• Memory stores information and programs.
• Memory units include bytes, kilobytes, megabytes, gigabytes, and terabytes, each with corresponding sizes in bits.

Data Types

• Programs work with literal values stored in variables.
• Variables hold data values.
• Primitive types (e.g., int, double, char) have predefined sizes and purposes.
• Reference types (e.g., objects, strings) hold references to objects in memory.

Selection

• Sequential execution: Statements execute in order.
• If statements use boolean evaluations as conditionals.
• Else statements are default conditions.
• Switch statements are used instead of multiple if-else statements to check multiple cases.
• Bitwise operations differ from logical operations.

Repetition

• Indefinite loops run until a condition is met.
• Definite loops run a set number of times.
• While loops execute while a condition is true.
• Do-while loops execute at least once and then check the condition.
• For loops iterate a specific number of times.

Methods and Classes

• Methods are parameterized blocks of code that may return values.
• Classes define objects and include methods/variables.
• Methods are used for various operations, improving code readability and organization.
• Variables can be declared in different places for various purposes.
• Static variables are shared by methods of a class.
• Non-static variables belong to an object.

Tools for Abstraction

• Classes define reusable units of abstraction for objects.
• Classes have methods for object operations and variables for data storage.

File I/O

• Files are used to store information in case of program crashes.
• Files can be easily accessed and exchanged between programs.
• Files are handled using methods and classes designed for this task.

Exceptions

• Exceptions are handled by try/catch blocks to manage errors.
• Exceptions occur when errors are found, and execution is stopped when the exception handling is not caught.

Inheritance and Interfaces

• Inheritance is best for overlapping functionalities.
• Interfaces provide a way for multiple systems to interact.
• The methods in interfaces are implicitly public.

Concurrency

• Multiple threads can run simultaneously within a program.
• Threads interact with shared data, and appropriate mechanisms (e.g., synchronization) are needed to prevent conflicts and errors.
• Threads can be used for efficient handling of complex operations.

Network I/O

• IP-Internet Protocol identifies computers on the internet.
• DNS (Domain Name System) maps domain names to IP addresses.
• TCP (Transmission Control Protocol) manages communication between computers.
• Sockets are used to make connections between processes on different computers for networked communication.

GUI's

• GUI programs provide visual interfaces for users.
• GUI components can be managed by layout managers to organize components on a screen.
• The framework gives the user an interface via windows, text, fields, etc.

Dynamic Data Structures

• Dynamic data structures can grow or shrink as needed.
• ArrayList examples are given in array implementations.
• Linked lists have nodes where each stores data and a pointer to the next node in the structure.

Recursion

• Recursion is a method that calls itself repeatedly to solve a problem.
• A base case is needed to stop the recursive process.
• Recursion is a significant method in computer science.

Polymorphism

• Polymorphism allows treating objects of different types in a uniform way through common methods.
• Methods in superclasses can sometimes be overridden by subclasses.