Understanding ADA Concepts

What are the main data structures used in ADA?

• Arrays, Records, Access Types

• Strings, Tuples, Sets

• Graphs, Hash Tables, Linked Lists

• Stacks, Queues, Trees

Explain the difference between a stack and a queue in ADA.

• A stack allows random access, while a queue does not.

• A stack uses LIFO, while a queue uses FIFO.

• Both stack and queue use LIFO for data management.

• A stack uses FIFO, while a queue uses LIFO.

What control structures are available in ADA?

• Multithreading constructs

• Function overloading

• Sequential statements, conditional statements (if-then-else, case), loop statements (for, while), exception handling.

• Goto statements

Describe the purpose of the 'if' statement in ADA.

• The 'if' statement in ADA is used for conditional execution of code.

• The 'if' statement in ADA is used to import libraries.

• The 'if' statement in ADA is for declaring variables.

• The 'if' statement in ADA is used to define loops.

List and explain three different sorting algorithms.

• Heap Sort

• Insertion Sort

• 1. Bubble Sort 2. Quick Sort 3. Merge Sort

• Selection Sort

How does the quicksort algorithm work?

• Quicksort sorts an array by merging elements in pairs.

• Quicksort sorts an array by selecting a pivot, partitioning elements, and recursively sorting sub-arrays.

• Quicksort requires the array to be sorted in reverse order before execution.

• Quicksort uses a single loop to sort all elements at once.

What is the time complexity of bubble sort?

• O(n^2)

• O(n)

• O(log n)

• O(n log n)

Define hashing and its purpose in data structures.

• Hashing is a method for encrypting sensitive data.

• Hashing is used to compress data for storage efficiency.

• Hashing is a technique for sorting data in ascending order.

• Hashing is a technique that converts data into a fixed-size value for efficient data retrieval and integrity verification.

What are the common hashing techniques used in ADA?

• Double Hashing

• Chaining Method

• Linear Probing

• Division Method, Multiplication Method, Universal Hashing

Explain the difference between binary trees and binary search trees.

• Binary trees have no specific ordering, while binary search trees have a defined order based on node values.

• Binary trees are used for sorting data, while binary search trees are not suitable for sorting.

• Binary trees can only have two children, while binary search trees can have multiple children.

• Binary trees are always balanced, whereas binary search trees can be unbalanced.