{"id":793,"date":"2018-11-12T17:37:01","date_gmt":"2018-11-12T11:07:01","guid":{"rendered":"http:\/\/ucsdawei.moe.edu.mm\/?page_id=793"},"modified":"2019-07-06T21:53:13","modified_gmt":"2019-07-06T15:23:13","slug":"faculty-of-computing","status":"publish","type":"page","link":"https:\/\/ucs.pudawei.edu.mm\/faculty-of-computing\/","title":{"rendered":"Faculty of Computing (FC)"},"content":{"rendered":"\n

Members<\/strong><\/span><\/h2><\/h3>\n\n\n\n
\n
\n
\"\"
Dr. Thidar Aung
Associate Professor
Head of FC<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Kyi Pyar Moe
Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Myo Su Su Hlaing
Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Mi Mi Hnin
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw San San Aye
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
\"\"
Daw Thet Thet Aye
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Nwet Nwet San
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Wine Sandar Aung
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n<\/div>\n\n\n\n

Offer Subjects<\/strong><\/span><\/h2><\/h3>\n\n\n\n
\n Subject Code<\/strong>\n <\/th>\n Field of Study<\/strong>\n <\/th><\/tr>
CST-102<\/td> Mathematics of Computing I<\/td><\/tr>
CST-202<\/td> Mathematics of Computing II<\/td><\/tr>
CST-302<\/td> Mathematics of Computing III<\/td><\/tr>
CST-402<\/td> Mathematics of Computing IV<\/td><\/tr>
CST-501<\/td> Mathematics of Computing V<\/td><\/tr>
Paper II<\/td> Mathematics of Computing I<\/td><\/tr><\/tbody><\/table>\n\n\n\n

Course Description<\/h2>\n\n\n\n


CM-121<\/strong> <\/h3>\n\n\n\n

COURSE DESCRIPTION<\/strong><\/p>\n\n\n\n
\n Course\n code number <\/strong>\n  <\/strong>\n <\/td>\n CM-121\n <\/td>\n Course\n Title<\/strong>\n <\/td>\n Discrete\n Mathematics<\/strong>\n <\/td><\/tr>
\n Semester\n hours<\/strong>\n <\/td>\n 3 hours \n <\/td>\n No.\n of Credit Units <\/strong>\n  <\/strong>\n <\/td>\n 3\n <\/td><\/tr>
\n Prerequisite<\/strong>\n <\/td>\n None\n <\/td>\n Course\n Coordinator<\/strong>\n <\/td>\n Dr.Thida Aung\n Daw San San Aye\n Daw Wine Sandar Aung\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

Course\nDescription<\/strong><\/p>\n\n\n\n

An\nintroduction to discrete mathematical concepts including the foundations: logic\nand<\/p>\n\n\n\n

proofs,\nmathematical induction and recursion, sets, functions, sequences and\nsummations,<\/p>\n\n\n\n

matrices,\ncomplexity of algorithms, number theory, permutations and combinations, an<\/p>\n\n\n\n

introduction\nto discrete probability and graphs.<\/p>\n\n\n\n

Textbook<\/strong><\/p>\n\n\n\n

Discrete\nmathematics and its applications<\/em>, 7h Edition, Kenneth H.\nRosen. McGraw-Hill<\/p>\n\n\n\n

2012.<\/p>\n\n\n\n

Course\nOutcomes<\/strong><\/p>\n\n\n\n

Students who complete\nthe course will be able to<\/p>\n\n\n\n

   1. Define and precisely use standard\nmathematical terminology and concepts.<\/p>\n\n\n\n

   2. Identify and apply appropriate methods of\nproof.<\/p>\n\n\n\n

   3. Understand the basic principles of sets\nand operations in sets and manipulate sets,<\/p>\n\n\n\n

       relations, functions and their\nassociated concepts, and apply these to solve<\/p>\n\n\n\n

       problems in mathematics and computer\nscience.<\/p>\n\n\n\n

   4. Understand the principles of elementary\nprobability theory<\/p>\n\n\n\n

   5. Understand basic terminology and\noperations for graphs<\/p>\n\n\n\n

   6. Use graphs to solve problems in computer\nscience.<\/p>\n\n\n\n

Major\nTopics Covered in the Course<\/strong><\/p>\n\n\n\n

1. Propositional and\nPredicate Logic<\/p>\n\n\n\n

2. Proof Techniques<\/p>\n\n\n\n

3. Sets<\/p>\n\n\n\n

4. Functions<\/p>\n\n\n\n

5. Sequences and\nSummations<\/p>\n\n\n\n

6. Matrices<\/p>\n\n\n\n

7. The Growth of\nFunctions and Complexity of Algorithms<\/p>\n\n\n\n

8. Number Theory<\/p>\n\n\n\n

9. Counting<\/p>\n\n\n\n

10. Introduction to\nDiscrete Probability<\/p>\n\n\n\n

11. Introduction to\nGraph Theory<\/p>\n\n\n\n

Assessment\nPlan for the Course<\/strong><\/p>\n\n\n\n

      Attendance    –  10%<\/p>\n\n\n\n

      Quizzes –       10%<\/p>\n\n\n\n

      Assignment – 20%<\/p>\n\n\n\n

      Test \n –            10%<\/p>\n\n\n\n

      Final Exam –   50%<\/p>\n\n\n\n

Grading\nSystem<\/strong><\/p>\n\n\n\n

UCSY follows a letter\ngrade system comprising of grades A, A-, B+, B, B-, C+,<\/p>\n\n\n\n

C, C-, D and F. All\nmarks obtained by students during the semester will be used in the<\/p>\n\n\n\n

grading process. A\ngrade of “D” is considered a passing grade for undergraduate courses.<\/p>\n\n\n\n

For undergraduate\nstudents, a grade of \u201cC\u201d or better is required in this course because it<\/p>\n\n\n\n

is a prerequisite for\nother courses in the program. The student who gets the grade point<\/strong><\/p>\n\n\n\n

less\nthan 2 must do Re-Exam.<\/strong><\/p>\n\n\n\n

The grading scale for\nthis course is:<\/p>\n\n\n\n

   Marks obtained            Letter Grade           Grade Point<\/strong><\/p>\n\n\n\n

   >=90                            A                        4<\/p>\n\n\n\n

  \n85 \u2013 89                       A-                        3.75<\/p>\n\n\n\n

  \n80 \u2013 84                       B+                        3.25<\/p>\n\n\n\n

  75\n\u2013 79                       B                          3<\/p>\n\n\n\n

  70 \u2013 74                      \n B-                  \n     2.75<\/p>\n\n\n\n

  65\n\u2013 69                        C+                  \n     2.25<\/p>\n\n\n\n

  60 \u2013 64                        C                          2<\/p>\n\n\n\n

  55 \u2013 59                        C-                        1.75<\/p>\n\n\n\n

  50\n\u2013 54                        D                         1<\/p>\n\n\n\n

  0 \u2013 49                                      F                          0<\/p>\n\n\n\n

Fail\nGrade and Re-Exam: C-,D,F (Grade point <2)<\/strong><\/p>\n\n\n\n

Class\nAttendance and Participation Policy:<\/strong><\/p>\n\n\n\n

 \u00b7   Attendance<\/strong><\/p>\n\n\n\n

      Class attendance is mandatory<\/strong>.\nMost of the material you will learn will be covered in<\/p>\n\n\n\n

the\nlectures, so it is important that you not miss any of them. You are expected to\nshow<\/p>\n\n\n\n

up on\ntime for class, and stay for the whole lecture.\nStudents are expected to attend each<\/p>\n\n\n\n

class,\nto complete any required preparatory work (including assigned reading) and to<\/p>\n\n\n\n

participate\nactively in lectures, discussions and exercises.<\/p>\n\n\n\n

\u2022 Mobile phones must\n<\/strong>be silenced and put away for the entire lecture unless use is<\/p>\n\n\n\n

specified by the\ninstructor. You may not make or receive calls on your cell phone, or send<\/p>\n\n\n\n

or receive text\nmessages during lectures.<\/p>\n\n\n\n

\u2022 You are responsible\nfor all material sent as email. Ignorance of such material is no<\/p>\n\n\n\n

excuse. You are\nresponsible for all materials presented in the lectures.<\/p>\n\n\n\n

\u2022 Your conduct in\nclass should be conducive towards a positive learning environment for<\/p>\n\n\n\n

your class mates as\nwell as yourself.<\/p>\n\n\n\n

\u00b7 Quizzes,\nassignments, tests and Exam<\/strong><\/p>\n\n\n\n

       Your performance in this class will be\nevaluated using your scores for attendance,<\/p>\n\n\n\n

quizzes, homework\nassignments, two tests and one final examination. There are no<\/p>\n\n\n\n

planned extra credit\nprojects or assignments to improve your grade.<\/p>\n\n\n\n

      We will take a short quiz for every\nlecture.<\/p>\n\n\n\n

      There will be 8  homework assignments, roughly one per week.\nPlease show all<\/p>\n\n\n\n

your work and write\nor type your assignments neatly. Credit cannot be given for answers<\/p>\n\n\n\n

without work (except\non true-false, always-sometimes-never, or other multiple choice<\/p>\n\n\n\n

questions).<\/p>\n\n\n\n

      Test will start after two or three\nchapters finished and the coordinator will<\/p>\n\n\n\n

announce the date for\nthe test.<\/p>\n\n\n\n

     Any assignment or quiz or test is simply\nmissed, regardless of the reason why<\/p>\n\n\n\n

(e.g. illness, work,\ntraffic, car trouble, computer problems, death, etc.), and earns a<\/strong><\/p>\n\n\n\n

grade\nof zero<\/strong>. You are strongly encouraged to complete all assignments and attend\nall<\/p>\n\n\n\n

quizzes so that you\ncan check that you understand the material and can throw out bad<\/p>\n\n\n\n

grades, or grades for\nwhich you had to miss an assignment or quiz for a valid reason.<\/p>\n\n\n\n

Late\nsubmissions will not be accepted for any graded activity for any reason.<\/strong><\/p>\n\n\n\n

\u00b7 There\nare no extra credit opportunities.<\/strong><\/p>\n\n\n\n

Students may not do\nadditional work nor resubmit any graded activity to raise a<\/p>\n\n\n\n

final grade.<\/p>\n\n\n\n

\u00b7 Exam<\/strong><\/p>\n\n\n\n

  The exam will be conducted on-campus, in a\nclassroom. The dates\/times\/locations<\/p>\n\n\n\n

will be posted on\nBoard as soon as possible.<\/p>\n\n\n\n

For this course, the\nfollowing additional requirements are specified:<\/p>\n\n\n\n

All work submitted\nfor a grade must have been prepared by the individual student.<\/p>\n\n\n\n

Students are\nexpressly prohibited from sharing any work that has been or will be<\/p>\n\n\n\n

submitted for a\ngrade, in progress or completed, for this course in any manner with a<\/p>\n\n\n\n

person other than the\ninstructor and teaching assistant(s) assigned to this course).<\/p>\n\n\n\n

Specifically,\nstudents may not do the following, including but not limited to:<\/p>\n\n\n\n

\u00b7 Discuss\nquestions, example problems, or example work with another person that<\/p>\n\n\n\n

   leads to a similar solution to work\nsubmitted for a grade.<\/p>\n\n\n\n

\u00b7 Give\nto, show, or receive from another person (intentionally, or accidentally<\/p>\n\n\n\n

   because the work was not protected) a partial,\ncompleted, or graded solution.<\/p>\n\n\n\n

\u00b7 Ask\nanother person about the completion or correctness of an assignment.<\/p>\n\n\n\n

\u00b7 Posting\nor sharing course content (e.g. instructor provided lecture notes,<\/p>\n\n\n\n

   assignment directions, assignment questions,\nor anything not created solely by the<\/p>\n\n\n\n

   student.<\/p>\n\n\n\n

Tentative\nLesson<\/strong><\/p>\n\n\n\n
\n No\n <\/strong>\n <\/td>\n Topics\n <\/strong>\n <\/td>\n Week<\/strong>\n <\/td>\n Remark<\/strong>\n <\/td><\/tr>
\n I<\/strong>\n <\/td>\n 1\n The Foundations: Logic and Proofs<\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n 1\n <\/td>\n  1.1 Propositional Logic Week\n 1\n  <\/strong>\n <\/td>\n Week 1\n <\/td>\n Assignment1<\/strong>\n <\/td><\/tr>
\n 2\n <\/td>\n 1.2 Applications of\n Propositional Logic    \n <\/td><\/tr>
\n 3\n <\/td>\n 1.3 Propositional\n Equivalences \n <\/td>\n Week 2\n  \n <\/td><\/tr>
\n 4\n <\/td>\n  1.4 Predicates and Quantifiers \n <\/td><\/tr>
\n 5\n <\/td>\n  1.5 Nested Quantifiers \n <\/td>\n Week 3\n  \n <\/td><\/tr>
\n 6\n <\/td>\n  1.6 Rules of Inference\n <\/td><\/tr>
\n 7\n <\/td>\n 1.7\n Introduction to Proofs \n <\/td><\/tr>
\n II<\/strong>\n <\/td>\n 2  Basic Structures: Sets, Functions, <\/strong>\n      Sequences, Sums, and Matrices<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 8\n <\/td>\n  2.1 Sets \n <\/td>\n Week 4\n  \n <\/td>\n  \n Assignment  2\n <\/td><\/tr>
\n 9\n <\/td>\n  2.2 Set Operations\n <\/td><\/tr>
\n 10\n  \n <\/td>\n  2.3 Functions\n <\/td><\/tr>
\n 11\n <\/td>\n  \n 2.4 Sequences\n and Summations \n <\/td>\n Week 5\n  \n <\/td><\/tr>
\n 12\n <\/td>\n  2.6 Matrices\n <\/td><\/tr>
\n 13\n <\/td>\n  1.8 Proof Methods and Strategy \n <\/td><\/tr>
\n III<\/strong>\n <\/td>\n 3\n Algorithms<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 14\n <\/td>\n 3.2 The Growth of\n Functions \n <\/td>\n Week 6\n  \n <\/td>\n Assignment 3\n <\/td><\/tr>
\n 15\n <\/td>\n 3.3 Complexity of\n Algorithms \n <\/td><\/tr>
\n IV<\/strong>\n <\/td>\n 4\n Number Theory<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 16\n <\/td>\n 4.1\n Divisibility and Modular Arithmetic \n <\/td>\n Week 7\n  \n <\/td>\n Assignment 4\n <\/td><\/tr>
\n 17\n <\/td>\n  4.2 Integer\n Representations and Algorithms\n <\/td><\/tr>
\n 18\n <\/td>\n  4.3 Primes and Greatest\n Common Divisors \n <\/td><\/tr>
\n 19\n <\/td>\n  4.4 Solving Congruences\n <\/td>\n  \n <\/td><\/tr>
\n  \n <\/td>\n Test I <\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n V<\/strong>\n <\/td>\n  5 Induction and Recursion<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 20\n <\/td>\n  5.1 Mathematical Induction \n <\/td>\n Week 8+9\n  \n <\/td>\n Assignment 5\n <\/td><\/tr>
\n 21\n  \n <\/td>\n  5.2 Strong Induction and Well-Ordering\n <\/td><\/tr>
\n 22\n <\/td>\n  5.3 Recursive Definitions and Structural\n Induction \n <\/td><\/tr>
\n VI<\/strong>\n <\/td>\n  <\/strong>6 Counting<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 23\n <\/td>\n  6.1 The Basics of Counting\n \n <\/td>\n Week 10\n  \n <\/td>\n Assignment 6\n <\/td><\/tr>
\n 24\n <\/td>\n  6.2 The Pigeonhole\n Principle\n <\/td><\/tr>
\n 25\n <\/td>\n  6.3 Permutations and\n Combinations \n <\/td>\n Week 11\n  \n <\/td><\/tr>
\n VII<\/strong>\n <\/td>\n  Discrete Probability<\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
\n 26\n  \n <\/td>\n  7.1 An Introduction to\n Discrete Probability \n <\/td>\n Week 12+13\n  \n <\/td>\n  \n <\/td><\/tr>
\n 27\n <\/td>\n 7.2\n Probability Theory\n <\/td>\n Assignment 7\n <\/td><\/tr>
\n 28\n <\/td>\n  7.4 Expected Value and\n Variance \n <\/td><\/tr>
\n VIII<\/strong>\n <\/td>\n  <\/strong>10 Graphs<\/strong>\n <\/td>\n  \n <\/td>\n Assignment 8\n <\/td><\/tr>
\n 29\n <\/td>\n 10.1 Graphs and\n Graph Models\n <\/td>\n Week 14\n  \n <\/td><\/tr>
\n 30\n <\/td>\n  10.2 Graph Terminology and Special Types of  Graphs\n <\/td><\/tr>
\n 31\n <\/td>\n 10.3 Representing\n Graphs and Graph Isomorphism \n <\/td>\n Week 15\n  \n <\/td><\/tr>
\n 32\n <\/td>\n 10.4 Connectivity\n <\/td><\/tr>
\n  \n <\/td>\n Test II <\/strong>\n <\/td>\n  \n <\/td><\/tr>
\n 33\n <\/td>\n Revision<\/strong>\n <\/td>\n  \n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

CM-202<\/h3>\n\n\n\n

<\/p>\n\n\n\n

COURSE DESCRIPTION<\/strong><\/p>\n\n\n\n
\n Course code number<\/strong>\n <\/td>\n CST-202\n <\/td>\n Course Title<\/strong>\n <\/td>\n Mathematics of Computing II<\/strong>\n <\/td><\/tr>
\n Semester hours<\/strong>\n <\/td>\n 4 hours\n <\/td>\n No. of Credit Units<\/strong>\n <\/td>\n 3\n <\/td><\/tr>
\n  <\/strong>\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n Course\n Coordinator<\/strong>\n  <\/strong>\n <\/td>\n Daw New Nwe San<\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

Course\nDescription<\/strong><\/p>\n\n\n\n

This course covers\nLaplace Transform, Infinite Sequences and Series, Parameterized<\/p>\n\n\n\n

Equations and Polar\nCoordinates, Vectors and The Geometry of Space.<\/p>\n\n\n\n

Textbook<\/strong><\/p>\n\n\n\n

  1. Thomas’ Calculus, 12 th Edition<\/em>,\nGeorge B, Thomas, Maurice D. Weir, Joel Hass.<\/p>\n\n\n\n

  2. Advanced Engineering Mathematics<\/em>,\n10th edition, by E.Kreyszig<\/p>\n\n\n\n

References<\/strong><\/p>\n\n\n\n

    Calculus: Early Transcendental, Eighth\nEdition by James Stewart.<\/p>\n\n\n\n

Course\nOutcomes<\/strong><\/p>\n\n\n\n

Students who complete\nthis course will be able to<\/p>\n\n\n\n

   1. Understand solving linear ODEs and\nrelated initial value problems, as well as<\/p>\n\n\n\n

       systems of linear ODEs, much easier\nusing Laplace Transform.<\/p>\n\n\n\n

   2. Represent a known differentiable function\nf(x) as an infinite sum of powers of x,<\/p>\n\n\n\n

      so it looks like a ”polynomial with\ninfinitely many terms.”<\/p>\n\n\n\n

   3. Understand the geometric definitions and\nstandard equations of parabolas,<\/p>\n\n\n\n

       ellipses, and hyperbolas (conic\nsections, or conics).<\/p>\n\n\n\n

   4. Understand three-dimensional coordinate\nsystems and vectors, the analytic<\/p>\n\n\n\n

       geometry of space, where they give\nsimple ways to describe lines, planes,<\/p>\n\n\n\n

       surfaces, and curves in space.<\/p>\n\n\n\n

Major\nTopics Covered in the Course<\/strong><\/p>\n\n\n\n

1. Laplace Transform<\/p>\n\n\n\n

2. Infinite Sequences\nand Series<\/p>\n\n\n\n

3. Parameterized Eqs\nand Polar Coordinates<\/p>\n\n\n\n

4. Vectors and The\nGeometry of Space<\/p>\n\n\n\n

Assessment\nPlan for the Course<\/strong><\/p>\n\n\n\n

Attendance    – 10%<\/p>\n\n\n\n

Quizzes          – 10%<\/p>\n\n\n\n

Assignment   – 10 %<\/p>\n\n\n\n

Test               – 10%<\/p>\n\n\n\n

Final Exam   – 60%<\/p>\n\n\n\n

Class\nAttendance and Participation Policy:<\/strong><\/p>\n\n\n\n

\u00b7 Attendance<\/strong><\/p>\n\n\n\n

    Class attendance is mandatory<\/strong>. Most\nof the material you will learn will be covered in<\/p>\n\n\n\n

the lectures, so it\nis important that you not miss any of them. You are expected to show<\/p>\n\n\n\n

up on\ntime for class, and stay for the whole lecture.\nStudents are expected to attend each<\/p>\n\n\n\n

class, to complete\nany required preparatory work (including assigned reading) and to<\/p>\n\n\n\n

participate actively\nin lectures, discussions and exercises.<\/p>\n\n\n\n

\u2022 Mobile phones must\n<\/strong>be silenced and put away for the entire lecture unless use is<\/p>\n\n\n\n

specified by the\ninstructor. You may not make or receive calls on your cell phone, or send<\/p>\n\n\n\n

or receive text\nmessages during lectures.<\/p>\n\n\n\n

\u2022 You are responsible\nfor all material sent as email. Ignorance of such material is no<\/p>\n\n\n\n

excuse. You are\nresponsible for all materials presented in the lectures.<\/p>\n\n\n\n

\u2022 Your conduct in\nclass should be conducive towards a positive learning environment for<\/p>\n\n\n\n

your class mates as\nwell as yourself.<\/p>\n\n\n\n

\u00b7 Quizzes,\nassignments, tests and Exam<\/strong><\/p>\n\n\n\n

     Your performance in this class will be\nevaluated using your scores for attendance,<\/p>\n\n\n\n

quizzes, homework\nassignments, two tests and one final examination. There are no<\/p>\n\n\n\n

planned extra credit\nprojects or assignments to improve your grade.<\/p>\n\n\n\n

      We will take a short quiz for every\nlecture.<\/p>\n\n\n\n

      There will be 6 homework assignments,\nroughly one per week. Please show all<\/p>\n\n\n\n

your work and write\nor type your assignments neatly. Credit cannot be given for answers<\/p>\n\n\n\n

without work (except\non true-false, always-sometimes-never, or other multiple choice<\/p>\n\n\n\n

questions).<\/p>\n\n\n\n

      Test will start after two or three\nchapters finished and the coordinator will<\/p>\n\n\n\n

announce the date for\nthe test.<\/p>\n\n\n\n

     Any assignment or quiz or test is simply\nmissed, regardless of the reason why<\/p>\n\n\n\n

(e.g. illness, work,\ntraffic, car trouble, computer problems, death, etc.), and earns a<\/strong><\/p>\n\n\n\n

grade\nof zero<\/strong>. You are strongly encouraged to complete all assignments and\nattend all<\/p>\n\n\n\n

quizzes so that you\ncan check that you understand the material and can throw out bad<\/p>\n\n\n\n

grades, or grades for\nwhich you had to miss an assignment or quiz for a valid reason.<\/p>\n\n\n\n

Late\nsubmissions will not be accepted for any graded activity for any reason.<\/strong><\/p>\n\n\n\n

\u00b7 There\nare no extra credit opportunities.<\/strong><\/p>\n\n\n\n

Students may not do\nadditional work nor resubmit any graded activity to raise a<\/p>\n\n\n\n

final grade.<\/p>\n\n\n\n

\u00b7 Exam<\/strong><\/p>\n\n\n\n

The exam will be\nconducted on-campus, in a classroom. The dates\/times\/locations<\/p>\n\n\n\n

will be posted on\nBoard as soon as possible.<\/p>\n\n\n\n

For this course, the\nfollowing additional requirements are specified:<\/p>\n\n\n\n

All work submitted\nfor a grade must have been prepared by the individual student.<\/p>\n\n\n\n

Students are\nexpressly prohibited from sharing any work that has been or will be<\/p>\n\n\n\n

submitted for a\ngrade, in progress or completed, for this course in any manner with a<\/p>\n\n\n\n

person other than the\ninstructor and teaching assistant(s) assigned to this course).<\/p>\n\n\n\n

Specifically,\nstudents may not do the following, including but not limited to:<\/p>\n\n\n\n

\u00b7 Discuss\nquestions, example problems, or example work with another person that<\/p>\n\n\n\n

leads to a similar\nsolution to work submitted for a grade.<\/p>\n\n\n\n

\u00b7 Give\nto, show, or receive from another person (intentionally, or accidentally<\/p>\n\n\n\n

because the work was\nnot protected) a partial, completed, or graded solution.<\/p>\n\n\n\n

\u00b7 Ask\nanother person about the completion or correctness of an assignment.<\/p>\n\n\n\n

\u00b7 Post\nquestions or a partial, completed, or graded solution electronically (e.g. a<\/p>\n\n\n\n

Web site).<\/p>\n\n\n\n

\u00b7 All\nwork must be newly created by the individual student for this course. Any<\/p>\n\n\n\n

usage of work\ndeveloped for another course, or for this course in a prior semester,<\/p>\n\n\n\n

is strictly\nprohibited without prior approval from the instructor.<\/p>\n\n\n\n

\u00b7 Posting\nor sharing course content (e.g. instructor provided lecture notes,<\/p>\n\n\n\n

assignment\ndirections, assignment questions, or anything not created solely by the<\/p>\n\n\n\n

student), using any\nnon-electronic or electronic medium (e.g. web site, FTP site,<\/p>\n\n\n\n

any location where it\nis accessible to someone other than the individual student,<\/p>\n\n\n\n

instructor and\/or\nteaching assistant(s)) constitutes copyright infringement and is<\/p>\n\n\n\n

strictly prohibited\nwithout prior approval from the instructor.<\/p>\n\n\n\n

Tentative\nLess<\/strong><\/p>\n\n\n\n
\n No\n <\/strong><\/strong>\n  <\/strong>\n <\/td>\n Chapter<\/strong>\n <\/td>\n Week<\/strong>\n <\/td><\/tr>
\n I<\/strong>\n <\/td>\n Chapter\n 12 Vectors and The Geometry of<\/strong>\n Space<\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n 1\n <\/td>\n  12.2 Vectors \n <\/td>\n Week 1+2\n <\/td><\/tr>
\n 2\n <\/td>\n  12.3 Dot Products (Scalar Products)\n <\/td><\/tr>
\n 3\n <\/td>\n  12.4 Cross Products \n <\/td><\/tr>
\n II<\/strong>\n <\/td>\n Chapter\n 6 Laplace Transform<\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n 4\n <\/td>\n  6.1 Laplace Transforms, Linearity, First\n Shifing\n Theorem (s- Shifting)\n <\/td>\n Week 3\n <\/td><\/tr>
\n 5\n <\/td>\n  6.2 Transforms of Derivatives and Integrals,ODEs\n <\/td>\n Week 4\n <\/td><\/tr>
\n 6\n <\/td>\n 6.3\n Unit Step function, Second Shifting\n Theorem\n <\/td>\n Week 5+6\n <\/td><\/tr>
\n 7\n <\/td>\n 6.5\n Convolution\n <\/td><\/tr>
\n  <\/strong>\n <\/td>\n Test 1<\/strong>\n <\/td><\/tr>
\n III<\/strong>\n <\/td>\n  Chapter 10 Infinite Sequences and Series<\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n 8\n <\/td>\n  10.1 Sequences \n <\/td>\n Week 7+8\n <\/td><\/tr>
\n 9\n <\/td>\n  10.2 Infinite Series\n <\/td><\/tr>
\n 10\n <\/td>\n 10.3\n the Integral test\n <\/td><\/tr>
\n 11\n  \n <\/td>\n  10.4 Comparison Tests \n  \n <\/td>\n Week 9\n <\/td><\/tr>
\n 12\n <\/td>\n  10.5 The Ratio and Root tests \n <\/td><\/tr>
\n 13\n <\/td>\n  10.6 Alternating Series, Absolute and\n Conditional\n Convergence\n <\/td>\n Week 10\n <\/td><\/tr>
\n 14\n <\/td>\n 10.7\n Power Series \n <\/td>\n Week 11\n <\/td><\/tr>
\n 15\n <\/td>\n  10.8 Taylor and Maclaurin Series\n <\/td><\/tr>
\n IV<\/strong>\n <\/td>\n Chapter11\n Parameterized Eqs and Polar<\/strong>\n Coordinates<\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n  <\/strong>\n <\/td><\/tr>
\n 16\n <\/td>\n  11. 1 Parametrizations of Plane Curves \n <\/td>\n Week 12\n <\/td><\/tr>
\n 17\n <\/td>\n 11.2\n Calculus with Parametric Curves \n <\/td><\/tr>
\n 18\n <\/td>\n 11.3\n Polar Coordinates \n <\/td>\n Week 13\n <\/td><\/tr>
\n 19\n <\/td>\n 11.5\n Area and Lengths in Polar Coordinates \n <\/td>\n Week 14\n <\/td><\/tr>
\n 20\n <\/td>\n 11.6\n Conic Section \n <\/td>\n Week 15\n <\/td><\/tr>
\n 21\n  \n <\/td>\n 11.7 Conic in Polar Coordinates \n <\/td><\/tr>
\n  <\/strong>\n <\/td>\n Test II<\/strong>\n <\/td><\/tr>
\n V<\/strong>\n <\/td>\n Revision<\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

<\/p>\n\n\n\n

CST-302<\/strong> <\/h3>\n\n\n\n

COURSE\nDESCRIPTION<\/strong><\/p>\n\n\n\n
\n Course code number<\/strong>\n <\/td>\n CST-302<\/strong>\n <\/td>\n Course Title<\/strong>\n <\/td>\n Mathematics of Computing III<\/strong>\n <\/td><\/tr>
\n Semester hours<\/strong>\n <\/td>\n 4 hours<\/strong>\n <\/td>\n No. of Credit Units<\/strong>\n <\/td>\n 3<\/strong>\n <\/td><\/tr>
\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n Course Coordinator<\/strong>\n <\/td>\n Daw Kyi Pyar Moe<\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

Course\nDescription<\/strong><\/p>\n\n\n\n

This course covers matrices, vectors, determinants,\nlinear systems, matrix eigenvalue problems, mathematical software design\nconsiderations, rudiments of floating point arithmetic, systems of linear\nequations, interpolation and data fitting integration and quadrature, linear\nleast squares and regression.<\/p>\n\n\n\n

Textbook<\/strong><\/p>\n\n\n\n

Advanced\nEngineering Mathematics, <\/em>10th<\/sup>\nedition, by E.Kreyszing<\/strong><\/p>\n\n\n\n

Course\nOutcomes<\/strong><\/p>\n\n\n\n

Students will be able to:<\/p>\n\n\n\n

  1. Know\nthe important characteristics of matrices, concepts of vector spaces and\nproperties of special categories of matrices.<\/li>
  2. Know\nhow to use characteristics of a matrix to solve a linear system of equation or\nstudy properties of a linear transformation.<\/li>
  3. Acquire\na working knowledge of algorithms for approximation solutions of scientific\ncomputing problems.<\/li><\/ol>\n\n\n\n

    Major\nTopic Covered in the Course<\/strong><\/p>\n\n\n\n

    1. Matrices,\nVectors, Determinants Linear Systems<\/li>
    2. Matrices\nEigen Value Problems<\/li>
    3. Solution\nof Equations by Iteration<\/li>
    4. Interpolation<\/li>
    5. Numeric\nIntegration and Differentiation<\/li><\/ol>\n\n\n\n

      Assessment\nPlan for the Course<\/strong>
      \n<\/strong>
      \n<\/strong><\/p>\n\n\n\n

                Attendance       –     \n10%<\/p>\n\n\n\n

                Quizzes            –      10%<\/p>\n\n\n\n

                Assignment      –     \n10%<\/p>\n\n\n\n

                Test                  –      10%<\/p>\n\n\n\n

                Final Exam      –     \n60%<\/p>\n\n\n\n

      Class attendance and Participation\nPolicy:<\/strong><\/p>\n\n\n\n

      • Attendance<\/strong><\/li><\/ul>\n\n\n\n

        Class\nattendance is mandatory<\/strong>. Most of the\nmaterial you will learn will be covered in the lectures, so it is important\nthat you not miss any of them. You are expected to show up on time for class, and stay\nfor whole lecture. Students are expected to attend each class, to\ncomplete any required preparatory work (including assigned reading) and to\nparticipate actively in lectures, discussions and exercises.<\/p>\n\n\n\n

        • Mobile phones must<\/strong> be silenced and put away for the entire lecture unless use is\nspecified by the instructor. You must be silenced and put away for the entire\nlecture unless use is specified by the instructor. You may not make or receive\ncalls on sour cell phones, or send or receive text message during lectures.<\/li>
        • You are responsible for all material\nsent as email. Ignorance of such material is no excuse. You are responsible for\nall materials presented in the lectures.<\/li>
        • Yours conduct in class should be\nconducive towards a positive learning environment for your class mates as well\nas yourself.<\/li><\/ul>\n\n\n\n
          • Quizzes,\nassignments, tests and Exam<\/strong><\/li><\/ul>\n\n\n\n

                    Your performance in this class will be\nevaluated using your sources for attendance, quizzes, homework assignments, two\ntests and one final examination. There are no planned extra credit projects or\nassignments to improve your grade.<\/p>\n\n\n\n

                     We will take a short quiz for every\nlecture.<\/p>\n\n\n\n

                     There will be 3 homework assignments,\nroughly one per week. Please show all your work and wire or type your\nassignment neatly. Credit cannot be given for answers without work (except on\ntrue-false, always-sometimes-never, or other multiple choice questions).<\/p>\n\n\n\n

                    \nTest will start after two or three chapters finished and the coordinator\nwill announce the date for the test.<\/p>\n\n\n\n

                     Any assignment or quiz or test is\nsimply missed, regardless of the reason why (e.g. illness, work, traffic, car\ntrouble, computer problems, deaths, etc.), and earns a grade of zero<\/strong>. You are strongly encouraged to complete all\nassignments and attend all quizzes so that you can check that you understand\nthe material and can throw out bad grades, or grades for which you had to miss\nan assignment or quiz for a valid reason. Late\nsubmissions will not be accepted for any graded activity for any reason<\/strong>.<\/p>\n\n\n\n

            • There\nare no extra credit opportunities.<\/strong><\/li><\/ul>\n\n\n\n

                    Students may not do\nadditional work nor resubmit any graded activity to raise a final grade.<\/p>\n\n\n\n

              • Exam<\/strong><\/li><\/ul>\n\n\n\n

                The\nexam will be conducted on-campus, in a classroom. The dates\/times\/locations\nwill be posted on Board as soon as possible.<\/p>\n\n\n\n

                For\nthis course, the following additional requirements are specified:<\/p>\n\n\n\n

                All\nwork submitted for a grade must have been prepared by the individual student.\nStudents are expressly prohibited from sharing any work that has been or will\nbe submitted for a grade, in progress or completed, for this course in any\nmanner with a person other than the instructor and teaching assistant(s)\nassigned to this course. Specifically, students may not do the following,\nincluding but not limited to:<\/p>\n\n\n\n

                • Discuss questions, example problems, or\nexample work with another person that leads to a similar solution to work\nsubmitted for a grade.<\/li>
                • Give to, show, or receive from another\nperson (intentionally, or accidentally because the work was not protected) a\npartial, completed or graded solution.<\/li>
                • Ask another person about the completed,\nor graded solution electronically (e.g. a Web site).<\/li>
                • All work must be newly created by the\nindividual student for this course. Any usage of work developed for another\ncourse, or for this course in a prior semester, is strictly prohibited without\nprior approval from the instructor.<\/li>
                • Posting or sharing course content (e.g.\ninstructor provided lecture notes, assignment directions, assignment questions,\nor anything not created solely by the student), using any non-electronic or\nelectronic medium (e.g. web site, FTP site, any location where it is accessible\nto someone other than the individual student, instructor and\/or teaching\nassistant(s)) constitutes copyright infringement and strictly prohibited\nwithout prior approval from the instructor.<\/li><\/ul>\n\n\n\n

                  Tentative\nLesson <\/strong><\/h2>\n\n\n\n
                  \n No <\/strong>\n <\/td>\n Topics\n <\/strong>\n <\/td>\n Week\n <\/strong>\n <\/td>\n Remark\n <\/strong>\n <\/td><\/tr>
                  \n I\n <\/strong>\n <\/td>\n Chapter 7Linear\n Algebra: Matrices, Vectors, Determinants. Linear Systems <\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
                  \n 1 \n <\/td>\n 7.1\n Matrices, Vectors: Addition and Scalar Multiplication \n <\/td>\n Week\n 1 \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 2 \n <\/td>\n 7.2\n Matrices Multiplication \n <\/td><\/td><\/tr>
                  \n 3 \n <\/td>\n 7.3\n   <\/strong>Linear Systems of Equations. Gauss\n Elimination \n <\/td>\n Week 2 \n <\/td><\/td><\/tr>
                  \n 4 \n <\/td>\n 7.4\n Linear Independent. Rank of a Matrix. Vector Space \n <\/td>\n Week 3 \n <\/td><\/td><\/tr>
                  \n 5\n <\/td>\n 7.6\n For Reference : Second- and Third-Order Determinants\n <\/td>\n Week\n 4 \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 6 \n <\/td>\n 7.7\n Determinants. Cramer\u2019s Rule \n <\/td><\/td><\/tr>
                  \n 7 \n <\/td>\n 7.8\n Inverse of a Matrix. Gauss-Jordan Elimination \n <\/td>\n Week 5 \n <\/td><\/td><\/tr>
                  \n II<\/strong>\n \n <\/td>\n Chapter 8 Linear\n Algebra: Matrices Eigen Value Problems<\/strong> \n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 8\n <\/td>\n 8.1\n The Matrix Eigenvalue Problem. Determining \n Eigenvalues\n and Eigenvectors \n <\/td>\n Week 6 \n <\/td><\/td><\/tr>
                  \n 9 \n <\/td>\n 8.3\n Symmetric, Skew-Symmetric and Orthogonal Matrices \n <\/td>\n Week 7 \n <\/td>\n  \n <\/td><\/tr>
                  \n  \n <\/td>\n Test I <\/strong>\n <\/td>\n  \n <\/td><\/td><\/tr>
                  \n III\n <\/strong>\n <\/td>\n Chapter 19 Numerics\n in General <\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 10 \n <\/td>\n 19.1\n Introduction \n <\/td>\n Week\n 8 \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 11 \n <\/td>\n 19.2\n Solution of Equations by Iteration \n <\/td><\/td><\/tr>
                  \n 12 \n <\/td>\n 19.3\n Interpolation \n <\/td>\n Week 9 \n <\/td><\/td><\/tr>
                  \n 13 \n <\/td>\n 19.5\n Numeric Integration and Differentiation \n <\/td>\n Week\n 10 \n <\/td><\/td><\/tr>
                  \n IV\n <\/strong>\n <\/td>\n Chapter 20 Numeric\n Linear Algebra <\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 14 \n <\/td>\n 20.2\n Linear Systems: LU-Factorization, Matrix Inversion \n <\/td>\n Week\n 11 \n <\/td><\/td><\/tr>
                  \n 15 \n <\/td>\n 20.3\n Linear Systems: Solution by Iteration \n <\/td>\n Week \n 12+13 \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 16 \n <\/td>\n 20.4\n Linear Systems: Ill-Conditioning, Norms \n <\/td><\/td><\/tr>
                  \n 17 \n <\/td>\n 20.5\n Least Squares Method \n <\/td>\n Week 14 \n  \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n 18 \n <\/td>\n 20.6\n Matrix Eigenvalue Problems: Introduction \n <\/td>\n  \n <\/td><\/tr>
                  \n 19 \n <\/td>\n 20.7\n Inclusion of Matrix Eigenvalues \n <\/td><\/td><\/tr>
                  \n 20 \n <\/td>\n 20.8\n Power Method for Eigenvalues \n <\/td>\n Week 15 \n  \n <\/td>\n  \n <\/td><\/tr>
                  \n  \n <\/td>\n Test II<\/strong>\n \n <\/td><\/td><\/tr>
                  \n  \n <\/td>\n Revision<\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                  CST-402 <\/strong> <\/h3>\n\n\n\n

                  COURSE\nDESCRIPTION<\/strong><\/p>\n\n\n\n
                  \n Course code number<\/strong>\n <\/td>\n CST-402<\/strong>\n Second<\/strong> Semester<\/strong>\n <\/td>\n Course Title<\/strong>\n <\/td>\n Mathematics of\n Computing IV<\/strong>\n <\/td><\/tr>
                  \n Semester hours<\/strong>\n <\/td>\n 4 hours<\/strong>\n  <\/strong>\n <\/td>\n No.of Credit\n Units<\/strong>\n <\/td>\n 3<\/strong>\n <\/td><\/tr>
                  \n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n Course Coordinator<\/strong>\n <\/td>\n Daw Myo Su Su\n Hlaing&<\/strong>\n Daw Mi Mi Hnin<\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                  Course Description<\/strong><\/p>\n\n\n\n
                  \n  \n CST-402.\n Mathematics of Computing IV \n  \n This\n course covers Applications of Recurrence Relations, Solving Linear Recurrence\n Relations,\n Generating Functions, Modeling Computation: Languages and Grammars,\n Finite-State\n Machines with Output, Finite-State Machines with No Output, Language\n Recognition\n and Turing Machines.\n  \n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                  Textbook<\/strong><\/p>\n\n\n\n
                  \n Discrete\n Mathematics and its Applications (Seventh Edition) <\/em>by\n KENNETH H. ROSEN\n  \n  <\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                              <\/strong>.<\/p>\n\n\n\n

                  Course Outcomes<\/strong><\/p>\n\n\n\n
                  \n After\n completing the course, the student will be able to:\n 1.\n Model, compare and analyse different computational models using combinatorial\n methods.\n 2.\n Apply rigorously formal mathematical methods to prove properties of\n languages,\n grammars\n and automata.\n 3.\n Construct algorithms for different problems and argue formally about\n correctness\n on\n different restricted machine models of computation.\n 4.\n Identify limitations of some computational models and possible methods of\n proving\n them.\n  \n  <\/strong>\n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                  University of Computer Studies (Dawei)<\/p>\n\n\n\n

                  B.C.Sc.\/B.C.Tech (Fourth Year)<\/p>\n\n\n\n

                  Major Topics Covered in the Course<\/strong><\/p>\n\n\n\n
                  \n  \n 1.\n Modeling With Recurrence Relations, Solving Linear Homogeneous and\n     Nonhomogeneous Recurrence Relations,\n Counting Problems and Generating\n     Functions\n 2.\n Phrase Structure Grammars, Derivation Trees, Backus-Naur Form, Finite State\n     Machines with output and no output.\n 3.\n Deterministic and Nondeterministic Finite State\n 4.\n Using Turing Machines to Recognize Sets\n  \n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                  Assessment Plan for the Course<\/strong><\/p>\n\n\n\n

                              <\/strong>Attendance     –    10%<\/p>\n\n\n\n

                              Quizzes           –    10%<\/p>\n\n\n\n

                              Assignment     –    10%<\/p>\n\n\n\n

                              Test                 –    10%<\/p>\n\n\n\n

                              Final Exam      –    60%<\/p>\n\n\n\n

                  Class Attendance and Participation\nPolicy<\/strong><\/p>\n\n\n\n

                  • Attendance<\/strong><\/strong><\/li><\/ul>\n\n\n\n

                    Class attendance is mandatory. <\/strong>Most of the material you will learn will be covered in\nthe<\/p>\n\n\n\n

                          lectures, so it is important that you not\nmiss any of them. You are expected to show up on time for       <\/p>\n\n\n\n

                          class, and stay for the whole lecture.\nStudents are expected to attended each class, to complete any        <\/p>\n\n\n\n

                          required preparatory work (including assigned\nreading) and to participate actively in lectures,  <\/p>\n\n\n\n

                          discussions and exercises.<\/p>\n\n\n\n

                    • Mobile phones must<\/strong> be silenced and put away for the entire lecture unless use is\nspecified by<\/li><\/ul>\n\n\n\n

                      the\ninstructor. You may not make or receive calls on your cell phone, or send or\nreceive text messages during lectures.<\/p>\n\n\n\n

                      • You are responsible for all materials\nsend as email. Ignorance of such material is no excuse. <\/li><\/ul>\n\n\n\n

                             You are responsible for all materials\npresented in the lectures.<\/p>\n\n\n\n

                        • Your conduct in class should be conducive\ntowards a positive learning environment for your<\/li><\/ul>\n\n\n\n

                          Class\nmates as well as yourself.<\/p>\n\n\n\n

                          • Quizzes,\nassignments, tests and Exam<\/strong><\/li><\/ul>\n\n\n\n

                            Your performance in\nthis class will be evaluated using your scores for attendance, quizzes,<\/p>\n\n\n\n

                                  homework assignments, two  tests and one final examination. There are no\nplanned extra credit    <\/p>\n\n\n\n

                                  projects or assignments to improve your\ngrade.<\/p>\n\n\n\n

                                        There will be 6 homework\nassignments, roughly one per week. Please show all your work and      <\/p>\n\n\n\n

                                  write or type your assignments neatly.\nCredit cannot be given for answers without work (except on <\/p>\n\n\n\n

                                  true-false, always-sometimes-never, or\nother multiple choice questions).<\/p>\n\n\n\n

                            University of Computer Studies (Dawei)<\/p>\n\n\n\n

                            B.C.Sc.\/B.C.Tech (Fourth Year)<\/p>\n\n\n\n

                                      Test will start after\none or two chapters finished and the coordinator will announce the date for the\ntest.<\/p>\n\n\n\n

                                        Any assignment or quiz or test is\nsimply missed, regardless of the reason why (e.g. illness, work, traffic, car trouble,\ncomputer problems, death etc.), and earns\na grade of zero. <\/strong>You are strongly encouraged to complete all assignments\nand attend all quizzes so that you can check that you understand the material\nand can throw out bad grades, or grades for which you had to miss an assignment\nor quiz for a valid reason.<\/p>\n\n\n\n

                            Late submissions will\nnot be accepted for any graded activity for any reason.<\/strong><\/p>\n\n\n\n

                            • There\nare no extra credit opportunities.<\/strong><\/li><\/ul>\n\n\n\n

                               Students may not do additional work nor\nresubmit any graded activity to raise a final grade.<\/p>\n\n\n\n

                              • Exam<\/strong><\/li><\/ul>\n\n\n\n

                                   The exam will conducted on-campus, in a classroom.\nThe dates\/times\/locations will be posted<\/p>\n\n\n\n

                                     on Board as soon as possible.<\/p>\n\n\n\n

                                For\nthis course, the following additional requirements are specified:<\/p>\n\n\n\n

                                All\nwork submitted for a grade must have been prepared by the individual student.\nStudents are expressly prohibited from sharing any work that has been or will\nbe submitted for a grade, in progress or completed, for this course in any\nmanner with a person other than the instructor and teaching assistant(s)\nassigned to this course. Specifically, students may not the following,\nincluding but not limited to:<\/p>\n\n\n\n

                                • Discuss questions, example problems, or\nexample work with another person that leads to a similar solution to work\nsubmitted for a grade.<\/li>
                                • Give to, show, or receive from another\nperson (intentionally, or accidentally because the work was not protected) a\npartial, completed, or graded solution.<\/li>
                                • Ask another person about the completion\nor correctness of an assignment.<\/li>
                                • Post questions or a partial, completed,\nor graded solution electronically (e.g. a Web site).<\/li>
                                • All work must be newly created by the\nindividual student for this course. Any usage of work developed for another\ncourse, or for this course in a prior semester, is strictly prohibited without\nprior approval from the instructor.<\/li>
                                • Posting o sharing course content (e.g.\ninstructor provide lecture notes, assignment directions, assignment questions,\nor anything not created solely by the student), using any non-electronic or\nelectronic medium (e.g. web site, FTP site, any location where it is accessible\nto someone other than the individual student, instructor and\/or teaching\nassistant(s)) constitutes copyright infringement and is strictly prohibited\nwithout prior approval from the instructor.<\/li><\/ul>\n\n\n\n

                                  University of Computer Studies (Dawei)<\/p>\n\n\n\n

                                  B.C.Sc.\/B.C.Tech (Fourth Year)<\/p>\n\n\n\n

                                  Tentative Lesson<\/strong><\/p>\n\n\n\n
                                  \n No.<\/strong>\n <\/td>\n Topics<\/strong>\n <\/td>\n Week<\/strong>\n <\/td>\n Remark<\/strong>\n <\/td><\/tr>
                                  \n I<\/strong>\n <\/td>\n Chapter 8 Advanced Counting Techniques<\/strong> <\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
                                  \n 1\n <\/td>\n 8.1 Applications of Recurrence Relations\n      Introduction; Modeling With Recurrence\n      Relations \n <\/td>\n Week 1-2\n <\/td>\n Assignment 1\n <\/td><\/tr>
                                  \n 2\n <\/td>\n 8.2\n Solving Linear Recurrence Relations \n       Introduction;\n      Solving Linear Homogeneous Recurrence\n      Relations with Constant Coefficients\n      Linear\n Nonhomogeneous Recurrence Relations                                                      \n with Constant Coefficients\n  \n <\/td>\n  Week 3-4-5\n <\/td>\n Assignment 2\n <\/td><\/tr>
                                  \n 3\n <\/td>\n  8.4 Generating Functions     \n        Introduction;\n        Useful Facts About Power Series\n       Counting Problems and Generating\n Functions\n       Using Generating Functions to Solve\n       Recurrence Relations\n       Proving Identities via Generating\n Functions\n  \n <\/td>\n Week 6-7\n <\/td>\n Assignment 3\n <\/td><\/tr>
                                  \n 4\n <\/td>\n Test I<\/strong>\n  \n  <\/strong>\n <\/td>\n  \n <\/td><\/tr>
                                  \n II<\/strong>\n <\/td>\n Chapter\n 13 Modeling Computation<\/strong>\n  <\/strong>\n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr>
                                  \n 5\n <\/td>\n 13.1\n Languages and Grammars Week 8\n        \n  Introduction;\n        Phrase-Structure Grammars\n        Types of Phrase-Structure Grammars\n        Derivation Trees \n        Backus\u2013Naur Form \n  \n <\/td>\n Week 8-9\n <\/td>\n Assignment 4\n <\/td><\/tr>
                                  \n 6\n <\/td>\n 13.2\n Finite-State Machines with Output            Introduction;\n         Finite-State Machines with Outputs\n  \n <\/td>\n         Week 10+11\n  \n <\/td>\n  \n <\/td><\/tr>
                                  \n 7\n <\/td>\n 13.3\n Finite-State Machines with No Output\n        Introduction;\n       Set of Strings\n       Finite-State Automata \n       Language Recognition by Finite-State\n       Machines\n       Nondeterministic Finite-State Automata\n  \n <\/td>\n           Week 12+13\n  \n <\/td>\n Assignment 5\n <\/td><\/tr>
                                  \n No<\/strong>\n  \n <\/td>\n Topics<\/strong>\n <\/td>\n Week<\/strong>\n <\/td>\n Remark<\/strong>\n <\/td><\/tr>
                                  \n 8\n <\/td>\n 13.4\n Language Recognition\n         Introduction;\n         Kleene\u2019s Theorem\n         Regular\n Sets and Regular Grammars\n         A Set\n Not Recognized by a Finite-State\n        Automaton\n        More\n Powerful Types of Machines \n <\/td>\n Week 14\n <\/td>\n Assignment 6\n <\/td><\/tr>
                                  \n 9\n <\/td>\n 13.5\n Turing Machines \n        Introduction;\n        Definition of Turing Machines\n       Using Turing Machines to Recognize Sets\n       Computing Functions with Turing\n Machines\n        Different Types of Turing Machines\n       The Church\u2013Turing Thesis\n       Computational Complexity,\n Computability,\n       and Decidability\n  \n <\/td>\n Week 15\n <\/td>\n  \n <\/td><\/tr>
                                  \n 10\n <\/td>\n Test II<\/strong>\n  <\/strong>\n <\/td>\n Test II<\/strong>\n  \n <\/td><\/tr>
                                  \n 11\n <\/td>\n Revision<\/strong>\n  \n <\/td>\n  \n <\/td><\/tr><\/tbody><\/table>\n\n\n\n

                                  <\/p>\n","protected":false},"excerpt":{"rendered":"

                                  Members Offer Subjects Subject Code Field of Study CST-102 Mathematics of Computing I CST-202 Mathematics of Computing II CST-302 Mathematics of Computing III CST-402 Mathematics of Computing IV CST-501 Mathematics of Computing V Paper II Mathematics of Computing I Course Description CM-121 COURSE DESCRIPTION Course code number   CM-121 Course Title Discrete Mathematics Semester hours […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages\/793"}],"collection":[{"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/comments?post=793"}],"version-history":[{"count":18,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages\/793\/revisions"}],"predecessor-version":[{"id":2754,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages\/793\/revisions\/2754"}],"wp:attachment":[{"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/media?parent=793"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}