2077
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.
What is stack? What are the different applications of stack? Explain stack operations with example.
Differentiate between singly linked list and doubly linked list. How do you insert and delete a node from doubly linked list? Explain.
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.
Attempt any EIGHT question.
What is dynamic memory allocation? Compare data structure with abstract data type.
Explain algorithm for evaluation of postfix expression using stack
Explain queue as an ADT.
Write a recursive program to find GCD of two numbers.
What is linked list? How is it different from array?
Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.
What is hashing? Explain concept of hash table and hash function with example.
What is minimum spanning tree? Explain
Write short notes on: a. Tail recursion b. Collision resolution techniques
*** END OF QUESTION PAPER ***
1. Definition of Stack A Stack is a linear data structure that follows the principle of LIFO (Last In, First Out). - The element inserted last is removed first. - All insertions and deletions take p
1. Difference between Singly Linked List (SLL) and Doubly Linked List (DLL) | Feature | Singly Linked List (SLL) | Doubly Linked List (DLL) | |---------|-------------------------|---------------------
1. Shortest Path (Definition) The shortest path between two vertices in a graph is the path with the minimum total weight (or distance) among all possible paths connecting them. - Graph types: Wei
Definition Dynamic memory allocation is the process of allocating memory to a program at runtime instead of at compile time. It allows a program to request memory from the heap as needed, making effic
Algorithm to Evaluate Postfix Expression 1. Definition A postfix expression (also called Reverse Polish Notation) is an expression in which the operator comes after the operands. Example: 2354+9- A
And more questions available on this page.