Term Inventory

Term Inventory
Computer Science Students:

The following words, names, terms and phrases are explained in the core courses required by all computer science majors. You will not be identified by your responses on this form. Please answer honestly. This helps the Department of Computer Science assess, evaluate and improve its program.

-- The Assessment Committee

Course Number:

Check

  1. if you have never heard of the term.
  2. if you have heard of the term but do not understand what it means.
  3. if you have heard of the term and generally understand what it means.
  4. if you completely understand the term.
For each term, please choose the response that best describes your understanding of the term.

Activation Record 1 2 3 4 Addressing Mode 1 2 3 4
Adjacency Matrix 1 2 3 4 Alan Turing 1 2 3 4
Algorithm 1 2 3 4 Arithmetic Overflow 1 2 3 4
Array 1 2 3 4 ASCII Character Set 1 2 3 4
AVL Tree 1 2 3 4 B-Tree 1 2 3 4
Binary Search Tree 1 2 3 4 Binding Time 1 2 3 4
Bit 1 2 3 4 BNF 1 2 3 4
Breath-First Search 1 2 3 4 Byte 1 2 3 4
Cache 1 2 3 4 Call by Reference 1 2 3 4
Call by Value Result 1 2 3 4 Call by Variable 1 2 3 4
Central Processing Unit 1 2 3 4 Charles Babbage 1 2 3 4
Compiler 1 2 3 4 CPU Flags 1 2 3 4
CRT 1 2 3 4 Data Bus 1 2 3 4
Dequeue 1 2 3 4 Direct Access File 1 2 3 4
Directed Graph 1 2 3 4 Discrete Type 1 2 3 4
Enqueue 1 2 3 4 Execute Cycle 1 2 3 4
Exponential Algorithm 1 2 3 4 Fetch Cycle 1 2 3 4
FIFO 1 2 3 4 FTP 1 2 3 4
Functional Programming Language 1 2 3 4 Global Variable 1 2 3 4
Half Adder 1 2 3 4 Hamiltonian Circuit 1 2 3 4
HTML 1 2 3 4 Hardware Registers 1 2 3 4
Hash Table 1 2 3 4 Hashing Function 1 2 3 4
Heap Sort 1 2 3 4 Hexadecimal Number System 1 2 3 4
Index Addressing 1 2 3 4 Indirect Addressing 1 2 3 4
Insertion Sort 1 2 3 4 Instruction Cycles 1 2 3 4
Instruction Pointer 1 2 3 4 Interpreter 1 2 3 4
Iteration Control Structure 1 2 3 4 Karnaugh Map 1 2 3 4
Lexical Analysis 1 2 3 4 Linked List 1 2 3 4
Local Area Network 1 2 3 4 Logic Based Language 1 2 3 4
Logic Gates 1 2 3 4 Machine Code 1 2 3 4
Megabyte 1 2 3 4 Micro Code 1 2 3 4
Multiplexer 1 2 3 4 Multitasking 1 2 3 4
Nanosecond 1 2 3 4 OOP 1 2 3 4
Open Addressing 1 2 3 4 Parallel Processing 1 2 3 4
Parity Bit 1 2 3 4 Permutation 1 2 3 4
Polynomial Algorithm 1 2 3 4 Postfix Notation 1 2 3 4
PreOrder Traversal 1 2 3 4 Priority Queue 1 2 3 4
Procedural oriented Language 1 2 3 4 Program Block 1 2 3 4
Prolog 1 2 3 4 Queue 1 2 3 4
Read Only Memory 1 2 3 4 Recursion 1 2 3 4
Run Time Errors 1 2 3 4 Scope of Identifier 1 2 3 4
Sequential Access File 1 2 3 4 Shell Script 1 2 3 4
Spanning Tree 1 2 3 4 Syntax 1 2 3 4
Topological Sort 1 2 3 4 Two's Complement Notation 1 2 3 4
Two pass Assembler 1 2 3 4 Virtual Memory 1 2 3 4
Volatile Memory 1 2 3 4 Weighted Graph 1 2 3 4

This is the end of the instrument. When you have completed all the questions and reviewed your answers, press the button below to submit your answers.


NSU Department of Computer Science
700 Park Avenue
Norfolk, VA 23504
 Phone: (757) 823-9454
     Fax: (757) 823-9229
  eMail: CompSci@nsu.edu
Home | Resources | People | Courses | Undergraduate Program | Graduate Program |
Research | News & Events
Norfolk State University - Department of Computer Science
Copyright © 2008. All Rights Reserved.
NSU College Of Science, Engineering & Technology