Data Structures Quiz 1

Data Structure Fundamentals

• Data: Elementary individual units or collections of values.
• Record: A compilation of various data items.
• Attribute: Specific property or characteristic of an entity.
• Field: An individual elementary unit of information pertaining to an attribute.
• Data Structure: A structured array of interrelated variables forming a system's fundamental component.

True/False Statements

• Data structures provide a structural representation of logical relationships between data elements (not unstructured).
• Efficiency of data structures is crucial for successful processes in real-time applications.
• Software development is influenced by market changes and emerging technologies.
• Software can be developed in a reusable and adaptable manner, allowing for reuse in future applications.

Data Structures Overview

• Primitive Data Structures: Composed of built-in numerical and character types.
• Non-Primitive Data Structures: Cannot be manipulated directly by machine-level instructions.
• Linear Data Structure: Arranged linearly, though not always sequentially in memory.
• Non-Linear Data Structure: Hierarchical arrangements of individual data items.

Array Characteristics

• An array is a linear data structure for storing elements of the same type.
• Incorrect statement about initializing array values: braces {} are used, not brackets [].
• Arrays can be classified into one-dimensional, two-dimensional, or multidimensional types.
• Insertion and deletion in arrays may present challenges due to element shifting.

Linked Lists and Other Structures

• Linked lists do not require data elements to be stored in consecutive memory locations.
• They are characterized by slower search operations and greater memory usage.
• Doubly Linked List: Utilized for forward and backward navigation in applications like browsers.
• Stack: A linear structure where insertions and deletions occur at one end.
• Queue: Elements added at the rear and removed from the front.

File and Data Organization

• File: A collection of records relating to entities within a set.
• Elementary Items: Indivisible data units.
• Data Item: Represents a single unit of values.
• Two-Dimensional Array: Collection of similar data elements accessed via two subscripts.
• One-Dimensional Array: List of data elements referenced by consecutive numbers.

Hierarchical Data Structures

• Entity: Object with specific attributes or properties that can be valued.
• Trees: Data structures that display hierarchical relationships among elements.

Data Structure Operations

• Traversing: Method utilized when sending invitations, indicating movement through elements.
• Sorting: Used for ordering top scorers in examinations.
• Merging: Combining two dissolved sections.
• Searching: Finding a student who has stopped attending classes.
• Deleting: Process to transfer students to other sections.

Matching Data Structures

• Last in First Out (LIFO): Characteristic of a stack.
• Top-only Access: A stack only has one end known as the "top."
• Hierarchical Structure: Represented by trees.
• Matrices: Associated with two-dimensional arrays.
• Pointer: References elements on the same list.