Exam #5
Order by
66 terms
Terms | Definitions |
|---|---|
 name | may have a specific value |
| variable | is a name that refers to a place (address) in main memory that holds a value |
| statements and variables | program scripts consist of: |
| primitive | what every programming language uses a set of instructions |
| assignment statement | statements to assign values to variables |
| conditional statement | to change what the program does, based on some condition |
| looping | structures to cause repeated execution of some part of the program |
| procedure | /function is a way to package up some programming code and refer to it by a convenient name |
| pseudocode | descriptive way to represent the primitives used to solve problems |
| flowchart | graphical way to represent the primitives used to solve problems |
| sequential search | /linear, start alphabetically and check for each object to see if its the one desired |
| binary search | uses a divide and conquer approach by breaking a big task into smaller subtasks |
| Big Theta | used to describe the complexity of an algorithm |
| theta n | sequential search algorithm |
| theta log n | binary search algorithm |
| selection sort | to alphabetize a list of names, find the name and exchange to the top until finished |
| quicksort | uses a divide and conquer approach to alphabetize a list of names |
| theta n log n | quicksort algorithm |
| theta nn | selection sort algorithm |
| array | the simplest form of data structure, a series of the same type of items stored in consecutive memory locations |
| array | static objects |
| list | are dynamic data structures that can adapt to changing information needs |
| linked list | used for a variable data set, data need not be stored in consecutive memory address and data can easily be added or deleted |
| pointer | the memory address of the next item in the list |
| head pointer | holds the address of the first element in the list |
| nil | the pointer in the last element with a special value that doesn't point to anything |
| stack | list in which items are only added or removed from the head (top) of the list |
| push | to add an item to the stack |
| pop | to remove an item from the stack |
| last in first out | stack |
| queue | a list in which items are only added at the tail and removed from the head of the list |
| dequeued | item is removed from the front of the list by changing the head pointer to point to the next item in the queue |
| enqueued | the last item's pointer is changed from NIL to point to the new item and that new item gets a NIL pointer |
| first in first out | queue |
| tree | data structure with hierarchy |
| root node | the single item at the top |
| leaf node | a node with no children |
| binary tree | a tree in which no parent has more than two children |
| sibling | children share the same parent on the tree |
| subtree | multiple little trees |
| ordered tree | making sure the left child is always before the parent and the right child is always after the parent in search order |
| waterfall model | what the five phases of software project is called |
| analyzing the task | phase one |
| devising a plan | phase two |
| top down design | complex tasks can be broken into simpler sub-tasks (divide and conquer) and continually breaking tasks into sub-tasks eventually results in simple steps that can be accomplished easily |
| creating the program | phase three |
| testing and correcting | phase four |
| maintenance | phase five |
| alpha | initial pass, for internal use only |
| beta | first external release, only to select group of users |
| version 1.0 | first commercial version |
| minor revision | (1.1, 1.2, 1.3.......) |
| major revision | (2.0, 3.0, 4.0..........) |
| store and manage | two things needed to deal with lots of information |
| database | a computerized record-keeping system consisting of two parts |
| hardware | devices to store data |
| software | methods to add, retrieve and change data |
| database management system | DBMS |
| DBMS | the software that runs a database |
| flat file database | earliest database; data was stored in simple/ flat tables |
| table | earliest database, what files data were stored in |
| record | earliest database, what the tables containing rows of data are called |
| field | earliest database, records that consist of individual data elements called... |
| network database model | separate tables are used to avoid data redundancy, data is connected through pointers |
| relational database model | does not depend on the physical arrangement of data storage elements, rather based on the logical relationships of the data |
| primary key | in relational database model, relates the information between the tables |
First Time Here?
Welcome to Quizlet, a fun, free place to study. Try these flashcards, find others to study, or make your own.