Skip to content

Federal (FBISE) · Quarter book test · Free

2nd Year Computer 1st Quarter Book Paper

40 marks · 1 hour · 28 questions. Covers: 1. Computer System, 2. Computational Thinking & Algorithms 2.

Your school name

2nd Year Computer 1st Quarter Book Paper

2nd Year · Computer · Federal (FBISE)

Name: ____________Roll No: ________Class/Section: ________Date: ________Total marks: 40Time: 1 hour

Q1. Multiple choice questions (Attempt all · 12 × 1 = 12)

  1. The factorial function example demonstrates:
    1. Sorting
    2. Searching
    3. Clear vs less clear code
    4. Looping
  2. Error prevention and recovery mechanisms:
    1. Minimize mistakes and guide correction
    2. Increase memory usage
    3. Focus only on encryption
    4. Allow system shutdown
  3. Which of the following best describes a data structure?
    1. A method of arranging data
    2. A way to store and organize data in memory
    3. A physical interface design
    4. A location and easy interaction detection
  4. Confidentiality protects data from:
    1. Hackers and unauthorized access
    2. Viruses only
    3. Server overload
    4. Storage failures
  5. Arrays are efficient because:
    1. They are slow in accessing elements
    2. They need extra data
    3. Memory locations are contiguous
    4. None of these
  6. Which principle prevents unnecessary complexity in design?
    1. Error handling
    2. Robustness
    3. Simplification
    4. Memorability
  7. Each node of a linked list contains:
    1. Data and index
    2. Only data
    3. Only pointer
    4. Data and pointer
  8. What is the disadvantage of encryption?
    1. Increases cost
    2. Makes data easy to copy
    3. Slows down usability and can be time-consuming
    4. Removes user authentication
  9. Arrays are the simplest data structure used in:
    1. Mathematics
    2. Programming
    3. Graphics
    4. Database
  10. Save prompt in MS Word is an example of:
    1. Simplicity
    2. Error prevention
    3. Consistency
    4. Accessibility
  11. Adding an element to a queue is called:
    1. Pop
    2. Push
    3. Enqueue
    4. Dequeue
  12. A system designed with high usability is:
    1. Complicated
    2. Simple and easy to use
    3. Confusing
    4. Technical only

Q2. Short questions (Attempt any 8 of 12 · 8 × 2 = 16)

  1. Define Human-Computer Interaction (HCI).
  2. What are the two parts of a singly linked list node?
  3. List two principles of usability.
  4. What is clarity in an algorithm?
  5. Suggest three features that should be included in a new educational software application to enhance accessibility for users with disabilities.
  6. What are arrays used for?
  7. What does accessibility ensure?
  8. Differentiate between connected and directed graph.
  9. What are the key components of usability in HCI?
  10. What is the time complexity of Euclidean Algorithm?
  11. How does user feedback contribute to effective system design?
  12. Define quadratic time complexity.

Q3. Long questions (Attempt any 3 of 4 · 3 × 4 = 12)

  1. Explain the different types of usability testing methods (Moderated, Unmoderated, Qualitative, Quantitative, Remote, A/B testing) with examples.
  2. Describe the difference between Stack and Queue. How does their operation affect algorithm design? Provide one real-life example for each data structure.
  3. How do security measures like multi-factor authentication (MFA) and encryption impact usability, and how can designers balance these trade-offs?
  4. Compare and evaluate the efficiency of Bubble Sort and Merge Sort in sorting a list of 1,000 student names. Discuss in terms of time complexity and clarity. Which is more suitable and why?