D ISCRETE M ATHEMATICS IN C OMPUTER S CIENCE E DUCATION AT F ACULTY OF EE IN N IS I.Z. M ILOVANOVIC B.M. R ANDJELOVIC E.I. M ILOVANOVIC F ACULTY OF E LECTRONIC.

Slides:



Advertisements
Similar presentations
1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
Advertisements

Edited by Malak Abdullah Jordan University of Science and Technology Data Structures Using C++ 2E Chapter 12 Graphs.
Mathematics Topics Table of Contents. 9/14/2013 Tables of Contents 2 How to Use Topics Main Topics Numbers Real Numbers Numbers and Data Numbers & Geometry.
Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Introduction to PageRank Algorithm and Programming Assignment 1 CSC4170 Web Intelligence and Social Computing Tutorial 4 Tutor: Tom Chao Zhou
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
EAs for Combinatorial Optimization Problems BLG 602E.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Multihop Paths and Key Predistribution in Sensor Networks Guy Rozen.
Degree A F H G B E D C. Adjacent A F H G B E D C.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
F ACULTY OF C OMPUTER S CIENCE & E NGINEERING. C ONTENTS OF SYLLABUS Chapter 01. Introduction to Wireless LANs Chapter 02. Radio Frequency Chapter 03.
Graph theory as a method of improving chemistry and mathematics curricula Franka M. Brückler, Dept. of Mathematics, University of Zagreb (Croatia) Vladimir.
ⅠIntroduction to Set Theory 1. Sets and Subsets
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
 期中测验时间:  11 月 4 日  课件 集合,关系,函数,基数, 组合数学.  Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder.
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
General linear groups, Permutation groups & representation theory.
Chapter 6 Graph Theory R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001.
1 CS104 : Discrete Structures Chapter V Graph Theory.
 期中测验时间:  10 月 31 日上午 9 : 40—11 : 30  第一到第四章  即,集合,关系,函数,组合数学.
Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
CYCLIC CONFIGURATIONS AND HAAR GRAPHS. Haar graph of a natural number Let us write n in binary: n = b k-1 2 k-1 + b k-2 2 k b b 0 where.
Introduction to Graph Theory
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Combinatorics University of Akron Programming Team 9/23/2011.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.
Graphs Basic properties.
3.1 Exponential Functions and Their Graphs The exponential function f with base a is denoted by f(x) = a x and x is any real number.
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE By, A.Kousar Nikhath, Asst.Professor, CSE Dpt.
CSCI 115 Course Review.
Week 11 - Wednesday.  What did we talk about last time?  Graphs  Paths and circuits.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
U NIVERSITY OF D ELAWARE C OMPUTER & I NFORMATION S CIENCES D EPARTMENT Optimizing Compilers CISC 673 Spring 2011 Yet More Data flow analysis John Cavazos.
Code: BM301 Mathematics for Computing Prof.(Dr.) Monalisa Banerjee By.
MATHEMATICS B.A./B.Sc. (GENERAL) THIRD YEAR EXAMINATION, 2012.
Review: Discrete Mathematics and Its Applications
Combinatorics of colouring 3-regular trees
Visual Arts Colour Schemes for Balanced Compositions
Graph theory Definitions Trees, cycles, directed graphs.
Chapter 1 Functions.
Example 1: Undirected adjacency graph Discretized polygon
1. Use the quadratic formula to find all real zeros of the second-degree polynomial
Mathematics for Computer Science MIT 6.042J/18.062J
Mathematics for Computer Science MIT 6.042J/18.062J
An Introduction to Variational Methods for Graphical Models
Just define the prefixes somewhere.
Walks, Paths, and Circuits
Combinatorics.
Mathematics for Computer Science MIT 6.042J/18.062J
Shapes.
Review: Discrete Mathematics and Its Applications
Sec 3.4: The Chain Rule Composite function Chain Rule:
1.5b Combining Transformations
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
MATHEMATICS (ELECTIVE)
Area of Composite Figures
1.5b Combining Transformations
Binary, permutation, communication and dominance matrices
Introduction to Graph Theory
Notes Over 8.7 Writing an Exponential Function
Exam 3 review Chapter 9- Graphs.
Presentation transcript:

D ISCRETE M ATHEMATICS IN C OMPUTER S CIENCE E DUCATION AT F ACULTY OF EE IN N IS I.Z. M ILOVANOVIC B.M. R ANDJELOVIC E.I. M ILOVANOVIC F ACULTY OF E LECTRONIC E NGINEERING A LEKSANDRA M EDVEDEVA 14, P.O.BOX 73, N IS S ERBIA

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

R EAL S EQUENCES GENERATING FUNCTION EXPONENTIAL GENERATING FUNCTION SEQUENCES GIVEN BY RECURRENCE RELATION APPLICATIONS OF RECURRENCE RELATIONS

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

S PECIAL C LASSES OF M ATRICES BINARY MATRICES PERMUTATION MATRICES SHIFTING MATRICES HADAMARE MATRICES STOCHASTIC MATRICES

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

E LEMENTS OF C OMBINATORICS PERMUTATIONS VARIATIONS COMBINATIONS PARTITIONS COMPOSITIONS PERMUTATIONS ON THE CIRCLE PERMUTATIONS OF TOTAL CHAOS LEXICAL ORDERING OF PERMUTATIONS

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

C OMBINATORIAL C ONFIGURATIONS BLOCK-SCHEME BALANCED INCOMPLETE SCHEME SYMETRICAL, DUAL, SELF-DUAL SCHEME SYSTEMS OF DIFFERENT REPRESENTATIVES LATIN RECTANGLES AND SQUARES MAGIC SQUARES ISOMORPHISM OF LATIN RECTANGLES

O UTLINE REAL SEQUENCES SPECIAL CLASSES OF MATRICES ELEMENTS OF CLASSICAL COMBINATORICS COMBINATORIAL CONFIGURATIONS GRAPH THEORY

NON-DIRECTED AND DIRECTED GRAPHS DEGREE OF THE NODE ADJACENCY MATRICES GRAPH SPECTRUM PATHS IN GRAPH, SHORTEST PATH GRAPH OPERATIONS PLANAR GRAPHS GRAPH COLOURING

T EXT- B OOKS AND M ANUALS D ISCRETE M ATHEMATICSI.Z. M ILOVANOVIC, E.I. M ILOVANOVIC: D ISCRETE M ATHEMATICS F ACULTY OF E LECTRONIC E NGINEERING, N IS, D ISCRETE M ATHEMATICS - C OLLECTION OF P ROBLEMSI.Z. M ILOVANOVIC, E.I. M ILOVANOVIC, B.M. R ANDJELOVIC: D ISCRETE M ATHEMATICS - C OLLECTION OF P ROBLEMS F ACULTY OF E LECTRONIC E NGINEERING, N IS, 2001.

L INKS U NIVERSITY OF N IS F ACULTY OF E LECTRONIC E NGINEERING D EPARTMENT OF M ATHEMATICS D EPARTMENT OF C OMPUTER S CIENCE {igor, bane,