IT-303 · Data Structure/Unsolved PYQ Paper
IT-303 Data Structure - Jun 2023 Question Paper
-
Unit 17 MarksaDefine data structure. Discuss different types of data structure and their implementations.
-
Unit 17 MarksbGive the Big-O notation definition and briefly discuss with suitable examples.
-
Unit 17 MarksaExplain different operations that are performed on data structures.
-
Unit 27 MarksbWhat is an array? Discuss different types of array with examples.
-
Unit 27 MarksaWhat is searching? Explain about fibonacci search technique.
-
Unit 27 MarksbDifferentiate between iterative merge sort and recursive merge sort.
-
Unit 37 MarksaWrite an algorithm for basic operations of stack.
-
Unit 37 MarksbExplain the procedure to evaluate postfix expression. Evaluate the following postfix expression 7 3 4 + - 2 4 5 / + * 6 / 7 + ?
-
Unit 37 MarksaExplain various operations that are performed on queue with suitable algorithms.
-
Unit 47 MarksbList various operations of linked list and explain how to insert a node anywhere in the list.
-
Unit 47 MarksaDescribe how a polynomial is represented using singly linked lists. Write an algorithm to add two polynomials using linked list.
-
Unit 47 MarksbWrite an algorithm to delete an element anywhere from doubly linked list.
-
Unit 57 MarksaExplain breadth first traversal algorithm with an example.
-
Unit 57 MarksbExplain the in-order, pre-order and post-order traversal of a binary tree.
-
Unit 1OR Choice7 MarksaComplexity analysis
-
Unit 2OR Choice7 MarksbBinary search
-
Unit 5OR Choice7 MarkscTypes of trees
-
Unit 3OR Choice7 MarksdApplications of queues
Go to where you left off?
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel