Quiz Maker LogoMake your own QuizCopy & Edit
Make your own quizManage my QuizzesPlans / FeaturesGuides and HelpContactPrivacy & Security
A special format for storing ang organizing data
Data structure
Abstract data type
Public or external
Private or internal
Logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented
Data structure
Abstract data type
Public or external
Private or internal
The data and the operation
Data structure
Abstract data type
Public or external
Private or internal
The representation and the implementation
Data structure
Abstract data type
Public or external
Private or internal
Used for storing elements where each element is a seperate object
Linked list
Tree
Priority queue
Heap
Represents a hierarchical nature of a structure in graphical form
Linked list
Treer
Priority queue
Heap
A special type of queue where elements are processed based on their order (natural or custom)
Linked list
Tree
Priority queue
Heap
A complete binary tree where each parent node is either higher or lower than the value of its child nodes
Linked list
Tree
Priority queue
Heap
A collection of elements where each element is unique
Set
Map
Graph
Input
Set of elements where each element is known as keys(identifiers) and values(constants)
Set
Map
Graph
Input
Consists of vertices and set of edges between the pair of vertices
Set
Map
Graph
Input
An algorithm should have zero or more well defined data before the algorithm begins
Set
Map
Graph
Input
An algorithm must have one or more results with relation to the input
Output
Uniqueness
Iteration
Recursion
The results of each step depends on the input and the result of the previous step
Output
Uniqueness
Iteration
Recursion
Repeat an action multiple times
Output
Uniqueness
Iteration
Recursion
Function calls itself once or multiple times to solve a problem
Output
Uniqueness
Iteration
Recursion
Any function that calls itself
Divide and conquer
Greedy algorithm
Dynamic programming
Recursive
A problem is broken into smaller subproblems
Divide and conquer
Greedy algorithm
Dynamic programming
Recursive
The optimal approach is always chosen in oroblek solving
Divide and conquer
Greedy algorithm
Dynamic programming
Recursive
Similar to divide and conquer except the results of the subproblems are reused in overlapping subproblems
Divide and conquer
Greedy algorithm
Dynamic programming
Recursive
Recursion that involves a method directly calling itself
Direct recursion
Indirect recursion
Infinite recursion
Iteration
When a method invokes another method, eventually resulting in the original method being invoked again
Direct recursion
Indirect recursion
Infinite recursion
Iteration
When a recursive function fails to stop recursion
Direct recursion
Indirect recursion
Infinite recursion
Iteration
Process of repeating a set of instructions, also known as looping
Direct recursion
Indirect recursion
Infinite recursion
Iteration
The function calls itself once each time it is invoked
Linear recursion
Tail recursion
Binary recursion
Mutual recursion
The function makes a recursive call as its very last operation
Linear recursion
Tail recursion
Binary recursion
Mutual recursion
The function calls itself twice in the run of the function
Linear recursion
Tail recursion
Binary recursion
Mutual recursion
The function works in pair or a group
Linear recursion
Tail recursion
Binary recursion
Mutual recursion
Elements in a linked list
Nodes
Data field
Pointer field
Successor
This contains the value of the element
Nodes
Data field
Pointer field
Successor
This contains the address of the next node
Nodes
Data field
Pointer field
Successor
The next node is the list
Nodes
Data field
Pointer field
Successor
First node in the list
Head
Null
Display
Insert
Where the last node points to since there are no successive elements
Head
Null
Display
Insert
Shows the element on the list
Head
Null
Display
Insert
Adds element into the list
Head
Null
Display
Insert
Removes a specific element or all the elements in the list
Delete
Count
Singly linked list
Doubly linked list
Returns the number of elements in the list
Delete
Count
Singly linked list
Doubly linked list
The basic linked list
Delete
Count
Singly linked list
Doubly linked list
Contains am extra pointer to connect the previous node in the sequence
Delete
Count
Singly linked list
Doubly linked list
{"name":"a special format for storing ang organizing data", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"a special format for storing ang organizing data, logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented, the data and the operation","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}

More Quizzes

Blah
320
2B CHAPTER 4
840
320
Scout
1267
Quiz AB
420
Zender Man Quiz
10547
96480
BrownBag Session
4234
[7.22.16] MAL-FALC Best Anime 2015 Pre-Semifinal Round
420
756 Systems Communications
1910845
X-Men
1160
Kuiz Memperkasa Ilmu Silat Cekak Hanafi
10527
Quiz Maker Logo Make your own Quiz
Powered by: Quiz Maker