Scribd
Upload
126 views1 page

Exam DSA

The document outlines a midterm exam for a Data Structure and Algorithm course, consisting of three tests: enumerations, fill in the blanks, and an essay. It includes questions on basic operations of arrays, types of data structures, and the importance of complex analysis. The fill-in-the-blank section covers definitions related to data structures, graphs, and trees.

Uploaded by

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

Exam DSA

The document outlines a midterm exam for a Data Structure and Algorithm course, consisting of three tests: enumerations, fill in the blanks, and an essay. It includes questions on basic operations of arrays, types of data structures, and the importance of complex analysis. The fill-in-the-blank section covers definitions related to data structures, graphs, and trees.

Uploaded by

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

Data Structure and Algorithm Test II: Enumerations: Enumerate the following.

Midterm Exam
1. 5 basic operations of array
Name:____________________________ Date:_________ 2. Types of data structure
Year/Course:_________________ Score:________ 3. Importance of data structure and algorithm
4. Importance of complex analysis
5. Linear data structure
Test I: Fill in the blank: Choose the correct answer in the box provided and
write it on the blank.
Test III: Essay: Discuss the following.
Trees Graphs Binary Trees
Data Structure 1. Data structure
Insert Operation 2. Array
Diagram
Update Algorithms 3. The basic operation of array
Undirected Graphs
Heaps
Elements Array

____________1. Are ways of organizing and storing data in a computer.


____________2. A set of nodes connected by edges. GOOG LUCK 😊
____________3. Collection of elements identified by index or key.
____________4. Each node has at most two children.
____________5. Each item stored in an array.
____________6. Update an element at given index.
____________7. Is to insert one or more data elements into an array
____________8. A hierarchical structure with a root node and child nodes
____________9. A special tree-based structure used for implementing
priority queues.
_____________10. Edges do not have a direction.

You might also like