2078
Bsc CSIT / Semester 3 / Science
Computer Science and Information Technology
Data Structure and Algorithms
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 3 Hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.
Attempt any TWO question.
Define Queue. Write are different applications of queue? Explain queue operations with example.
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.
Attempt any EIGHT question.
How do you find complexity of algorithms? Explain
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
What is priority queue? Why do you need this type of queue?
Write a recursive program to find nth fibonacci number.
Explain array implementation of list.
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.
Write a program to implement sequential search algorithm.
What is graph traversal? Explain.
Write short notes on: a. Divide and Conquer sorting b. AVL Tree
*** END OF QUESTION PAPER ***
1. Definition of Queue A Queue is a linear data structure that follows the FIFO (First In, First Out) principle. - The element inserted first is removed first. - Insertion is done at the rear (end
1. Circular Linked List (CLL) Definition A Circular Linked List is a linked list in which the last node points back to the first node instead of pointing to NULL. - It can be singly or doubly linke
1. Definition of Binary Search Tree (BST) A Binary Search Tree (BST) is a binary tree in which each node satisfies the following properties: - The left subtree of a node contains only nodes with val
1. Definition of Complexity Algorithm complexity is a measure of the efficiency of an algorithm. It helps us understand: - Time Complexity: How much time an algorithm takes relative to input size n.
Step 1: Replace variables with values ABCD-x+ → 5 4 3 7 - x + (Assuming x means multiplication in this context; if it's subtraction, replace accordingly.) Here, let's consider x as multiplication .
And more questions available on this page.