Workshop 1

Question 1

Data Structures - 2 parts

Answer 1

Collection of elements, either data type or another data structure.

Set of associations or relationships, involving collection of elements.

Question 2

Algorithim

Answer 2

Sequence of steps that takes an input and and output.

Question 3

Candidate Solutions

Answer 3

Different Algorithms.

Question 4

Linear Structure

Answer 4

Unique predecessor and unique successor.

e.g. stack, queue

Question 5

Hierarchal Structure

Answer 5

Unique predecessor and many successors.

eg. management structure, family tree

Question 6

Graph Structure

Answer 6

Many predecessors and many successors.

eg. railway map, computer network.

Question 7

Set Structure

Answer 7

No predecessors and no successors.

eg. YOU (students studying this unit)

Question 8

ADT

Answer 8

Abstract Data Type

Data collection and associated methods stored in a single module.

Question 9

ADT data

Answer 9

Cannot be accessed directly, data is accessed indirectly through methods.

Question 10

ADT details

Answer 10

High Level Description.

Concerned with WHAT it can do.

Implementation Independent.

Question 11

Data Structure Details

Answer 11

Concrete Description.

Concerned with HOW task is done.

Implementation dependent.

Question 12

Stack ADT

Answer 12

Collection of objects where most recently inserted objects can be removed at anytime.

Linear Data Structure, Last-In First-Out.

Question 13

Stack ADT types

Answer 13

Push - Add an item on top of stack
Pop - Remove an item on top of stack
Peek - Examine item at top of stack
Empty - Determine if stack is empty.
Full - Determine if stack is full.

Question 14

Stack ADT will expect the ADT to throw an exception if:

Answer 14

Push operation is requested on full stack.

Pop/peek operation is requested on an empty stack.

Question 15

Application using ADT Stack is not…

Answer 15

concerned with way storage stack is managed.

Question 16

An ADT is not…

Answer 16

inserted in the application using the ADT.

Question 17

Stack ADT is a

Answer 17

fixed size array.

Question 18

ADT methods require

Answer 18

Push
Pop
Peek

Question 19

Application of a Stack

Answer 19

Matching bracket in arithmetic expressions.

Question 20

Queue ADT

Answer 20

collection of objects organised such that the object that has been stored in the queue the longest is the next one removed.

a queue is a linear data structure with elements.

Question 21

Probabilistic data structure

Answer 21

designed to handle large-scale or streaming data efficiently by sacrificing some accuracy for reduced space and time complexity.

e.g

Question 22

A BLANK follows the first in first out (FIFO) principle

Answer 22

A QUEUE follows the first in first out (FIFO) principle

Question 23

A BLANK follows the first in last out (FILO) principle.

Answer 23

A STACK follows the first in last out (FILO) principle.