Network Flows — DU Skill Enhancement Courses Previous Year Question Papers

NETWORK FLOWS CREDIT DISTRIBUTION, ELIGIBILITY AND PRE-REQUISITES OF THE COURSE Course title Credits Credit distribution of the course Eligibility & Code criteria requisite Lecture Tutorial Practical/ of the course 2 0 0 2 Class XII NIL Practical Exercises: Use Excel spreadsheet to solve transportation, and assignment problems, shortest-path problem, maximum flow problem, minimum cost flow problem, and CPM calculations of following type of exercises from the chapters 9 and 10 of [1]. 9.1-1, 9.3-1, Case 9.1 (Shipping Wood to Market), and Case 9.3 (Project Pickings). 10.3-2, 10.3-6, 10.5-3, 10.6-5, 10.8-1, Case 10.1 (Money in motion), and Case 10.3 (Steps to success). Teaching Plan (SEC Paper: Network Flows) Weeks 1 to 5: Network representation of the transportation and assignment problems, Formulate transportation and assignment problems, and solve using Excel. [1]: Chapter 9 (Sections 9.1, and 9.3). Weeks 6, and 7: Terminology of networks, Formulate and use Excel to solve Shortest-path problem. [1]: Chapter 10 (Sections 10.2, and 10.3). Week 8: The minimum spanning tree problem. [1]: Chapter 10 (Section 10.4). Weeks 9, and 10: Formulate maximum flow, and minimum cost flow problems and solve using Excel. [1]: Chapter 10 [Sections 10.5, and 10.6 (including special cases fit into the network format of the minimum cost flow problems, pages 388-390)]. Week 11: Critical path method (CPM) of time-cost trade-offs using Excel spreadsheet. [1]: Chapter 10 (Section 10.8). Week 12: Shipping wood to market. [1]: Chapter 9 (Case 9.1). Week 13: Project pickings. [1]: Chapter 9 (Case 9.3). Week 14: Money in motion. [1]: Chapter 10 (Case 10.1). Week 15: Steps to success. [1]: Chapter 10 (Case 10.3).