mikay

Play an AI-generated podcast conversation about this lesson

Part of ADT: data and operation

External ADT (correct)

Internal ADT

used for storing elements where each is separate object

Queue

Stack

Tree

Linked List (correct)

algorithm must terminate after specified number of steps

Uniqueness

Terminate

Finiteness (correct)

repeating action multiple times

iteration Signup and view all the answers

problem broken into smaller sub-problems

divide and conquer Signup and view all the answers

single call itself each time function runs

linear recursion Signup and view all the answers

terminate when reached base case

recursion Signup and view all the answers

elements access in sequential order but stored unsystematically

Linear Signup and view all the answers

logical description on how data viewed

Abstract Data Type Signup and view all the answers

LIFO

Stack Signup and view all the answers

step by step instructions to be executed insequence for solving problem

Algorithm Signup and view all the answers

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

Output Signup and view all the answers

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

Recursion Signup and view all the answers

calls itself twice during course of execution

Binary Recursion Signup and view all the answers

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

Dynamic Programming Signup and view all the answers

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

Map Signup and view all the answers

FIFO

Queue Signup and view all the answers

not main operation that defined ADT

creating Signup and view all the answers

elements stored and accessed in non-sequential order

Non-Linear Signup and view all the answers

special format for storing and organizing data

Data Structure Signup and view all the answers

call is the last statement that is executed by function

Tail Recursion Signup and view all the answers

terminated condition if proven false

Iteration Signup and view all the answers

represents hierarchical nature of structure in graphical form

tree Signup and view all the answers

special type of queue elements processed by order

primary queue Signup and view all the answers

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

uniqueness Signup and view all the answers

optimal approach is always chosen in solving problem

greedy algorithm Signup and view all the answers

when divided into two functions that call each other

mutual recursion Signup and view all the answers

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

input Signup and view all the answers

representation and implementation

Internal ADT Signup and view all the answers

other term for external adt

public Signup and view all the answers

when method directly calls itself

direct recursion Signup and view all the answers

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

True Signup and view all the answers

complete binary tree

heap Signup and view all the answers

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

graph Signup and view all the answers

collection of elements where each item is unique

set Signup and view all the answers

not part of wall of adt

remove empty Signup and view all the answers

each instruction has to be clear and unambiguous

Definiteness Signup and view all the answers

when method calls another method, eventually calling original method

Indirect Recursion Signup and view all the answers