3.1.2 Design of the solution

• What are project requirements in computer science?

  Detailed specifications of program
• Understanding project requirements helps design a solution that meets user needs efficiently.


  True
• What are the advantages of decomposing a complex problem into modules?

  Modular and scalable solution
• Match the data structure with its key characteristic:

  Arrays ↔️ Fixed size

  Lists ↔️ Flexible insertion/deletion

  Dictionaries ↔️ Efficient lookup by key
• Binary search is a common example of a searching algorithm.
• What is the definition of functional requirements?

  What the program must do
• What is an example of improved understanding as a benefit of modular decomposition?

  Analyzing user authentication separately
• What is the primary benefit of maintainability in modular design?

  Patching a single module without affecting others
• What does independent development and testing in decomposition allow?

  Develop and test each module separately
• What are data structures used for in a computer program?

  Organizing and storing data
• What do non-functional requirements focus on in program design?

  How the program performs
• Each module in decomposition can be developed and tested independently.


  True
• What is a key characteristic of arrays as a data structure?

  Fixed size
• What is the primary purpose of sorting algorithms?

  Arrange data in order
• Steps in the process of decomposition:

  1️⃣ Break down the complex problem

  2️⃣ Focus on individual components

  3️⃣ Develop and test each module

  4️⃣ Reuse modules in the program

  5️⃣ Maintain and update as needed
• Why is decomposition beneficial for software development?

  Creates modular and scalable solutions
• Reusing a date validation function is an example of reusability in modular design.


  True
• Improved understanding is a key benefit of decomposition.


  True
• Why is maintainability important in modular design?

  Easier to update and fix individual modules
• What are arrays characterized by in terms of data access?

  Fixed size, sequential access
• Arrays have a fixed size and allow sequential access.


  True
• What are algorithms used for in computer programs?

  Solving problems step-by-step
• Dynamic programming is an example of an optimization algorithm.
• Consistency in UI design maintains a unified look, feel, and behavior
• Functional requirements describe what the program must do.
• Decomposition allows developers to understand the problem better by focusing on individual components.
• Data structures are designed to support a program's functional and non-functional requirements.
• Choosing the right data structures is essential for scalability and maintainability of a program.


  True
• Time complexity is a key factor to consider when choosing an algorithm.


  True
• What is the primary focus of non-functional requirements?

  Performance, security, usability
• Independent development of modules allows parallel development of the UI and backend
• Decomposition involves breaking down a complex problem into smaller, manageable modules
• Reusing a date validation function is an example of reusability
• Data structures support a program's functional and non-functional requirements
• What is a key characteristic of trees in data structures?

  Efficient searching and sorting
• Choosing the right data structures is essential for performance, scalability, and maintainability
• What is the purpose of searching algorithms?

  Find specific data
• What does simplicity in UI design ensure?

  Keep the interface clean and uncluttered
• What does accessibility in UI design consider?

  Users with diverse abilities and needs
• Prototyping and iterative design are essential for creating a user-friendly UI.

  True