Unit 6 plus HL

Question 1

What is A collection

Answer 1

An ADT that hols elements of the same or different data type

Question 2

Characteristics of a collection

Answer 2

Resizeable
has a set of methods that can be called on
stores multiple data of different types
only accessed sequentially
can have objects

Question 3

What is a sub program

Answer 3

a small program with computer instructions within a larger program its purpose is to perform a specific task, this task may be used more than once in the main program

Question 4

advantages of using sub program

Answer 4

breaks complex programming jobs into simpler jobs
distrubuting a large programming problem among various programmers
enables code reuse
improving maintainability and tracability
reducing programming code duplication

Question 5

advantages of using a collection

Answer 5

reusability
modularity
reliability

Question 6

what is code reuse

Answer 6

it is very useful as it allows programmers to take advantage of existing code to speed up their task

Question 7

what are fundamental operations

Answer 7

the basic operations a computer performs(add compare retrieve store)

Question 8

compound operations

Answer 8

a combination of fundamental operations

Question 9

what is concurrent thinking

Answer 9

executing different instructions simultaneously by multiple processors

Question 10

what is concurrent

Answer 10

something that happens at the same time as something else

Question 11

pros and cons of concurrent thinking

Answer 11

better planning and coordination of resoureces
example is access to database by several users

Question 12

what is a stack

Answer 12

an adt that stores elements in a particular order and only allows access to the last item inserted

Question 13

what are the methods of a stack

Answer 13

push: pushes an item onto the stack
pop: returns and removes the last item inserted on the stack
isempty: checks if the stack is empty
size: checks the size of the stack
peek returns but does not remove teh item from the stack

Question 14

characterists of a stack

Answer 14

last in first out
restricted access

Question 15

applicaitons of stacks

Answer 15

undo button
tower of hanoi
reversing a word

Question 16

what is a queue

Answer 16

an adt that stores elements in a particular order and only allows access to the front of the queue and the first item inserted

Question 17

methods of a queue

Answer 17

enqueue, puts an item in the back of the queue
dequeue, removes the first item inserted in the queue
isempty, checks if the queue is empty
size, checks the size of the queue
peek, returns but does not remove the first item in teh queue

Question 18

characteristics of a queue

Answer 18

restricted access
first in first out

Question 19

applications of a queue

Answer 19

printing tasks
keyboard input

Question 20

Explain the use of a one-dimensional array as a static stack. Your answer should include brief outlines of the push and pop operations and the tests for empty and full stacks.

Answer 20

An array A of N elements should be initialized,

keep track of the top of the stack since not all of the array holds stack elements (in an integer variable, for example, named TOP);

the main property of a stack is that stack values/objects go on and come off of the one end of the stack (LIFO data structure);

Push
Places a value (object) on the top of the stack;
Increase TOP by one and set A[TOP]= value;
Pop
Returns a value from the top of the stack and removes that value from the top of the stack;
Returns A[TOP] and decreases TOP by 1;
IsEmpty
Reports whether the stack is empty or not / returns True if the stack is empty, False otherwise;
Returns True if TOP is less than 0, False otherwise;
IsFull
Reports whether the stack is full or not/ returns True is stack is full, False otherwise;
Returns True if TOP is greater than N-1 (where N is size of the array), False otherwise;