Theory Flashcards
Define the term operating system. [1]
A set of programs through which a computer manages/controls its own resources
Outline the function of the ALU. [1]
Part of a processor that performs arithmetic and logical operations
Outline the relationship between binary and hexadecimal. [2]
Binary is base 2, whereas hexadecimal is base 16;
Each hexadecimal digit can be represented by a group of 4 binary digits;
Describe the characteristics of a stack. [2]
Data structure;
Which can only be accessed at one end/LIFO (last in first out);
Identify two applications of a stack in computing. [2]
Translations of one programming language to another;
Used in calculations;
State three advantages of using sub-programs while solving programming problems. [3]
A large program can be broken into smaller pieces;
A sub-program could be written independently;
Easier maintenance;
What does the MOD function do?
Basically just finds the remainder.
Static vs Dynamic [2]
Fixed size for static, and only has one data type;
Dynamic structure can change in size, and the data type isn’t fixed;
How does post-order traverse?
Put the apple on the right of the node;
What are stacks, linked lists and queues? (static or dynamic?)
Dynamic;
Why is dynamic structure good?
Make memory allocation more efficient, by only using as much as is necessary, while also allowing the programmer to design more flexible algorithms, where the size of a data structure is not known before runtime.
What is the role of the MDR? [2]
Holds the content of the memory;
Which is to be transferred from the memory to the other CPU components;
What is the importance of Memory Management function? [3]
Allocates and deallocates memory;
Allowing more programs to run concurrently;
Provides memory protection;
Define recursion [1]
A function/algorithm that calls itself;
Describe the characteristics of a queue [2]
FIFO;
Items can only be added to one end and removed from the other end;
Explain the benefits of Binary Search Trees (BST’s) compared to a stack when finding specific item;
The data in a binary search tree is ordered;
Each element in a stack has to be checked;
Which for large data sets will be ineffeicient;
Explain the purpose of cache memory [3]
Cache memory is a small-sized type of volatile computer memory;
that provides high-speed data access to a processor;
and stores frequently used computer programs, applications and data;
Applications of stacks [2]
Evaluating arithmetic expressions;
Parsing;
Outline the function of an OS in managing primary memory [2]
The operating system (OS) makes sure that each running program always has enough memory for its data;
The OS assigns memory to programs by freeing up space in the computer’s memory;
Outline the need for a translation process from high level language to machine code [2]
So that the computer can excecute the program;
As the computer only understands machine code;
What is an xor gate? (own understanding)
An XOR gate is the same as an or gate, just with the exception that 1 and 1 is 0, not 1.
Identify 3 operating management techniques.
Multitasking;
Virtual memory;
Interrupt;
Paging;
Application of queues;
Playlist queue;
Super market queue;
Print queue;
What is a child node?
A child node is a node that has up to two links to other nodes and has only one parent node.