Algorithm Design and Analysis — DU B. Sc. (Hons) Electronics Previous Year Question Papers

This document is prepared from the following University Notifications https://www.du.ac.in/uploads/new-web/15092023_Indis_sem1.pdf https://www.du.ac.in/uploads/new-web/notifications-2021/28032023_nep- DISCIPLINE SPECIFIC ELECTIVES (DSE-2) CREDIT DISTRIBUTION, ELIGIBILITY AND PRE-REQUISITES OF THE COURSE Course Credits Credit distribution of the course Eligibility Pre-requisite title & Lecture Tutorial Practical/ criteria of the course Code Practice (if any) Algorithm 4 3 0 1 Course Basic Design Admission Knowledge of and Eligibility Python Analysis language Learning Objectives The Learning Objectives of this course are as follows: To develop the understanding of usage of basic data structures like stack, queue, linked list, trees To introduce the students to design and analyse algorithms To highlight the differences between various problem-solving techniques for an efficient algorithm design To provide an understanding of algorithm design through a survey of the common algorithm design paradigms of Iterative techniques, Divide and Conquer, Dynamic Programming, Greedy Optimization To develop proficiency in Problem Solving and Programming To provide an understanding of time and space complexities of algorithms designed to solve computational problems To familiarize with various Searching and Sorting techniques Learning outcomes The Learning Outcomes of this course are as follows: Implement data structures like Stacks, Queues. Linked List, trees Use an appropnate algorithm using the algorithm design techniques, namely Iterative, Divide and Conquer, Greedy, Dynamic Programming for a series o computational problems Apply various Searching and Sorting techniques Solve computational problems with an understanding of time and space complexities of algorithms SYLLABUS OF ELDSE-1B Total Hours- Theory: 45 Hours, Practicals: 30 UNIT - I (11 Hours) Data Structures: Stacks, array implementation of stack, operation on stacks, application of stacks-conversion of infix expression to prefix and postfix, evaluation This document is prepared from the following University Notifications https://www.du.ac.in/uploads/new-web/15092023_Indis_sem1.pdf : https://www.du.ac.n/uploads/new-web/notifications-2021/28032023 nep- : https://www.du.ac.in/uploads/new-web/18092023_Inter_4.pdf of expression; Queues, array implementation of queues, operation on queues, Linked List and its implementation of stack and queue. UNIT - II (11 Hours) Trees: Introduction to trees, Binary search tree, preorder, postorder and in order traversal (recursive) Searching Techniques: Linear and Binary Search, Hashing techniques UNIT - III (12 Hours) Algorithm Design Techniques: Iterative techniques-Insertion Sort, Divide and Conquer-Merge Sort, Dynamic Programming-Weighted Interval Scheduling, 0-1 Knapsack Problem UNIT - IV (11 Hours) Greedy Algorithm- Interval Scheduling, Fractional Knapsack problem, Dijkstra's shortest path problem. Comparison between Dynamic programming and Greedy algorithm