✍️ Tests §

• Studienleistung: Flexnow 1.6.2021
• Klausur: Flexnow 15.07.2021

📑 VL01 Programming languages §

• What’s a ☕️ Programming Language?
• 📁 Classification of programming languages
• What’s 👨‍💻 ADP?

📑 VL02 Data structures §

• What does a 💿 Computer Program consist of?
• What is a 🗂 Data structure?
  • → How to classify: [[Data structure#🏷 Classification|🗂 Data structure#🏷 Classification]]

📑 VL03 Algorithms (1/2) §

1. What is an ⚙️ Algorithm?
2. Which ᦛ Levels of complexity can it have?
3. 🗂 Algorithm classifcation

📑 VL04 Algorithms (2/2) §

1. What’s an ⚙️ Algorithm (function)
2. Updated 🗂 Algorithm classifcation
3. 📝 Algorithm description
4. What’s 🤨 Algorithm ambiguity

📑 VL05 Software engineering §

1. What’s 🔨 Software-Engineering?
2. What is 🟦 Object Oriented Programming?
3. What’s an ⚽️ Object (programming)?

📑 VL06 Static §

1. What does the Modifier-Static mean?
2. What does the Modifier-Virtual mean?
3. What is Function overloading?

📑 VL08 §

1. What does the Modifier-Final mean?
2. Why use 🏕 Local Classes

📑 VL09 & 10 §

1. What are 🧮 Complex data structures?
2. What’s the difference between arrays and graphs?
3. What’s a 🌳 Tree (programming)?
4. What’s a 🔗 Link list and a ⛓ Adjacency matrix?
5. How to construct a graph?

📑 VL11 Iteration §

1. 🔛 Iteration algorithms
2. Calculating using iteration → Calculation algorithms
3. Searching/Checking using iteration → Search and Checking algorithms
4. Sorting using iteration → Sorting algorithms
5. Figuring out possible outcomes using iteration → Combination algorithms

📑 VL12 Recursion (1/2) §

1. ♻️ Recursive algorithms
2. Recursive Vs Iterative Algorithms

📑 VL13 Recursion (2/2) §

1. Recursive Algorithms
2. Big-O Notation