Algorithm Addict: 이산수학·알고리즘 APP
Algorithm Addict is a learning app for mastering discrete mathematics and algorithms through problems.
There is a difference between knowing something by reading and knowing it by solving problems. Instead of simply skimming concept explanations, the app is designed to help you internalize concepts by directly solving problems for each unit and revisiting the parts you got wrong.
■ How You Study
Select a unit and solve the problems. For multiple-choice questions, four answers are selected from six options and shuffled, so you cannot memorize the location of the answer even if you encounter the same question again. For short-answer questions, you must enter the answer directly as a number without options, so you cannot guess the correct answer.
If you get the answer right, you choose whether to move on to the next question; if you get it wrong, you view the explanation. The explanation places the answer on the first line and follows it with an explanation of why that is the correct answer.
■ What's Included
Trees, graphs, Venn diagrams, and arrays are drawn directly by the app. Since it is drawn to fit the screen rather than pasting image files, the text does not become distorted or blurry.
- Level Mode: Climb the thematic ladder one rung at a time. You must answer correctly to unlock the next section, and new problems start again every month.
- Spacingd Review: Retrieves incorrect and correct questions at different intervals.
- Progress: Provides a small number of new problems daily from chapters you haven't solved yet.
- Chapter Focus Mode: Skip correct answers and continue working only on unsolved problems.
- Mock Exam: Select a range and number of questions to solve all at once, and grade at the end.
- Random 10 Questions: Shuffles and prioritizes unsolved problems within the chapter.
- Learning Grass: View at a glance which days you studied over the past 12 weeks.
- Supports both Light and Dark modes.
■ Current Scope
Contains 24 chapters and over 600 questions in Discrete Mathematics and Algorithms. The chapters currently included are listed below. Discrete Mathematics: Propositional Logic · Predicate Logic and Quantifiers · Inference Rules and Proof Methods · Sets ·
Set Operations and Identities · Functions · Function Composition and Inverse Functions · Sequences and Recurrence Relations ·
Sum-Product Notation · Fundamentals of Number Theory · Congruences and Modular Arithmetic · Relations · Fundamentals of Graphs and Representation · Trees · Boolean Algebra and Logic Circuits
Algorithms: Asymptotic Notation · Fundamentals of Algorithm Analysis · Recurrence Relations and Master Theorems ·
Divide and Conquer · Comparison-based Sorting · Binary Search · Trees and Binary Search Trees ·
Breadth-First Search and Depth-First Search · NP and Reduction
Chapters will continue to be added. All problems and solutions are created in-house, and answers and complexity notations are verified based on the definitions in standard textbooks.
■ No Account Required
There is no registration required. We do not ask for your email or phone number. Learning records are stored only on your device and are not transmitted to a server. Since the problems and solutions are included in the app, you can solve them even in places with unstable connections.
■ Recommended for:
- University students currently taking Discrete Mathematics or Algorithms courses
- Those who have reviewed the concepts but get stuck when encountering problems
- Those who want to review briefly multiple times before an exam
Inquiries: algorithmaddict.erescenta@gmail.com
Read more
There is a difference between knowing something by reading and knowing it by solving problems. Instead of simply skimming concept explanations, the app is designed to help you internalize concepts by directly solving problems for each unit and revisiting the parts you got wrong.
■ How You Study
Select a unit and solve the problems. For multiple-choice questions, four answers are selected from six options and shuffled, so you cannot memorize the location of the answer even if you encounter the same question again. For short-answer questions, you must enter the answer directly as a number without options, so you cannot guess the correct answer.
If you get the answer right, you choose whether to move on to the next question; if you get it wrong, you view the explanation. The explanation places the answer on the first line and follows it with an explanation of why that is the correct answer.
■ What's Included
Trees, graphs, Venn diagrams, and arrays are drawn directly by the app. Since it is drawn to fit the screen rather than pasting image files, the text does not become distorted or blurry.
- Level Mode: Climb the thematic ladder one rung at a time. You must answer correctly to unlock the next section, and new problems start again every month.
- Spacingd Review: Retrieves incorrect and correct questions at different intervals.
- Progress: Provides a small number of new problems daily from chapters you haven't solved yet.
- Chapter Focus Mode: Skip correct answers and continue working only on unsolved problems.
- Mock Exam: Select a range and number of questions to solve all at once, and grade at the end.
- Random 10 Questions: Shuffles and prioritizes unsolved problems within the chapter.
- Learning Grass: View at a glance which days you studied over the past 12 weeks.
- Supports both Light and Dark modes.
■ Current Scope
Contains 24 chapters and over 600 questions in Discrete Mathematics and Algorithms. The chapters currently included are listed below. Discrete Mathematics: Propositional Logic · Predicate Logic and Quantifiers · Inference Rules and Proof Methods · Sets ·
Set Operations and Identities · Functions · Function Composition and Inverse Functions · Sequences and Recurrence Relations ·
Sum-Product Notation · Fundamentals of Number Theory · Congruences and Modular Arithmetic · Relations · Fundamentals of Graphs and Representation · Trees · Boolean Algebra and Logic Circuits
Algorithms: Asymptotic Notation · Fundamentals of Algorithm Analysis · Recurrence Relations and Master Theorems ·
Divide and Conquer · Comparison-based Sorting · Binary Search · Trees and Binary Search Trees ·
Breadth-First Search and Depth-First Search · NP and Reduction
Chapters will continue to be added. All problems and solutions are created in-house, and answers and complexity notations are verified based on the definitions in standard textbooks.
■ No Account Required
There is no registration required. We do not ask for your email or phone number. Learning records are stored only on your device and are not transmitted to a server. Since the problems and solutions are included in the app, you can solve them even in places with unstable connections.
■ Recommended for:
- University students currently taking Discrete Mathematics or Algorithms courses
- Those who have reviewed the concepts but get stuck when encountering problems
- Those who want to review briefly multiple times before an exam
Inquiries: algorithmaddict.erescenta@gmail.com
speed test ookla 
ထိုင်း မြန်မာဘာသာပြန် 
helakuru 
island 
kleinanzeigen 
umax 
papadustream 
shopee 
okwin 
poppo live 
kuaishou 
mlwbd 
shopee malaysia 
space 
cloaked 
google play services 
zedge 
word 
hyper 
facetune 
