Data Structures and Algorithms

What are the main data types in programming?

• Characters

• Integers, Floats, Strings, Booleans, Arrays, Objects

• Dictionaries

• Functions

Explain the purpose of an if-else statement.

• To store data in an array.

• To create loops in code execution.

• The purpose of an if-else statement is to control the flow of execution based on conditional logic.

• To define a variable in programming.

What is the difference between a function and a procedure?

• A procedure always returns a value; a function does not.

• A function returns a value; a procedure does not.

• A function can only take one argument; a procedure can take multiple.

• A function is used for input validation; a procedure is used for data storage.

How do you declare an array in most programming languages?

• Use square brackets to declare an array, e.g., `arrayName = []`.

• Declare an array using parentheses, e.g., `arrayName = ()`.

• Use curly braces to declare an array, e.g., `arrayName = {}`.

• Use angle brackets to declare an array, e.g., `arrayName = <>`.

What is the significance of indexing in lists?

• Indexing prevents any changes to the elements in lists.

• Indexing slows down the retrieval of elements in lists.

• Indexing enables efficient access and manipulation of elements in lists.

• Indexing is only useful for sorting lists.

Name

1. Application of data structure queue is:

• Level wise printing of tree
• Implementation of priority queues
• Function call implementation
• Depth first search in a graph

2. A full binary tree with n leaves contains

• n nodes
• log2 n nodes
• 2n –1 nodes
• 2n nodes

3. What item is at the root after the following sequence of insertions into a Max Heap: 1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?

• 11
• 2
• 4
• 8

4. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

• Binary search tree
• AVL tree
• Threaded binary tree
• Complete tree