Data Structures & Applications - Question Bank IA-1

Organized ways to store and manage data in a computer efficiently.

Categories like linear (arrays, linked lists) and non-linear (trees, graphs) based on how data is structured and accessed.

User-defined data types for grouping related data items.

Dynamically allocates memory during program execution.

Dynamically allocates memory and sets it to zero.

Linear data structure that follows the Last-In, First-Out (LIFO) principle.

A way to write arithmetic expressions where operators are placed between operands.

A way to write arithmetic expressions where operators are placed after operands.

A way to write arithmetic expressions where operators are placed before operands.

A method to calculate the result of a postfix expression using a stack.

Steps to compute a postfix expression outcome.

Table used to track step by step calculations.

Organised ways to store and manage data in a computer, making it efficient to access and process information. They're like containers with specific rules for how data is arranged.

Linear data structures arrange data in a single sequence, like a line, while non-linear structures allow data to branch out in multiple directions, like a tree.

Custom data types in C programming that let you group related data items under one name, making code more organised and readable.

Both are memory allocation functions in C. malloc() allocates memory, calloc() allocates and zeroes it out.

The ability to allocate memory for variables during program execution, rather than fixing the memory size beforehand.

A linear data structure where the last element added is the first to be removed, like a stack of plates.

Common stack operations include push (add an item), pop (remove an item), peek (view the top item), and isEmpty (check if the stack is empty).

Implementing a stack using dynamic arrays allows the stack to grow or shrink in size as needed during program execution.

Transforming an arithmetic expression from infix notation (operators between operands) to postfix notation (operators after operands).

Transforming an arithmetic expression from postfix notation (operators after operands) to infix notation (operators between operands).

Transforming an arithmetic expression from infix notation (operators between operands) to prefix notation (operators before operands).

Transforming an arithmetic expression from prefix notation (operators before operands) to infix notation (operators between operands).

A table used to track the intermediate steps and the contents of the stack during the evaluation of an expression, especially useful for debugging.

To find the numerical result of an arithmetic expression written in postfix notation by performing the operations in the correct order.

A set of steps to systematically calculate the result of a postfix expression using a stack.

Postfix notation avoids the need for parenthesis and simplifies the evaluation process with the use of a stack.

Infix has operators between operands, while postfix has them after operands.