TeXes 241 Texas Computer Science Test
bubble sort
A simple (and relatively slow) sorting algorithm that repeatedly loops through a list of values, comparing adjacent values and swapping them if they are in the wrong order.
selection sort
A sorting routine that uses a nested loop process to systematically select the best value among the unsorted elements of the array for the next position in the array, starting with position zero all the way to the end.
&&
AND
constant run time
An algorithm is said to be constant time (also written as O(1) time) the process does not depend on the size of the input, such as accessing any value of a contiguous array, a process that only involves one step, regardless of the size of the array.
pseudocode
An informal high-level description of the operating principle of a computer program or other algorithm.
trojan
Disguised as legitimate software, are a harmful piece of software that tricks users into loading and executing it on their systems. Unlike viruses and worms they do not reproduce by infecting files, nor do they self-replicate.
ROM (Read Only Memory)
Does not disappear if computer is unplugged. It cannot be altered. retains its contents even when the computer is turned off.
module
Each of a set of standardized parts, independent units, or previously defined functions that can be used to construct a more complex program.
zombie
In computer science is a computer connected to the Internet that has been compromised by a hacker, computer virus or trojan horse and can be used to perform malicious tasks of one sort or another under remote direction. (Botnets of zombie computers are often used to spread e-mail spam and launch denial-of-service attacks.)
complexity
In computing, complexity is defined in terms of the number of steps it takes to perform an algorithm in relation to the amount of data involved, or in terms of how much memory is required during the processing of the data. It is generally measured by the Order of Magnitude system, often called Big O.
while statement
In most computer programming languages it controls the flow statement that allows code to be executed repeatedly based on a given Boolean condition.
The main types of bug/errors:
Lexical, Syntax, Run-time, and Logic Error
The Three Pillars of OOP (Object Oriented Programming)
Inheritance, Composition, and Encapsulation
2 Rules for processing linked list
Never let go of the head and always connect before disconnecting
Static Memory
Memory allocated to an array, which cannot grow or shrink once declared
Contiguous Memory
Memory that is "side-by-side" in a computer, typical of an array structure
||
OR
gigabyte (GB)
1 billion bytes typically used when describing the total storage capacity of a computer
Megabyte (MB)
1,048,576 bytes the size of a large computer file
in-order execution
1. fetch instruction 2. send instruction to correct unit if input operand are availble 3. send in instruction to correct functional unit for execution 4. have the functional unit write the result back to the register file.
out of order execution
1. fetch instruction 2. send intstruction to queue 3. remove instruction from queue and execute it when the necessary input operands come available. 4. send instruction to correct function units for executions 5. send results back execution results 6. record the results
kilobyte (KB)
1024 bytes, the size of a small computer file
!
NOT
IEEE standard for wireless networking
802.11
memory chips
=RAM this are the most important temporary storage unit of data
sequential access file
A file that contains records or other elements that are stored in a chronological order based on account number or some other identifying data.
debugging
A methodical process of finding and reducing bugs, defects, or errors in a computer program or a piece of electronic hardware
bus
A network topology in which nodes are connected to a central, backbone. The entire network shuts down if there is a break in the main cable. It is also difficult to troubleshoot, and responds slower when more devices are added.
Ring
A network topology is set up in a circular fashion in such a way that they make a closed loop. There is no server present
multiprogramming
RAM can contain and execute more than one program at once
monoprogramming
RAM can contain and execute only one program at once
In SDLC, which step is the most important?
Requirement specification.
spyware
Software that enables a user to obtain covert information about another's computer activities by secretly transmitting data from their hard drive.
base case
The case that does not use recursion to determine its value
hexadecimal
The general terms used to indicate the base 16 numbering system, featuring the digits 0-9 and letters A-F
←, =
Used to assign values to variables and constants
==
Used to check for equality between two expressions
!=, <>, ≠
Used to check if two expressions are NOT equal to each other
piracy
When someone installs and uses commercial software without paying for the program
Windows OS
Windows 1.0 was released on November 20, 1985, as the first version
^
XOR
class variable
a variable that belongs to the class, and is not specific to any particular object, indicated by the word "static", of which only a single copy exists, regardless of how many instances of the class exist
flowchart
a visual organizer system in programming that indicates the flow of a program, using process blocks, decision diamonds and arrows.
adapter pattern
also known as the 'wrapper'. implemented when software modules fulfills the intended function and goal of a program but cannot interface with existing system. using this pattern the software module cab be wrapped in a 2nd module that translate between 2 interface.
system development life cycle (SDLC)
also referred to as the application development life-cycle, is a term used in systems engineering, information systems and software engineering to describe a process for planning, creating, testing, and deploying an information system.
ASCII
an American Standard Code for Information Interchange code is the numerical representation of a character
$
an absolute reference indicator, which locks the column and/or row indicated when copying down a formula
Parameter Passing
data is passed from one section of the program to another, using actual parameters that send information to formal parameters
storage medium
data that is stored example: hard drive, magnetic stripes (credit cards, etc) DVD, etc.
ISAs have the same three grouping of instruction:
data transfer group arithmetic/logic group control group
boolean data type
data type that only stores data that can be assigned a value of true/false and can perform operation that will determine whether a stored value is true or false. ex: TRUE/FALSE
What would be the best name for a variable that will store the interest rate of a loan?
dblIntRate
in a standard flowchart, what does the diamond/rhombus symbol represent?
decision
data type
describes memory location. types: integer, float, character, boolean, & string Integer (used for whole numbers; ex: 7, 12, 999) Float (floating point/real number; number w/ decimal point; ex: 3.15, 9.03, 00.13) Character (Encoding text numerically; ex: 97 (in ASCII, 97 is a lower case 'a')) boolean (representing logical values; ex: TRUE/FALSE) String (alphanumeric characters; ex: hello world, Abi, Bob123)
network topology
describes the arrangement of nodes within a network.
semiconductor
designation for any material which is a moderately good conductor of electricity; ex: silicon
memory manager
determines and allocates the amount of RAM necessary to run program
turing machine
developed by alan turing in 1937, is theoretical device that is studied by computer scientist so they can better understand the limits of mechanical computation, CPU functions, and complexity theory.
what does an operating system use to communicate with hardware device?
device drivers (is a group of files that enable one or more hardware devices to communicate with the computer's operating system)
synchronous sequential system
digital circuit in which the changes in the state of memory elements are synchronized by a clock signal. In a sequential digital logic circuit, data is stored in memory devices called flip-flops or latches. The output of a flip-flop is constant until a pulse is applied to its "clock" input, upon which the input of the flip-flop is latched into its output.
data dictionary
collection of description of the data/items in a data model.(for benefits of programmer & other who need to refer to them)
byte (B)
combination of eight bits representing a single character, such as letter or number.
heteregeneous array
common type of abstract data structure capable of storing different data types.
homogenous array
common type of abstract data structure win which all data must be the same type ( integer, real number, character, etc) it can store a block of variables in either one-dimensional lis or multi-dimensional array consisting of row & columns.
Cable Internet
digital data transmitted by coaxial and fiber optic cables.
∨ (notation)
disconjunction, or
free-format languages
do not require program statement to occupy any specific position on a printed page.
LAN (Local Area Network)
is a network that connects computers and other devices in a relatively small area, typically a single building or a group of buildings. Ex: home/single building
DHCP (dynamic host configuration)
is a process that normally runs on the server of a network and contains a list of valid IP addresses for the network.
vandal/vandelism
is a process wherein there is a program that performs malicious function such as extracting a user's password or other data or erasing the hard disk.
merge sort
is a recursive algorithm that continually splits a list in half, until each half is either empty or one item, at which point the two halves are merged together in natural order, back up the division process until the entire list has been sorted.
waterfall design
is a sequential design process, used in software development processes, in which progress is seen as flowing steadily downwards through the phases of conception, initiation, analysis, design, construction, testing, production/implementation and maintenance.
Mac OS
is a series of graphical user interface based operating systems developed by Apple Inc.
worm
is a standalone malware computer program that replicates itself in order to spread to other computers. Often, it uses a computer network to spread itself, relying on security failures on the target computer to access it.
WAN (Wide Area Network)
is a telecommunications network or computer network that extends over a large geographical distance/place
HAN (Home Area Network)
is a type of computer network that facilitates communication among devices within the close vicinity of a home.
RJ-45
is a type of connector commonly used for Ethernet networking. It looks similar to a telephone jack, but is slightly wider. Standard connector that is used with 8-wire(four twisted pair) cable.
multidimensional array
is a type of data structure that is more complex than a single array.
virus
is a type of malicious software program ("malware") that, when executed, replicates itself by modifying other computer programs and inserting its own code. When this replication succeeds, the affected areas are then said to be "infected".
critical path (method)
is an algorithm for scheduling a set of project activities. It is commonly used in conjunction with the program evaluation and review technique.
Recursion
is another form of iteration, and happens when a process calls itself over and over, until it reaches a base case condition. where the solution to a process involves that process calling another instance of itself, stacking up process calls over and over again, moving towards a base case, at which time the unstacking process happens and the process is concluded; it can do anything a loop can do and more
boot device
is any piece of hardware that can read or contains the files required for a computer to start. For example, a hard drive, floppy disk drive, CD-ROM drive, DVD drive, and USB jump
abstract data type (ADT)
is data type whose definition remains constant between different programs. it presents information in such a way that users can more easily understand and access it (example are: stacks, queues, priority queues, strings, containers, lists, deques, maps, multimaps, multisets, trees and sets). they can be implemented in the forms of modules that included procedures for ____ operations. Are important in object oriented programming languages.
function
is most often a procedure or method that performs a calculation and returns a value of some sort
motherboard
is one of the most essential part of the computer. it holds crucial computer components such as: CPI, memory connector for input and output
the kernel
is the central (core) component of most computer operating systems (files/memory/device); it is a bridge between applications and the actual data processing done at the hardware level
object program
is the new program after it has been translated
project management
is the practice of initiating, planning, executing, controlling, and closing the work of a team to achieve specific goals and meet specific success criteria at the specified time
parallel processing
is the processing of program instructions by dividing them among multiple processors with the objective of running a program in less time. (examples: MIMD/SIMD/ build larger computer)
patent laws
is used when a physical devices has been invented by a person.
NUXI Ordering
issues with byte order; UNIX stored on a big-endian machine can show up as NUXI on a little-endian one
floating data type
its a data type also know as real numbers, may contain numeric data other than whole numbers, such as numbers with decimal. Example: {DATA TYPE} Length, Width Length = 27.3; Width = 16.8;
integer data type
its a data type that contains whole number, numeric data, and allows programs to perform traditional arithmetic operation (such as subtraction/addition/comparison/less than/greater than/ equal to) Example: {DATA TYPE} MaxOccupancy = 300;
character data type
its a data type that stores symbols using Unicode and ASCII Example: 97 (in ASCII, 97 is a lower case 'a')
mass storage
known as secondary strorage, includes any device that provides additional memory storages. There 2 types On-line & Off-line
Machine language
lowest level language. a computer programming language consisting of binary or hexadecimal instructions that a computer can respond to directly.
operating system (os)
manages and controls all computer functions such as calculation and processing of data
computer
mechanical device for converting data arranged as programs into comprehensible information.
pointers
memory cells containing the encoded numeric addresses that a program uses to identify a specific data entry in the computer's memory. Also many programming languages include it as primitive data type.
router
networking device that forwards data packets between computer networks. Routers perform the traffic directing functions on the Internet. connects LANs
switch
similar to bridge but is capable of connecting more than two bus network. Intelligent device forward traffic to its destination rather than everyone on network.
variable
single location that stores one value within a computer memory; also allows computer to store various types of data (ex: numbers, characters on temp basis) has two types global & local.
spooler
software application that regulates access to computer resources such as printer
combinational logic
sometimes also referred to as time-independent logic is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only. This is in contrast to sequential logic, in which the output depends not only on the present input but also on the history of the input. In other words, sequential logic has memory while combinational logic does not.
passing by reference
the memory location of the object referenced by the actual parameter is passed to the formal parameter, so that any changes made to that object by the formal parameter immediately affect the actual parameter (like a shared Google document)
WWW (World Wide Web)
the network or web of server that support documents written in Hyper Text Markup Language (HTML). a venue for the use of the HTTP.
Depth of a Tree
the number of steps from the root of the tree to the farthest outlying node in the tree; height is also used to mean the same thing
composition
the process of combining simpler objects into more complex objects. For example, a Car class might include a BodyType object, an Engine object, and a TransmissionType object.
construct
the process of instantiating (bringing into existence) an object based on a class definition
Binary search
the process of searching through an ordered set of data using the "divide and conquer" technique, which guarantees a final result in O(log2 N) steps
In-Order Traversal
the process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered at its "center", proceeding likewise along the tree, accessing each node as encountered at the "center" (starts with the leftmost leaf)
Post-Order Traversal
the process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered at its "right" side, proceeding likewise along the tree, accessing each node as encountered at its "right" side.
Pre-Order Traversal
the process of systematically visiting every node in a tree once, starting with the root node, proceeding to the left along the tree and accessing the node when the "left" side of the node is encountered
Binary Tree Traversal
the process of systematically visiting every node in a tree once.
product introduction
the product is made available on a limited basis, and typically high price.
product retirement
the project has become outdated and production is discontinued.
multimedia
the set of technologies that enable information to be presented in a variety of ways; example include sound, video, images and text
operating system
the software that supports a computer's basic functions, such as scheduling tasks, executing applications, and controlling peripherals.
ISP (internet service provider)
these are companies that have access to the internet backbone and provide a connection to that backbone, usually a fee.
fair use law
to allow the use of copyright material without permission but limit that use to academic or review setting situations
POP (Post Office Protocol)
transfer email from the clients computer to the email server
IRC (Internet Relay Chart)
transfer text between multiple users on the internet
comment
// comment goes here /* comment goes here */
Pretest Loops
check before the action (for and while loops); they may never act
asymptotic analysis
is a method of analyzing algorithms by describing their limiting behaviors
trademark laws
"word, phrase, symbol, or design" that represents a certain person, thing or company.
Worldwide organization for computer and computing
Association for Computing Machinery (ACM), Institute of Electrical and Electronics Engineers (IEEE), Computing Research Association (CRA)
FORTRAN
One of the original high level languages, short for Formula Translation, created by John Backus to make programming easier for math and science applications.
Star
This network topology consists of a central node, to which all other nodes are connected.
random access file
To access a file randomly, you open the file, seek a particular location, and read from or write to that file.
MAN (Metropolitan Area Network)
[computer network] that interconnects users with computer resources in a geographic area or region larger than that covered by even a large local area network (LAN) but smaller than the area covered by a wide area network (WAN).
Linux
a UNIX-like computer operating system assembled under the model of free and open-source software development and distribution. The defining component of Linux is the Linux kernel, an operating system kernel first released on 5 October 1991 by Linus Torvalds.
control structure
a block of programming that chooses which way to go, given certain parameters
switch statement
a conditional control structure in programming that functions as a multi-step if else statement, where several cases are stated and examined during execution to seek a match, and then a command is executed when a match is found
binary tree
a data structure in which a record is linked to two successor records. no node will have more that two descendant. (A node's descendants are known as children while the ancestral nodes are known as parent)
object oriented design
a data-centered design methodology that uses interacting objects using the big ideas of Abstraction, Inheritance, and Polymorphism.
systems analysis
a design model for observing and improving systems and consist of six phases. (1st: investigation & planning, 2nd: analysis, 3rd: design, 4th: development, 5th: implementation,6th: maintenance) this 6-phase process is known as the systems development cycle or SDLC.
UNIX
a family of multitasking, multiuser computer operating systems that derive from the original AT&T developed in the 1970s at the Bell Labs research center
programming
a five step process. 1. identifying the problem or determining the function that the computer is to perform. 2. inventing a solution to the problem 3. compose program code in the appropriate syntax 4. program testing and troubleshooting 5. comprehensive and detailed documentation
break
a keyword needed at the end of each line of case commands in order for the matching item(s) to be the only thing printed
array
a linear collection of data items in a program, all of the same type, such as an array of integers or an array of strings, stored in contiguous memory, and easily accessed using a process called indexing
Linked List
a linear data structure that consists of nodes, where each node contains data as well as a link to the next node, but that does not use fixed memory
For Loop
a loop structure in various programming languages where the start, check, and step are designated in parentheses immediately after the for
Array Length
a value that represents the number of elements contained in an array. Often there is a process associated with an array that provides this value, such as list.length, or len(list)
constructor
a method in a class definition whose sole responsibility is to construct a new object
leaf
a node in a tree data structure that has no children, and is at the end of a branch in a tree
Parent Node
a node, including the root, which has one or more child nodes connected to it
Full Tree Traversal
a non-executable, visual approach to help determine the pre-order, in-order, or post-order traversal of a tree; start with the left side of root and connect to each closet point
Big O Notation
a notation system used to classify algorithms (see algorithm analysis). The primary notation levels are: O(1), O(log2 N), O(N), O(N log2 N), and O(N2)
Big O Notation
a notation system used to classify algorithms. The primary notation levels are: O(1), O(log N), O(N), O(N log N), and O(N^2)
chip
a piece of silicon containing potentially millions of integrated circuits also known as a microship.
Do While Loop
a post test loop in programming where the action of the loop precedes the "if true" expression, which decides whether or not the loop should continue
While Loop
a pretest loop in programming that checks a boolean condition before performing the action of the loop, and continues iterating while the condition is true
method
a process that includes a collection of data processing commands (such as void and return methods) that you create in a program; the building blocks of a fully functioning program
Linear Data Structure
a programming data structure that occupies contiguous memory, such as an array of values
procedures
a programming module that performs a task of some sort
new
a reserved word in several languages that asks the compiler to instantiate a new object
ISDN (Integrated Service Digital Network)
a set of communication standards for simultaneous digital transmission of voice, video, data, and other network services over the traditional circuits of the public switched telephone network. Don't require modem.
bit (b)
a single binary digit, a 0 or 1
deadlock
a situation where to or more threads are blocked forever waiting on each other. *operating systems use a variety of techniques to overcome this.
HTML (hyper text markup language)
a standardized system for tagging text files to achieve font, color, graphic, and hyperlink effects on World Wide Web pages.
conditional statement
a statement in programming that makes a decision using if or if-else situations by evaluating a boolean condition
BitTorrent
a system for rapidly transferring files by dividing them into many small parts; a downloading computer receives bits of the files from many different uploading computers
semaphore
a technique by with an operating system manages access to computer resources (such as: printer, fax, etc) using flag system it prevents 2 processes from accessing the same resource at the same time
Full Tree
a tree in which every level of the tree is completely full, with no missing nodes
Maximum Heap Tree
a tree in which every parent is greater in value than both its children, which means that the root of the tree is the greatest value in the tree
Minimum Heap Tree
a tree in which every parent is lesser in value than both its children, which means that the root of the tree is the least value in the tree
Binary Search Tree
a tree in which nodes are inserted systematically in natural order, with the final property of each left child being less than or equal to its parent, and each right child being greater than its parent
Complete Tree
a tree where there are no missing nodes when looking at each level of the tree. The lowest level of tree may not be completely full, but does not have any missing nodes; All other levels are full
Huffman Encoding
a type of optimal prefix code that is commonly used for lossless data compression
IP Address
a unique string of numbers separated by periods that identifies each computer using the Internet Protocol to communicate over a network. example: 426.6.35.4
Array Index
a value that indicates the position in the array of a particular value. In many languages, the index of the first element of an array is zero. The index value for the last element of a zero-indexed array would be the length of the array, minus 1. For example, and array with 10 elements has the first element in position zero, and the last element in position 9
black box
also known as Behavioral Testing, is a software testing method in which the internal structure/design/implementation of the item being tested is not known to the tester. These tests can be functional or non-functional, though usually functional. a device, system, or object in computing which can be viewed in terms of its inputs and outputs, without requiring any knowledge of its internal workings
device manager
also known as an I/0 supervisor, regulates access to input & outputs (I/0)
greedy algorithm design
algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum.
inheritence
allows classes to be defined based on previously defined and developed classes, receiving all of the characteristics of the parent class, and then expanding on those features.
SMTP (Simple Mail Transfer Protocol)
allows user to converse over the internet by converting audio into transferable digital packets
instruction set
also known as an instruction set architecture or ISA, includes machine language specification and sets of native commands carried out by processors. (it can be implemented in both hardware and software)
Ragged Array
an array where the number of columns in each row may be different
Row Major
an array where the two index values for any element are the row, column
integrated circuit
an electronic circuit, usually places on a tiny piece of silicon or some other special material capable of containing a variety of electronic
silicon
an element frequently used as a semiconductor in integrated circuits; abundant in clay and sand. and therefore cheap to obtain and use
storage device
an equipment for recording a copy of the data to be stored.
Node
an object linked to other objects, representing some entity in that data structure
passing by value
any changes made by the formal parameter do NOT affect the value of the actual parameter
solid-state device
any device in w/ electrons pass through a solid material rather than a vacuum; in many solid-state devices, electrons pass through silicon
polynomial problems
are bound by polynomials and can produce practical solutions in practical solution in polynomial time using deterministic algorithm
global variable
are considered "in scope" through the entire program, meaning they can be read and changed through any part of the program.
local variable
are considered "in scope" throughout only parts of the program, such as a specific function or subroutine which can read and modify the variable.
2D homogenous array
are ideal for tables of information. They come in two varieties: row major order, which stores data row by row in the computer's memory, and column major order which stores data column by column in the computer memory.
nonpolynomial problems
are not bound by polynomials but can be solved in polynomial times using nondeterministic algorithms. These can produce practical solutions only when the inputs are carefully selected or small
Actual Parameter
are the specific terms that are inserted into formal parameters once the procedures starts executing. in the method header (first line)
main memory
area which a computer stores information. It consist of numerous circuits, each of which holds one bits
glass box
assesses the effectiveness of software based on its internal composition. (also known as clear box testing, glass box testing, transparent box testing, and structural testing) is a method of testing software that tests internal structures or workings of an application, as opposed to its functionality (i.e. black-box testing)
⇔ (notation)
biconditional, is equivalent
PAN (Personal Area Network)
is a computer network for interconnecting devices centered on an individual person's workspace.
what are the 5 basic components of greedy algorithm
candidate set selection function feasibility function objective function solution function
agile
builds a system incrementally with repeated cycles of analysis, design, implementation and testing. The methodology emphasizes continuous delivery of working software that is coded, tested and fixed over short intervals that are typically one to three weeks in duration456
microarchitecture
computer organization and sometimes abbreviated as µarch or uarch, is the way a given instruction set architecture, is implemented in a particular processor.
interpreter
computer program that directly executes, i.e. performs, instructions written in a programming or scripting language, without requiring them previously to have been compiled into a machine language program.
translator
computer program that performs the translation of a program written in a given programming language into a functionally equivalent program in another computer language (the target language), without losing the functional or logical structure of the original code (the "essence" of each program)
partitioning
concurrent multiprogramming technique; is a section of the hard drive that is separated from other segments. it requires more memory.
^ (notation)
conjunction, and
process manager
controls programs as the are executed in memory
Cable Modem
enables transmission of digital data over lines previously used exclusively for cable TV. network bridge that provides bi-directional data communication via radio frequency channels on a hybrid fibre-coaxial and radio frequency over glass infrastructure
Information technology
equipment designed to arrange, organize, and display data.
∃ (notation)
existential qualifier, there exist
algorithms
expressed as a formula or a sequence of instructions that will accomplish a specific task.
bridge
first reads the destination address of the signal and only forwards it to the other network if the signal is intended for a computer on the opposite side of the bridge.
The three types of loops are:
for, while, and do while
Formal Parameter
formal term used by the procedure. They must be listed in the procedure's header (first line)
Binary Search Best Case
found in the exact middle position
Integrated Development Environment
gives information to help fix bugs
distributed systems
is a group of software units that are processed on different computers via networking technologies. (Ex: computer games, company acct systems, retrieval systems)
tree
hierarchal abstract data structure that consist in node. the top node is known as the "root node" while bottom nodes are known as terminal/leaf/nodes. Lower nodes can't connect to anymore than one higher level node & depth of the ____ is its total number of horizontal layers.
Polymorphic Objects
how a parent object can reference any of its child objects, or any descendant several levels of inheritance down the way
DNS (domain name system)
i a service that converts web addresses (www.domain.com) from names to IP addresses (like 192.168.2.173)
1D homogenous array
ideal for storing sequence data because the store elements in consecutive memory cells.
IF/ELSE statement
if the condition was false, this occurs which is also known as "two-way" conditional statements
decorator pattern
implemented when system is at risk of becoming overly complex. using this pattern the programmer can better manage system.
⇒ (notation)
implication, implies
hardware
includes the physical parts or components of a computer, such as the central processing unit, monitor, keyboard, computer data storage, graphic card, sound card and motherboard.
encapsulation
incorporates related data items and processes into a class definition, including instance variables, constructors, accessor and modifier (mutator) methods.
digital circuit theory
information is encoded as a series of digits -1s and 0s that are stored in numerous devices, each device stores one of the digits. Each level is interpreted as one of two different states (for example, on/off, 0/1, true/false). use transistors to create logic gates in order to perform Boolean logic.
in a standard flowchart, what does the parallelogram symbol represent?
input/output
loops
interative structure in which the program executes the same set of instruction until certain termination conditions has been met. There two primary structures: while (termination condition) do (set of instruction & repeat (set of instructions) until (termination condition)
list
is a basic abstract data structure that arranges data entries sequentially. entries at the beginning are called "head" and entries at the end are called "tails" Two basic types: queues and stacks.
¬ (notation)
negation, not
Pushing
occurs when a new data element is added to the stack. (FIFO/FILO)
Popping
occurs when the computer returns the first data element that was saved. (FIFO/FILO)
dynamic memory
one method of implementing RAM. rather than using flip flop to store bits of information DRAM uses small electric charges that fade out very quickly.
petabyte
one quadrillion bytes
terabyte
one trillion bytes
interrupt handler
operating system software that examines and categorizes interrupted commands. signal/alerts the CPU to stop process so it can process a request.
repeater
passes signal between two bus network but has no ability to read the signal. (simplest method of connecting network)
in a standard flowchart, what does the arrow symbol represent?
path that data takes through software
static Internet Protocol (IP) address
permanent number assigned to a computer by an Internet service provider (ISP). addresses are useful for gaming, website hosting or Voice over Internet Protocol (VoIP) services.
The most common traversals are:
pre-order, in-order, and post-order
in a standard flowchart, what does the rectangle symbol represent?
process
class method
process in a class definition that acts on the data that belongs to that class
name binding
process of associating a programming object, such as data or code with an identifier.
enqueue
process of entering data into a queue
dequeue
process of returning data
what are the 5 stages that hardware development goes through:
product development, product announcement, product introduction, product, maintenance, & product retirement.
product announcement
production of new device is announced to the public
backtracking
program that retrieves instruction in an order that is reverse from which they entered.
assembler
program that takes basic computer instructions and converts them into a pattern of bits that the computer's processor can use to perform its basic operations.
compiler
program that translates the source code for another program from a programing language into executable code. The source code is typically in a high-level programming language (e. g. Pascal, C, C++, Java, Perl, C#, etc.)
software
programs and other operating information used by a computer
copyright law
protects "original work of authorship" that include creation of writing/drama/music/other activities such as programming.
exact analysis
provides a more specific measure of algorithm efficiency that asymptomatic analysis.
queue
receives new entries at the tail and removes old entries at the head, much like a checkout line. It is known as FIFO first in, first out.
in standard database, one row represents one:
record
Satellite Internet Services
refers to Internet access provided through satellites. In other words, it is a telecommunications network provided by orbital communication stations. Signals from these satellites allow a user with a dish to have a high speed internet connection.
fixed-format language
require that each program statement occupy a specific position when printed on a page.
Common Network Topologies:
ring, bus, star, tree
2D Array
row column indices; arranged in a grid format, but still stored in side-by-side memory, accessed using two index values
software copyrigth
safeguard ownership of a program and restricts the right of non-owner to alter and distribute the program.
asynchronous sequential system
self-timed circuit, is a sequential digital logic circuit which is not governed by a clock circuit or global clock signal. Instead it often uses signals that indicate completion of instructions and operations, specified by simple data transfer protocols. This type of circuit is contrasted with synchronous circuits, in which changes to the signal values in the circuit are triggered by repetitive pulses called a clock signal.
Root
the base level node in tree; the node that has no parent
product maintenance
the demand for the product is assessed and a price is set
on-line
the device can operate w/o human intervention b/c it is attached to the machine
off-line
the device only operates after some type of human intervention, such as turning on the power or plugging the device into correct port.
cache
special memory section that computer use for frequently required instruction
product development
specification are determined and a manufacturer creates
BIOS
stands for basic input/output system. a set of computer instructions in firmware that control input and output operations.
The four standard parts of any loop:
start (initialize), check (test), action(modify), step
in a standard flowchart, what does the oval symbol represent?
start or stop
IF statement
statements in programming that check to see if a Boolean expression is true, and executes a "then" statement if so, otherwise does nothing. These are often called "one-way" conditional statements
RAM (Random Access Memory)
storage location for data in a computer typically holds program instruction for open applications and the operating system. Typically found in circuit board. Intended only for immediate need of computer.
buffer
store data temporarily for transfer between two location
data structure
stores multiple related variables using some type of conceptual shape or arrangement. using this system can process many variables at once-- a useful ability when handling large amount of data (such as customer list, inventory list, etc). Example: daily planner w/ arranges information in a conceptual way.
Exception Handling
technique used by most programming languages to intercept events that disrupt the normal flow of a program's execution
virtual memory
used when ram is full sometimes its slows down computer system
boolean values
true/false
stack
type of list data structure. it receives and removes new entries at the head, also know as the top. The tail is known as the base or bottom. Data saved most recently always goes to the top of the ____ and will always be the 1st data returned when the computer retrieves information. FILO, first in , last out.
sequential logic
type of logic circuit whose output depends not only on the present value of its input signals but on the sequence of past inputs, the input history. This is in contrast to combinational logic, whose output is a function of only the present input. That is, sequential logic has state (memory) while combinational logic does not.
∀ (notation)
universal quantifier, for all
Children of a Binary Tree
used in trees to indicate a node that extends from another node
concurrent processing
used to describe the ability of program or operating system to keep a number of precesses logically active concurrently even though only one operation can take place at a time.
Turing Test
used to determine a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human
HTTP (Hypertext Transfer Protocol)
used to transfer information over the internet; capable of transmitting files that contain audio, text, & video
FTP (File Transfer Protocol)
used to transmit information between 2 computers on the internet; in this arrangement, one computer is the host and the other is the client
VDE
visual development environment, enables a computer programmer to use the shortcut of point and click technology.
Recursive Case
where another method call is made
polymorphism
where methods can be redefined (overloaded or overridden) as needed and desired.
binary
which consists of just two unique numbers, 0 and 1. The base-2 numeral system is a positional notation with a radix of 2. Each digit is referred to as a bit.
set flag
which has a value of one (1) specifies resource being used
clear flag
which has a value of zero (0), meaning that the resource is available/free