Data Structures and Algorithms in C s Exam Questions with Answers

Data Structures and Algorithms in C s Exam Questions with Answers Data Structure - Correct Answers: Organizes and stores data for efficient use. Linear Data Structure - Correct Answers: Elements accessed sequentially; examples include arrays. Non-linear Data Structure - Correct Answers: Elements accessed in non-linear order; includes trees. Algorithm - Correct Answers: Step-by-step procedure for solving a problem. Characteristics of Algorithm - Correct Answers: Includes clarity, well-defined inputs, and outputs. Array - Correct Answers: Finite ordered collection of homogeneous data. Element - Correct Answers: Individual item stored in an array. Index - Correct Answers: Numerical identifier for an element's location. Advantages of Array - Correct Answers: Represents multiple items using a single name. Disadvantages of Array - Correct Answers: Fixed size; memory allocation cannot change. Basic Operations on Array - Correct Answers: Includes insertion, deletion, searching, and updating. Insertion Operation - Correct Answers: Adds an element at a specified index. Deletion Operation - Correct Answers: Removes an element at a specified index. Searching in Array - Correct Answers: Finding the position of a value in an array. Sequential Search - Correct Answers: Searches elements one by one in order. Binary Search - Correct Answers: Efficient search method for sorted arrays. Two Dimensional Array - Correct Answers: Array with rows and columns for data representation. Tree Traversal - Correct Answers: Visiting all nodes in a tree structure. Binary Search Tree - Correct Answers: Tree structure where left nodes are smaller. Memory Optimization - Correct Answers: Efficient use of memory through data structures. Reusability - Correct Answers: Ability to use implemented data structures elsewhere. Sorting Techniques - Correct Answers: Methods like Bubble sort and Insertion sort. CPU Scheduling - Correct Answers: Managing processes for efficient CPU usage. Graph - Correct Answers: Non-linear data structure representing relationships. Linked List - Correct Answers: Linear data structure with nodes linked together. Stack - Correct Answers: Linear structure following Last In First Out principle. Queue - Correct Answers: Linear structure following First In First Out principle. Effectiveness of Algorithm - Correct Answers: Measured by execution time and memory space. Well-Defined Outputs - Correct Answers: Clearly specifies expected results from an algorithm. Linear Search - Correct Answers: Another name for sequential search algorithm. Sorted Array - Correct Answers: Array arranged in ascending or descending order. Middle Element - Correct Answers: Element compared during binary search process. Array Declaration - Correct Answers: Defining an array with specified dimensions. Nested Loops - Correct Answers: Loops within loops for multi-dimensional arrays. LIFO - Correct Answers: Last In First Out data structure principle. Push Operation - Correct Answers: Inserts an element onto the top of stack. Pop Operation - Correct Answers: Removes the top element from the stack. Stack Overflow - Correct Answers: Occurs when trying to push onto a full stack. Stack Underflow - Correct Answers: Occurs when trying to pop from an empty stack. Basic Operations - Correct Answers: Primary functions: push and pop on stack. Infix Expression - Correct Answers: Standard arithmetic expression format (e.g., A + B). Prefix Expression - Correct Answers: Operator precedes operands (e.g., + A B). Postfix Expression - Correct Answers: Operands precede operator (e.g., A B +). Polish Notation - Correct Answers: Another term for prefix notation. Reverse Polish Notation - Correct Answers: Another term for postfix notation. Conversion Algorithm - Correct Answers: Steps to convert infix to postfix using stack. Operand - Correct Answers: Basic data element in expressions (e.g., A, B). Operator - Correct Answers: Symbol that represents an operation (e.g., +, -). Precedence - Correct Answers: Priority of operators in expressions. Associativity - Correct Answers: Determines order of operations for equal precedence. Parenthesis - Correct Answers: Used to group expressions in arithmetic. Display Function - Correct Answers: Outputs elements of the stack. Input Function - Correct Answers: Accepts user input for array elements. Counter Variables - Correct Answers: Variables used to iterate through loops. Array Elements - Correct Answers: Individual items stored in an array. Parenthesis Handling - Correct Answers: Operators popped until the last left parenthesis. Enqueue - Correct Answers: Operation to add an element to the queue. Dequeue - Correct Answers: Operation to remove an element from the queue. FIFO - Correct Answers: First In First Out; order of queue operations. Simple Queue - Correct Answers: Basic queue with standard enqueue and dequeue. Circular Queue - Correct Answers: Queue where the last node connects to the first. Priority Queue - Correct Answers: Queue where elements are removed by priority. Double Ended Queue - Correct Answers: Queue allowing insertion and deletion at both ends. Input Restricted Deque - Correct Answers: Insertion at one end, deletion at both ends. Output Restricted Deque - Correct Answers: Deletion at one end, insertion at both ends. Postfix Evaluation Algorithm - Correct Answers: Process to compute value from postfix expression. Stack Operations - Correct Answers: Push and pop actions on stack data structure. Queue Overflow - Correct Answers: Condition when queue exceeds its maximum capacity. Queue Underflow - Correct Answers: Condition when trying to dequeue from an empty queue. Array Representation of Queue - Correct Answers: Queue implemented using a linear array structure. Front Pointer - Correct Answers: Indicates the position of the first element. Rear Pointer - Correct Answers: Indicates the position of the last element. Postfix Conversion Example 1 - Correct Answers: 3*3/(4-1)+6*2 converts to 33*41-/62*+. Postfix Conversion Example 2 - Correct Answers: 5 * (6 + 2) - (12/4) converts to 562+124/-*. Postfix Evaluation Example - Correct Answers: Evaluating (5+3) * (8-2) results in 48. Queue Applications - Correct Answers: Used for waiting lists, data transfer, and buffers. Queue Functions - Correct Answers: Includes insert(), delete(), and display(). Queue Initialization - Correct Answers: Front and rear start at -1 for empty queue. Queue Display - Correct Answers: Shows all elements from front to rear. Postfix Notation - Correct Answers: Eliminates the need for parentheses in expressions. Algorithm for Postfix Evaluation - Correct Answers: Scan, push operands, pop for operators. Output Restricted Double Ended Queue - Correct Answers: Deletion at one end, insertion at both ends. Pointers in C - Correct Answers: Variables that store memory addresses instead of values. Address Operator (&) - Correct Answers: Used to retrieve the memory address of a variable. Value at Address Operator (*) - Correct Answers: Used to access the value stored at a pointer's address. Pointer Declaration - Correct Answers: Syntax for declaring a pointer variable in C. Assigning Addresses - Correct Answers: Setting a pointer to point to a variable's address. Changing Pointer Value - Correct Answers: Modifying the value at the address a pointer points to. Singly Linked List - Correct Answers: Each node points to the next, no backward links. Doubly Linked List - Correct Answers: Each node links to both previous and next nodes. Circular Linked List - Correct Answers: Last node points back to the first node. Doubly Circular Linked List - Correct Answers: Combines features of doubly and circular linked lists. Dynamic Data Structure - Correct Answers: Structure that allocates memory as needed. Node in Linked List - Correct Answers: Contains data and address of the next node. Memory Wastage in Linked List - Correct Answers: Extra memory used for storing pointers. Sequential Access - Correct Answers: Accessing nodes one after another in order. Insert Operation in Linked List - Correct Answers: Adding a new node at any position. Delete Operation in Linked List - Correct Answers: Removing a node from the list. First Node Predecessor - Correct Answers: First node has no predecessor in linked list. Last Node Successor - Correct Answers: Last node points to NULL as successor. Traversal in Doubly Linked List - Correct Answers: Can move in both forward and backward directions. Linked List Chain Visualization - Correct Answers: Nodes connected via pointers forming a chain. Pointer Content Access - Correct Answers: Using * operator to get value at pointer's address. Invalid Pointer Assignment - Correct Answers: Assigning values instead of addresses causes errors. Insert Function in Queue - Correct Answers: Function to add an element to the queue. Delete Function in Queue - Correct Answers: Function to remove an element from the queue. Display Function in Queue - Correct Answers: Function to show all elements in the queue. Queue Array Implementation - Correct Answers: Using an array to implement queue operations. Advantages of Doubly Linked List - Correct Answers: Traversable in both directions; easier node deletion. Disadvantages of Doubly Linked List - Correct Answers: Requires extra space for previous pointers. Applications of Circular Linked List - Correct Answers: Used for managing multiple running applications. Circular Doubly Linked List - Correct Answers: Contains pointers to both next and previous nodes. Binary Tree Traversal - Correct Answers: Visiting every node in a binary tree. Preorder Traversal - Correct Answers: Visit root, traverse left, traverse right. Inorder Traversal - Correct Answers: Traverse left, visit root, traverse right. Postorder Traversal - Correct Answers: Traverse left, traverse right, visit root. Example of Preorder Traversal - Correct Answers: Sequence: 1, 3, 5, 4, 6, 7, 8, 9, 10, 11, 12. Example of Inorder Traversal - Correct Answers: Sequence: 4, 5, 6, 3, 1, 8, 7, 9, 11, 10, 12. Example of Postorder Traversal - Correct Answers: Sequence: 11, 12, 4, 6, 5, 3, 8, 9, 7, 1. Binary Search Tree (BST) - Correct Answers: Tree structure where left < node < right. Insertion in BST - Correct Answers: Insert new node based on value comparison. Deletion in BST - Correct Answers: Removing nodes with three case scenarios. Case 1: Deleting Leaf Node - Correct Answers: Find and delete node with no children. Case 2: Deleting Node with One Child - Correct Answers: Link parent to child, then delete node. Case 3: Deleting Node with Two Children - Correct Answers: Swap with largest left or smallest right. Traversal Strategy - Correct Answers: Order of visiting nodes distinguishes techniques. Traversal Processing - Correct Answers: Processing at node is not specified. Leaf Node - Correct Answers: Node with no children in a tree. Complexity of Deletion - Correct Answers: Deletion in BST has O(log n) complexity. Fixed Time Slot - Correct Answers: Operating system allocates time for applications. Node Pointer - Correct Answers: Reference to next or previous node. Traversal Example - Correct Answers: Visiting nodes in specific order. New Node Creation - Correct Answers: Creating a node with value and NULL links. Binary Search Tree Construction - Correct Answers: Insert sequence: 10, 12, 5, 4, 20, 8, 7, 15, 13.