1. Principles of Computing – UFCFA3-30-1 Week 1
Instructor : Mazhar H Malik
Global College of Engineering and Technology

2. Today’s Lecture
Introduction
Basic Concepts

3. Global College of Engineering and Technology
Course Detail
Principles of Computing Webpage: mazhargcet.wordpress.com Office: LP.8 Discussion: 3:30 to onward
Global College of Engineering and Technology

4. Required Software Required Software
Python Language (
RegexBuddy

5. Python

6. JFlap

7. Automation Simulator

8. Simulator For Regular Expressions

9. 50% (Examination (2 hours))
Course Requirements
Your grade for the course will be computed as follows:
Identify final assessment component and element
Components
% weighting between components A and B (Standard modules only) A: B:
50% (Examination (2 hours))
50%
e-Assessment – short answers to questions in mathematics
Written Assessment – a portfolio of tasks related to problems of computational theory
To receive a passing grade for the course, you must:
Pass the Final Exam
Submit all coursework (both lab works and programming assignments)

10. Course Exams Component A 50% weighting Written Exam (2 Hours)
Component B 50% weighting
e-Assessment – short answers to questions in mathematics (50% weighting of component B)
Written Assessment – a portfolio of tasks related to problems of computational theory (50% weighting of component B)

11. Text Book
Rosen, K.H. (2003.). Discrete Mathematics and its Applications. 5th ed., New York, NY: McGraw Hill.

12. Text Book
Hein J H (2010). Discrete Structures, Logic, and Computability, 4th ed.
Jones and Bartlett

13. Global College of Engineering and Technology
Recommended Book(s)
Reference Book(s):
Daniel I. A. Cohen, “Introduction to Computer Theory”, Second Edition.
Nasir S.F.B and P.K. Srimani, “A Textbook on Automata Theory”, Cambridge University Press, India, 2008
Sikander H. Khiyal, “Theory of Automata and
Computation”, National Book Foundation, 2004
John E. Hopcroft, Rajeev Motvani, and Jeffrey D. Ullman, “Introduction to Automata theory, Languages and Computation”, Second Edition, Addison- Wesley, New York, 2001.
K.L.P. Mishra, N. Chandrasekaran, “Theory of Computer Science (Automata, Languages and Computation)”, Prentice-Hall of India, 2002.
Global College of Engineering and Technology

14. Reference Books Implementations

15. Syllabus Outline
Machines. How these abstract machines work. What limitations they have. How do apply them to real world applications. The significance of the Universal Turing Machines.
Formal Languages: words, sentences, languages, grammars, productions. Links to computing models. How to formally define languages. How a compiler detects syntax errors.
Algorithms: Classes of algorithms, search algorithms and sorting algorithms. Time and space complexity of algorithms. NP-complete problems.
Recursion: Inductive definitions and recursive programs.
Logic: Propositional and Predicate logic. Truth tables for basic logic operators. Inference methods.
Mathematical Structures: Numbers. Sets. Functions. Relations. Matrices. Application of mathematical structure to computing. Enumerating (counting) these structures.
Graph Theory: Theory and its applications as a modelling tool. Classical problems: finding the shortest route on a graph and the travelling salesman problem 14

16. Learning and Teaching 1.
Understand simple models of computation and formulate small problems in terms of
those models. 2.
Define the syntax of formal languages in terms of productions. Define functions using
recursion 3.
Explain algorithmic behaviour of programs in appropriate formal terms and Big-O notation 4.
Design and simulate abstract computation models: Finite Automata, Push Down Automata,
and Turing Machines. 5.
Appreciate the limitations of computers 6.
Use mathematical language, notation and methods in the description and analysis of
problems in appropriate areas of application within computing. 7.
Begin to abstract general principles from studying particular problems and solutions 8.
Recognise the fundamental role of foundation mathematics and discrete mathematical
structures within computing. 15

17. Teaching Method (Interactive)
Students are asked to write algorithm/Programs of problems
Imagine/Calculate Possible output of problem/Piece
of Code
Discussions & Brainstorming
Real World implications

18. Q & A (Discussion)

19. Basics (Set Theory)

20. Sets

21. Notations

22. Set-Builder Notation

23. Set Examples

24. Union

25. Intersection

26. Difference

27. Three sets

28. Three sets Examples

29. Universal Set

30. Universal Set

31. Complement

32. Global College of Engineering and Technology
Questions?
Global College of Engineering and Technology

33. Principles of Computing – UFCFA3-30-1 Lecture-2
Instructor : Mazhar H Malik
Global College of Engineering and Technology

34. Global College of Engineering and Technology
Previous Lecture
Introduction about course
Set Theory
Set, Notation, Set Builder Notation
Union , Intersection, Difference
Universal Set and Complement of a set
Global College of Engineering and Technology

35. Global College of Engineering and Technology
Today’s Lecture
Equality
Power Set
Type of Number
Commutative, Associative and Distributive Law
Equations, Functions and Relation
Global College of Engineering and Technology

36. Equality

37. Power Set

38. Types of Number

39. Types of Number

40. Common Number Sets

41. Commutative, Associative and Distributive Laws

42. Commutative Laws

43. Associative Laws

44. Associative Laws

45. Associative Laws

46. Distributive Law

47. Distributive Law

48. Equation

49. Function

50. Input, Relationship, Output

51. Input, Relationship, Output

52. Names

53. Your Turn…

54. Your Turn…

55. Relation

56. Resources

57. Thank You