mikay

38 Questions

Part of ADT: data and operation

External ADT

used for storing elements where each is separate object

Linked List

algorithm must terminate after specified number of steps

Finiteness

repeating action multiple times

iteration

problem broken into smaller sub-problems

divide and conquer

single call itself each time function runs

linear recursion

terminate when reached base case

recursion

elements access in sequential order but stored unsystematically

Linear

logical description on how data viewed

Abstract Data Type

LIFO

Stack

step by step instructions to be executed insequence for solving problem

Algorithm

algorithm must have 1 or more results with specified relation to input

Output

occurs when function calls itself once or multiple times to solve problem

Recursion

calls itself twice during course of execution

Binary Recursion

same with Divide and Conquer, except results of sub-problems reused for overlapping sub-problems

Dynamic Programming

set of ordered pairs where elements called identifiers and values called content

Map

FIFO

Queue

not main operation that defined ADT

creating

elements stored and accessed in non-sequential order

Non-Linear

special format for storing and organizing data

Data Structure

call is the last statement that is executed by function

Tail Recursion

terminated condition if proven false

Iteration

represents hierarchical nature of structure in graphical form

tree

special type of queue elements processed by order

primary queue

result of each step depends on input and result of previous step

uniqueness

optimal approach is always chosen in solving problem

greedy algorithm

when divided into two functions that call each other

mutual recursion

algorithm has zero or more well-defined data given before algorithm begins

input

representation and implementation

Internal ADT

other term for external adt

public

when method directly calls itself

direct recursion

TRUE or FALSE: Each iteration doesn't require extra memory

True

complete binary tree

heap

consist of vertices(nodes) and set of edges(relations) between pair of vertices

graph

collection of elements where each item is unique

set

not part of wall of adt

remove empty

each instruction has to be clear and unambiguous

Definiteness

when method calls another method, eventually calling original method

Indirect Recursion

Test your knowledge on the representation and implementation of algorithms, hierarchical structure, and optimal approach selection. This quiz covers the dependencies of algorithm steps, well-defined data, recursive functions, and graphical representation.

Make Your Own Quizzes and Flashcards

Convert your notes into interactive study material.