DISCRETE STRUCTURE AND GRAPH THEORY Course Code CS

  • Slides: 5
Download presentation
DISCRETE STRUCTURE AND GRAPH THEORY Course Code : CS 211 SECOND YEAR B. TECH

DISCRETE STRUCTURE AND GRAPH THEORY Course Code : CS 211 SECOND YEAR B. TECH COURSE INSTRUCTOR: DR. SUNITA S. BARVE Department of Computer Engineering

DISCRETE STRUCTURE AND GRAPH THEORY COURSE OBJECTIVES Course Outcome: 1. Develop the notion of

DISCRETE STRUCTURE AND GRAPH THEORY COURSE OBJECTIVES Course Outcome: 1. Develop the notion of mathematical thinking, mathematical proofs and reasoning, and be able to apply them in problem solving. (Applying) 2. Make use of function and relation to analyze data models and to apply the associated operations and terminology in context. (Analyzing) 3. Demonstrate the use of algebraic structure, logical possibilities for algorithmic design and analyze performance for some basic algorithmic examples. (Analyzing) 4. Illustrate the basic properties of graphs and related discrete structures, and be able to apply these to practical examples. (Applying) DR. SUNITA S. BARVE Create Evaluate Analyze Apply Understand Remember 2

Department of Computer Engineering COURSE OUTLINE Unit I Sets and Propositions: Combination of sets,

Department of Computer Engineering COURSE OUTLINE Unit I Sets and Propositions: Combination of sets, Principle of inclusion and exclusion, Propositions, Logical Connectivity, Prepositional calculus, Universal and Existential Quantifiers, Mathematical Induction. Unit II Relations and Functions: Properties of Binary Relations, Closure of relations, Wars hall's algorithm, Functions, Composition of functions, Invertible functions, Discrete numeric functions Unit III Counting Methods: Rule of sum and product, Permutations, Combinations, Algorithms for generation of Permutations and Combinations, Unit IV Groups and Rings: Algebraic Systems, Groups, Semi Groups, Monoids, Subgroups, Permutation Groups, Codes and Group codes Unit V Graph Theory: Basic terminology, representation of a graph in computer memory, multi-graphs and weighted graphs, Subgraphs Unit VI Trees: Basic terminology and characterization of trees, Prefix codes and optimal prefix codes, binary search trees, Tree traversal, Spanning trees DR. SUNITA S. BARVE 3

Department of Computer Engineering ASSESSMENT STRATEGY Examination Syllabus Type of Examination Marks In Course

Department of Computer Engineering ASSESSMENT STRATEGY Examination Syllabus Type of Examination Marks In Course Examination Unit 1 , 2 & 3 Theory/Online/Presentati on 40 End Course Examination Unit 1 to 6 Weightage for each Unit unit 1 -10 marks unit 2 -10 marks unit 3 -20 marks unit 4 -20 marks unit 5 -20 marks unit 6 -20 marks Theory 100 to be converted to 50 Practical Examination All Practical Assignments. Practical 25 Project Presentation Project developed Internal Assessment Unit 1 to 6 All Assignments Demo & presentation of project Assignments , Activities, Continuous Assessment DR. SUNITA S. BARVE 25 20 4

Department of Computer Engineering DESIGN CONSIDERATION § Contrast colors for background and foreground §

Department of Computer Engineering DESIGN CONSIDERATION § Contrast colors for background and foreground § Only Two types of fonts with readable font size § Mnemonic Graphics to communicate an idea with visual form § Tabular Representation § No more than 6 points per slide DR. SUNITA S. BARVE 5