Notation Index 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coef
|
|
- Phebe Thomas
- 5 years ago
- Views:
Transcription
1 Notation 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coefficient) CL-14 (multinomial coefficient) CL-18 n m 1 ;m 2 ;::: BFE(T ) (breadth first vertex sequence) DT-7, GT-29 BFV(T ) (breadth first vertex sequence) DT-7, GT-29 C(n; k) (binomial coefficient) Cov(X; Y ) (covariance) CL-14 DFV(T ) (depth first vertex sequence) GT-28 xjy (x divides y) GT-25 DFE(T ) (depth first edge sequence) GT-28 μ X (expectation or mean) Fn-22 E(X) (expectation) f ffi g (composition) Fn-22 Fn-6 F n (Fibonacci numbers) (V; E) (simple graph) (V; E; ffi) (graph) N (natural numbers) n (first n integers) GT-2 GT-2 CL-13 DT-18 O( ) (Big oh notation) GT-37 o( ) (little oh notation) GT-38 P k (A) (k-subsets of A) S(A) (permutations of A) PER(A) (permutations of A) CL-14, Fn-7 Fn-7 DT-7, DT-7, Probability notation μ X (expectation, or mean) Fn-22 ρ(x; Y ) (correlation) ff X (standard deviation) E(X) (expectation) Fn-22 Cov(X; Y ) (covariance) Var(X) (variance) P (AjB) (conditional probability) POSV(T ) (postorder sequence of vertices) DT-8 PREV(T ) (preorder sequence of vertices) DT-8 Q (rational numbers) R (real numbers) ρ(x; Y ) (correlation) CL-26, DT-36 Set notation οa (complement) CL-13, A 0 (complement) CL-13, A B (difference) CL-13, A B (intersection) CL-13, A [ B (union) CL-13, AΦB (symmetric difference) A n B (difference) CL-13, A B (Cartesian product) CL-3, A c (complement) CL-13, P k (A) (k-subsets of A) CL-14, jaj (cardinality) CL-2 ff X (standard deviation) S(n; k) (Stirling numbers) ( ) (rate of growth) GT-37 Var(X) (variance) Z (integers) CL-13, CL-23-1
2 Subject Adjacent vertices GT-3 Algorithm backtracking DT-7 Kruskal's (minimum weight spanning tree) GT-31 lineal (= depth-first) spanning tree GT-31 partial GT-45 polynomial time (tractable) GT-43 Prim's (minimum weight spanning tree) GT-30 which is faster? GT-41 Antisymmetric binary relation GT-25 Asymptotic GT-38 Average running time GT-40 Backtracking DT-7 Base (simplest) cases for induction DT-15 Bayes' Theorem DT-37, DT-41 Bell numbers CL-25 Bicomponents GT-21 Biconnected components GT-21 Bijection Binary relation GT-5 antisymmetric GT-25 covering GT-25 equivalence relation GT-4 order relation GT-25 reflexive GT-5 symmetric GT-5 transitive GT-5 Binary tree GT-34 full GT-34 Binomial coefficients CL-14 recursion CL-21 Binomial distribution 2 Binomial theorem CL-16 Bipartite graph GT-23 cycle lengths of GT-33 Blocks of a partition CL-18, CL-23, 4 Boolean variables DT-44 Breadth first vertex (edge) sequence DT-7, GT-29 Card hands and multinomial coefficients CL-21 full house CL-17 straight CL-24 two pairs CL-17 Cartesian product CL-3, Characteristic equation DT-18 Chebyshev's inequality Fn-25 Child vertex DT-2, GT-27 Chromatic number GT-40, GT-45 Circuit in a graph GT-17 Eulerian GT-20 Clique GT-44 Clique problem GT-44 Codomain (range) of a function Fn-2 Coimage of a function 3 Coloring a graph GT-40, GT-45 Coloring problem GT-44 Comparing algorithms GT-41 Complement of a set Complete simple graph GT-15 Component connected GT-18 Composition of an integer CL-8 Composition of functions Fn-6 Conditional probability DT-36 Conjunctive normal form DT-44 Connected components GT-18 Correlation Covariance Covering relation GT-25-2
3 Cumulative distribution (of normal) 4 Cycle in a graph Hamiltonian GT-17 GT-20 Cycle in a permutation Fn-8 Decision tree DT-1 see also Rooted tree ordered tree is equivalent GT-27 probabilistic DT-39 RP-tree is equivalent GT-27 Towers of Hanoi DT-28 traversals DT-7, GT-28 Decreasing (strictly) function or list 6 Decreasing (weakly) function or list Degree of a vertex DT-2, GT-4 Degree sequence of a graph Density function Fn-21 GT-4 Depth first vertex (edge) sequence GT-28 Derangement recursion Deviation standard Dictionary order 1 DT-20 CL-4 Digraph GT-14 functional GT-22 Direct (Cartesian) product CL-3, Direct insertion order for permutations DT-5 Directed graph Directed loop GT-14 GT-14 Disjunctive normal form 6 DT-7, Distribution Fn-21 binomial 2 cumulative 4 hypergeometric CL-29 joint 1 marginal 1 normal 3 Poisson 3 uniform CL-25 Distribution function see Distribution Divide and conquer Domain of a function Domino covering DT-21, GT-42 DT-10 Down degree of a vertex Edge DT-2, GT-2 directed GT-14 incident onvertex loop GT-10 parallel GT-10 Fn-2 DT-2 GT-3 Edge sequence breadth first DT-7, GT-29 depth first DT-7, GT-28 Envelope game Equation characteristic Equivalence class Fn-2 Equivalence relation Error percentage CL-9 relative CL-9 DT-18 GT-4 Eulerian circuit or trail Event CL-25, 9 independent pair GT-4 GT-20 Fn-26, DT-37 Expectation of a random variable Fn-22 Factorial estimate (Stirling's formula) CL-9 Fibonacci recursion First Moment Method Full binary tree GT-34 DT-18-3
4 Functiion probability 9 Function bijection codomain (range) of Fn-2 coimage of 3 composition of Fn-6 decreasing: decision tree DT-13 density Fn-21 distribution, see Distribution domain of Fn-2 generating CL-14 image of 2 image of and Stirling numbers (set partitions) 4 injective (one-to-one) inverse inverse image of 2 monotone 6 one-line notation Fn-2 partial DT-3 range of Fn-2 restricted growth and set partitions 9 strictly decreasing 6 strictly increasing 6 surjective (onto) two-line notation Fn-5 weakly decreasing 6 weakly increasing 6 Functional relation Fn-4 Gambler's ruin problem Generating function Geometric probability Geometric series DT-23 CL-14 DT-48 CL-31 Graph GT-2 see also specific topic biconnected GT-21 bipartite GT-23 bipartite and cycle lengths GT-33 complete simple GT-15 connected GT-18, GT-18 directed GT-14 incidence function GT-3 induced subgraph (by edges or vertices) GT-17 isomorphism GT-6 oriented simple GT-24 random GT-7 rooted GT-27 simple GT-2 subgraph of GT-16 Gray code for subsets Growth rate of, see Hamiltonian cycle Hasse diagram Height of a tree Height ofavertex DT-32 Rate of growth GT-25 GT-20 GT-34 DT-2 Hypergeometric probability CL-29 Image of a function 2 Stirling numbers (set partitions) and 4 Incidence function of a graph Inclusion and exclusion CL-35 CL-27, GT-3 Increasing (strictly) function or list Increasing (weakly) function or list Independent events Fn-26, DT-37 Independent random variables Induced subgraph (by edges or vertices) GT-17 Induction Fn-7, DT-14 base (simplest) cases DT-15 induction hypothesis DT-15 inductive step DT-15 Fn
5 Inequality Tchebycheff Injection Internal vertex Intersection of sets Fn-25 DT-2, GT-27 Inverse image of a function Involution Isolated vertex Fn-9 Isomorph rejection Isomorphic graphs GT-10 DT-13 GT-6 Joint distribution function 2 1 Kruskal's algorithm for minimum weight spanning tree GT-31 Leaf vertex rank of DT-2, GT-27 DT-5 Lexicographic order (lex order) CL-4 List CL-2 circular CL-10 strictly decreasing 6 strictly increasing 6 weakly decreasing 6 weakly increasing 5 with repetition CL-3 without repetition CL-2, CL-9 without repetition are injections Little oh notation GT-38 Local description DT-25 Gray code for subsets DT-33 merge sorting DT-24 permutations in lex order DT-27 Towers of Hanoi DT-29 Loop GT-10 directed GT-14 Matrix permutation Merge sorting Merging sorted lists Monotone function 0 Multinomial coefficient DT-24, GT-43 DT-24 6 Multiset CL-2 and monotone function CL-18 Nondecreasing function or list Nonincreasing function or list Normal distribution Normal form conjunctive disjunctive DT-44 NP-complete problem NP-easy problem NP-hard problem 3 GT-44 GT-44 GT Numbers Bell CL-25 binomial coefficients CL-14 Fibonacci DT-18 Stirling (set paritions) 4 Stirling (set partitions) CL-23 Odds CL-29 One-line notation Fn-2 One-to-one function (injection) Onto function (surjection) Order direct insertion for permutations DT-5 lexicographic (lex) CL-4 Order relation GT-25 Oriented simple graph GT-24 Machine independence Marginal distribution GT-36 1 Parallel edges GT-10 Parent vertex DT-2, GT-27 Partial function DT-3-5
6 Partition set CL-23, 3 set (ordered) CL-18 set and restricted growth function 9 Path in a (directed) graph GT-15 Permutation CL-3,, Fn-6 cycle Fn-8 cycle form Fn-8 cycle length Fn-8 derangement 1 direct insertion order DT-5 involution Fn-9 is a bijection matrix 0 powers of Fn-7 Poisson distribution 3 Polynomial time algorithm (tractable) Postorder sequence of vertices Preorder sequence of vertices DT-8 DT-8 Prim's algorithm for minimum weight spanning tree GT-30 Prime factorization DT-15 Probabilistic decision tree DT-39 Probability conditional DT-36 conditional and decision trees function CL-26 probability space CL-26 Probability distribution function see Distribution Probability function CL-26, 9 see also Distribution Probability space CL-26, 9 see also Distribution Random graphs GT-7 Random variable Fn-20 binomial 2 correlation of two covariance of two independent pair Fn-26 standard deviation of variance of DT-39 GT-43 Range of a function Rank (of a leaf) DT-5 Fn-2 Rate of growth Big oh notation GT-37 comparing GT-41 exponential GT-43 little oh notation GT-38 polynomial GT-38, GT-43 Theta notation GT-37 Rearranging words Recurrence see Recursion Recursion DT-16 CL-18 see also Recursive procedure binomial coefficients CL-21 derangements DT-20 Fibonacci DT-18 guessing solutions DT-21 inductive proofs and DT-14 set partitions (Bell numbers) CL-25 set partitions (Stirling numbers) CL-23 sum of first n integers DT-16 Recursive equation see Recursion Recursive procedure see also Recursion 0-1 sequences DT-24 Gray code for subsets DT-33 merge sorting DT-24 permutations in lex order DT-27 Towers of Hanoi DT-29 Reflexive relation Relation Fn-4 GT-5 see perhaps Binary relation Relative error CL-9 Restricted growth function and set partitions 9 Root DT-2 Rooted graph GT-27-6
7 Rooted tree child DT-2, GT-27 down degree of a vertex DT-2 height ofavertex DT-2 internal vertex DT-2, GT-27 leaf DT-2, GT-27 parent DT-2, GT-27 path to a vertex DT-2 siblings GT-27 RP-tree (rooted plane tree) see Decision tree Rule of Product Rule of Sum Sample space SAT problem CL-5 CL-3 CL-25, 9 Satisfiability problem Sequence Series geometric CL-2 DT-23 Set CL-2 and monotone function 6 Cartesian product CL-13 complement CL-13 complement of difference CL-13 intersection CL-13 intersection of two partition, see Set partition subsets of size k CL-14 symmetric diference of two symmetric difference CL-13 union CL-13 union of two with repetition (multiset) CL-2 Set partition CL-23, 3 ordered CL-18 recursion (Bell numbers) CL-25 recursion (Stirling numbers) CL-23 restricted growth function 9 Simple graph GT-2 Simplest (base) cases for induction Sorting (merge sort) DT-24, GT-43 DT-15 Space probability CL-26 Spanning tree GT-29 lineal (= depth first) GT-32 minimum weight GT-29 Stacks and recursion Standard deviation DT-31 Stirling numbers (set partitions) image of a function 4 Stirling's approximation for n! Strictly decreasing function or list Strictly increasing (or decreasing) function or list 6 Strictly increasing function or list String see List Subgraph GT-16 cycle GT-17 induced by edges or vertices Surjection Symmetric difference of sets Symmetric relation GT-5 Tchebycheff's inequality Fn-25 CL-23 CL GT-17-7
8 Theorem Bayes' DT-37, DT-41 binomial coefficients CL-14 binomial theorem CL-16 bipartite and cycle lengths GT-33 conditional probability DT-37 correlation bounds Fn-25 covariance when independent Fn-28 cycles and multiple paths GT-18 equivalence relations GT-5 expectation is linear expectation of a product Fn-28 induction DT-14 lists with repetition CL-3 lists without repetition CL-9 minimum weight spanning tree GT-30 monotone functions and (multi)sets 6 permutations of set to fixed power Fn-9 Prim's algorithm GT-30 properties of and O GT-37 Rule of Product CL-3 Rule of Sum CL-5 Stirling's formula CL-9 systematic tree traversal DT-8 Tchebycheff's inequality Fn-25 variance of sum Fn-28 walk, trail and path GT-16 Towers of Hanoi DT-28 four pole version DT-35 Tractable algorithm GT-43 Trail in a (directed) graph Transitive relation GT-5 Traveling salesman problem Traversal decision tree DT-7, GT-28 GT-15 GT-44 Tree see also specific topic binary GT-34 decision, see Decision tree height GT-34 ordered tree, see Decision tree rooted, see Rooted tree RP-tree (rooted plane tree), see Decision tree spanning GT-29 spanning, lineal (= depth first) GT-32 spanning, minimum weight GT-29 Two-line notation Fn-5 Uniformly at random CL-25 Union of sets Variance Venn diagram CL-28 Vertex DT-2 adajcent pair GT-3 child DT-2, GT-27 degree of DT-2, GT-4 down degree of DT-2 height of DT-2 internal DT-2, GT-27 isolated GT-10 leaf DT-2, GT-27 parent DT-2, GT-27 Vertex sequence GT-15 breadth first DT-7, GT-29 depth first DT-7, GT-28 Walk in a graph GT-15 Weakly decreasing function or list Weakly increasing function or list Words CL-11, CL
Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.
Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)
More informationF falling factorial, 11. father, 139. Ferris wheel, 112. Fibonacci numbers, 34, 36, 224, , 277. finite automaton, deterministic, 191.
Subject Index The style of a page number indicates the nature of the text material: the style 123 indicates a definition, the style 123 indicates an extended discussion, and the style 123 indicates a short
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationAbout the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design
Preface About the Author Dependency Chart xiii xix xxi Chapter 1: Logic and Sets 1 1.1: Logical Operators: Statements and Truth Values, Negations, Conjunctions, and Disjunctions, Truth Tables, Conditional
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationIntroductory Combinatorics
Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationCLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION
CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the
More informationBasic Concepts of Graph Algorithms
Basic Concepts of Graph Algorithms Combinatorics for Computer Science (Units 6 and 7) S. Gill Williamson c S. Gill Williamson 2012 Preface From 1970 to 1990 I ran a graduate seminar on algebraic and algorithmic
More informationDESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK Module 1 OBJECTIVE: Algorithms play the central role in both the science and the practice of computing. There are compelling reasons to study algorithms.
More information4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...
Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...
More informationMATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).
MATH 139 W12 Review 1 Checklist 1 Exam Checklist 1. Introduction to Predicates and Quantified Statements (chapters 3.1-3.4). universal and existential statements truth set negations of universal and existential
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationFundamentals of Discrete Mathematical Structures
Fundamentals of Discrete Mathematical Structures THIRD EDITION K.R. Chowdhary Campus Director JIET School of Engineering and Technology for Girls Jodhpur Delhi-110092 2015 FUNDAMENTALS OF DISCRETE MATHEMATICAL
More informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
More informationReference Sheet for CO142.2 Discrete Mathematics II
Reference Sheet for CO14. Discrete Mathematics II Spring 017 1 Graphs Defintions 1. Graph: set of N nodes and A arcs such that each a A is associated with an unordered pair of nodes.. Simple graph: no
More informationDS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
More informationCS521 \ Notes for the Final Exam
CS521 \ Notes for final exam 1 Ariel Stolerman Asymptotic Notations: CS521 \ Notes for the Final Exam Notation Definition Limit Big-O ( ) Small-o ( ) Big- ( ) Small- ( ) Big- ( ) Notes: ( ) ( ) ( ) ( )
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationThomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6
More informationContents. 1 Introduction. 2 Searching and Traversal Techniques. Preface... (vii) Acknowledgements... (ix)
Contents Preface... (vii) Acknowledgements... (ix) 1 Introduction 1.1 Algorithm 1 1.2 Life Cycle of Design and Analysis of Algorithm 2 1.3 Pseudo-Code for Expressing Algorithms 5 1.4 Recursive Algorithms
More information1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English
MATH 3012 Final Exam, May 3, 2013, WTT Student Name and ID Number 1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English alphabet and the ten digits {0, 1,
More informationCSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 4: Basic Concepts in Graph Theory Section 3: Trees 1 Review : Decision Tree (DT-Section 1) Root of the decision tree on the left: 1 Leaves of the
More informationApplied Combinatorics
Applied Combinatorics SECOND EDITION FRED S. ROBERTS BARRY TESMAN LßP) CRC Press VV^ J Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group an informa
More informationCOURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05
COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular
More informationUnit 8: Coping with NP-Completeness. Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems. Y.-W.
: Coping with NP-Completeness Course contents: Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems Reading: Chapter 34 Chapter 35.1, 35.2 Y.-W. Chang 1 Complexity
More informationIntroduction to Algorithms Third Edition
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 INFORMATION TECHNOLOGY TUTORIAL QUESTION BANK Course Name : DESIGN AND ANALYSIS OF ALGORITHMS Course Code : AIT001 Class
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationThe Algorithm Design Manual
Steven S. Skiena The Algorithm Design Manual With 72 Figures Includes CD-ROM THE ELECTRONIC LIBRARY OF SCIENCE Contents Preface vii I TECHNIQUES 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 2 2.1 2.2 2.3
More informationPSD1A. DESIGN AND ANALYSIS OF ALGORITHMS Unit : I-V
PSD1A DESIGN AND ANALYSIS OF ALGORITHMS Unit : I-V UNIT I -- Introduction -- Definition of Algorithm -- Pseudocode conventions -- Recursive algorithms -- Time and space complexity -- Big- o notation --
More informationThe absolute value of the real number y xis smaller than y x is smaller than or equal to y x is not equal to y
Notation Throughout the book the following notation is used: a A The element a belongs to the set A A B A is a subset of B {a A ψ(a)} The elements of A that satisfy property ψ {a 1,a 2,...,a r } The set
More informationCONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis
Contents Chapter 1. Relations 8 1. Relations and Their Properties 8 1.1. Definition of a Relation 8 1.2. Directed Graphs 9 1.3. Representing Relations with Matrices 10 1.4. Example 1.4.1 10 1.5. Inverse
More informationStudent Name and ID Number. MATH 3012 Final Exam, December 11, 2014, WTT
MATH 3012 Final Exam, December 11, 2014, WTT Student Name and ID Number 1. Consider the 11-element set X consisting of the three capital letters {A, B, C} and the eight digits {0, 1, 2,..., 7}. a. How
More informationDESIGN AND ANALYSIS OF ALGORITHMS
QUESTION BANK DESIGN AND ANALYSIS OF ALGORITHMS UNIT1: INTRODUCTION OBJECTIVE: Algorithms play the central role in both the science and the practice of computing. There are compelling reasons to study
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationDepartment of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I
MCA 312: Design and Analysis of Algorithms [Part I : Medium Answer Type Questions] UNIT I 1) What is an Algorithm? What is the need to study Algorithms? 2) Define: a) Time Efficiency b) Space Efficiency
More informationGraphs and trees come up everywhere. We can view the internet as a graph (in many ways) Web search views web pages as a graph
Graphs and Trees Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) who is connected to whom Web search views web pages as a graph Who points to whom Niche graphs (Ecology):
More informationR13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)
SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)
More informationTable of Contents. Chapter 1: Introduction to Data Structures... 1
Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction
More informationquanüfied Statements; valid well-formed formulas; comparison of propositional and predicate wffs. Exercises
Contents Preface xix Note to the Student xxv 1 Formal Logic 1 Chapter Objectives 1 1.1 Statements, Symbolic-Representation, and Tautologies 1 Statements and logical connectives; truth tables; well-formed
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More information1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \
BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,
More informationChapter 9 Graph Algorithms
Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set
More informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More informationFINAL EXAM SOLUTIONS. 1. Consider the 9-element set X consisting of the five letters {a, b, c, d, e} and the four digits
FINAL EXAM SOLUTIONS Student Name and ID Number MATH 0 Final Exam, December 5, 00, WTT Note. The answers given here are more complete and detailed than students are expected to provide when taking a test.
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
More informationLecture 13. Reading: Weiss, Ch. 9, Ch 8 CSE 100, UCSD: LEC 13. Page 1 of 29
Lecture 13 Connectedness in graphs Spanning trees in graphs Finding a minimal spanning tree Time costs of graph problems and NP-completeness Finding a minimal spanning tree: Prim s and Kruskal s algorithms
More informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
More information11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions
Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the
More informationL.J. Institute of Engineering & Technology Semester: VIII (2016)
Subject Name: Design & Analysis of Algorithm Subject Code:1810 Faculties: Mitesh Thakkar Sr. UNIT-1 Basics of Algorithms and Mathematics No 1 What is an algorithm? What do you mean by correct algorithm?
More informationSTUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl
Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 12 By Dr. Dalia M. Gil, Ph.D. Trees Tree are useful in computer science, where they are employed in a wide range of algorithms. They are used to construct efficient
More informationCSCE 321/3201 Analysis and Design of Algorithms. Prof. Amr Goneid. Fall 2016
CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Fall 2016 CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Course Resources Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More information5105 BHARATHIDASAN ENGINEERING COLLEGE
CS 6402 DESIGN AND ANALYSIS OF ALGORITHMS II CSE/IT /IV SEMESTER UNIT I PART A 1. Design an algorithm to compute the area and circumference of a circle?(dec 2016) 2. Define recurrence relation? (Dec 2016)
More informationD.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1.
D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1. DESIGN AND ANALYSIS OF ALGORITHM UNIT- I SECTION-A 2 MARKS 1. Define an algorithm? 2. Specify the criteria of algorithm? 3. What is Computational Procedure?
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationMATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE
MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationJAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:
JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And
More informationEND-TERM EXAMINATION
(Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt
More informationCLASSIC DATA STRUCTURES IN JAVA
CLASSIC DATA STRUCTURES IN JAVA Timothy Budd Oregon State University Boston San Francisco New York London Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Paris Cape Town Hong Kong Montreal CONTENTS
More informationLet G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.
Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,
More informationCourse Review for Finals. Cpt S 223 Fall 2008
Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationAccepting that the simple base case of a sp graph is that of Figure 3.1.a we can recursively define our term:
Chapter 3 Series Parallel Digraphs Introduction In this chapter we examine series-parallel digraphs which are a common type of graph. They have a significant use in several applications that make them
More informationModule 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 16 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 16 Notes Goals for this week Graph basics Types
More informationBreadth-First Search. BFS and Shortest Length Paths. Spanning Trees. Depth-First Search
Breadth-First Search BFS and Shortest Length Paths Input G(V, E) v [a connected graph] [start vertex] Algorithm Breadth-First Search visit v V {v} [V is the vertices already visited] Put v on Q [Q is a
More informationFurther Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationCSE 100: B+ TREE, 2-3 TREE, NP- COMPLETNESS
CSE 100: B+ TREE, 2-3 TREE, NP- COMPLETNESS Analyzing find in B-trees Since the B-tree is perfectly height-balanced, the worst case time cost for find is O(logN) Best case: If every internal node is completely
More informationA6-R3: DATA STRUCTURE THROUGH C LANGUAGE
A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF
More information1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1).
Math/CS 415 Combinatorics and Graph Theory Fall 2017 Prof. Readdy Homework Chapter 1 1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This
More informationGraph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationDEPARTMENT - Mathematics. Coding: N Number. A Algebra. G&M Geometry and Measure. S Statistics. P - Probability. R&P Ratio and Proportion
DEPARTMENT - Mathematics Coding: N Number A Algebra G&M Geometry and Measure S Statistics P - Probability R&P Ratio and Proportion YEAR 7 YEAR 8 N1 Integers A 1 Simplifying G&M1 2D Shapes N2 Decimals S1
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationBHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities CS6702-GRAPH THEORY AND APPLICATION
BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI 635 854 Department of Science and Humanities DEGREE/BRANCH : B.E. CSE YEAR/ SEMESTER : IV/VII. CS6702-GRAPH THEORY AND APPLICATION 1. Define graph. UNIT-I
More informationChapter 3 Trees. Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
More informationBest known solution time is Ω(V!) Check every permutation of vertices to see if there is a graph edge between adjacent vertices
Hard Problems Euler-Tour Problem Undirected graph G=(V,E) An Euler Tour is a path where every edge appears exactly once. The Euler-Tour Problem: does graph G have an Euler Path? Answerable in O(E) time.
More information( ) 1 B. 1. Suppose f x
CSE Name Test Spring Last Digits of Student ID Multiple Choice. Write your answer to the LEFT of each problem. points each is a monotonically increasing function. Which of the following approximates the
More information2. (a) Explain when the Quick sort is preferred to merge sort and vice-versa.
Code No: RR210504 Set No. 1 1. (a) Order the following functions according to their order of growth (from the lowest to the highest). (n-2)!, 5 log (n+100) 10,2 2n, 0.001n 4 +3n 3 +1, ln 2 n, n 1/3, 3
More informationLecture 6: Combinatorics Steven Skiena. skiena
Lecture 6: Combinatorics Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Learning to Count Combinatorics problems are
More informationUNIT 1 BASICS OF AN ALGORITHM
UNIT 1 BASICS OF AN ALGORITHM Basics of an Algorithm Structure Page Nos. 1.0 Introduction 5 1.1 Objectives 6 1.2. Analysis and Complexity of Algorithms 6 1.3 Basic Technique for Design of Efficient Algorithms
More informationYEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1)
YEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1) Algebra and Functions Quadratic Functions Equations & Inequalities Binomial Expansion Sketching Curves Coordinate Geometry Radian Measures Sine and
More informationSankalchand Patel College of Engineering - Visnagar Department of Computer Engineering and Information Technology. Assignment
Class: V - CE Sankalchand Patel College of Engineering - Visnagar Department of Computer Engineering and Information Technology Sub: Design and Analysis of Algorithms Analysis of Algorithm: Assignment
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationAlgorithm. Algorithm Analysis. Algorithm. Algorithm. Analyzing Sorting Algorithms (Insertion Sort) Analyzing Algorithms 8/31/2017
8/3/07 Analysis Introduction to Analysis Model of Analysis Mathematical Preliminaries for Analysis Set Notation Asymptotic Analysis What is an algorithm? An algorithm is any well-defined computational
More information