Scribd
Upload
25 views2 pages

Data Structures Midterm Exam Questions

This document outlines the midterm examination for the Electrical and Computer Engineering Department at Garmian Polytechnic University, focusing on data structures and algorithms. It includes multiple-choice questions and true/false statements assessing students' understanding of key concepts. The exam is scheduled for October 29, 2025, and is worth a total of 10 marks.

Uploaded by

kg2241261
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views2 pages

Data Structures Midterm Exam Questions

This document outlines the midterm examination for the Electrical and Computer Engineering Department at Garmian Polytechnic University, focusing on data structures and algorithms. It includes multiple-choice questions and true/false statements assessing students' understanding of key concepts. The exam is scheduled for October 29, 2025, and is worth a total of 10 marks.

Uploaded by

kg2241261
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Kurdistan Regional Government – Iraq Subject: data structure

Ministry of Education &Scientific Research Class: 3rd Semester


Garmian Polytechnic University Time: 1 hour
Kalar Technical College Date: 29 / 10 / 2025
Electrical and Computer Engineering Department

Midterm Examination 2025-2026

(10 Marks)

Q1// Choose the correct answer. (( 2.5


3 Marks)
Marks )
1. An algorithm must have which of the following properties?
A. Only input and output B. Must be infinite
C. Well-defined steps and finiteness D. Only effectiveness
2. Which of the following best defines a data structure?
A. A way to write algorithms in code
B. A way to organize and store data efficiently
C. A method to analyze algorithm performance
D. A computer memory device
3. In pseudo-code, which structure is used for repeating actions a fixed number of times?
A. If-Then B. For-Loop C. While-Loop D. Switch
4. The best-case time complexity of Bubble Sort is:
A. O(n²) B. O(n) C. O(log n) D. O(1)
5. Which sorting algorithm performs the fewest swaps?
A. Bubble Sort B. Selection Sort C. Insertion Sort D. Merge Sort
6. In Insertion Sort, before inserting an element, other elements are:
A. Ignored B. Sorted randomly C. Shifted one place to the right D. Deleted
7. Which Big-O notation represents the slowest-growing function?
A. O(1) B. O(n) C. O(n²) D. O(log n)
8. What does it mean if an algorithm has O(1) time complexity?
A. It takes linear time. B. Its time depends on input size.
C. It takes constant time. D. It is not efficient.
9. Which of the following statements about Big-O notation is correct?
A. It measures only memory usage of an algorithm.
B. It describes the growth rate of an algorithm as input size increases.
C. It depends on the programming language used.
D. It is only used for sorting algorithms.
10. A good algorithm should be:
A. Complicated and long B. Efficient in time and space
C. Hard to implement D. Independent of inputs
Q2// Indicate whether the following statement is true or false. ( 2.5 Marks )

1. An algorithm must always produce at least one output. true


2. A program and an algorithm are the same thing. false
3. Arrays and linked lists are linear data structures. true
4. A hash table is a non-linear data structure. true
5. Bubble Sort and Selection Sort both have O(n²) time complexity in the worst case. false
6. Insertion Sort is not stable. false
7. Big-O notation describes how fast an algorithm runs as input size grows. true
8. O(n²) grows slower than O(n). false
9. Pseudo-code focuses on syntax more than logic. false
10. A data structure affects how efficiently algorithms run. true

You might also like