{"id":790,"date":"2018-11-12T17:37:01","date_gmt":"2018-11-12T11:07:01","guid":{"rendered":"http:\/\/ucsdawei.moe.edu.mm\/?page_id=790"},"modified":"2020-11-02T16:00:15","modified_gmt":"2020-11-02T09:30:15","slug":"faculty-of-computer-science","status":"publish","type":"page","link":"https:\/\/ucs.pudawei.edu.mm\/faculty-of-computer-science\/","title":{"rendered":"Faculty of Computer Science (FCS)"},"content":{"rendered":"\n

Members<\/strong><\/span><\/h2>\n\n\n\n
\n
\n
\"\"
Dr. Aye Mon Yi
Professor
Head of FCS<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Hnin Thuzar Aye
Associate Professor<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Sint Sint Shein
Lecturer <\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Dr. Soe Lai Phyue
Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Lett Yi Kyaw
Lecturer<\/figcaption><\/figure><\/div>\n\n\n\n

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

\n
\n
\"\"
U Myo Myint Oo
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Moe Kalayar Naing
Assistant Lecturer<\/figcaption><\/figure><\/div>\n<\/div>\n\n\n\n
\n
\"\"
Daw Thinzar Tun
Assistant Lecturer <\/figcaption><\/figure><\/div>\n<\/div>\n<\/div>\n\n\n\n

Offer Subjects<\/strong><\/span><\/h2>\n\n\n\n
\n Subject Code<\/strong>\n <\/th>\n Field of Study<\/strong>\n <\/th><\/tr>
CST-201 <\/td> Java Programming<\/td><\/tr>
CST-203 <\/td> Digital Fundamentals II and Advanced Data Structure <\/td><\/tr>
CST-301<\/td>Computer Organization and Assembly, Operating System<\/td><\/tr>
CS-306<\/td>Advanced Programming Techniques<\/td><\/tr>
CS-403 <\/td> Analysis of Algorithms and Operating System<\/td><\/tr>
CT-401 <\/td> Artificial Intelligence, Database Management System<\/td><\/tr>
CST-502<\/td> Distributed Computing System and Advanced Networking<\/td><\/tr>
CS-504<\/td> Advanced Artificial Intelligence
Computing Applied Algorithms
Computer Vision & Interactive Computer Graphics<\/td><\/tr>
Paper I<\/td> Introduction to Computer Fundamental, System, Programming in C++, Structure
Operating System Concept, Programming in Java, Artificial Intelligence, Programming Language in Concepts<\/td><\/tr>
Paper IV<\/td> Web Programming in PHP, C# Programming in Microsoft Platform<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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


  Course Description<\/strong> <\/h1>\n\n\n\n

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

Second Semester<\/strong><\/h2>\n\n\n\n


CST- 201 (Advanced Java Programming)<\/strong> <\/h3>\n\n\n\n

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

\n Course code <\/strong>\n number<\/strong>\n <\/td>\n CST-201<\/strong>\n Second\n Semester<\/strong>\n <\/td>\n Course Title<\/strong>\n <\/td>\n Advanced Java Programming <\/strong>\n <\/td><\/tr>
\n Semester   hours<\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n  <\/strong>\n <\/td><\/tr>
\n Prerequisite<\/strong>\n <\/td>\n Basic Java Programming, Database\n Concept<\/strong>\n <\/td>\n  <\/strong>\n <\/td>\n Daw Myat Thuzar Soe, <\/strong>\n Assistant Lecture,<\/strong>\n Faculty of Computer Science<\/strong>\n <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

  • To\nexplain how to develop client-server programs in java.<\/li>
  • To\nlearn and develop distributed Java applications using Remote Method Invocation\n(RMI)<\/li>
  • To\nknow and fundamentals of Java Web application development features, such as the\nJava Servlet, Java Server Page, and Java Standard Tag Library (JSTL)<\/li>
  • To\ndevelop a dynamic wen application by the use of servlet, JSTL, JSP and database\ntechnology<\/li>
  • To\nbe able to develop a small web project independently.<\/li><\/ul>\n\n\n\n

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

                       <\/strong>The outline of\nthe course covers the following topics:<\/p>\n\n\n\n

    • Networking\nBasics & Java Networking using Sockets<\/li>
    • Understanding\nRMI<\/li>
    • Web-based\narchitecture<\/li>
    • Java\nServer Page (JSP) technology<\/li>
    • Java\nServlet technology<\/li>
    • Java\nStandard Tag Library (JSTL) technology<\/li>
    • JDBC\nand Database Programming<\/li><\/ul>\n\n\n\n

      Learning\nOutcomes:<\/strong><\/p>\n\n\n\n

                 After\nthe completion of this course, the students will be able<\/p>\n\n\n\n

      • to recognize and understand both the\nelements and characterizing of client-server architecture in java programming<\/li>
      • to know the architecture of RMI,\nunderstand how to serialize an object, create and implement the class that can\nbe used to create remote server objects<\/li>
      • to know how to design and build a web\napplication using Servlet, JSP, JSTL<\/li>
      • to know how to interact with database\nand how to plan  web development<\/li>
      • to gain the skills and project-based\nexperience needed for entry into web application<\/li><\/ul>\n\n\n\n

        Exam\nAssessment:<\/strong><\/p>\n\n\n\n

                               Paper\nExam                             50%<\/p>\n\n\n\n

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

                               Quiz                                        5%<\/p>\n\n\n\n

                               Tutorial                                    10%<\/p>\n\n\n\n

                               Practical                                  5%<\/p>\n\n\n\n

                               Attendances                            5%<\/p>\n\n\n\n

                               Project                                     15% <\/p>\n\n\n\n

        CS -201 (Principle of Computer Science I)<\/strong> <\/h2>\n\n\n\n

        Course Title: Principle\nof Computer Science I
        \n
        \nCourse Objectives<\/strong><\/p>\n\n\n\n

        The objective of this\nclass is to expose the student to procedural programming using C++ and to <\/p>\n\n\n\n

        increase the depth of\nstudents’ knowledge about several implementation issues. Knowing C++ will be\nuseful in the students\u2019 jobs in IT organizations as developers or managers\nbecause it will enable them to code efficiently, communicate effectively with\ncolleagues and understand and improve software development practices in their\norganizations. <\/p>\n\n\n\n

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

        This course teaches the\nstudent to apply fundamental procedural programming concepts to the <\/p>\n\n\n\n

        programming language\nC++. Programming principles and constructs, such as data types, common control\nflow structures, basic data structures, and console and file input\/output will\nbe presented.<\/p>\n\n\n\n

        Learning Outcomes<\/strong><\/p>\n\n\n\n

        At the end of the\ncourse, a student completing this course will be able to: <\/p>\n\n\n\n

        \u2022 Apply elementary\ntechniques involving arithmetic operators and mathematical expressions in C++\nprogramming<\/p>\n\n\n\n

        \u2022 Choose an appropriate\ndata type to represent data<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat use selection (if, switch, conditional operator)<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat use loops (while, do while, for)<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat use sequential files for input and output<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat make use of functions for transfer of control<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat use arrays, including sorting and searching arrays<\/p>\n\n\n\n

        \u2022 Write C++ programs\nthat use pointers<\/p>\n\n\n\n

        \u2022 Solve programming\nproblems using C++<\/p>\n\n\n\n

        Text Books:<\/strong><\/p>\n\n\n\n

        1. Object-Oriented\nProgramming in C++ (Fourth Edition) by Robert Lafore <\/p>\n\n\n\n

        Reference Books :<\/p>\n\n\n\n

        [1] \u201cComputer\nProgramming and Techniques\u201d, University of Computer Studies Yangon. (Old <\/p>\n\n\n\n

        Book)<\/p>\n\n\n\n

        [2] C Programming for\nEngineering & Computer Science by H.H. Tan and T.B. D\u2019Orazio<\/p>\n\n\n\n

        [3] C++ Language\nTutorial (e-book)<\/p>\n\n\n\n

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

        Student participation in\nthis course will involve the following activities:<\/p>\n\n\n\n

        1. Attending the\nlectures<\/p>\n\n\n\n

        2. Practical \/\nAssignments<\/p>\n\n\n\n

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

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

        5. Project<\/p>\n\n\n\n

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

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

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

        Test \/ Quiz – 15 %<\/p>\n\n\n\n

        Practical \/ Attendances\n– 10 %<\/p>\n\n\n\n

        Project – 15%<\/p>\n\n\n\n

        CST-203 :<\/strong> Advanced Data Structure <\/h3>\n\n\n\n

        Second Semester Text\nBook<\/strong>:Data Structures & Algorithms in Java (2nd Edition) by Robert\nLafore <\/p>\n\n\n\n

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

        This course covers techniques for the data structure and\nalgorithm with java. Topics include: Bubble Sort, Selection Sort, Insertion\nSort, Recursion, Binary Trees, Hash Tables, Heaps, Graphs. <\/p>\n\n\n\n

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

        The aim of this course: <\/p>\n\n\n\n

        -To understand algorithms and its analysis procedure. <\/p>\n\n\n\n

        – To design and implement various data structure algorithms.<\/p>\n\n\n\n

        – To introduce various techniques for representation of the\ndata in the real world.<\/p>\n\n\n\n

        – To develop application using data structure algorithms. <\/p>\n\n\n\n

        -To compute the complexity of various algorithms <\/p>\n\n\n\n

        Learning Outcomes <\/strong><\/p>\n\n\n\n

        Student will be able to \n<\/p>\n\n\n\n

        -Select appropriate data structures as applied to specified\nproblem definition. <\/p>\n\n\n\n

        -Implement operations like searching, insertion, and\ndeletion, traversing mechanism etc. on various data structures. <\/p>\n\n\n\n

        -Implement appropriate sorting\/searching technique for given\nproblem. \uf0b7 Determine and analyze the complexity of given algorithms. <\/p>\n\n\n\n

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

         1. Data Structures\nand Algorithms Analysis in Java (Third Edition) by Mark Allen Weiss (E-book) <\/p>\n\n\n\n

        2. Object-Oriented Data Structures using Java by Nell Dale,\nDaniel T. Joyce, Chip Weems<\/p>\n\n\n\n

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

        Student participation in the course will involve the\nfollowing activities: <\/p>\n\n\n\n

        1. Attending the lectures <\/p>\n\n\n\n

        2. Tutorial <\/p>\n\n\n\n

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

        4. Practical assignments <\/p>\n\n\n\n

        5. Exams <\/p>\n\n\n\n

        Assessment plan for\nthe course <\/strong><\/p>\n\n\n\n

        1. Paper Exam  60%<\/p>\n\n\n\n

         2. Attendances 10% <\/p>\n\n\n\n

        3. Tutorial  10% <\/p>\n\n\n\n

        4. Assignment 10% <\/p>\n\n\n\n

        5. Practical assignments 10% <\/p>\n\n\n\n

        Period: 60 Periods (Lecture-44periods + Lab-16periods) for\n15weeks (50 minutes for 1 period)<\/p>\n\n\n\n

        \n No.\n <\/td>\n Chapter\n <\/td>\n Page\n <\/td>\n Periods\n <\/td>\n Detail Lecture Plan\n <\/td><\/tr>
        \n  \n <\/td>\n Chapter 3Simple Sorting<\/strong>\n <\/td>\n 77 to 111<\/strong>\n <\/td>\n 8<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 1\n <\/td>\n How Would You Do It? Bubble Sort    \n Bubble Sort on the Baseball Players    \n The Bubble Sort Workshop Applet    \n Java Code for a Bubble Sort    \n Efficiency of the Bubble Sort \n  \n <\/td>\n 78- 88 \n <\/td>\n 2 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 2\n <\/td>\n Selection Sort     Selection\n Sort on the Baseball Players     The\n Selection Sort Workshop Applet     Java\n Code for a Selection Sort    \n Efficiency of the Selection Sort \n  \n <\/td>\n 89-95 \n <\/td>\n 2 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 3\n <\/td>\n Insertion Sort     Insertion\n Sort on the Baseball Players     The\n InsertionSort Workshop Applet     Java\n Code for a Insertion Sort    \n Efficiency of the Insertion Sort Comparing the Simple Sorts \n  \n <\/td>\n 95-103 \n  \n  \n  \n 108 \n  \n <\/td>\n 1 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 4\n <\/td>\n Lab examples and exercises  \n <\/td>\n  \n <\/td>\n 2\n <\/td>\n  \n <\/td><\/tr>
        \n 5\n <\/td>\n  Questions Chapter Review \n  \n <\/td>\n 109-111 \n <\/td>\n 1 \n <\/td>\n 1 to 15\n <\/td><\/tr>
        \n  \n <\/td>\n Chapter 6 Recursion\n <\/strong>\n <\/td>\n 251 to 311 <\/strong>\n <\/td>\n 12<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 6\n <\/td>\n Triangular Numbers Finding the nth Term Using a Loop Finding the nth\n Term Using Recursion \n  \n <\/td>\n 251-252 \n 252-253\n  253-255 \n  \n <\/td>\n 1 \n  \n <\/td>\n Brief Explain \n  \n Detail Explain\n <\/td><\/tr>
        \n 7\n <\/td>\n The triangle.java Program What\u2019s Really Happening? \n  \n <\/td>\n 255-259 \n <\/td>\n 1 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 8\n <\/td>\n Characteristics of Recursive Methods Is Recursion Efficient?\n Mathematical Induction Factorials\n <\/td>\n 259-260 \n  \n  \n 260-262\n <\/td>\n 1 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 9\n <\/td>\n A Recursive Binary Search Divide-and-Conquer Algorithms\n <\/td>\n 268-269 \n 272-273\n <\/td>\n 1 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 10\n <\/td>\n Mergesort \n Merging Two Sorted Arrays\n <\/td>\n 279-282\n <\/td>\n 2 \n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 11\n <\/td>\n The MergeSort Workshop Applet The mergeSort.java Program Efficiency\n of the Mergesort Eliminating Recursion\n <\/td>\n 285-287 \n 287-294 \n  \n 294\n <\/td>\n 1\n <\/td>\n Trace the program Brief Explain\n <\/td><\/tr>
        \n 12\n <\/td>\n Lab examples and exercises\n <\/td>\n  \n <\/td>\n 2\n <\/td>\n  \n <\/td><\/tr>
        \n 13\n <\/td>\n Questions \n Chapter Review\n <\/td>\n 310-311 \n <\/td>\n 1\n <\/td>\n 1 to 6, 9, 11 to 15\n <\/td><\/tr>
        \n 14\n <\/td>\n Tutorial\n <\/td>\n  \n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n 15\n <\/td>\n Assignment\n <\/td>\n  \n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n  \n <\/td>\n Chapter 8\n Binary Trees<\/strong>\n <\/td>\n 366 to 424 <\/strong>\n <\/td>\n 16<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 16\n <\/td>\n Why Use Binary Trees? \n What Is a Tree? Tree Terminology\n <\/td>\n 366-370 \n <\/td>\n 1\n <\/td>\n  Detail Explain\n <\/td><\/tr>
        \n 17\n <\/td>\n How Do Binary Search Trees work? \n Representing the Tree in Java Code\n <\/td>\n 371-376\n <\/td>\n 1\n <\/td>\n  Detail Explain\n <\/td><\/tr>
        \n 18\n <\/td>\n Finding a Node Java Code for Finding a Node Inserting a Node Java\n Code for Inserting a Node\n <\/td>\n 376-381\n <\/td>\n 2\n <\/td>\n  Detail Explain\n <\/td><\/tr>
        \n 19\n <\/td>\n Traversing the Tree Inorder Traversal Java Code for Traversing\n Traversing a Three-Node Tree Traversing with the Workshop Applet Preorder and\n Postorder Traversals \n <\/td>\n 381-388 \n <\/td>\n 3\n <\/td>\n Explain the codes for Preorder and Postorder Traversals\n <\/td><\/tr>
        \n 20\n <\/td>\n Finding Maximum and Minimum Values Deleting a Node The efficiency of\n Binary Trees \n  \n <\/td>\n 388-389\n 389-401\n 401-403 \n  \n <\/td>\n 4\n <\/td>\n Detail Explain. For delete case, mainly explain delete operation with\n figures rather than Java Codes\n <\/td><\/tr>
        \n 21\n <\/td>\n Trees Represented as Arrays \n <\/td>\n 403-404 \n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 22\n <\/td>\n Lab examples and exercises\n <\/td>\n  \n <\/td>\n 3\n <\/td>\n  \n <\/td><\/tr>
        \n 23\n <\/td>\n Questions Chapter Review \n <\/td>\n 423-424 \n <\/td>\n 1\n <\/td>\n  2 to 13\n <\/td><\/tr>
        \n  \n <\/td>\n Chapter  11 Hash Tables <\/strong>\n <\/td>\n 519 to 577 <\/strong>\n <\/td>\n 12<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 24\n <\/td>\n Hash table\n Introduction to Hashing \n A Dictionary \n Hashing Collisions\n Clustering\n Quadratic Probing\n  Double Hashing\n <\/td>\n 519-552 \n <\/td>\n 3\n <\/td>\n Brief Explain\n <\/td><\/tr>
        \n 25\n <\/td>\n Separate Chaining\n Hash Functions \n Folding \n  \n <\/td>\n 552-566\n <\/td>\n 3\n <\/td>\n Brief Explain\n <\/td><\/tr>
        \n 26\n <\/td>\n Hashing Efficiency \n <\/td>\n 566-571\n <\/td>\n 1\n <\/td>\n Brief Explain\n <\/td><\/tr>
        \n 27\n <\/td>\n Lab examples and exercises  \n <\/td>\n  \n <\/td>\n 2\n <\/td>\n  \n <\/td><\/tr>
        \n 28\n <\/td>\n Questions Chapter Review\n <\/td>\n 575-576\n <\/td>\n 1\n <\/td>\n 1 to 15\n <\/td><\/tr>
        \n 29\n <\/td>\n Tutorial\n <\/td>\n  \n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n 30\n <\/td>\n Assignment\n <\/td>\n  \n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n  \n <\/td>\n Chapter  12 Heaps <\/strong>\n <\/td>\n 579 to 613 <\/strong>\n <\/td>\n 7<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 31\n <\/td>\n Introduction to Heaps \n <\/td>\n 580-582 \n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 32\n <\/td>\n Removal\n Insertion \n <\/td>\n 583-585 \n <\/td>\n 2\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 33\n <\/td>\n Heap Sort \n The Efficiency of Heapsort \n  \n <\/td>\n 601-609\n  610\n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n 34\n <\/td>\n Lab examples and exercises\n <\/td>\n  \n <\/td>\n 2\n <\/td>\n  \n <\/td><\/tr>
        \n 35\n <\/td>\n Questions \n Chapter Review \n <\/td>\n 611-612\n  \n <\/td>\n 1\n <\/td>\n  1 to 10\n <\/td><\/tr>
        \n  \n <\/td>\n Chapter  13 Graphs <\/strong>\n <\/td>\n 615 to 668 <\/strong>\n <\/td>\n 5<\/strong>\n <\/td>\n  \n <\/td><\/tr>
        \n 36\n <\/td>\n Introduction to Graphs \n Definitions \n <\/td>\n 615-618 \n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 37\n <\/td>\n Representing a Graph in a Program \n <\/td>\n 619-621 \n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 38\n <\/td>\n Depth-First Search \n <\/td>\n 625-626\n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 39\n <\/td>\n Breadth-First Search \n <\/td>\n 636-637\n <\/td>\n 1\n <\/td>\n Detail Explain\n <\/td><\/tr>
        \n 40\n <\/td>\n Tutorial\n <\/td>\n  \n <\/td>\n 1\n <\/td>\n  \n <\/td><\/tr>
        \n  \n <\/td>\n  \n <\/td>\n  \n <\/td>\n  \n <\/td>\n  \n <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

        CST-301  :Operating Systems<\/strong><\/h3>\n\n\n\n

        Text books           :<\/strong>Operating  Systems  Internals and Design Principles(7th<\/sup>\nEdition) by William Stallings<\/p>\n\n\n\n

        \n Course code number\n <\/td>\n CST-301\n First Semester \n <\/td>\n Course Title\n <\/td>\n Operating Systems\n <\/td><\/tr>
        \n Semester\n Hours\n <\/td>\n 3 Hours\n <\/td>\n No of Credit Units\n <\/td>\n 3\n <\/td><\/tr>
        \n  \n <\/td>\n  \n <\/td>\n  \n <\/td>\n Daw Sint Sint Shein\n <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

        The course aims to explore the importance of the\noperating system and its function. The different techniques used by the\noperating system to achieve its goals as resource manager. Topics include:\nOperating System overview, Process Description and Control, Threads,\nUniprocessor scheduling and File Management.<\/p>\n\n\n\n

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

        -To\nintroduce basic concepts of Operating System, its functions and services<\/p>\n\n\n\n

        -To\nlearn the mechanisms of OS to handle process and threads and their\ncommunication<\/p>\n\n\n\n

        -To\nunderstand the scheduling technique use in OS and access the performance of\ndifference scheduling policies<\/p>\n\n\n\n

        Learning\noutcomes<\/strong><\/p>\n\n\n\n

        -Understand\nthe structure of Operating Systems and basic architectural components involved\nin OS<\/p>\n\n\n\n

        -Understand\nhow to manage files, memory, I\/O, processes and threads<\/p>\n\n\n\n

        -Understand\nthe various scheduling polices and evaluate their performance<\/p>\n\n\n\n

        Assessment plan\nfor the course<\/strong><\/p>\n\n\n\n

        1.\nPaper Exam     -60%<\/p>\n\n\n\n

        2.\nTutorial            -10%<\/p>\n\n\n\n

        3.\nAssignment      -10%<\/p>\n\n\n\n

        4.\nAttendances     -10%<\/p>\n\n\n\n

        5. Discussion\/Quiz         -10% <\/p>\n\n\n\n


        CS \u2013 306 Professional Ethics in IT<\/strong> <\/h2>\n\n\n\n

        <\/h2>\n\n\n\n
        \n Course\n Code \n Number\n <\/td>\n CS\n \u2013 306\n Second\n Semester\n <\/td>\n Course\n Title\n <\/td>\n Professional\n Ethics in IT\n <\/td><\/tr>
        \n Semester\n Hour\n  \n <\/td>\n 4\n Hours\n <\/td>\n No.\n of Credit Units\n <\/td>\n 3\n <\/td><\/tr>
        \n Prerequisite\n  \n <\/td>\n None\n <\/td>\n Course\n Coordinator\n <\/td>\n Dr.\n Nwe Ni Aung\n <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

        Course\nAims:<\/strong><\/p>\n\n\n\n

                    Ethics in Information Technology addresses the different\naspects of ethics in Information Technology and describes the techniques to\navoid of practical business information for business managers and IT\nprofessionals. We also discuss Ethics for IT workers and IT users, Computer and\nInternet Crimes, Privacy, Intellectual Property and the varying degrees of\nownership protections.<\/p>\n\n\n\n

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

                    Students\ncan learn to understand the critical importance of ethics as it applies to IT\nand to make the ethical decisions based on the technical survey and sense of\nethics.<\/p>\n\n\n\n

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

        • An Overview of Ethics provides an\nintroduction to ethics, ethics in business and the relevance of discussing\nethics in IT.<\/li>
        • Ethics for IT workers and IT users\nemphasizes the significance of IT professional organizations and their codes of\nethics and also discusses the roles that certification and licensing can play\nin legitimizing professional standards.<\/li>
        • Privacy explains how the use of IT\naffects privacy rights and discusses several key pieces of legislation, and law\ndesigned to protect personal information, health data and Electronic Surveillance.<\/li>
        • Intellectual Property explains the\nvarious degrees of ownership protection offered by Copyright, Patents, Trade\nSecrets, and key Intellectual Property issues such as plagiarism, reverse\nengineering of software, open source code, competitive intelligence gathering\nand cyber-squatting.<\/li><\/ul>\n\n\n\n

          Reference Materials:<\/strong><\/p>\n\n\n\n

          Ethics\nin Information Technology, George W. Reynolds, Fifth Edition<\/p>\n\n\n\n

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

          Assessments\nevaluation will be<\/p>\n\n\n\n

          1. Assignment                                                     –\n10%<\/li>
          2. Class\nparticipation                                           –\n20%<\/li>
          3. Quizz\/Moodle                                                 –\n10%<\/li>
          4. Group\npresentation                                         –\n30%<\/li>
          5. Evaluation\nReport (or) Term paper Report     – 30%<\/li><\/ol>\n\n\n\n

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

            CS \u2013 403: Operating Systems<\/strong> <\/h2>\n\n\n\n

            Text Books: Operating Systems Internals and Design\nPrinciples (7th<\/sup> Edition) By William Stalling<\/p>\n\n\n\n

            \n Course\n Code Number\n <\/td>\n CS\n \u2013 403\n Second\n Semester\n <\/td>\n Course\n Title\n <\/td>\n Operating\n Systems\n <\/td><\/tr>
            \n Semester Hours          \n  \n <\/td>\n 4\n Hours\n <\/td>\n No\n of Credit Units\n <\/td>\n 3\n <\/td><\/tr>
            \n Prerequisite\n  \n <\/td>\n CST\n – 301\n <\/td>\n Course\n Coordinator\n <\/td>\n Dr.\n Nwe Ni Aung\n <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

                        This course describes the concepts, structure and\nmechanisms of operating systems. The purpose of this course is to present as\nclearly and completely as possible, the nature and characteristics of\nmodern-day operating systems. It also provides a thorough discussion of the\nfundamentals of operating system design and to relate these to contemporary\ndesign issues and to current directions in the development of operating\nsystems.<\/p>\n\n\n\n

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

            • To understand the basic concepts related\nto concurrency, mutual exclusion requirements and OS concerns<\/li>
            • To know the efforts of concurrent\nprocessing \u2013 deadlock and starvation<\/li>
            • To study the various OS mechanisms used\nto implement the virtual memory<\/li>
            • To discuss the key design issues in\nmultiprocessor thread scheduling and real-time scheduling requirements<\/li>
            • To provide the characteristics of\nembedded operating system and the key concepts of embedded systems<\/li>
            • To understand the spectrum of computer security\nattacks and the types of intrusion techniques used to breach computer security<\/li><\/ul>\n\n\n\n

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

              • Understanding the central themes of\nmodern operating system, the fundamental technology of OS design considerations\nand the general approaches to dealing with deadlock<\/li>
              • Knowing the virtual memory approaches :\npaging and segmentation and how the multiprocessors scheduling access to the\nsame main memory<\/li>
              • Understanding the embedded operating\nsystem concepts and computer security concepts<\/li><\/ul>\n\n\n\n

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

                1. Operating\nSystems Internals and Design Principles (5th<\/sup> Edition) By William\nStalling<\/li>
                2. A\nSilberschatz, P.B. Galvin, G.Gagne, Operating Systems Principles, 7th<\/sup>\nEdition 2006<\/li><\/ol>\n\n\n\n

                  Assessments methods<\/strong><\/p>\n\n\n\n

                  1. Class\nparticipation                   – 10%<\/li>
                  2. Quizz                                       – 10%<\/li>
                  3. Assignment\/Lab                      – 10%<\/li>
                  4. Tutorial                                    – 10%<\/li>
                  5. Final\nExam                              – 60%<\/li><\/ol>\n\n\n\n

                    CS \u2013 406 : Computer Vision and Interactive Computer Graphics <\/strong> <\/h2>\n\n\n\n

                    Text Books : Computer Graphics C\nVersion, Second Edition, Donald Hearn and M. <\/strong><\/p>\n\n\n\n

                    PaulineBaker,1997.<\/p>\n\n\n\n

                    Course Code : CS-406<\/strong><\/p>\n\n\n\n

                    Course Title Computer Vision and Interactive\nComputer Graphics<\/p>\n\n\n\n

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

                    The aim of this course is to provide the concept of\ncomputer graphics application, 2D  computer\ngraphics techniques and the overview of 3D computer graphics.<\/p>\n\n\n\n

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

                    \u2022 To study the general concepts of 3D computer\ngraphics.<\/p>\n\n\n\n

                    \u2022 To understand and apply 2D computer graphics\ntechniques<\/p>\n\n\n\n

                    \u2022 To design and create program using graphics\nprogramming techniques<\/p>\n\n\n\n

                    Learning Outcomes<\/strong><\/p>\n\n\n\n

                    On successfully\ncompleting the course, students will be able to demonstrate knowledge and\nunderstanding of fundamental principles in 2D computer graphics, and apply them\nto the design of algorithms for graphics applications. Students will be able to\ndevelop graphics programs to model various types of two-dimensional scenes.\nStudents will also gain skills necessary for the study of advanced concepts and\ntechniques in the field of computer graphics.<\/p>\n\n\n\n

                    Course Contents:<\/strong><\/p>\n\n\n\n

                    \u2022 Overview of computer graphics system and\napplications<\/p>\n\n\n\n

                    \u2022 Output primitives<\/p>\n\n\n\n

                    \u2022 Attributes of output primitives<\/p>\n\n\n\n

                    \u2022 2D geometric transformations<\/p>\n\n\n\n

                    \u2022 2D viewing<\/p>\n\n\n\n

                    \u2022 3D basic concepts<\/p>\n\n\n\n

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

                    1. Computer Graphics (Second Edition) Schaum’s\nOutlines by Zhigang Xiang, Roy A. Plastock<\/p>\n\n\n\n

                    2. Interactive Computer Graphics A Top-down Approach\nwith Shader-Based OPENGL (6th<\/sup> Edition) by Edward Angel, Dave\nShreiner<\/p>\n\n\n\n

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

                    Your participation in the course will involve six\nforms of activity:<\/p>\n\n\n\n

                    1. Attending the lectures.<\/p>\n\n\n\n

                    2. Preparing for and participating in the\nrecitations.<\/p>\n\n\n\n

                    3. Laboratory assignments.<\/p>\n\n\n\n

                    4. Reading the text.<\/p>\n\n\n\n

                    5. Exams<\/p>\n\n\n\n

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

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

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

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

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

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

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

                    Exam  – 50%<\/p>\n","protected":false},"excerpt":{"rendered":"

                    Members Offer Subjects Subject Code Field of Study CST-201 Java Programming CST-203 Digital Fundamentals II and Advanced Data Structure CST-301 Computer Organization and Assembly, Operating System CS-306 Advanced Programming Techniques CS-403 Analysis of Algorithms and Operating System CT-401 Artificial Intelligence, Database Management System CST-502 Distributed Computing System and Advanced Networking CS-504 Advanced Artificial Intelligence Computing […]<\/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\/790"}],"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=790"}],"version-history":[{"count":44,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages\/790\/revisions"}],"predecessor-version":[{"id":3392,"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/pages\/790\/revisions\/3392"}],"wp:attachment":[{"href":"https:\/\/ucs.pudawei.edu.mm\/api\/wp\/v2\/media?parent=790"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}