This action might not be possible to undo. Are you sure you want to continue?
COMPUTER SCIENCE, SOFTWARE ENGINEERING AND INFORMATION TECHNOLOGY
IO EDUC AT N
IO SS N C O M MI
HIGHER EDUCATION COMMISSION ISLAMABAD
CURRICULUM DIVISION, HEC
Dr. Syed Sohail H. Naqvi Prof. Dr. Altaf Ali G. Shaikh Miss Ghayyur Fatima Mr. M. Tahir Ali Shah Mr. Shafiullah Khan Executive Director Member (Acad) Director (Curri) Deputy Director (Curri) Deputy Director
TABLE OF CONTENTS
1. Introduction………………………………………………………… 2. Computing …………………………………………………………. Computer Science Software Engineering Information Technology 3. Structures for BS Programme……………………………………… 4. Course Contents (Computing-Core Courses)……………………. 5. Computer Science Curricula – 2009……………………………… BS in Computer Science ………………………………………. MS in Computer Science………………………………………. 6. Software Engineering Curricula - 2009 ………………………… BS in Software Engineering MS in Software Engineering ………………………………… 7. Information Technology Curricula - 2009 …………………………. BS in Information Technology MS in Information Technology…………………………………. 8. Annexures – A, B, C, D & E………………………………………… 6 16
17 19 26 31 54 72 106 114 124 143
It also aimed to give a basic. and 35--30% to non Engineering courses. certificates and diplomas awarded by degree colleges. respective accreditation councils and stake holders. the curriculum of a subject must be reviewed after every 3 years. Software Engineering and Information Technology in a meeting held on June 12-13. dated December 4th 1976. imperative to update our curricula regularly by introducing the recent developments in the relevant fields of knowledge. SHAIKH Member Academics August 2009 4 . new ideas and information are pouring in like a stream. degree awarding institutions. The new Bachelor (BS) degree shall be of 4 years duration. D773/76-JEA (cur. 2009 at the HEC Islamabad revised the curriculum in the light of the unified template. By looking at the curriculum one can judge the state of intellectual development and the state of progress of the nation. For the purpose of curriculum revision various committees are constituted at the national level. comprising of senior teachers nominated by universities. R&D organizations. ALTAF ALI G. and to fulfill the needs of the local industries. therefore. A committee of experts comprising of conveners from the National Curriculum Revision of HEC in Basic. appointed the University Grants Commission as the competent authority to look after the curriculum revision work beyond class XII at the bachelor level and onwards to all degrees. PROF. It is. In exercise of the powers conferred by sub-section (1) of section 3 of the Federal Supervision of Curricula Textbooks and Maintenance of Standards of Education Act 1976. DR. The engineering degree will devote 65-70% of the curriculum towards engineering courses. The world has turned into a global village. universities and other institutions of higher education. broad based knowledge to the students to ensure the quality of education. In pursuance of the above decisions and directives.).PREFACE Curriculum of a subject is said to be the throbbing pulse of a nation. According to the decision of the special meeting of ViceChancellor‘s Committee. and will require the completion of 130-136 credit hours. The joint National Curriculum Revision Committee for Computer Science. The revised draft curriculum is being circulated for implementation in the concerned institutions. the Federal Government vide notification No. Applied Social Sciences and Engineering disciplines met in April 2007 and developed a unified template to standardize degree programs in the country to bring the national curriculum at par with international standards. the Higher Education Commission (HEC) is continually performing curriculum revision in collaboration with universities.
PREP. Abbreviations Used: NCRC. OF NCRC. Vice-Chancellor’s Committee Experts Colleges Universities ORIENTATION COURSES BY LI. QUESTIONNAIRE CONS. Preparation REC. UNI. OF FINAL CURRI.CURRICULUM DEVELOPMENT STAGE-I STAGE-II STAGE-III STAGE-IV CURRI. UNDER CONSIDERATION CURRI. National Curriculum Revision Committee VCC. EXP. FINALIZATION OF DRAFT BY NCRC COMMENTS PRINTING OF CURRI. OF CURRI. HEC BACK TO STAGE-I PREP. COL. INDUSTRY & COUNCILS APPRAISAL OF 1ST DRAFT BY EXP PREP. R&D. OF DRAFT BY NCRC REVIEW IMPLE. IN DRAFT STAGE FINAL STAGE FOLLOW UP COLLECTION OF EXP NOMINATION UNI. LI R&D HEC Recommendations Learning Innovation Research & Development Organization Higher Education Commission 5 .
The reports delivered by theses committees were sent to the experts of international repute abroad for their evaluation and recommendations. It is important to mention here that various delegates from international software industry including Microsoft and Oracle also participated in our meetings. the same were also submitted to the various respective departments of universities for their review and feedback. structure and courses details of BS. All three committees (NCRC-CS. Computing Curricula Development-An Ongoing Activity Computing is a dynamic and fast expanding field. it is vital for its curricula to maintain currency with the latest developments in the filed. Software Engineering and Information Technology) Curriculum Committee (NJCCC) Introduction I. Software Engineering and Information Technology)-2009-JNCRC-CSSEIT All committees held their preliminary meetings (except JNCRC) to establish the respective first draft of curriculum. Moreover. 6 . MS and PhD programs. NCRC-SE and NCRC-IT) worked independently in their respective domains through extensive interaction and consensus of national and international experts in the field. final meetings were held to finalize the recommendations in their respective domains. All three committees developed a final report pertaining to the design. The following committees were constituted by HEC involving the respective expert faculty members both from public and private sectors throughout the country: National Curriculum Revision Committee-Computer Science (2009)-NCRC-CS National Curriculum Revision Committee-Software Engineering (2009)-NCRCSE National Curriculum Revision Committee-Information Technology (2009)-NCRCIT Joint National Curriculum Revision Committee (Computer Science. Higher Education Commission (HEC) is investing substantial effort in improving and promoting higher education in the domain of curricula development and research.National Joint Computing (Computer Science. Accordingly. Accordingly.
Software Engineering and Information Technology from both public and private sector institutions were invited nationwide to participate in the meeting. Software Engineering and Information Technology)-2009 A two-day meeting of the Joint National Curriculum Revision Committee (Computer Science. the following committee was constituted to develop a model to unify all the curricula and create systemic structures to maintain consistency of certain level in all the degree programs: Meeting of Joint National Curriculum Revision Committee (Computer Science. All senior faculty members and experts in the domains of Computer Science. Software Engineering and Information Technology.Subsequently. The major objectives of the meeting include the following: Unification among curricula of Computer Engineering and Information Technology Science. Islamabad. Software It is essential that consistent standards should to be maintained across all three curricula. 7 . and Joint ACM and IEEE Curriculum Task Force has already established Computing as an origin and basis for family of disciplines including Computer Science. The following participants attended the meeting and contributed significantly to establish a model to structure all degree programs on the basis of Computing in a systematic manner. 2009 at Higher Education Commission. Institute of Electrical & Electronics Engineers (IEEE). To integrate the work of all three committees under the umbrella of Computing and to identify commonalities and differences among all three disciplines. Curricula Revision Strategy The international scientific and professional bodies including Association of Computing Machinery (ACM). Software Engineering and Information Technology)-2009 was held on June 12-13.
Name & Address Federal / Rawalpindi 1. 6. Naveed Ikram. Islamabad. H-12. Dr. National University of Science and Technology. Islamabad. Faculty Block-2. Islamabad Dr. 4. International Islamic University. Aftab Ahmed Chairman National Computing Education Accreditation Council (NCEAC) Director Foundation University Institute of Management & Computer Sciences Near Lalazar Colony Rawalpindi. Dr. Dr. H-10 Campus. Islamabad Dr.K Brohi Road H-11/4. College of Electrical & Mechanical Engineering (EME). Prof. Department of Computer Science & Engineering. Muhammad Yunus Javed. Bahria University. Faculty Block-2. CS & SE Sr. Sector E-8. Shangrila Road. Muhammad Yousaf. 8 . H-10 Campus. Islamabad 2. Associate Professor.LIST OF EXPERT IN THE SUBJECT OF IT. International Islamic University. 5. Professor. Engr. Prof. Department of Computer Science. 3. Associate Professor. Dr. Prof. Muhammad Sher. Department of Computer Science. Aftab Maroof Professor National University of Computer & Emerging Sciences A.
Assistant Professor. Islamabad Mr. Department of Computer Science. The Mall. Professor. Blue Area. 14. Deptt of Software Engineering Foundation University Medical College New Lalazar. 30. Professor. Abdul Qadir. Associate Professor. Sector H-8/1. Quaid-i-Azam University. Dr. Arshad Iqbal. School of Electrical Engineering & Computer Sciences (SEECS). Rawalpindi Dr. Dr. 9 . Sharifullah Khan. Islamabad. Fatima Jinnah Women University. Aamer Nadeem Associate Professor M. Department of Software Engineering.7. Munir Hussain Naveed. Nazir A. Institute of Information Technology. H-12. PIEAS Nilore. Saeed Bhatti. 10. Islamabad Dr. 9. Principal Engr. Islamabad Dr. Convener NCRC IT Professor / Director. 13. National University of Sciences and Technology. Islamabad Dr. 15. Dr. Jinnah University (MAJU) Blue Area Islamabad. Allama Iqbal Open University. Sangi. 11. Deptt of Computer & Information Science P.A. 12. Islamabad 8.O. Farhana Shah. Shahid Nazir Bhatti Professor Deptt of Computer Science COMSATS Institute of Information Technology. Rawalpindi Dr. Muhammad Ali Jinnah University (MAJU). Prof.
Muhammad Nadeem Khokhar Professor. Department of Computer Science. Syed Afaq Husain Professor & Chairman.16. 30. Islamabad Dr.T University of Engineering & Tech. Faculty Block-2. Dr. Islamabad 17. Brohi Road. H-11/4. 18. Dr. NUST School of Electrical & Computer Science. Blue Area Islamabad. Mr. Deptt of Computer Science. A. Arshad Ali Shahid. Amir Hayat. H-12. Professor.K. Air University E-9. 10 . 19 20 21 Punjab 1. National University of Computer & Engineering Science. M. Dr. Sector H-8/1. Islamabad. Lahore. Head of Department Computing Shaheed Zulfikar Ali Bhutto Institute of Science & Technology. International Islamic University. 19. Islamabad Prof. Islamabad Dr. Dr. Deptt of Computer Science. H-10 Campus. Mohammad Mahboob Yasin. Prof. Deptt of Computer Science. Islamabad. Software Engineering & Information Technology. COMSATS Institute of Information Technology. Professor. Head. Jamil Ahmed Dean Iqra University Islamabad Campus H-10. Muhammad Ali Maud Deptt of Computer Engg & I. Prof. Imran Saeed Assistant Professor Department of Computer Science.
6. & Software Engineering Forman Christian College Lahore. Jerald Allan Kabell. National University of Computer & Engineering Science. B. Dr. Assistant Professor.2. Jamshoro Sindh Dr. Department of Computer Science. Shafay Shamail Chairman Deptt. Sindh 1. Dr. I. Professor & Head of Deptt of Computer Science. Convener NCRC Computer Science Professor & Director. Sarmad Hussain. Aftab Ahmed Malik. Institute of Information and Communication Technology. Of Computer Science & Info. Multan 3. Ferozepur Road. Lahore Dr. Z. Lahore Campus Block B. 7. Syed Mansoor Sarwar Principal Information Technolgy (PUCIT) Punjab University Lahore. 5. Tech LUMS. Dr. Deptt of Computer & Information Technology. Shaheed Zulfikar Ali Bhutto Institute of Science & Technology 90-Clifton Karachi 11 2. Deptt of Computer Science I. Iftikhar Hussain Shah. Kazi Campus. Forman Christian College. Professor & Chairperson. . Univesity. 4. Sohail Asghar. Lahore. Professor. Lahore 54600 Dr. Prof. Department of Computer Science. Dr. Professor.T. Faisal Town. Imdad Ali Ismali. University of Sindh. Allama I.
IBA Sukkur Airport Road Sukkur. 10. Shaheed Zulfiqar Ali Bhutto Institute of Science & Technology (Szabist). Najmi Ghani Haider. Allama I. Of Computer Science . FAST National University of Computer & Emerging Sciences. 8. Jamshoro Prof. Ejaz Ahmed Professor. Associate Professor. Information Technology. Karachi Dr.3. 7. Professor. Akram Sheikh. Professor. Abdul Wahab Ansari. Deptt of Information Technology. Zubair A. Dr. University of Sindh. 12 . Mehran University of Engineering & Technology. Director. 9. Qamar Uddin Khand. Sukkur Dr. Aqil Burney. IBA Sukkur Airport Road. Deptt of Computer Science Institute of Business Management Korangi Creek Road Karachi-75190 Prof. 100 Clifton. Dr. Shaikh. Dr. Tech University of Karachi Karachi. Shah Latif Town. Karachi 4. Info. Professor. Jamshoro Sindh Dr. Madad Ali Shah. Institute of Information & Communication Technology. 6. Convener NCRC in SE Chairman. Director Deptt. Department of Computer Sciences. Dr. National Highway. Department of CS and SE Engineering. Kazi Campus. 5. HOD. I. Dr.
UET Peshawar. Institute of Management Sciences. Prof. Muhammad Ajmal Bangash. 3. 13 . Prof. Associate Professor. Dr. Hayatabad. Muhammad Amir Associate Professor Deptt. Phase-V. Sir Syed University of Engg. & Tech Karachi.11. Prof. Dr. Inayatullah Babar Chairman Deptt. Abid Khan. Of Electronic Engg. Topi. Department of Computer Science. Dr. University of Karachi. Tahseen Ahmed Jilani Assistant Professor Department of Computer Science. 12. GIK Institute of Engineering Science and Technology. 13. GIK Institute of Engineering & Technology. Karachi Mr. District Swabi 2. Muhammad Ali. Of Computer & IT NWFP. Assistant Professor. Asif Mehmood Gilani. Topi – Swabi. NWFP Prof. University of Peshawar. 5. Peshawar. Department of Information Technology & Computer Science. Dr. M. Abu Turab Alam College of Computer Science & Information System Korangi Creck Karachi. 4. Dr. NWFP 1. Peshawar Dr. 7/B-3. Dr.
Muid Mufti.Balochistan 1. Convener NCRC-IT Director. Chairman and Director. Dr Farhana Shah . Department of Computer Science. National highway Karachi Dr. M. Islamabad Prof. Dr. M. Muhammad Abid. Shaikh. Department of Computer Science. University of Peshawar 6 7 Dr. Head. Imdad Ali Ismaili. Islamabad 14 . Quetta The following was sequence of presentations made during the meeting: Sr. Convener NCRC-SE Meritorious Professor. Institute of Information & Communication Technology. Engineering & Management Sciences. University of Karachi. S. Punjab University College of IT PU Old Campus. Dean. Dr. Aqil Burney. Shoaib Khan. Abdul Hussain Shah Bukhari. No 1 Topic CS-Curriculum-2009 Presentation By Dr. EME College NUST. Faculty of Information & Communication Technology (ICT). Prof. Rawalpindi & Dr. Zubair A. Jamshoro Dr. Lahore 2 SE-Curriculum-2009 3 IT-Curriculum-2009 4 Survey of the Latest Recommendation of ACM & IEEE Curriculum Task Force Regarding CSCurriculum Survey of the Latest Recommendation of ACM & IEEE Curriculum Task Force Regarding SECurriculum Survey of the Latest Recommendation of ACM & IEEE Curriculum Task Force Regarding ITCurriculum Survey of IT Industry Trends and What is Expected from Computing Programs in Pakistan? 5 Dr. University of Sindh. ID Technologies. Institute of Information Technology Quaid-i-Azam University. Balochistan University of Information Technology. Mansoor Sarwar Principal. Director. FASTUniversity of Computer and Emerging Sciences Shah Abdul Latif Town. Prof. Convener NCRC-CS Professor & Director.
8 Software Industry Trends. 15 . Dr. Opportunities and Threats Resource person from PSEB 9 Curricula Revision Strategy Prof. Aftab Ahmed and Future Challenges Chairman National Computing Education Accreditation Council (NCEAC) Director Foundation University Institute of Management & Computer Sciences Near Lalazar Colony Rawalpindi.
Computing Requirements for Bachelor Degree Programs (Computer Science. Software Engineering. Information Technology) Structure of BS Programs Name of Program # Category Computer Science Credit Hours 70 43 12 15 48 18 21 9 12 130 12 130 48 18 21 9 12 130 Software Engineering Credit Hours 70 43 12 15 48 Information Technology Credit Hours 70 1 Computing Courses Core Courses 43 Supporting Areas 12 General Education 15 2 Software Engineering Courses CS Core Courses 18 CS Electives Courses 21 CS Supporting Areas 9 Courses (Electives) 3 University Electives Total Credit Hours 16 .
8 Labs preferred in these courses. implementation details are left upon the concerned Institutes. Supporting Area. B. However. Computing-Core Courses – 43 Credit Hours # C o d e 1 3 3 4 4 2 PreReq Course Title Credit hours Proposed Semester 1 2 3 4 5 6 7 8 9 10 11 12 1: Introduction to Computing 4 (3-3) 1 Programming Fundamentals 4 (3-3) 1 Object Oriented Programming 3 (3-0) 2 Discrete Structures 3 (3-0) 2 Data Structure and Algorithms 3 (3-0) 3 1 Digital Logic and Design 3 (3-0) 3 Operating Systems 4 (3-3) 4 Introduction to Database Systems 4 (3-3) 4 Introduction to Software 3 (3-0) 4 Engineering 1 6 Computer Communications and 3 (3-0) 6 Networks 1 8 Human Computer Interaction 3 (3-0) 7 Senior Design Project 6 (0-18) 7.Structure of BS Program Common Areas in all BS Programs of Computer Science. Supporting Area Courses . Software Engineering and Information Technology Regarding Computing.12 Credit Hours # 13 14 15 16 Co de MT MT MT PH PreReq Course Title Calculus and Analytical Geometry Probability and Statistics Linear Algebra Electromagnetism Credit hours 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) Proposed Semester 1 2 4 3 17 . General Education & University Elective Courses A.
Institutions may add more courses) # 1 2 3 4 5 6 7 8 Cod e MG MG MG MG SS PS SS SS PreReq - Course Title Financial Accounting Financial Management Human Resource Management Marketing Economics Psychology International Relations Foreign/Regional Language (French. 0) 3 (3. 0) 3 (3.C. German.) Philosophy Credit hours 3(3. Punjabi. 0) 3 (3. 0) 3 (3. 0) 3 (3. General Education Courses – 15 Credit Hours # 17 18 19 20 21 Co de EG EG EG SS SS PreReq Course Title English-I (Functional English) English-II (Technical and Report Writing) English-III (Communication Skills) Islamic and Pakistan Studies Professional Practices Credit hours 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) Proposed Semester 1 2 3 1 8 - - University Elective Courses – 12 Credit Hours (Not limited to the list below. Sindhi. 0) Proposed Semester 4 5 6 7 6 7 7-8 9 SS - 3(3. 0) 3 (3. 0) 3 (3. Urdu etc. 0) 6-8 18 .
basic machine organization. Von Neumann Architecture. Labs: 1 Prerequisites: None Objectives: This course focuses on a breadth-first coverage of computer science discipline. Boolean logic. Reference Material: 1. Programming paradigms and languages. designing solution. Social and legal issues. Algorithm definition. Social issues of computing. Brooks/Cole Thomson Learning. Compiler. 2000 4. Computers: Information Technology in Perspective. Reference Material: 1. Introducing Software engineering and Information technology within the broader domain of computing. Overview of language for e. testing programmes. introducing computing environments. Computer Science: An overview of Computer Science. and programme development and testing.g. Computer networks and internet. control structures. Labs: 1 Prerequisites: None Objectives: The course is designed to familiarize students with the basic structured programming skills. desktop publishing. Binary numbers. translation of algorithms to programmes. records. Fundamental programming constructs. general application software. and implementation. Internet. Operating system. 2. Schneider and Gersting. algorithm designing. design. testing designed solution. Course Name: Programming Fundamentals Credit Hours: 4 Course Structure: Lectures: 3. analyzing problem. Basics of structured and Modular programming. software applications and tools and computer usage concepts. basic computing hardware. Overview of Software Engineering and Information Technology. AI. Basic Algorithms and problem solving. C language C. data types. Course Outline: Number Systems. It emphasizes upon problem analysis. 9/e by Larry Long and Nancy Long. operating systems. Problem Solving and Program Design in C / 6E Hanly & Koffman 19 . files. 2002 / ISBN: 0130929891 3. History computer system. Computer graphics. Prentice Hall. Sherer. functions. Graphical programming.COURSE CONTENTS Computing – Core Courses (43 credit hours) Course Name: Introduction to Computing Credit Hours: 4 Course Structure: Lectures: 3. development of basic algorithms. Course Outline: Overview of computers and programming. An Invitation to Computer Science. arrays.
constructors and destructors. Reference Material: 1. pigeonhole principle. 20 . abstract algebra. problem solving in OO paradigm. analysis and software development. Kenneth H. inheritance and polymorphism. Sequences. probabilistic methods. exception handling Reference Material: 1. Trees and Graphs. tree and graph structures. Discrete Mathematics and Its Applications. objects and encapsulation. Java How to Program. Prepositional and predicate calculus. C++ How to Program. Sets. Methods of Proof. focusing on providing a solid theoretical foundation for further work. derived classes. In this course more emphasis shall be given to statistical and probabilistic formulation with respect to computing aspects. Mcgraw Hill Book Co. Relations and functions. iterative procedures. predicate calculus. proof by contradiction. ISBN-10: 0132404168 ISBN-13: 9780132404167 Publisher: Prentice Hall Copyright: 2007 Course Name: Object Oriented Programming Credit Hours: 3 Course Structure: Lectures: 2. Mathematical Induction and Recursion. operator and function overloading. Combinatorics. this course aims to develop understanding and appreciation of the finite nature inherent in most Computer Science problems and structures through study of combinatorial reasoning. 6/E (Harvey & Paul) Deitel & Deitel ISBN-10: 0136152503 ISBN-13: 9780136152507 Publisher: Prentice Hall 2. methods. Pigeonwhole principle. OO programme design process. Optimization and matching. Course Outline: Evolution of Object Oriented (OO) programming. 6TH edition. virtual functions. 2006. cardinality and countability. 5/E (Harvey & Paul) Deitel & Deitel. OO concepts and principles. Course Outline: Introduction to logic and proofs: Direct proofs. C How to Program. Rosen.Addison-Wesley | Published: 02/06/2009 ISBN-10: 0321535421 | ISBN-13: 9780321535429 2. loop invariants. I/O and file processing. classes. Fundamental structures: Functions. Further. Labs: 1 Prerequisites: Programming Fundamentals Objectives: The course aims to focus on object-oriented concepts. Elementary number theory. relations (more specifically recursions). 7/E (Harvey & Paul) Deitel & Deitel ISBN-10: 0132222205 ISBN-13: 9780132222204 Publisher: Prentice Hall Course Name: Discrete Structures Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: None Objectives: Introduces the foundations of discrete mathematics as they apply to Computer Science. Formal logic.
2008.. Synchronization. Database security and authorization. I/O systems. Entity Relationship modelling. 3rd Edition. Labs: 1 Prerequisites: Data Structures and Algorithms Objectives: The course aims to introduce basic database concepts. Secondary storage. Course Name: Database Systems Credit Hours: 4 Course Structure: Lectures: 3. Introduction to concurrency. 2. Applied Operating Systems Concepts. Physical database design: Storage and file structure. 21 . Process and CPU management. database efficiency and tuning. Protection. Modern Operating Systems. External Fragmentation.2. Tanenmaum A. Kolman. Course Outline: History and Goals. Prentice Hall Publishers. functional dependencies and normal forms.L. data storage and retrieval techniques and database design techniques. Busby & Ross. 4th edition. Silberschatz A. 7TH edition. implementation and operation of the complex OS possible. J. Richard Johnsonbaugh. Co. Discrete Mathematics. 7th Edition. Addison-Wesley Pub. files with variable length records. 3. Problems of cooperative processes. 2000. different data models. Peterson. Course Name: Operating Systems Credit Hours: 4 Course Structure: Lectures: 3. 1985. Deadlocks. Transaction processing and optimization concepts. 2008. Discrete Mathematical Structures. b-trees. Evolution of multi-user systems. Relocation. Labs: 1 Prerequisites: None Objectives: To help students gain a general understanding of the principles and concepts governing the functions of operating systems and acquaint students with the layered approach that makes design. Small Group Project implementing a database. concurrency control and recovery techniques. Prentice-Hall Publishers. Introduction to distributed operating systems. File systems. Paging and Demand Paging. Ralph P. Course Outline: Basic database concepts. Grimaldi. 2004. files with dense index. RDBMS. Security and Protection. Lab assignments involving different single and multithreaded OS algorithms. Multithreading. The course primarily focuses on relational data model and DBMS concepts. Memory management and virtual memory.C. 4. Relational data model and algebra. Discrete and Combinatorial Mathematics: An Applied Introduction. & Galvin P. Structured Query language.S. indexed files. Scheduling and dispatch.. Kernel and User Modes. Reference Material: 1... Database design.
Roger Pressman. Course Outline: Analogue and digital Transmission. 2009 Course Name: Computer Communication and Networks Credit Hours: 3 Course Structure: Lectures: 2. Requirements Specifications. 5/E. Implementation and Management 5E. C. Asynchronous and Synchronous transmission. Quality Assurance. Noise. Multiplexing. Course Outline: Introduction to Computer-based System Engineering. Addison-Wesley Pub. Software Design: Architectural Design. labs or projects involving implementation of protocols at different layers. Elmasri and Navathe. change control. Network Layers. Local Area Networks and MAC Layer protocols (Ethernet.J. Software Specification. Analogue & digital transmission. Function-Oriented Design. Introduction to advanced issues: Reusability. process management. Assignments and projects on various stages and deliverables of SDLC. ISBN: 0-201-74153-9. Co (2009).Date. Processes & Configuration Management. The concepts of project management. Database Systems 8E. Data Link Protocols (HDLC. Programming exercises. Routing. Labs: 1 Prerequisites: None Objectives: To introduce students to the concept of computer communication. Fundamentals of Database Systems. Network security issues. Network system architectures (OSI. Object-Oriented Design.Begg. Co. Protocol design issues. Switched and IP Networks. Addison Wesley Pub. PPP). Patterns. Encoding. Transport layer protocols TCP/IP. (2004).Connolly and P. TCP/IP) and Protocol Standards. R. 22 . Requirements Engineering. Course Name: Introduction to Software Engineering Credit Hours: 3 Course Structure: Lectures: 2. McGraw-Hill. 2006 2. AddisonWesley. System Modelling. Emphasis is given on the understanding of modern network concepts. Inter-networking. User Interface Design. Error Control. Software Prototyping. Token ring). Network models (OSI. UDP. Media. Project Management. Software Engineering: A Practitioner's Approach /7E.Reference Material: 1. Software Engineering 8E by Sommerville Addison Wesley. Labs: 1 Prerequisites: Object Oriented Paradigm/Programming Objectives: To study various software development models and phases of software development life cycle. software development and testing are introduced through hands-on Team Projects. TCP/IP). Flow Control. Bridging. UML modelling. 2. 3. Reference Material: 1. Database Systems: A Practical Approach to Design.
Computer Networks and Internets. Course Structure: Lectures: 0. standards and models. Labs: 6 Prerequisites: Introduction to Software Development. University of Maryland Catherine Plaisant. Pankaj. Human-Computer Interaction..Reference Material: 1. Groupware. Gregory D. Russell Beale. 4/E Ben Shneiderman. conceive. Software Project Management in Practice by Jalote. Usability paradigm and principles. It considers the implications of human understanding on the usability of computer systems and the importance of understanding the context of use. Resources: 1. Computer and Interaction. Georgia Institute of Technology. evaluation techniques. 8th Edition 2006 Course Name: Human Computer Interaction Credit Hours: 3 Course Structure: Lectures: 2. 23 . Computing Dept. Leeds Metropolitan University. Abowd. Design rules. University of Maryland ISBN-10: 0321197860 ISBN-13: 9780321197863 Publisher: Addison-Wesley Course Name: Senior Design Project Credit Hours: 6 Data Base Systems. Resources: 1. Data and Computer Communications By William Stallings Published by Macmillan Pub. Universal design and User support and Computer Supported Cooperative Work. Comer. S. 2008 Douglas E. Make oral and written project presentations. 5/E. HCI in software process. Topics include Usability Design principals. Lancaster University Janet E. Introduction to Computer Networks /4. Introduction to design basics. pervasive and ubiquitous applications. A. task analysis. Prentice Hall 2003 2. Tanenbaum. prototyping. plan and develop a real and substantial project related to computer science. Labs:1 Prerequisites: Data Structures and Algorithms Objectives: This course introduces the human issues of usability and its importance. Computer Architecture Objectives: The software project involves research. 3/E Alan Dix. Introduction to specialized topics such as Groupware. evaluation techniques. pervasive and ubiquitous applications. Finlay. Purdue University ISBN-10: 0136061273 ISBN-13: 9780136061274 Publisher: Prentice Hall 3. Course Outlines: The Human. It describes guidelines for use of different media and interface styles. Designing the User Interface: Strategies for Effective Human-Computer Interaction. It provides an opportunity to the students to crystallize their acquired professional competence in the form of a demonstrable software product. Co. University of Birmingham ISBN-10: 0130461091 ISBN-13: 9780130461094 Publisher: Prentice Hall 2.
Boyce Richard C. DeMoivre‘s Theorem and its Applications. Statistics in decision making. counting techniques. Swokowski. Arc Length. Reference Material: 1. Volume and Surface of Revolution.Computing – Supporting Courses (12 credit hours) Course Name: Calculus and Analytic Geometry Credit Hours: 3 Course Structure: Lectures: 3. Derivative as Slope of Tangent to a Curve and as Rate of Change. Taylor and Maclaurin Expansions and their convergence. Graphical representation of Data Stem-and Lead plot. Application to Tangent and Normal. Differentiation of Functions. Simple Cartesian Curves. Geometric. Erwin Kreyzig. 7th edition. probability and decision making. 1994. Application to Area. presentation. 8th edition. 3. Labs: 0 Prerequisites: None Objectives: To introduce the concepts of data analysis. Advanced Engineering Mathematics. Descriptive Statistics. events. measures of central tendencies and dispersion. Box-Cox plots. John Wiley and Sons (WIE). Methods of Integration: Integration by Substitution. Course Outline: Complex Numbers. and by Partial Fractions. 24 . 2008. Brooks/Cole Publishers. Curve Tracing. Counting techniques. Maxima/Minima and Point of Inflexion. Ye. John Wiley and Sons. Howard Anton. use of elementary statistical packages for explanatory Data analysis. Labs: 0 Prerequisites: None Objectives: To provide foundation and basic ground for calculus and analytical geometry background. Estimation and testing of hypotheses. Calculus and Analytical Geometry. William E. Integral as Anti-derivative. Poisson. Diprima. 2002. Symmetrical Properties. 6 th edition. John Wiley & Sons Inc. Linearization. Calculus. Course Name: Probability and Statistics Credit Hours: 3 Course Structure: Lectures: 3. Calculus. John Wiley & Sons. Myers. Olinick and Pence. 1993. Functions and Graphs. laws of probability. Conditional probability and Baye‘s theorem with application to random variable (Discrete and continuous) Binomial. Definite Integral as Limit of a Sum. Course Outline: Introduction to Statistics. Negative Binomial Distributions. ―Probability & Statistics for Engineers & Scientists‖. Indefinite Integration of Simple Functions. Ronald Walpole. introduction to probability. Calculus and Analytical Geometry. 4. Myers. Limit and Continuity. sample space. 2. 5. Prentice Hall Publisher. Reference Material: 1. 7th edition. Regression and Correlation. ISBN: 0471093335. by Parts. moments of frequency distribution. 10th edition. Exponential Gamma and Normal distributions. Thomas Finny.
Operations on matrices. 3. Probability and Statistics for Engineering and the Sciences. Andrew BulmanFleming. 2. clipper and clamper circuits. Elementary Linear Algebra with Applications.2. solutions and study of their properties. zener diode and voltage regulator. Halliday and Krane. 2005. Wiley. Solution of system of Linear systems. Course Outline: Vectors. University Physics. LED and LCD etc. pn junction. College Physics (6th and higher edition).. BJT amplifiers. Duxbury Publishers. Matrices & Determinants. pMOS and CMOS inverters circuits. Vector Spaces. Linear Transformations. G. 9th edition. Introduction to A/D and D/A conversion circuits. Strang. Metal oxide transistors. 2007. Linear Algebra and Its Applications. Cowan. Transistors: Bipolar Junction transistors. David Hill. power amplifiers. orthgonality and least squares. Chris Rorres. Reference Material: 1. nMOS. BJT biasing circuits. Howard Anton. Oxford. Gilbert Strang. Course Name: Linear Algebra Credit Hours: 3 Course Structure: Lectures: 3. Reference Material: 1. 25 . matrix properties. 2000. Eigenvalue & Eigenvectors. Lay. BJT as a switch. 2nd edition. Strang's Linear Algebra And Its Applications. operations on system of equations. Clarendon. David C. Labs: 1 Prerequisites: None Credit Hours: 3 Objectives: Introduction of Electronics Course Outline: Fundamentals of Semiconductor physics: Band theory. Inner products. 4th edition. Positive Definite matrix. 9 th edition. semiconductors (intrinsic and extrinsic). Freedman and Young. Addison-Wesley. Cofactor and Inverse. Linear Independence. Prentice Hall PTR. Lay L. Devore. Brooks/Cole. Labs: 0 Prerequisites: None Objectives: To provide fundamentals of solution for system of linear equations. Statistical Data Analysis. Q-point. Resnick. 2. Applications to Systems of Equations and to Geometry. Course Name: Electromagnetism Course Structure: Lectures: 2. 4. Bernard Kolman. Brett Coonley. Singular Value Decomposition. pn junctions as a rectifier. 2005 3. 2003. Rank. Elementary Linear Algebra: Applications Version. (10th and higher editions). 1998. Andy Bulman-Fleming. classes of amplifiers.
Definitions of Computing (software engineering. Labs: 0 Prerequisites: None Objectives: A Computing graduate as professional has some responsibilities with respect to the society.B Course Name: English – III (Communication Skills) Credit Hours: 3 Course Structure: Lectures: 3. Professional Issues in Software Engineering. information security and privacy. Labs: 0 Prerequisites: None Course Name: English Annexure . M. and economic context of Computing (software engineering.C & Pakistan Studies Credit Hours: 3 Course Structure: Lectures: 3. Software house organization Resources: 1. and assess ethical and professional computing case studies. Information Technology). evaluate. and risks of software. This course develops student understanding about historical. ethical. intellectual property and software law (cyber law).F. social responsibilities.Computing – General Education Courses (15 credit hours) Course Name: English-I (Functional English) Credit Hours: 3 Course Structure: Lectures: 3. Computer Science. misuses. business practices and the economics of software. professional ethics. Labs: 0 Prerequisites: None Course Name: Professional Annexure – D&E Practice Credit Hours: 3 Course Structure: Lectures:3. social. professional societies.A – II (Technical and Report Writing) Credit Hours: 3 Course Structure: Lectures: 3. and professional issues related to the discipline of Computing. Course Outline: Historical. 26 . Computer Science. It identifies key sources for information and opinion about professionalism and ethics. Bott et al. software related contracts. economic. Labs: 0 Prerequisites: None Annexure . Information Technology) subject areas and professional activities. professional competency and life-long learning. social. Labs: 0 Prerequisites: None Course Name: Islamic Annexure . Students analyze. uses.
Karachi Convener Secretary 3 Dr. Professor & Director. Member Director. Zubair A. Amir Hayat. 2008. NUST School of Electrical Engineering & Computer H-12. Multan 5 Dr. Tahseen Ahmed Jilani. Imdad Ali Ismaili. Professor. Department of Computer & Science. The following attended the meeting. National Highway. Islamabad Science. Jamshoro 2 Mr. Badar Sami. Sector H-8/1. Karachi 4 Prof. Department of Computer Science. Shah Latif Town. Dr. Department of Computer Science. Mohammad Mahboob Yasin. Karachi Campus. Islamabad 7 Dr. Karachi 6 Dr. The aims and objectives of the meeting were to discuss the deliberations and finalize the curriculum drafted by the committee of the last meeting held from 28th to 30th August. National University of Computer & Engineering Science. pertaining to revising the curriculum for Computer Science degree programs developed in 2004 was held from February 17 th to 19th. Aftab Ahmed Malik. 2009 at HEC regional Centre. (NUST-SEECS) Member Member Member Member 27 . Department of Computer Science. 30. Department of Computer Science. Institute of Information & Communication Technology. Univesity. Professor. Department of Computing. Sheikh. University of Sindh. Head. Z. Karachi. University of Karachi. B. 1 Dr. University of Karachi.National Curriculum Revision Committee – Computer Science (2009) A three day final meeting of the National Curriculum Revision Committee of Computer Science. Associate Professor. COMSATS Institute of Information Technology.
8 Dr. Road. Dr. Professor. Karachi 10 Prof. Arshad Ali Shahid. Air University E-9. Institute of Business Administration. Professor. District Swabi 11 Prof. Airport Road Sukkur 14 Dr. International Islamic University. Karachi 12 Dr. Nazir A. Brohi Science. Deptt of Computer Science & IT. Faculty Block-2. M. Allama Iqbal Open University. Department of Computer Science. Imran Saeed Assistant Projector. Professor & Chairman. Software Engineering & Information Technology. Dean. Professor FAST National University. Faculty of Computer Management Sciences. College of Computer Science & Information System.K. Sangi. F. H-10 Campus. GIK Institute of Engineering & Technology. Lahore Member Member Member Member Member Member Member Member Member Member 28 . Professor. Abu Turab Alam. Topi. Zafar Nasir. Department of Computer Science. Deptt of Information Technology. Deptt of Computer Science. Madad Ali Shah.C College. Professor. Asif Mehmood Gilani. Islamabad 18 Dr. Department of Computer Science. Dr. Hyderabad 15 Dr. Iftikhar Hussain Shah. Islamabad 9 S. Islamabad 17 Syed Afaq Hussain. Islamabad 13 Dr. National University of Computer & Engineering A. Asadullah Shah. Isra University. H-11/4.
19 Mr. Farrukh Amin, Assistant Professor (CS), Institute of Business Management, Korangi Creek, Karachi 20 Meritorious Prof. Dr. S. M. Aqil Burney Chairman Department of Computer Science, University of Karachi 21 Dr. Sh. M. Wahabuddin Usmani, Associate Professor, Department of CS & IT, NED University of Engineering & Technology, University Road, Karachi
The proceedings of the meeting started with the recitation from the holy Quran by Mr. Tahir Ali Shah and welcome address by Mr. Rafiq Rai (Director – HEC Karachi region). The house unanimously nominated and elected Dr. Imdad Ali Ismaili as Convener and Mr. Badar Sami as secretary of the committee. The Convener of the meeting Prof. Dr. Imdad Ali Ismaili informed the participants that the comprehensive report of previous meeting held on 28th to 30th August 2008 has been already circulated among all the members of the committee, universities and institutions to have feedback from them. The following programs were discussed by the participants of the meeting 1) BS (Computer Science) 2) MS (Computer Science) After detailed revision of the minutes of the previous meeting held on August 28th to 30th 2008, following recommendations were made for BS (Computer Science) program to achieve the desired objectives;
Revision recommendations regarding BS (Computer Science) program
1) Digital Logic Design should be a separate course of 3 credit hours instead of being part of ―Digital Logic & Computer Architecture‖ course and should be included in the ―Computing – Core‖. ―Computer Architecture‖ should be included in the ―Computer Science – Core‖ as a full 3 credit hour course in place of ―System Programming‖ and ―System Programming‖ may be placed in ―Computer Science – Elective‖ courses . 2) Digital Computer Logic should not have any pre-requisite
3) The credit hours for each course should be written using standard notations. 4) Discrete Structures be moved from ―Computing Core‖ to ―Computer Science – Required Supporting courses‖ 5) Contents of ―Electromagnetism‖ should be included in the contents of ―Basic Electronics‖ 6) Numerical Computing should be moved from ―Computer Science – Electives‖ to ―Computer Science – Core‖ and contents may be updated to include Symbolic Computing related topics. 7) Each ―Computer Science – Elective‖ area/group should comprise of at least four courses. Since the areas of ―Software Engineering‖, ―Multimedia‖ have less than 4 courses so more courses be included in those areas/groups. 8) New areas/ groups may be included in ―Computer Science – Electives‖ (like Entrepreneurship, Multimedia Computing etc.) 9) The committee members also emphasized the need of revising the contents of the courses of the schemes for BS and MS(Comptuer Science) and advised to update books and reference material.
1. Industrial Challenges 7. distribution of credits among various components of programme are discussed in the following pages. The Committee finally agreed to the curriculum model presented in the following table. The structure and other details of the program proposed by the committee were designed inline to the recommendations of various leading bodies continuously in the quest to designing the educational programs of Computer Science and related disciplines. Fast Changing Disciplines 4. Possible program design structure Almost all the members of the committee unanimously approved the proposed objectives of the program. Many changes were recommended in various sections of the curricula developed by this Committee in the last meeting held in August 2008. general recommendation regarding the update and revise of the curriculum.Curriculum for BS (Computer Science) Program: The same basis used in the last meeting held in 2004 were taken to revise the Curriculum of Computer Science. structure. Objectives/Goals 2. 32 . Emerging Technologies 5. Strategies 3. # 1 Category Computing courses Computing – Core courses Computing – Supporting areas Computing – General Education Computer Science courses CS – Core courses CS – Electives CS – Supporting Area University Electives Total credit hours Credit Hrs 43 12 15 18 21 9 70 2 3 48 112 130 A complete detail of BS programme involving objectives. program structure. Latest reports and recommendations of ―Computer Science Curriculum 2008: Interim Revision of CS2001 report‖ by Interim Review Task Force of ACM and IEEE Computer Society were mainly considered. These bodies include IEEE and ACM. International Standards 6.
The programme should be dynamic and flexible enough to maintain currency with the latest scientific and technological developments in the field. and conclusions for a complex task. 3. the principles and techniques learnt during the course of implementation of academic programme. There is a need for curricula structures that are really able to grow as we put new demands on them. The curriculum must be structured to provide a balanced mixture of learning experiences to make the graduate capable of sound professional decisions. theory. Computer Science graduates require special communication skills both orally and in writing. 6. and techniques. The programme should provide a broad understanding of the field via introducing concepts. 2. government. One of the key elements here is to prepare the graduates for the future. They must be able to produce well-organized reports. development. The challenge of getting all newly emerging technologies incorporated in to the curriculum is becoming pivotal for the effectiveness of curricula. results.Objectives Recent developments in computer hardware. methods of solution. The following summarizes some key characteristics for consideration as a basis of a successful academic programme in Computer Science: 1. The curriculum is required to provide integration of all components and the foundations that allow accessing all of the new knowledge and technology to fulfil the vision of future. and planning levels. 4. 5. 7. software and communication technologies have offered new exciting opportunities and challenges for creation of innovative learning environments for Computer Science and its curricula design. As a result the graduate should be able to assume responsible positions in business. 33 . The programme may encourage students to develop and use abstract models in addition to apply respective technology in practical situations. and education at the research. The Computer Science curriculum is expected to provide environments to put into practice. which clearly delineate objectives. The programme should provide formal foundations for higher learning. The programme should also provide an excellent foundation for further formal learning and training. Intensive education/training in focused areas of Computer Science is desirable. The basic intention of an academic programme in Computer Science is to develop the student‘s critical professional thinking and intuition. The programme should provide professional orientation to prepare students for industry.
Student may choose a particular option. Depth-Based.Supporting areas Computing . which is most appropriate to their planned future career.General Education CS .Core courses CS .Core courses Computing . The following are relevant details: Minimum credit hours shall be 133 for BS (Computer Science) programme including computing related courses. The students are expected to learn theoretical and practical understanding of the entire field of Computer Science. The programme shall comprise 8 semesters spread over 4 years with two semesters a year. Credit hour Percentage 43 33% 12 9% 15 12% 18 14% 21 16% 9 7% 12 14% Course Group Computing .Supporting courses University Electives University Electives CS .Computing General Education CS .Electives . Each major area shall comprise of 4-6 courses.Core courses 34 .Computing Supporting areas . The major area of specialization shall be incorporated in the structure. The following is distribution of total credit hours.Core courses CS – Electives CS .Programme Structure The structure of a BS programme in Computer Science is proposed to meet the needs of students with formal computing experience and with established relevant skills. The proposed structure is dynamic and provides basis for various options including Breadth-Based. and Integrated Breadth & Depth-Based specializations.Supporting courses Computing .
Dedicated computing facilities are essential for hands-on experience. However. multimedia systems. Professional areas of specialization such as computer graphics. General Recommendation Regarding Implementation of Programme Faculty level and orientation is vital for the successful implementation It is strongly recommended that the BS programme should be only implemented via experienced computer science faculty having formal education in Computer Science. Students 35 . The House unanimously recommended the eligibility criteria for admission to BS (Computer Science) as given: The candidates must have intermediate or equivalent qualification. The university may add any number of courses to the general elective courses preferably other than Computer Science courses. the university shall define their selection criteria. substantial library resources are important to support a rigorous graduate programme in information technology. Besides faculty and computing facilities. It was thoroughly discussed by considering all input streams of BS (Computer Science). The access to sate of the art computing and information technology is essential for creation of innovative learning environments. Eligibility Criteria The eligibility criteria of the draft curriculum by the last meeting were opened for discussion in the House.Some clusters regarding Computer Science Electives are listed below: a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) Networking Information Management Intelligent Systems Graphics & Visualization Software Engineering Web Engineering E-Commerce Multimedia Distributed Computing Security Languages and Translators Computer Architecture Systems Software Scientific Computing Soft Computing University Electives It was unanimously recommended that 18 credit hours shall require to be taken from the list of general elective courses. computer networking and virtual reality or design automation require very special and dedicated computing facilities. Variety of programming languages systems and operating systems must be available.
should have access to digital libraries and knowledge resources via Internet technologies. Related IT Curriculum Efforts There are various major curriculum efforts that relate to the Computer Science curricula: a) The IFIP (International Federation of Information Processing) Curriculum Reports b) The DPMA (Data Processing Management Association) Computer Systems Proposal c) The ACM (Association of Computing Machinery) Curriculum Task ForceCurriculum 2001 d) The ITAA (Information Technology Association of America) Report on IT Workforce Study 36 .
0) 3 (3. 1) Proposed Semester 1 2 3 2 7 1 37 . 1) 3 (2. 1) Proposed Semester 1 3 2 1 # 16 17 18 19 20 21 Code EG EG EG PK SS CS PreReq -- Credit hours 3 (3. 0) 3 (2. 1) 3 (2. 8 7 # 11 12 13 14 Code MT MT MT EL PreReq - Credit hours 3 (3. 1) Proposed Semester 1 2 3 3 5 5 6 6 7. 1) 3 (2.Core Courses (34 Credit Hours) Course Title # 1 2 3 4 5 6 7 8 9 10 Code CS CS CS CS CS CS CS CS CS CS PreReq 1 2 21 3 2 - Programming Fundamentals Object Oriented Programming Data Structure and Algorithms Digital Logic Design Operating Systems Database Systems Introduction to Software Development Computer Communications and Networks 6. 1) 6 3 (2. 0) 3 (3. 1) 3 (3. Final year Project 26 3 Human Computer Interaction Computing – Supporting Courses (12 Credit Hours) Course Title Calculus and Analytical Geometry Probability and Statistics Linear Algebra Basic Electronics Computing – General Education Courses (18 Credit Hours) Course Title English-I (Functional English) English-II (Technical and Report Writing) English-III (Communication Skills) Islamic and Pakistan Studies Professional Practices Introduction to Information and Communication Technologies Credit hours 3 (2. 1) 3 (2. 7. 0) 3 (2. 0) 3 (3. 1) 3 (2. 0) 3 (2. 0) 3 (3. 0) 3 (3. 0) 3 (3.Scheme of Studies for Bachelor Degree Computer Science Program Computing courses Computing .
0) 3 (2. 0) 3 (3. 0) 5 4 6 6 7 38 . Design and Analysis of Algorithms 29 29 Artificial Intelligence Computer Architecture 23 Compiler Construction Computer Science – Supporting Courses (9 Credit Hours ) Course Title Credit Hours 3 (2. 1) 3 (3. 1) 3 (2.Computer Science courses Computer Science – Core Courses (18 Credit Hours) Course Title # 22 23 24 25 26 27 Code CS CS CS CS CS CS PreReq 4 Computer Organization and Assembly Language 29 Theory of Automata & Formal Languages 3. 1) 3 (2. 3) 3(3.0) Proposed Semester 4 5 7 # 32 33 34 35 36 37 38 39 40 41 Code CS CS CS CS CS CS CS CS CS CS Are a CG V1 CG V1 CG V1 CG V1 SE 2 SE 2 LT 3 CC N4 CC N4 CC N4 Computer Science – Elective Courses (21 Credit Hours) –(Not limited to the list below) Course Title Computer Graphics Digital Image Processing Digital Signal Processing Computer Vision Software Engineering Advance Software Engineering Principles of Programming Languages Data Communication Distributed Computing Data and Network Security Credit hours 3 (2. 1) Proposed Semester 6 3 (3. 1) 3 (3. 1) 3(2. 1) Proposed Semester 4 5 7 8 6 7 # 30 31 Code ST ST CS PreReq 11 Multivariate Calculus 11 Differential Equations 11 Numerical Computing Credit Hours 3 (3. 0) 3 (3. 0) 3 (2. 0) 3 (2. 0) 3 (3.
1) 3(2. 1) 3 (2. 1) 7 5 7 7 6-7 SS 8 IM 9 IM 9 SIC 10 SIC 10 SIC 10 SO C 11 SO C 11 SO C 11 = = = = = = = = = 1 – CGV 2 – SE 3 – LT 4 – CCN 7 – WE 8 – SS 9 – IM 10 – SIC 11 – SOC Computer Graphics and Visualization Software Engineering Languages and Translators Computer Communication Networks Web Engineering Systems Software Information Management Scientific Computing Soft Computing 39 . 1) 3 (2.42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 CS CS CC N4 CC N4 Wireless Networks Telecommunication Systems 3(2. 3) 3 (2. 1) 3 (2. 1) CS CS CS CS CS CS CS CS CS CS CS CA O6 WE 7 Microprocessor Interfacing Web Engineering System Programming Distributed Database Systems Data Warehousing Numerical and Symbolic Computing Operations Research Simulation and modelling Expert Systems Artificial Neural Network Fuzzy Logic 3 (2.
0) 3 (3. German. Urdu etc. 0) 3 (3. 0) 3(3. 0) 3 (3. 3 3 3 3 3 15 Cr. 0) 3 (3. 4 4 3 3 3 17 Cr. Hrs. Sindhi.University Elective courses Computer Science – University Elective Courses (18 Credit Hours) –(Not limited to the list below) # 101 102 103 104 105 106 107 108 109 Code MG MG MG MG SS PS SS SS SS PreReq Course Title Financial Accounting Financial Management Human Resource Management Marketing Economics Psychology International Relations Foreign/Regional Language (French. Hrs. Hrs. 0) Proposed Semester 4 5 6 7 6 7 7-8 6-8 Sample Scheme of Study for BS (CS) 4–year Program (8 Semesters) (130 Credit Hours) Semester-wise 4-Year Plan Semester 1 Introduction to Computing Programming Fundamentals Calculus and Analytical Geometry Pakistan Studies and Islamic Studies English-I (Functional English) Cr. 0) 3 (3.) Philosophy Credit Hours 3(3. 0) 3 (3. Hrs. 3 3 3 3 3 3 18 40 Semester 2 Discrete Structures Object Oriented Programming Multivariable Calculus Probability and Statistics English-II (Technical and Report Writing Cr. Punjabi. 0) 3 (3. 4 3 4 3 3 17 Semester 3 Digital Logic and Design Data Structures and Algorithms Linear Algebra English-III (Communication Skills) Electromagnetism University Elective I Semester 4 Operating Systems Differential Equations Introduction to Database Systems Introduction to Software Engineering Computer Organization and Assembly Language .
Hrs. 3 3 3 3 3 3 18 Cr. 3 3 3 3 3 3 18 Cr. Hrs.Semester 5 Computer Communication and Networks Theory of Automata & Formal Languages Computer Architecture Human Computer Interaction University Elective II University Elective III Cr. 3 3 3 3 12 Compiler Construction CS Elective I Numerical Computing Design and Analysis of Algorithms CS Elective II University Elective IV Semester 7 Software Design Project I Professional Practices CS Elective III CS Elective IV Artificial Intelligence Semester 8 Software Design Project II CS Elective V CS Elective VI CS Elective VII 41 . 3 3 3 3 3 15 Semester 6 Cr. Hrs. Hrs.
Prentice HALL. Data Movement. "Computer Organization & Architecture". Patterson and John L. Objectives and Perspectives of Assembly Language. Computer Organization and Design. Introduction to Registers and Flags. NFAs. Prentice Hall. Describe actions inside the processing chip. Irvine. Transducers (automata with output). Assembly Language for Intel-based Computers. Memory Organization and Structure (Segmented and Linear Models). At the end of the course the students should be capable of writing moderately complex assembly language subroutines and interfacing them to any high level language. Manipulate and translate machine and assembly code. Discuss operations performed by an instruction set.COURSE CONTENTS For BS Computer Science Computer Science – Core Courses (18 credit hours) Course Name: Computer Organization and Assembly Language Credit Hours: 3 Course Structure: Lectures: 2. 3. The Hardware/Software Interface. Labs: 1 Prerequisites: Digital Logic Design Objectives: The main objective of this course is to introduce the organization of computer systems and usage of assembly language for optimization and control. Course Name: Theory of Automata and Formal languages Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Prerequisites: Discrete Structures Objectives: The course aims to develop an appreciation of the theoretical foundations of computer science through study of mathematical & abstract models of computers and the theory of formal languages. Reference Material: 1. Peripheral Control Interrupts. Finite automata (FAs). 5th ed. Stack and its operation. Regular expressions/Regular languages. 2007. by David A. 42 . Theory of formal languages and use of various abstract machines as ‗recognizers‘ and parsing will be studied for identifying/validating the synthetic characteristics of programming languages. Interfacing with high level languages. Hennessy. Some of the abstract machines shall also study as ‗Transducers‘. Emphasis should be given to expose the low-level logic employed for problem solving while using assembly language as a tool. Write a fully documented program. 7th ed. Subroutines. Data and Control. Programme Control. 2008. Using an assembler of choice. Elsevier Publishers. Introduction to the Assembler and Debugger. Real-time application. Addressing Modes. Kleene‘s theorem. Course Outline: Microprocessor Bus Structure: Addressing. Transition graphs (TGs). Stallings. 2006. 4th ed. 2. Arithmetic and Logic. Course Outline: Finite State Models: Language definitions preliminaries.
By John C. Algorithms in C++. Normal form grammars and parsing. C. Text Books/Reference Books: 1. Jones & Bartlett Publishers. Introduction to Algorithms /2E. Hashing. and R. New Age Publishers. Variations on TM. Introduction to Automata Theory. Dynamic programming. L. Taking actions by using the knowledge of the environment and desired goals to plan and execute actions. NY. Several measures of complexity are introduced. 2006 2. E. derivation trees and ambiguity. Derivations. and efficiency of algorithms. Defining Computers by TMs. Course Name: Design and Analysis of Algorithms Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Discrete Structure. By S. Polynomial and matrix calculations. Heaps. 2005. McGraw-Hill Professional. Asymptotic notations. Chomsky‘s hierarchy of grammars Turing Machines Theory: Turing machines. H. Graph algorithms. complexity. 4th edition. Learning from past experience. T. Modelling the environment by constructing computer representations of the real world. Eugene. 2. New York. Sorting. By Peter Linz. McGraw-Hill. TM encoding. Greedy approach. Kavier. Introduction to Languages and the Theory of Computation. Robert Sedgewick Course Name: Artificial Intelligence Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Discrete Structures Objectives: This course studies four main objectives of AI. Languages. MIT Press. Decidability. Universal Turing Machine. Divide-and-conquer approach. Context sensitive Grammars. Addison-Wesley. Recursion and recurrence relations. Shortest paths. Leiserson. 2nd edition.obtaining and creating information/knowledge to populate a computational representation. String matching. Reference Material: 1. 3. Data Structures and Algorithms Objectives: Detailed study of the basic notions of the design of algorithms and the underlying data structures. 43 . Formal Languages and Computation. Rivest. Cormen. Course Outline: Introduction. and Computation. Perception and reasoning . Simplifying CFLs . Search trees. ISBN (13) : 978-81-224-2334-1. 2001. John Hopcroft and Jeffrey Ullman. P. Network flow. 4. ISBN (10): 81-224-2334-5. NP complete problems.Pumping lemma and non regular language Grammars and PDA: Context free grammars. An Introduction to Formal Languages and Automata. 2001. Martin3rd edition. Approximation algorithms. Emphasis on the structure. Post machine. Theory of Automata. 2002. Disjoint Sets.
working knowledge of various subsystems and the general principles that affect their performance. perceiving. 44 . Resources: 1. Prentice Hall. Labs: 0 Credit Hours: 3 Prerequisites: Digital Logic and Design Objectives: Get a deeper understanding of how computers work. and acting: Communication. principles of Instruction Set Design. Case Studies. Main Memory Performance Issues. analyze the performance of systems and quantify the performance measurements. Uncertain knowledge and reasoning: Uncertainty. Learning: Learning from Observations. and will know significant details of a number of important techniques commonly used. Course Name: Compiler Construction Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Theory of Automata and Formal Languages Objectives: At the end of the course students should understand the overall structure of a compiler. exception handling features. Knowledge in Learning. Introduction to LISP/PROLOG and Expert Systems (ES) and Applications. 2008. 2. Reference Material: 1. Cache Design. Multiprocessors and Thread Level Parallelism. Storage Systems. fundamentals of all technologies. Morgan & Kauffman Series (2006) Fourth Edition. 6th edition: Pearson Education. 2. Adversarial Search. Canny. Perception and Robotics. Making Complex Decisions. Knowledge and reasoning: Logical Agents. Making Simple Decisions. Computer Organization & Design : The Hardware/Software Interface By Patterson & Hennessy. Communicating. Intelligent Agents. Planning and Acting in the Real World. pipelining of Processors: Issues and Hurdles. Performance Issues and improvements. Reinforcement Learning. 2nd Edition. Artificial Intelligence: Structures and Strategies for Complex Problem Solving: International Edition By George F. addressing modes and encoding. Operands. Probabilistic Reasoning over Time. Constraint Satisfaction Problems. Artificial Intelligence: A Modern Approach. Course Name: Computer Course Structure: Lectures: Architecture 3. Problemsolving: Solving Problems by Searching. Inference in First-Order Logic. Peter Norvig. Course Outlines: Fundamentals of Computer Design including performance measurements & quantitative principles. and advanced architectural features that boost the performance of computers. Knowledge Representation. Probabilistic Reasoning. John F. Memory Hierarchy Design. Computer Architecture: A Quantitative Approach by Hennessy & Patterson. Instruction-Level Parallelism and Dynamic handling of Exceptions. Statistical Learning Methods. Probabilistic Language Processing.Course Outline: Artificial Intelligence: Introduction. Morgan & Kauffman Series (2008) Fourth Edition. Luger. They will be aware of the way in which language features raise challenges for compiler builders. First-Order Logic. 2003. Informed Search and Exploration. By Stuart Jonathan Russell.
Functions of any period P-2L. Maia Ginsburg. Parsing techniques.1987 Original from the University of Michigan 2. Object code generation and optimization. John Wiley. Co. Trench. 2000. Koen G. 2004. Even & odd functions. Ullman . Techniques. Equations Reducible to 45 . Thomson Learning EMEA. 6th edition. and developing differential equations for real-world problems. Bernard Kolman. Computer Science – Supporting Courses (9 credit hours) Course Name: Multivariable Calculus Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Calculus and Analytical Geometry Objectives: The goals are to develop the skills to have ground knowledge of multivariate calculus and appreciation for their further computer science courses. Cambridge University Press. Multivariable Calculus. Koen G. Henri E. 2. Cengage Learning publishers. Compilers: Principles.Course Outline: Compiler techniques and methodology. 2003. Separable Equations. Ceriel J. Olinick and Pence. Multiple Integrals. Contributor Jeffrey D. Course Outline: Functions of Several Variables and Partial Differentiation. Ceriel J. 1971. Ullman. John Wiley. detection and recovery from errors. 3. Henri E. Langendoen. Aho. Elementary Multivariable Calculus. Jacobs. By Dick Grune. Jeffrey D. 6th edition. Half Range expansions. H. Bal. Ravi Sethi. James Stewart. Course Name: Differential Equations Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Calculus and Analytical Geometry Objectives: Develop fundamental skills of solving ordinary differential equations. Course Outline: Ordinary Differential Equations of the First Order: Geometrical Considerations. Modern Compiler Implementation in C. ZTransform. Fourier Series: periodic functions. 5th edition. John Wiley & Sons. Fourier Transform. 1995. Calculus and Analytical Geometry. Appel. William F. Reference Material: 1. Swokowski. Modern Compiler Design by Dick Grune.Addison-Wesley Pub. Albert Herr. Organization of compilers. Isoclines. Jacobs. Academic Press. 4. Bal. 2007. Multivariable Calculus. Langendoen. Green‘s and Stoke‘s Theorem. Line and Surface Integrals. Laplace Transform.. 2nd edition. 4. and Tools By Alfred V. Modern Compiler Design. Reference Material: 1. Howard Anton. Lexical and syntax analysis. By Andrew W. Ltd. Contrast between compilers and interpreters. H. 3. Contributor Maia Ginsburg. 1994.
Prentice Hall. Double Root of the Characteristic Equation. 4. Non-homogeneous Linear Equations. Michael Greenberg. Integrating Factors. Khubaza Numerical Analysis and Programming : Shan S Kuo Numerical Analysis by Berden Fairs 46 . Advanced Engineering Mathematics. Ordinary Linear Differential Equations. students will be able to demonstrate programming proficiency using structured programming techniques to implement numerical methods for solutions using computer-based programming techniques .using Matlab for all methods. Series Solutions of Differential Equations. 1996. Brooks/Cole Publishing. Course Name: Numerical Computing Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Calculus and Analytical Geometry Objectives: On completion of this unit. Direct Methods for Solving Linear Systems. Numerical Methods for Scientific Computing : J. Differential Operators.A. Heat & Laplace equations and their solutions by Fourier series method. Reference Material: 1. Theory of Differences. 3. Penney.H. Difference Tables. Dennis G. Cullen. Complex Roots. 2. 4. Homogeneous Second-Order Equations with Constant Coefficients. Prindle. Course Outline: The concepts of efficiency. Homogeneous Linear Equations of the Second Order. Michael R. H . Heinbockel Numerical Analysis: I. Brooks/Cole Publishing. Iterative Techniques in Matrix Algebra. 5. C. John Wiley & Sons Inc. Initial Value Problems for Ordinary Differential Equations. reliability and accuracy of a method. 1996. 3. Differential Equations with Boundary-Value Problems. Zill. Numerical Methods in Scientific Computing Germund Dahlquist and Åke Björck . Modelling of Electrical Circuits. Reference Material: 1. 7th edition. Exact Differential Equations. Homogeneous Linear Equations of Arbitrary Order. Homogeneous Linear Equations of Arbitrary Order with Constant Coefficients. Weber and Schmidt.Edwards. Zill. Interpolation and Polynomial Approximation. Advanced Engineering Mathematics. 5. wave. General Solution. Backward Differences and Central Differences. The course must serve the purpose of scientific software development for science and engineering problems. Mathematical Preliminaries. Partial Differential Equations: Method of Separation of variables.Separable Form. Forward Differences. Minimising computational errors. Variation of Parameters. Solution of Equations in one variable. 1996. Difference Operators. Elementary Differential Equations With Applications. 1993. Prentice Hall publishers. Systems of Differential Equations. Erwin Kreyzig. 2. Real Roots. Solution of non-linear equations. Linear FirstOrder Differential Equations. A First Course in Differential Equations. 1993. Cauchy Equation. Numerical Differentiation and Numerical Integration. David E.
A. and segmentation. Another important objective of this module is to learn about various information systems used in industries and select the appropriate information system for the required application. Bandreject Filters. Course Outline: Graphics hardware. Fundamental algorithms. Two and three dimensional imaging geometry (Perspective projection and Orthogonal projection) and transformations. characters and circles. Addison-Wesley ISBN: 0-201-12110-7. Edge Linking and Boundary Detection. Local Processing. Peter Burger and Duncan. S.Hill. Reference Material: 1. methods. Region-Based Segmentation. Differential Line Algorithm. Basic Global Thresholding. Feiner and J. Foley. Estimation by Image Observation. J. (2003) Course Name: Digital Image Processing Credit Hours: 3 Course Structure: Lectures:3 Labs: 0 Prerequisites: Objective: The aim of this module is to understand the main terms & concepts of Information Systems & their applications in everyday business. computers and telecom and to manage IT systems in modern organisational structure. Procedural and Device-level 2. Maxwell MacMillan ISBN: 0-02-354860-6. Mean Filters. Gillies. Scaling. Point Detection. Estimating the Degradation Function. Thresholds Based on Several Variables. colour and animation. Region filling and clipping. Basic Adaptive Thresholding. Detection of Discontinuities. Curve and surface design. F. Raster algorithms and software — Scan-Converting lines. Edge Detection. Estimation by Modeling. Hughes. Estimation by Experimentation. Local Thresholding. Translation. panning and zooming. Image Segmentation. Adaptive Filters. The Role of Illumination. Interactive graphics programming — graph plotting. F. Principles and Practice. K. Line Detection. 2. Programming raster display systems. Addison-Wesley. rendering. Region Splitting and Merging 47 .S. Periodic Noise Reduction by Frequency Domain Filtering. 3. windows and clipping. van Dam. 1. Global Processing via the Hough Transform. Rotation. Notch Filters. Region Growing. D. The main objectives of this module are to make business students aware of the increasing importance of IT. shading. Applications of graphics.6. Numerical Analysis by Gerald Computer Science – Elective Courses (21 credit hours) Course Name: Computer Graphics Course Structure: Lectures: 2 / Labs: 3 Credit Hours: 3 Prerequisites: Object Oriented Programming . Visual Programming Objectives: Study of various algorithms in computer graphics and their implementation in any programming language. Thresholding. Inverse Filtering. Computer Graphics. Bandpass Filters. Minimum Mean Square Error (Wiener) Filtering. F. Computer Graphics. Restoration in the Presence of Noise Only–Spatial Filtering. Order-Statistics Filters. Interactive Computer Graphics: Functional.
Fourier series representation of periodic signals. Students will also be able to illustrate some successful applications of vision systems and will be able to identify the vision systems limitations. Prentice Hall. Convolution. Invertability. Signals and systems.Energy of a signal. Analog and digital/discrete signal. Course Outlines: Concepts behind computer-based recognition and extraction of features from raster images. Discrete time signal Processing Course Name: Computer Vision Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Pre-Req: Data Structures and Algorithms Objectives: By the end of this course Students will be able to explain the concepts behind computer based recognition and the extraction of features from raster images. Shapiro. Computer Vision. Oppen Heim. Transformation Of independent variable. analogy to edge point detection and Hough transform. Fourier series representation. By Linda G. Depth measurement in images. Relaxation labelling of images: detection of image features. LTI system with and without memory.Course Name: Digital Prerequisites: Signal Processing Credit Hours: 3 Course Structure: Lectures:3 Labs: 0 Objective: Introduction to signal. Session 1 of Matlab. Impulse response of an LTI system. Associative property. Causality. Computer Vision: A Modern Approach. Sobel and Laplacian operators. Jean Ponce. 2003. limitations of the Hough transform. grouping edge points into straight lines by means of the Hough transform. Perceptual grouping: failure of the Hough transform. mean and variance pyramids. 1. Distributive property. Examples of Fourier series representation. Overview of early. Mathematical representation of periodic signal. 3. Difference b/w continuous time and discrete time signal. Oppenheim. Prentice Hall. Stockman. computing the first and second derivatives of images using the isotropic. Overview of mammalian vision: experimental results of Hubel and Weisel. grouping line segments into curves. Reference Material: 1. Examples of an LTI system. Session 2 of Matlab. Text Books/Reference Books: 2. By David Forsyth. Segmentation: region splitting and merging. Examples of Fourier series representation. Properties of an LTI system. Properties of an LTI system. Fourier series representation of periodic signal. Applications of DSP. with circle. intermediate and high level vision. 2. Euler‘s relation. perceptual criteria. Step response of an LTI system. Stability. 2001. parameterisation of conic sections. Grouping of contours and straight lines into higher order features such as vertices and facets. Relation of complex no. improved Hough transform with perceptual features. quadtree structures for segmentation. Signal types. Commulative property. applications of vision systems and their limitations. George C. Unit impulse and unit step and their relationship. 48 .
2006. Addison-Wesley. Roger Pressman. Yunmei Chen. Software Process Framework Process Models Agile Software Process Software Engineering Practices System Engineering Requirement Engineering Analysis Modelling Design Engineering Architectural Design Component Design User Interface Design Testing Strategies Testing Tactics Product and Process Metrics Project Management Project Estimation Project Scheduling Risk Management Quality Management Change Management Text Books/Reference Books: 1. By Nikos Paragios. UML Distilled Course Name: Data Course Structure: 3 Pre-requisite: Communication Credit Hours: 3 Objectives: To provide knowledge of Data Communication and different 49 . validation and testing. Sixth Edition. Handbook of Mathematical Models in Computer Vision. Upon successful completion of this course the student will be to understand the importance of software engineering to computer science and the most important general approaches to structuring the software production process. Olivier Faugeras. 2. Ian Sommerville. 3. Software Engineering: A Practioner's Approach. Software Engineering. Course Name: Software Engineering Credit Hours: 3 Course Structure: Lectures: 3hrs Objective: The students will study techniques for software verification. use different testing techniques used in software engineering to test software systems. Birkhäuser. 2001 (7th edition). They would also study reliability and performance issues in software design and development. analyze the requirements for a software system and produce a software design from requirements (Data Flow Diagram (DFD)). manage the important issues for planning a project. McGraw-Hill. 2005. Course Outlines: Introduction to Software Engineering.4. assess software productivity using metrics.
Stallings. Elliptic curves. B. ASK. Data and Network. QAM. Pthreads. NJ. W. William Stalling. 1/e. 2. 3rd Edition. Emerging Internet security standards. Other Parallel Programming Systems. Course Name: Data and Network Security Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outlines: Introduction. Data Communication Protocols. PVM. More on Block Ciphers. Modulation. Business Data Communication. Confidentiality & Message authentication: Hash functions. Digital Transmission. 1993. 50 . Behrouz A. Common parallelization strategies. Data Communication Techniques and technologies. Introduction to Signals. Firewalls. Aurora: Scoped behaviour and abstract data types. Kerberos and directory authentication. Upper Saddle River. Forouzan. Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall. distributed shared data (DSD). MPI. Identification schemes. The Advanced Encryption Standard. Number theory and algorithm complexity. 1999. Key management schemes. Software architectures: threads and shared memory. Dial-up security.mechanisms of communication Course Outlines: Introduction. Miscellaneous topics. SSL and IPsec. E-mail security. Possible research and project topics. Concurrency and synchronization. Data Communication and Networking. Data and work partitioning. Locks and semaphores. Public key Encryption. Layers. Parallel Algorithms. Distributed-Memory Programming: Message Passing. networks of workstations (distributed memory). PGP. 2. Types of errors. PCM. Stream and block ciphers. Wilkinson and M. Enterprise: Process templates. Distributed shared memory. Prentice Hall PTR. Shared-Memory Programming: Threads. Hardware architectures: multiprocessors (shared memory). distributed shared memory (DSM). Granularity. Load balancing. Research Topics Text Books/Reference Books: 1. Transmission Media. Allen. clusters (latest variation). Reference Material: 1. S-MIME. W. Viruses. Text Books/Reference Books: 1. Digital signatures. Cryptography and Network Security. etc. FSK. DES. PSK. Examples: parallel search. 2003. Current technologies being used for data communication. processes and message passing. Multiplexing. Conventional encryption techniques. Addison Wesley. Advanced Programming in the Unix Environment. PAM. Course Name: Distributed Computing Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outlines: Why use parallel and distributed systems? Why not use them? Speedup and Amdahl's Law. Stevens. OSI Model. Cryptology and simple cryptosystems. SET. parallel sorting. RSA and Discrete Logarithms. VPNs.
Boca Raton. 7. Prentice Hall. Microwave links. radio propagation models. Cryptography: Theory and Practice. Mollin. Introduction to optical sources and detectors. Stinson. David Tse.P. T. Course Name: Telecommunication Course Structure: Lectures:3 Labs: 0/3 Prerequisites: None Systems Credit Hours: ¾ Objectives: To provide a first level exposure to the broad domain of telecommunication Systems Course Outline: Introduction to media. Upper Saddle River. GSM. W. H. B. cdma2000. As an example for the third generation air interfaces. Theodore S Rappaport. An Introduction to Cryptography. Vanstone. Perlman. Block diagram and current trends. ―Mobile Communications‖. CRC Press. Introduction to mobile and cellular communications. 1996. Holma and A. second. 5. Text Books/Reference Books: 1. ―WCDMA for UMTS Radio Access for Third Generation Mobile Communications‖. Speciner. Kaufman. Handbook of Applied Cryptography. IS-136. Schiller. 51 . FDMA. 2002. 8. common air protocols (AMPS. Second Edition.2. medium access techniques. Course Name: Wireless Networks Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outlines: This course covers fundamental techniques in design and operation of first. TDM. 3. satellite communication and infrared links. handoff. 5. TDMA and CDMA. Applied Cryptography. Schneier. etc). IS-95. Prentice Hall PTR. A. radio resource and network management. 2002. Stallings. CRC Press. Chapman and Hall/CRC. and S. R. and third generation wireless networks: cellular systems. Switching: circuit and packet switching. NJ.S. Menezes. 2000. EDGE. ―Wireless Communications: Principles & Practice‖. 2000. GPRS. Richard A. Prentice Hall. M. 2. This course is intended for graduate students who have some background on computer networks. Twisted pair (UTP. Wiley.K. optical fibres (types and losses). Frequency Division Multiplexing (FDM). WCDMA is discussed in detail since it is expected to have a large impact on future wireless networks. P. J. 7. 2002. 2001. Bishop. Castro. FL. FL. 6. 4. ―Wireless Communications and Networks‖. John Wiley and Sons. Garg. WCDMA. Computer Security: Art and Science – Addison-Wesley. power control. Rappaport. ―The UMTS Network and Radio Access Technology . John Wiley & Sons. STP). Boca Raton. 2001. J. Network Security: Private Communication in a Public World – Prentice Hall PTR.Air Interface Techniques for Future Mobile Systems‖. Toskala. 4. 6. 1995. M. 1997. 2001. V. Addison Wesley. 3. Wireless Communications. error control techniques. NY. coaxial cables (types and specifications). bandwidth and noise. Oorshcot. Fundamentals of Wireless Communications. 2003. ―IS-95 CDMA and cdma 2000‖.
Saadawi. 2.Reference Material: 1. Dynamic shared objects. Distributed DBMS architecture. Fonteolliet. Principals of Distributed Database Systems by Ozsu Tamer. Course Name: Distributed Database System Credit Hours: 3 Course Structure: Lectures: 3 (3. Device Drivers. System Programming. Artech House 1991. Reference Material: 1. 3. Artech House 2003. System Software. Distributed Database Recovery. Windows Architecture. Distributed Query Processing. Telecommunication Systems. macro-processors. Addison-Wesley Longmsan. Ring O Computer. Database Systems by Thomas Connolly. The UNIX Programming Environment. Distributed database design and Data Distribution Strategies. Course Outline: System Programming overview: Application Vs. T.S Programming for I 386. P. Leland L. Pike Prentice-Hall. ISBN: 0-201-50945-8. Operating System. COFF obj format 16 bit. Kernighan & R. Course Outline: Introduction. Unix Device Architecture (Character & Block Devices). G. Virtual Machine (VM)Basics. Virtual Device Driver (V + D). ISBN: 1580535003. OS Calls. Enhancing Unix Kernel. interpreters. loaders. Distributed Data Security. 2. New Executable format. (Unix) other 32-bit O. Module Management. Course Name: System Programming Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Operating Systems Objectives: Demonstrate mastery of the internal operation of Unix system software including assemblers.0) Prerequisites: Database Systems Objectives: To clearly describe the difference of Centralized database and Distributed database and enable the students to design/model a distributed database. System Software. 1984. Introduction to Telecommunications Network Engineering. Aattalainen. interprocess communication. Fundamentals of Telecommunication Networks. Window System Programming for Intel386 Architecture: 16 bit Vs 32 bit. Unix Kernel Programming (Ring O). Reference Material: 1. 1990. Portable Executable Format. Overview of relational DBMS and Normalization. T. B. Distributed Transaction Management. Replication/Fragmentation. Unix Binaryble format (ELF). 52 . Linear Executable format. 2nd edition. ISBN: 0471515825. Wiley US. 32 bit Flat memory model. Beck. Distributed Concurrency Control. Programming. 2. Device Driver Development. System Virtual Machine.
ISBN: 1591840562. And enable the students to understand different features / issues in datawarehousing and its designing.Course Name: Datawarehouse Course Structure: Prerequisite: Database Systems Credit Hours: 3 Objective: To provide the Introduction of Datawarehouse and its purpose. The course gives students the tools necessary to think creatively. Data Warehouse Architecture. or to support an employer in launching and growing an entrepreneurial venture. Course Name: Entrepreneurship Course Structure: Lectures: 3 Labs: 0 Credit Hours: 3 Pre-requisite: Introduction to Management. Cleansing and Loading process and techniques. 53 . Designing a Data warehouse. Extraction. the focus shall be on items particularly important for technology ventures. practices and tools of the entrepreneurial world. Course Outline: Introduction to Data Warehouse and Data Marts. cases studies and projects designed to convey the unique environment of the entrepreneurs and new ventures. Semester: 8 Principles of Accounting Course Outlines: This course provides the student with an understanding of the entrepreneurship process. Comparison Of DM & ER Models. to plan out whether their idea is marketable to investors. Dimensional Modeling. Text Books/Reference Books: 1. It exposes them to the concepts. Battle-Hardened Guide for Anyone Starting Anything by Guy Kawasaki. This will be accomplished through a combination of readings. Comparison of OLTP Systems & Data Warehousing. The Art of the Start: The Time-Tested. As CS students. End user tools. OLAP. guide them through the launch their own business.
Curriculum for MS (Computer Science)
The recommendations of the last meeting held in August 2008 were also considered and very minor changes in the structure have been made in the light of committee‘s recommendations. The complete detail regarding proposed MS (Computer Sciences) Programme is available herein the following pages Minimum credit hours shall be 30 for MS (Computer Science) programme. The programme shall comprise 4 semesters spread over 2 years with two semesters a year. The additional major areas have been appended in the list of specialization each having on average 4 courses from ―Computer Science Curriculum 2008: Interim Revision of CS2001 report‖ by Interim Review Task Force of ACM and IEEE Computer Society.
The following is the modified distribution of total credit hours:
Category or Area Core Electives Thesis Total Credit Hours Credit Hours 12 12 9 33
A challenging graduate programme may be structured on the basis of the classical objective, which is the preparation for study of doctoral level, and this remains an important aspect of such programmes, but it is believed that all programmes should prepare the student for study beyond the master‘s level. Many people already in the field desire additional training in Computer Science. These individuals may have undergraduate degrees in Computer Science and desire to advance; or they may have considerable experience in Computer Science, but little formal education in the field. While this latter group should be declining in number as more undergraduate Computer Science majors enter the job market, the demand does exist and will continue to do so in the foreseeable future. In addition, there will be a continuing need for individuals with a bachelor‘s degree in Computer Science to update their training. Among the objectives for students in master‘s programmes is entry into the Computer Science field at a relatively high level of responsibility and expertise. Computer Science is such a new and rapidly expanding field that individuals entering with a master‘s degree in this field will almost immediately move to positions with great responsibility. This, in turn, implies the requirement for an advanced level of prior training in both technical and related areas (e.g. communication skills). In all these cases, the master‘s degree provides both motivations for the student and a standard for reward by the employer.
The graduate programme should embody sufficient flexibility to fulfil the requirements of either an ―academic‖ degree (Breadth-Based) obtained in preparation for further graduate study or a terminal ―professional‖ degree (DepthBased). The discipline of Computer Science has matured enough that the distinction between academic and professional programmes is beginning to appear. However, the concept of an utterly terminal programme is not widely accepted in the field. All Computer Science academic programmes should provide the possibility of additional study in the field. The proposed programme is intended to establish an integrated breadth and depth based curriculum model to assure that the common aspects of various potential masters‘ programmes in Computer Science are captured. 56
16 year Science and Engineering graduates are eligible but they have to cover deficiency. A project/thesis work may be unified with student‘s chosen depth oriented specialties. Eligibility BS (CS) 4 Years Degree Programme (min 130 credit hours). or Computer Science Conversion Course 2 Years Degree Programme referred to as ―MCS‖ or ―MSc (CS)‖. BCS-3 years Degree Programme-Student will be required to complete the deficiency of difference of total earned credit hours and 130 credit hours. 57 .The proposed curriculum structure may be implemented within four-semester time. Generally graduate programmes are structured with a common core of fundamental material and wide range of options for the rest of the course work.
Software Quality Assurance Requirements Engineering Software Architecture Agent Oriented Software Engineering Software Project Management Software Design Software Engineering and Formal Specifications Empirical Software Engineering Software Process Improvement Component-Based Computing Programming 3 3 3 3 3 3 3 3 3 3 3 3 3 3 CS CS CS CS CS CS CS CS CS CS CS CS CS CS 3 3 3 3 3 3 3 3 3 3 3 3 3 3 58 .Hrs CS CS CS CS CS CS CS CS CS CS CS CS CS CS Software Engineering Advanced Software Development Topics in Software Engineering Object Oriented Software Engineering.SCHEME OF STUDIES MS (CS) Courses Requirements: Core courses # 1 2 3 4 Code CS CS CS CS Course Title Advanced Theory of Computation Advanced Algorithm Analysis Advanced Operating Systems Credit hours 3 3 3 3 Semester 1 1 1 1 Advanced Computer Architecture (12/30) Electives (Specialized Areas)-Not limited to the list given below (4 Courses of 12 credit hours) Code Specialization Areas Crt. Hrs Code Specialization Areas Artificial Intelligence Design of Intelligent Systems Machine Learning Neural Networks Mathematical Reasoning Decision Support Systems Computer Vision Automated Reasoning Knowledge based systems Planning systems Natural Language Processing Agents Robotics Symbolic Computation Genetic Algorithms Crt.
CS Environment Safety-Critical Systems Information Management 3 CS Semantic Web 3 CS CS CS CS CS CS CS CS CS CS CS CS CS CS CS Advanced DBMS Multimedia Information Systems Database Design Transaction Processing Distributed and Object Databases Data Mining Spatial and Temporal Databases Semantic Databases Data Warehousing Object Oriented Databases Digital Libraries Web-Based DBMS Topics in DBMS Data Grids Text Mining System Engineering 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 CS CS CS CS CS CS CS Computer Architecture and Organization Embedded Systems Parallel and Distributed Systems Design Verification Integrated Circuit System on a chip VLSI Development Device Development Graphics and Visual Computing Advanced Computer Graphics Multimedia & Hypermedia System Virtual Reality Visualization Geographical Information Systems Computer Animation Genetic Algorithms Human Computer Interaction 3 3 3 3 3 3 3 CS CS CS CS CS CS CS CS 3 3 3 3 3 3 3 3 CS CS CS CS CS CS CS CS CS Digital Signal Processing Switching and Fault Diagnosis FPGAs and Verilog Control Systems and Robotics Real Time Systems Parallel & Distributed Systems Control Systems and Robotics Real Time Operating Systems Embedded System 3 3 3 3 3 3 3 3 3 59 CS CS CS CS CS CS Computer Science Education Educational Technology Multimedia and Hypermedia Sys Computer Aided Instructions Web Based Education Systems Measurement of Learning Topics in Comp Science Education 3 3 3 3 3 3 .
Tolerance 3 3 3 60 .CS CS ASIC Design VHDL 3 3 CS Human Computer Interaction Intelligent User Interfaces Information Retrieval Techniques Rich Internet Applications Graphical User Interfaces ComputerSupported Cooperative Work (CSCW) Multimedia Systems Development Interactive-Systems Development 3 3 3 3 Net-Centric computing CS CS Advanced Computer Networks Network Security Topics in Computer Networking Broadband and Satellite Communication Mobile and Pervasive computing Wireless and Mobile Computing Networks Intelligent and active networks Network Performance Evaluation Cluster Computing 3 3 CS CS CS CS 3 CS 3 CS CS CS CS 3 3 3 3 CS CS 3 3 Social and Professional Issues (SP) CS CS CS CS CS CS Social Context computing Computing and Ethics Computing Economics Computer Law Intellectual Property Privacy and Civil Liberties 3 3 3 3 3 3 CS CS CS CS CS CS CS 3 3 Distributed Computing 3 Data Compression Network Management Enterprise Networking Programming for the World-Wide Web 3 3 3 3 Operating Systems Programming Language Design and Translators CS CS Compiler Construction Programming Language Design 3 CS CS CS Concurrent and Distributed Systems Dependent Computing Fault.
Time Systems 3 CS CS CS Discrete Structures Combinatorics Probability and Statistics Coding and Information Theory 3 3 3 CS CS CS CS Computational Science Computational Science Numerical Analysis Operations Research Simulation and Modelling Scientific Computing Computational Biology Web Engineering Semantic Web Web Services 3 3 3 3 3 3 CS CS CS CS CS CS CS Grid and Cloud Computing Autonomous Computing Data Grids Semantic Grid Computational Grid Utility Computing Autonomous Computing Data Grids CS 3 3 3 3 3 3 3 CS CS CS 3 3 61 .CS CS CS CS CS CS CS CS CS CS CS Programming Language Semantics Programming Paradigms Functional Programming Logic Programming Scripting Languages Algorithm and complexity (AL) Advanced Algorithmic Analysis Automata and Language Theory Cryptography Geometric Algorithms Parallel Algorithms 3 3 3 3 3 3 3 3 3 3 3 CS Real.
Model Programme: Semester-wise Plan MS (CS) Semester 1 (12 credit hrs) Subjects 1 2 3 4 CS CS CS CS Advanced Theory of Computation Advance Algorithm Analysis Advanced Operating Systems Advanced Computer Architecture Credit Hrs 3 3 3 3 Total: 12 Semester 2 (9 credit hrs) Subjects 1 2 3 CS CS CS Elective I Elective II Elective III Credit Hrs 3 3 3 Total: 9 Semester 3 (4 credit hrs) Subjects 1 2 CS CS Thesis (partial registration) Elective IV Credit Hrs 3 3 Total: 6 Semester 4 (5 credit hrs) Subjects 1 CS Thesis (partial registration) Credit Hrs 6 Total: 6 Total (all semesters) = 33 62 .
Course Description and Profiles: Core Courses: Course Name: Advanced Theory of Computation Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Automata theory.. and numerical approximations) are covered. John Hopcroft and Jeffrey Ullman. 2. and the implications of non-computability. backtracking. Additional topics include standard complexity classes. Languages. Peter Linz. An Introduction to Formal Languages and Automata. students should be able to explain the mathematical concepts used in describing the complexity of an algorithm. Published by MIT Press. Topics include asymptotic analysis of upper and average complexity bounds using big-O. Search Techniques. computability theory and reducibility. Addison-Wesley. First Edition. (or the second edition). Leiserson. 2004. branch-and-bound. using recurrence relations to analyze recursive algorithms. Computational Complexity. By Thomas H. Introduction to the Theory of Computation. formal languages.. CRC Press. 1994. 63 . Fundamental algorithmic strategies (brute-force. non-computable functions. Formal models and Computability. Randomized Algorithms. 2001. Algorithmic animation is used to reinforce theoretical results. greedy. Rivest. Ronald L. NP-completeness. Atallah. 1996. 1979. MIT Press and McGraw-Hill Book Co. 3. Introduction to Algorithms. time and space tradeoffs in algorithms. selected advanced topics. Turing machines. computational complexity. space hierarchy. T. Cormen. 2nd edition. Text Books/Reference Books: 1. By Vijay V. Clifford Stein. Also included are standard graph and tree algorithms. the halting problem. By Mikhail J. Approximation Algorithms. Upon completion of the course. and select and apply algorithms appropriate to a particular situation. Christos Papadimitriou. pattern matching. Introduction to Algorithms. Ming Li.H. Heuristic and Approximation Algorithms. Algorithms and Theory of Computation Handbook. and Computation. 1990. 6. Charles E. and theta notation. Addison-Wesley. 3. et al. in Handbook of Computer Science. NP completeness. and Bala Ravikumar. PWS Publishing Company. 2. divide-and-conquer. Tao Jiang. Atallah Contributor Mikhail J. Springer. Introduction to Automata Theory. CRC Press. nondeterminism. ISBN: 0-66917342-8. 1998. determinism. Text Books/Reference Books: 1. Vazirani. time hierarchy. Michael Sipser. 1997. Cormen. 5. 4. little-o. Course Name: Advance Algorithm Analysis Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Pre-Req: Data Structures and Algorithms Course Outline: Advanced algorithm analysis including the introduction of formal techniques and the underlying mathematical theory.
―Scalable Parallel Computing Technology. file systems. Various coarse-grained and fine-grained architectures with reference to SIMD and MIMD designs should also be covered.Problems of coordination and agreement in Distributed Systems . Jean Dollimore and Ttim Kindberg 2.Introduction Characterization of Modern Operating Systems. Addison-Wesley Publishers. McGraw Hill Publishers. Process scheduling and resource management.Concurrency Control in Distributed Systems . Sinha 3. Distributed Operating Systems: Concepts and Design by Pradeep k. Course Outlines: This course is aimed at the hardware aspects of parallel computer architectures including the design and protocols evaluation for memory coherence. Course Contents Course Outline: .Course Name: Advance Operating System Credit Hours: 3 Course Structure: Lectures:3 Labs: 0 Prerequisites: Objective: To apprise the students with characteristics of modern operating systems and architectural models. Programming‖. 64 .Issues of Security in Distributed Systems (Partial coverage) . Terence Fountain. as a foundation for advanced work in computer architecture. Distributed Systems Concepts and Design 4th edition by George Coulouris. memory management techniques. 1998. ―Advanced Computer Architecture: A Design Space Approach‖. Kai Hwang. Peter Kacsuk. . Zhiwei Xu.Mobile and Ubiquitous Computing Reference Books 1. 1997.System Models Architectural models . 2. Text book: 1. Advanced topics in this course will cover multiprocessors on a chip.Interprocess Communication .Distributed File System . inter-connection networks and system scalability. Architecture.Replication – Advantages and requirements Fault-tolerant services . Dezso Sima. reconfigurable computing and power aware designs. Advanced Concepts in Operating Systems by Singhal and Shiviratri Course Name: Advance Computer Architecture Credit Hours: 3 Course Structure: Lectures:3 Labs: 0 Prerequisites: Computer Architecture Objective: To develop a thorough understanding of high-performance computer architecture.
Load balancing. Concurrency and synchronization. bilinear transform. Locks and semaphores. distributed shared data (DSD). 2. Distributed shared memory. Distributed-Memory Programming: Message Passing. Other Parallel Programming Systems. Advanced Programming in the Unix Environment. MPI. Granularity. Possible research and project topics. Text Books/Reference Books: 1. Schafer. Allen.Electives Courses Course Name: Digital Signal Processing Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: One. Shared-Memory Programming: Threads. Impulse invariance. Common parallelization strategies. 2nd edition Alan V. Research Topics. PVM. 1999. Addison Wesley. Adaptive filters: LMS and array processing. Parallel Algorithms. Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Data and work partitioning. distributed shared memory (DSM). etc. parallel sorting. Software architectures: threads and shared memory. Examples: parallel search. Optimal filtering: Wiener filters. fast Fourier transform. Prentice Hall. FIR filter design. Aurora: Scoped behaviour and abstract data types. Text Books/Reference Books: 1. Stevens. 65 . networks of workstations (distributed memory). 1/e. Hardware architectures: multiprocessors (shared memory). Enterprise: Process templates. Wilkinson and M. Statistical signal processing: Stochastic signals: correlation functions and power density spectra. Course Name: Parallel and Distributed Computing Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outlines: Why use parallel and distributed systems? Why not use them? Speedup and Amdahl's Law. discrete Fourier transform. Oppenheim and Ronald W. 1993. Prentice-Hall. z-transforms: stability and minimum phase signals/systems. Sampling theorem. Pthreads. Discrete-Time Signal Processing.and N-dimensional signals and systems. Discrete-time Fourier transform. Linear filtering of signal: Time domain: Difference equations and convolution. processes and message passing. clusters (latest variation). 2D filter design. W. B.
current trends. Dorf.C. Prentice Hall. interactive and multimedia. Introduction to state space methods. 3. Modern Control Systems. and others. Internet Addressing. such as autonomous robotics.Course Name: Control Systems and Robotics Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Review of classical control analysis methods. distributed systems management Protocols. Course Name: Real Time Operating Systems Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: The principles of real-time and embedded systems inherent in many hardware platforms and applications being developed for engineering and science as well as for ubiquitous systems. Next Generation IP – Ipng. packet and circuit switching. web-based management 66 . Controllability and observability. Algorithms. understand real-time operating systems and the resource management and quality of service issues that arise. 2. Nyquist stability criterion. Network Security. Bissell. Issues with wireless over TCP. Control Engineering. Publisher: Chapman & Hall. 1990. ICMP. and construct sample applications on representative platforms. Text Books/Reference Books: 1. Platforms range from handheld and mobile computers to media and real-time server systems. Satellite Systems. LQR design. Routing. WAP. state transformations. including robotics and manufacturing. phase lead and lag controllers. Modern Control Engineering. Classical design using frequency domain methods. Mobile IP. Wireless: Radio basics. Avoidance. Design using state feedback. Voice over IP (VoIP). State space models. Relay auto tuning. Course Name: Advanced Networking Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Review of basic concepts: The OSI Model. use of observers. pole placement. Real-time and quality of service system principles. Management: Quality of Service (QoS). DNS. 8th (1998) or 9th (2001) Edition. PID controllers. 7th (1995). C.C. 2nd Edition. Congestion in the Internet. solution of the state equations. Introduction to robotics. ARP. immersive and omnipresent applications. actuators and robot control. Transducers. 2nd ed. smart sensors. K. Congestion Control: Control vs. Platforms may also include specialized systems used in application-specific contexts. Text Books/Reference Books: It is an advanced course and the instructor may make his notes from various resources at the web. The TCP/IP protocol stack: IP.Ogata. network topology. 1994. VPNs. R. ISDN. IP Multicast. TCP and UDP. RSVP. network vs. Addison-Wesley.
3. "Data and Computer Communications". P. Kurose and Keith W. CRC Press. Dial-up security. A. Kindberg. More on Block Ciphers. Chapman and Hall/CRC. network interface design. 2003. Kaufman. Perlman. Detailed operation of Internet routing protocols such as Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP). Ross. William Stallings. Text Books/Reference Books: 1. 6. Boca Raton. Richard A. Fundamentals of Internet Protocol (IP) networking. NJ. and network economics. NY. 3. Coulouris. and finally. and S. RSA and Discrete Logarithms. Applied Cryptography. James F. Prentice-Hall — Sixth Edition (for those who want to review basics of networking). John Wiley and Sons. Mollin. Addison Wesley. SET. Prentice Hall PTR. CRC Press. Cryptography: Theory and Practice. critical analysis. Integrated and 67 . Handbook of Applied Cryptography. Route lookup algorithms. 1995. Public key Encryption. Stallings. The Advanced Encryption Standard. FL. Course Name: Topics in Computer Networking Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: This course offers an advanced introduction and research perspectives in the areas of switch/router architectures. QoS mechanisms and architectures. Router architecture and performance. scheduling for best-effort and guaranteed services. 2003. an original and novel research contribution. An Introduction to Cryptography. Cryptology and simple cryptosystems. Miscellaneous topics. Speciner. 2002. Key management schemes. Dollimore. Course Name: Network Security Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Introduction. Cryptography and Network Security. DES. 4. W. Number theory and algorithm complexity. 5. Elliptic curves. Upper Saddle River. FL. web protocols and applications. R. Boca Raton. M. Conventional encryption techniques. Emerging Internet security standards. Stream and block ciphers. S-MIME. SSL and IPsec. Viruses. 1996. M. Network Security: Private Communication in a Public World – Prentice Hall PTR. Computer Security: Art and Science – Addison-Wesley. Confidentiality & Message authentication: Hash functions. The course also includes a research project in computer networking involving literature survey. Upper Saddle River. NJ. optical networking. Bishop. Addison Wesley. 1997. ―Computer Networking – A Top-Down Approach Featuring the Internet‖. Schneier. Vanstone. Identification schemes. B. Firewalls. Kerberos and directory authentication. 7. Typical topics can be listed below: Overview of packet switching networks and devices. E-mail security. ―Distributed Systems – Concepts and Design‖. PGP. Menezes. 2.Text Books/Reference Books: 1. VPNs. 2. Oorshcot. Digital signatures. Stinson. 2001.
and constraint-based routing algorithms. power control. Andrew S. March 1996. Stallings. ―IS-95 CDMA and cdma 2000‖. TE-based routing and signalling protocols. voice. 2000. 2003. Morgan Kaufman. T. Text Books/Reference Books: 1. ―Wireless Communications: Principles & Practice‖. Prentice Hall. William Stallings. McGraw-Hill. Prentice Hall. 5. 1998. and configure a Web Server. ISBN: 0-619-03528-5. and video communications. install. 3. common air protocols (AMPS. (2000) Course Technology. Principles of Web Design. 4. Computer Networks. 2001. ISBN: 0-619-01526-8. Schiller. Switching and Routing. IS-136. and third generation wireless networks: cellular systems. (2002) Course Technology. cdma2000. Fundamentals of per-flow and aggregate scheduling algorithms. GSM. 4. error control techniques. As an example for the third generation air interfaces. 2002. handoff. High-Speed Networks: TCP/IP and ATM Design Principles. 3. and design and implement a Web Site on the Web Server created. Worst-case analysis for multimedia networking. V. radio propagation models. Course Name: Network Administration Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Through completion of this course. EDGE. 2. medium access techniques.differentiated network service models. Text Books/Reference Books: 1. Tanenbaum. manage. Communication Networks: Fundamentals Concepts and Key Architectures. Second Edition. monitor. WCDMA. radio resource and network management. 2002. ―Mobile Communications‖. Text Books/Reference Books: 1.S. 2. Quality of service mechanisms for multimedia and real-time communications. Prentice Hall PTR. ISBN: 0135259657. Computer Networking a Systems Approach. Garg. This course is intended for graduate students who have some background on computer networks. Information Technology Project Management. W. WCDMA is discussed in detail since it is expected to have a large impact on future wireless networks. Multi-protocol label switching and its generalization. Resource signalling and resource reservation protocols. 2000. second. Rappaport. Peterson and Davie. GPRS. Traffic Engineering (TE) concepts and mechanisms including label assignment. 68 . Puzmanov. Addison Wesley.K. 3rd Edition. J. Garica and Widjaja. 2. Addison Wesley. Prentice Hall. label distribution. 3rd Edition. and optimize a Web Server. 2002. Prentice Hall. Application-level and network-level signalling protocols for data. IS-95. students will be able to plan. etc). ―Wireless Communications and Networks‖. Course Name: Wireless Networks Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: This course covers fundamental techniques in design and operation of first.
2nd edition. Advanced Programming Language Design. Addison-Wesley. 2001. Ullman. G. Dataflow. Syntax and Semantics. Advanced topics include memory hierarchy management. Computer Networks and Systems: Queuing Theory and Performance Evaluation. Object-oriented Programming. Alfred V. The Anatomy of Programming Languages -. John Wiley & Sons. Raphael Finkel. The Study of Programming Languages -. Text Books/Reference Books: 1. Types. Steven S. Advanced Compiler Design & Implementation.Air Interface Techniques for Future Mobile Systems‖. Text Books/Reference Books: 1. classical optimization. Aho. Toskala.Sebesta Course Name: Advanced Compiler Design I Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: An in-depth study of compiler backend design for highperformance architectures. Control Structures. Holma and A. ISBN: 0805311912 2. predicated and speculative execution. simulation and experimental methods should be used to evaluate and design networks and protocols. Morgan Kaufmann. Castro. 2. instruction scheduling. thus familiarity with both computer architecture and compilers is recommended. 69 . Investigate network management tools and techniques. and Tools. The class focus is processor-specific compilation techniques. 1988. 6. Techniques. Concurrent and Distributed Programming. T. and register allocation. Course Name: Network Performance Evaluation Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: This is an advanced course in networks and protocols. Compilers: Principles.5. ―WCDMA for UMTS Radio Access for Third Generation Mobile Communications‖.Ryan Stansifer 4. H. Introduction to the Theory of Programming Languages -. Functional Programming and Lambda calculus. and Jeffrey D. Logic Programming. Springer-Verlag. 2001. modulo scheduling.P. 1997. Muchnick. Robertazzi.Bertrand Meyer 3. Topics include control-flow and data-flow analysis. Addison-Wesley. Wiley. ―The UMTS Network and Radio Access Technology . 1994. optimization for instruction-level parallelism. Course Name: Theory of Programming Languages Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Introduction and History. Concepts of Programming Languages -. J. Ravi Sethi. Text Books/Reference Books: 1. Analytical.Fischer and Grodzinsky 5.
Philip M. image. Weiyi Meng. 3. Text/Document Databases. senstitive to our needs. Mark T. Paperback . Ullman. by Clement T. Robert Morgan. Text Books: 1. ISBN: 1558604340. Building an Optimizing Compiler. Robert Morgan. Wolfgang Wahlster (Editor). Subrahmanian. Databases and Transaction Processing. Principles of Multimedia Database Systems. Multidimensional Data Structures. Compilers: Principles. The text covers the topic well. Techniques. San Fransisco.3. ISBN: 1558604448. by V. Steven S. Building an Optimizing Compiler. Course Name: Advanced Compiler Design II Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: The course should consist of one or two major projects. similarity based search (spatial. audio). Maybury (Editor). and Jeffrey D. XML Databases. 1997. Course Name: Multimedia Database Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: Introduction.736 pages (April 1998) Morgan Kaufman Publishers. Morgan Kaufmann. agile. Arthur Bernstein. and Micheal Kifer. Text Books: 1. Overview of Relational and Object-Relational Data Representations. Aho. and Tools. Theoretical study should depend on the level of the first course Design I and the student needs. 2. Temporal Data Models. Butterworth-Heinemann. 1998. CA. Addison-Wesley. Advanced Compiler Design & Implementation. Ravi Sethi. An Application-Oriented Approach. The promise of interfaces that are knowledgeable. Muchnick. ISBN: 1558604669. Morgan Kaufmann Publishing Company. 1998. Alfred V. Principles of Database Query Processing for Advanced Applications (Morgan Kaufmann Series in Data Management Systems). Readings in Intelligent User Interfaces. Text Books/Reference Books: 1. Addison Wesley 70 . 1998.S. Butterworth-Heinemann. 1998. Course Name: Intelligent User Interfaces Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: The increasing complexity of software and the proliferation of information makes intelligent user interfaces increasingly important. and genuinely useful has motivated research across the world to advance the state of the art and practice in user interfaces that exhibit intelligence. Logical Frameworks. 3. Lewis. 1988. 2. Yu.
2002. However. Handbook of Mathematical Models in Computer Vision. Perceptual grouping: failure of the Hough transform. Grouping of contours and straight lines into higher order features such as vertices and facets. By Linda G. 71 . Text Books/Reference Books: 1. 2001. macromedia‘s FLASH. perceptual criteria. Text Books/Reference Books: No particular text book can be specified as the contents and teaching approach depend on the instructor and the latest trends in the area. Computer Vision. the course will use the concepts of data structures. grouping edge points into straight lines by means of the Hough transform. quadtree structures for segmentation. Students will also be able to illustrate some successful applications of vision systems and will be able to identify the vision systems limitations. Sobel and Laplacian operators. intermediate and high level vision. Course Outline: Concepts behind computer-based recognition and extraction of features from raster images. By Nikos Paragios. ISBN: 0201708728. Overview of mammalian vision: experimental results of Hubel and Weisel. for example. analogy to edge point detection and Hough transform. grouping line segments into curves. Depth measurement in images. object oriented programming. applications of vision systems and their limitations. 2006. 3. Course Name: Rich Internet Applications Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Course Outline: This course covers the concept and technology evolution regarding the internet applications and the use of interface tools. Course Name: Computer Vision Credit Hours: 3 Course Structure: Lectures: 3 Labs: 0 Pre-Req: Data Structures and Algorithms Objectives: By the end of this course Students will be able to explain the concepts behind computer based recognition and the extraction of features from raster images. parameterisation of conic sections. 2003. Stockman. Mainly. Birkhäuser. Prentice Hall. Computer Vision: A Modern Approach.Publishers. programming languages and the software design and engineering to develop projects of medium to large magnitude. By David Forsyth. Prentice Hall. mean and variance pyramids. Olivier Faugeras. Segmentation: region splitting and merging. Overview of early. 2. improved Hough transform with perceptual features. limitations of the Hough transform. Jean Ponce. Yunmei Chen. the course can focus on any one of the technologies of modern day. however. George C. Shapiro. Macromedia‘s presence on the web can be utilized to maximum. computing the first and second derivatives of images using the isotropic. Relaxation labelling of images: detection of image features.
2008 to develop the vision for Software Engineering education and curriculum for software engineering programmes. Islamabad Member Member 7 Dr. Aqil Burney. Faculty Block-2. Professor and Director Institute of Information and Communication Technologies University of Sindh. Meritorious Professor. Muhammad Abdul Qadir. Mohammad Ali Jinnah University. H-10 Campus. International Islamic University. Department of Computer Science. Jamshoo. Naveed Ikram. Nazir A. Convener Member Member 4 Dr. Chairman and Director. 2 Dr. Dr. Islamabad Campus. Jerald Allan Kabell. Jinnah Avenue. Participants represented most of the universities and software industry of the country. Following experts participated in the meetings: 1 Dr. Zubair A. M. Member Professor and Dean.. 72 . Department of Computer Science. Department of Computer Science. Rawalpindi. The Committee met again on 7-9 April. Imdad Ali Ismaili. Allama Iqbal Open University. Islamabad The Mall. Faculty of Engineering & Applied Sciences. Forman Christian College University. University of Karachi. Lahore. Department of Computer Science & I.T. 6 Associate Professor.Shaikh Member PEC Nominee FAST National University of Computer & Emerging Sciences National Highway 5 Dr. Sangi Professor. S.National Curriculum Revision Committee Software Engineering The National Curriculum Revision Committee for Software Engineering (NCRC-SE) met on 24-26 November. Professor & Chairman. Islamabad 3 Dr. 2009 to finalize the curricula recommendations.
11 Dr. Principal Engineer. Islamabad 17 Mr. Sukkur IBA Airport Road.O. Department of Computer Science. Qamar Uddin Khand. (NOT PRESENT) Department of Computer Science. Associate Professor. Member Assistant Professor. Najmi Ghani Haider Professor and HOD Department of Computing Science. Lahore. Nadeem Mahmood. Shafay Shamail Associate Professor and Head Department of Computer Science School of Science and Engineering Lahore University of Management Science (LUMS). COMSATS Institute of Information Technology. Karachi. Muhammad Akram Sheikh Member Associate Professor. P. Karachi 12 Dr. Islamabad Member Member Member Member Member Member 16 Dr. Member 73 . Department of Computer Science. Assistant Professor. Mehran University of Engineering & Technology. Jamshoro 10 Dr. 15 Mr. Department of Information Technology. Peshawar 13 Mr. Sukkur Member 9 Dr. Sukkur 14 Dr. SZABIST. Tahseen Ahmed Jilani.8 Dr. Arshad Iqbal. Ghulam Mujtaba Sheikh Lecturer IBA Sukkur Airport Road. Department of CS and SE Engineering. Saeed Mahfooz. Department of Computer Science. Assistant Professor. University of Peshawar. Shahid Nazir Bhatti. Department of Computer & Information Science. University of Karachi. PIEAS Nilore.
Department of I. IEEE Software. Nov/Dec. Karachi 18 Syed Asim Ali Shah. University of Peshawar. Software Engineering and Computer Science differ in much the same way as do Electrical Engineering and Physics1. and process. “Software Engineering Programmes are not Computer Science Programmes”. 1999. Nov/Dec. solution design. A software engineering programme should develop professionals who have a mastery of software development principles. Zahoor Jan.. NetSol Avenue. pp. 19-30. / Computer Science. pp. The Discipline of Software Engineering Software Engineering is a bridge connecting the basic concepts and principles of Computer Science with the variety of users who can benefit from technologies based upon those principles. 74 . IEEE Software. 1999. Generally. Ghazi Road. It also includes the design and development of techniques. and maximally useful and usable.T. is to 1 David Parnas. Software engineering therefore requires familiarity with the basic needs and processes in the various application domains. with the principles of good engineering practice and with the underlying concepts and principles of computer science. 19-30. Peshawar. Islamabad 19 Abdul Mujeeb Kabadia. (NOT PRESENT) Lecturer.University of Karachi. theory. Assistant Professor. while science is more theoretical. At both levels it requires a systematic approach which deals with quantifiable measures of quality and effectiveness. Lahore Cantt. the goal of Computer Science. according to Parnas2. 2 David Parnas. efficient. Therefore. maintainable. It requires facility in problem analysis. It also requires a basic understanding of the ways in which humans interact with technological systems. Shangrila Road. engineering should be concerned with applying what we already know to create products. processes and higher level tools by which these applications can be developed in a timely. cost effective and sustainable manner. robust. “Software Engineering Programmes are not Computer Science Programmes”. (NOT PRESENT) Project Manager NetSol Technologies Ltd. Bahria University. as well as attention to the critical nature of the various products of the process. Sector E-8. program development and documentation. practice. 54792 20 Dr. It includes the design and development of software systems which are effective.
with an emphasis on issues of process. "Software engineering is that form of engineering that applies the principles of computer science and mathematics to achieving cost-effective solutions to software problems. theory. and their adaptability to team environments. deployment. development. and methods to the design. The programme will lead to development of student’s professional and interpersonal skills. deploy. and processes to design. There are many definitions in literature. Such as: "The establishment and use of sound engineering principles (methods) in order to obtain economically software that is reliable and works on real machines" [Bauer 1972]. operation. practices.learn and to extend the science. quantifiable approach to the development. SE on the other hand aims to use the science and technology already available to create products and tools for use. disciplined." [CMU/SEI-90-TR-003] "The application of a systematic. and maintenance of economical software systems. Definition Software Engineering is a discipline concerned with the development of software systems by applying engineering principles with the goal of developing costeffective quality systems. quantifiable development. and maintenance of software. disciplined. quantifiable design. disciplined. design.‖ Software Engineering could also be defined as: ―The application of systematic. The study of approaches as in 1. Software Engineering derives its essence from computer science as other engineering disciplines do from natural or life sciences. and maintain software systems. measurement. A software engineering programme should develop professionals who have a mastery of principles. analysis and verification providing a strong foundation in engineering principles and practices as applied to software development. controlled and efficient manner. and maintenance of software" [IEEE 1990]. operation.. The programme will inculcate among 75 .‖ approach to is application approach to reliable and Vision Software engineering is the discipline of creating high-quality software systems in a systematic. It will prepare them to apply ably engineering principles. The curriculum committee formalized the Vision Statement for SE education in Pakistan as follows: The SE education in Pakistan will focus on imparting the knowledge and training which should enable students to harmonize theory with practice. concept with application. It involves the application of engineering concepts. It will help students to enhance their ability in oral and written communication. deployment and maintenance of software systems. development. The application of systematic. and problem with solution. and processes necessary to produce quality software systems. develop. IEEE defines software engineering [IEEE-93] as ―1. practices. techniques. that of engineering to software. 2.
Software engineering concepts should be taken up as early as the start of 2 nd year. apply. Software Engineering – Curriculum Guidelines for Undergraduate Degree Programs in Software Engineering. Computing Foundation (CS/SE/CE) Software Engineering (SE Major) Software Engineering Application Domain Supporting Areas (Mathematics and Natural Sciences) General Education (Management. implement. The graduates thus produced will be adequately equipped to exploit the opportunities and answer the challenges offered by the modern world. 4. design. SE curricula thus developed would reflect the aim to satisfy professional demands of the industry and academia both in terms of immediate needs and the capacity for longer term development. The main technical SE content should be covered during the third and forth years. The graduates. The programme must demonstrate that graduates have: the ability to analyze. A capstone design project should provide the opportunity to bring together all the knowledge 3 4 Guide to Software Engineering Body of Knowledge. The practice of software engineering is often in the context of non-software application domains. and Computing Curriculum 20085. It should gradually introduce and strengthen the core professional competencies and desired skill-sets. and relevant topics in computer and management sciences to complex software systems. Software Engineering Education Knowledge (SEEK)4. It is noted that efforts carried out by ACM and IEEE-CS to develop international software curricula are very relevant and provide excellent guidelines on the issue. verify. in the spirit of engineering criteria above. should be provided an opportunity for reasonably broad exposure to at least one application area in the senior years.. 5. therefore. the ability to appropriately apply discrete mathematics. The following major areas of relevant pedagogy have been identified to be appropriate for design of the software engineering curriculum: 1. Outcome of these efforts is documented in Software Engineering Body of Knowledge (SWEBOK)3. 2004 5 Computing Curriculum 2008—Draft 76 . It will help them learn and demonstrate the application of software engineering practices. Practical component should use medium to large scale projects to develop in students a systematic approach to problem solving and program development. probability and statistics. 2. and maintain software systems. Knowledge Areas of SE Curriculum Development ABET Engineering Criteria 2000 notes: The curriculum must provide both breadth and depth across the range of engineering and computer science topics implied by the title and objective of the programme. Good SE practices must be nurtured all through the education programme. validate. 2004 Edition. Humanities. The programme will also strive to develop a capacity for innovation and a passion for life long learning. SE curriculum specified here has been developed systematically by identifying the major knowledge areas of SE education. 3.students a strong sense of civic. 2004August 23. professional and ethical responsibility. Social Sciences) The committee is of the view that good curriculum should focus on building a solid foundation in the early stages of learning.
universities may define their own admission criteria. The following nomenclature was thus agreed upon for various degrees: Bachelor of Science in Software Engineering — BS Software Engg — BS (SE) Master of Science in Software Engineering — MS Software Engg— MS (SE) Duration of Programs The committee defined a credit hour as 15 lecturing hours in a course offered in a particular semester.gained in a wide variety of courses to solve realistic problems in a team-based environment. however. Software Engineering Degree Programs Nomenclature The committee emphasized that the nomenclature followed for Software Engineering programs should correspond to international trends and standards. The BS Software Engineering Degree would be a 4-year programme spread over 8 semesters and MS Software Engineering programme would be a 2-year programme spread over 4 semesters. It was agreed that 3 weekly lab hours shall be treated as one credit hour for a course. In normal circumstances a semester comprises 15 teaching weeks followed by the final examination. The notation used for this purpose is X(YZ). universities may define their own admission criteria. Admission Criteria The eligibility criteria for BS Software Engineering admission was agreed to be intermediate with mathematics or equivalent qualifications. however. X represents credit hours. The eligibility criterion for admission to MS Software Engineering was unanimously agreed to be 4-year BS Software Engineering or equivalent qualifications. 77 . y represents hours of practical in class per week and z represents hours of lab work per week over a 15 week semester.
computer. processes. costing. with special emphasis on software engineering — concepts. Students will also be trained in the skills and techniques which are rooted in the basic sciences like mathematics and physics. be able to model. Curriculum Model The curriculum is designed to achieve systematically the objectives set out above for the programme. both functional and non-functional. methodologies. have an awareness of current industry standards and practices. document and track system requirements. and practices. Graduates of such programs will be able to function as proficient software developers and effective team members. deploy and maintain software systems. have knowledge of economics. implement. historical.html . and the cultural. analyze.org/ccse/SEprogrammes. estimation. be able to understand and apply software project management skills: measurement. Various components have been included in the curriculum to ensure that the graduates will: understand and be able to apply mathematics. the demands of the market. subject to realistic constraints. deployment and tracking of resources. These areas will be taken care of 6 While setting the objectives the committee benefited substantially from different universities’ online documentation for similar programmes available on http://sites. and the trends of the industry. be able to verify and validate the software systems.Curriculum for BS Software Engineering — BS (SE) Curriculum Objective The objective of the curriculum is to prepare students for professional careers and graduate studies with a balance between computing theory and practical application of software engineering concepts. During the first two years of the programme the students will be given an underpinning in computer science. understand and apply the principles of the team process. They will have knowledge of and experience with software product engineering and engineering management and an understanding of professional issues and practices. be able to design. 78 . be able to work in one or more application domains. have strong communication and interpersonal skills. The students will be exposed to the discipline in a systematic. It has been structured to suit the needs of the students. understand professional responsibility and application of ethical principles. understand and be able to apply the principles of software engineering practice and process.6 The curriculum is designed to ensure breadth across allied disciplines and supporting subjects. planning. Graduates will be able to understand and assess their own software engineering capabilities and performance. computer science and related disciplines. humanities and social sciences. They will have grounding in communication. mathematics and science. and depth in most areas of the software engineering body of knowledge. gradual and definite way. and social issues that influence and effect or relate to the development of high quality software systems. be capable of independent learning. physical science. tools and technologies in the modern software development environments.
Figure SE1 illustrates the structure of the proposed curriculum. In order to inculcate among them a scientific attitude they will go through a substantial lab work. Students‘ personal traits and personality polishing will be cared for by the general education courses including communication and writing skills. A host of slots for elective courses have also been proposed to give to the students an opportunity to move towards their areas of interest. During the senior years the students will be given exposure to the more specialised aspects of the discipline. The final year design project will mark the crystallisation and culmination of the students‘ four-year learning process. whereas the Table SE1 gives the credit hour distribution of the core and elective courses. SE Design Project General Courses Elective (18) General Courses Core (15) Support Courses Elective (9) Support Courses Core (12) SE & Domain Elective Courses (15+6) Software Engineering Core Courses (18) Computing Foundation Core Courses in CS/SE/CE (37) Figure-SE1 Structure of the proposed curriculum (credit hours within parenthesis) 79 .in the supporting courses which have been allocated reasonably sufficient space. which will prepare them for the industry and for further research oriented studies. They will also be given training in at least one application domain which will help institutions to prepare human resource well suited to the needs of different segments of the job market.
implementation details are left upon the concerned Institutes.Major Areas Computing Foundation Software Engineering Software Engineering (Application Domain) Supporting Studies (Math/Science ) General Education Total Core/ Required 43 18 Electives Credit Hours 21 82 (63%) -- 06 12 15 82 (68%) 9 12 48 (32%) 21 (17%) 27 (21%) 130 Table SE1: The Credit Hour Distribution of the Core and Elective Courses Computing-Core Courses – 43 Credit Hours # 1 2 3 4 5 6 7 8 9 10 11 12 1: Co de PreReq 1 3 3 4 4 2 6 Course Title Credit hours 4 (3-3) 4 (3-3) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 4 (3-3) 4 (3-3) 3 (3-0) 3 (3-0) Proposed Semester 1 1 2 2 3 3 4 4 4 6 Introduction to Computing Programming Fundamentals Object Oriented Programming Discrete Structures Data Structure and Algorithms Digital Logic and Design 1 Operating Systems Introduction to Database Systems Introduction to Software Engineering 1 Computer Communications and Networks 1 8 Human Computer Interaction 3 (3-0) 7 Senior Design Project 6 (0-18) 7. However.8 Labs preferred in these courses. 80 .
Code SE SE SE SE SE SE Prereq 4 7 13 13 7 7 Course Title Software Construction Software Requirements Engineering Software Design and Architecture Software Quality Engineering Software Project Management Formal Methods in Software Engineering (18/133) Credit Hours 3 (2-3) 3 (2-3) 3 (2-3) 3 (2-3) 3 (3-0) 3 (3-0) Semester 4 5 6 6 7 5 Elective Computing & Software Engineering Courses (15/133) (The list below is by no means exhaustive. MG Information System Audit 3 (3-0) 7 15. CS 4 Data Security and Encryption 3 (3-0) 6 26. CS 7 Business Process Automation 3 (3-0) 7. CS Design Patterns 3 (3-0) 7. CS 30 Artificial Neural Networks 3 (3-0) 8 33. 17.4 Automata Theory and Formal 3 (3-0) 5. 7 24. CS 30 Introduction to Soft Computing 3 (2-3) 4. CS 3 Artificial Intelligence 3 (3-0) 6 25. SE 3. CS Computer Graphics 3 (2-3) 6 32. SE 7 Software Engineering Economics 3 (3. CS Web-Engineering 3(3-0) 5-8 81 . CS 7.0) 6.10 Real-time systems 3 (3-0) 6-7 23.8 13.0) 3-4 14. CE 6 Microprocessor Interfacing 3 (3-0) 7 29. Institutions may add new course) # Code PreCourse Title Credit Semester req hours 12.8 16.7 18.0) 7.Bachelor of Science in Software Engineering: BS (SE) Computing Core Requirements part) 37 Credit Hours (Refer to Computing Required Software Engineering Courses # 12. 16. 5 22. 3 Principles of Programming Languages 3 (3-0) 7 31. CS 8 Advance Database Management 3 (2-3) 8 Systems 34.8 17.4 Formal Methods 3 (3-0) 6-7 19. CS 3.3 27. CS 3 Discrete Structures – II 3 (3-0) 2. CS 4 Analysis of Algorithms 3 (3-0) 6 30. SE 15 Software Metrics 3 (3. CS 8 Data Warehousing and Data Mining 3 (3. SE 7 Distributed Computing 3 (3-0) 7-8 21. 6 Languages 28. SE 7 PSP and TSP 3 (3-0) 7-8 20. 13. 15. 14. CS Bio-Informatics 3 (3-0) 5-8 35. SE 7 Software Testing 3 (2-3) 6. CS 2.
etc. insurance. Survivable Intrusion detection Systems Failure analysis and recovery 7 CE Safety Critical Depth in formal methods. Common domains may include banking. CRM 6 5-8 Systems Systems Engineering 2 NS Net-Centric Knowledge and skills in Web-based 6 5-8 Systems Technologies Depth in networking. SCM Systems. Architecture Cryptography.. etc. Proof of 6 5-8 Systems correctness.Domain Specific Elective Courses (6/133) In-depth treatment of one of the following SE Application Domains should be offered in the form of set of two to three courses of 3 credits each in the selected domain. information theory. agriculture. Depth in networks 4 IS Information Data warehousing. defence. steganography. 6 5-8 ation Systems Telephony and telecommunication protocols 82 . Depth in security 3 IS Enterprise Business issues related to security. Hardware verification 9 BI Bio-medical Biology and related sciences 6 5-8 Systems Related safety critical systems knowledge 10 SS Scientific Depth in related sciences. oil exploration. Knowledge of control systems 8 CE Embedded & Hardware for embedded systems 6 5-8 Real time Languages and tools for development Systems Depth in timing issues. Domains Topics /Component Cr 1 IS Enterprise ERP Systems. Institutions may add new domains. Finance 6 5-8 E-commerce Depth in security Systems 6 CE Fault Tolerant Knowledge and skills in heterogeneous. 6 5-8 and distributed systems. textile and garments. computing concept of the domains and the domain specific computing examples with general sprit of implementation using SE principles. etc. Depth in security. 6 5-8 Security Security weaknesses and risk analysis. medicine. Depth in databases 6 5-8 Systems and Depth in business administration Data Processing 5 IS Financial and Accounting. cryptanalysis. Each domain treatment should be organized as domain introduction. etc. The list below is by no means exhaustive. Depth in 6 5-8 Systems statistics Visualization and graphics 11 TE Telecommunic Depth in signals.
CS -Natural Language Processing 3 (3-0) 6-7 83 . Sc Physics-II (Mechanics) 3(3-0) 2 9. Sc -Software Engineering Economics 3(3. Wireless technology Related embedded and real-time systems knowledge Related telecom systems knowledge Machine learning. and graphics Depth in human computer interface design Depth in networks Depth in human computer interfaces for small and mobile platforms. haptics. Institutions may add new course) 5. Fuzzy logic Knowledge engineering 6 5-8 6 5-8 6 5-8 6 5-8 6 5-8 Computing Requirements-Supporting Sciences 12 Credit hours (refer to Computing part) Elective Supporting Courses (9/133) (The list below is by no means exhaustive. MT 3 Numerical and Symbolic Computing 3 (3-0) 5-6 7. EE 4 Digital Electronics 4 (3-3) 3-4 12. MT -Mathematical tools for Software 3(3-0) 6-7 Engineering 15. Sc Biology/ genetics 3 (3-0) 4 11. MT 3 Stochastic Processes 3 (3-0) 6-7 8.3) 3-4 13. game. MT -Computational Linear Algebra 3(3-0) 5-6 14. MT -Simulation and Modeling 3(3-0) 4-5 17. MT 1 Advanced Calculus 3 (3-0) 2 6. MT -Operation Research 3(3-0) 5-6 16.12 AS Avionic & Vehicular Systems 14 IE Industrial Process Systems 15 ES 16 WN Multimedia. Sc Bio-Chemistry 3 (3-0) 4 10. and entertainment Systems System for Small & mobile Platforms 17 AI Agent based Systems Mechanical engineering concepts Related safety critical systems knowledge Related embedded and real-time systems knowledge Control systems Industrial engineering and other relevant areas Related embedded and real-time systems knowledge Visualization.
Institutions may add new course) 60 SS English Literature 3 (3-0) 5 61 62 63 64 65 66 67 68 69 70 SS SS SS SS HU MG MG MG MG MG Economics Sociology Psychology International Relations Foreign Language (Arabic. German. etc.Computing Requirements-General Education 15 Credit Hours (Refer to Computing part) Elective General Education Courses (12/133) (The list below is by no means exhaustive. French.) Information System Audit Principles of Management Human Resource Management Marketing Accounting and Finance 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 7 2-6 6 7 7-8 7 4 5 6-7 5-7 84 .
Discrete Structures-I Object Oriented Programming Supporting Elective I GE/University Elective I English-II (Communication Skills) 3 3 3 3 3 15 Cr. Hrs. Human Computer Interaction Software Quality Engineering Software Design & Architecture Formal Methods in Software Engineering SE Elective II SE Application Domain Elective –I 3 3 3 3 3 3 18 Cr. Hrs. Semester 3 Semester 4 Introduction to Software Engineering Data Structures and Algorithms Digital Logic & Design Linear Algebra Pakistan Studies and Islamic Studies 3 3 3 3 3 Operating Systems Software Construction Supporting Elective II GE/University Elective II Introduction to Database Systems English-III (Technical and Report Writing) 3 3 3 3 3 3 18 Cr. Hrs. Semester 6 Software Requirement Engineering Probability and Statistics Computer Communication and Networks SE Elective I Supporting Elective III GE/University Elective III 3 3 3 3 3 3 18 Cr. Introduction to Computing Programming Fundamentals Calculus and Analytical Geometry Physics English-I (Functional English) 3 4 3 3 3 16 Cr. Hrs. 15 Semester 5 Cr. Hrs.Sample Scheme of Study for BS (SE) 4-year Programme (8 Semesters) (130 Credit Hours) Semester-wise 4-Year Plan Semester 1 Cr. Semester 2 Cr. Hrs. Hrs. Hrs. Semester 7 Semester 8 Senior Capstone Project I Software Project Management Professional Practice SE Application Domain Elective –II GE/University Elective IV 3 3 3 3 3 18 Senior Capstone Project II SE Elective III SE Elective IV SE Elective V 3 3 3 3 12 85 .
and analyzing concurrent designs Lab Work: .Use of software engineering tools to create designs . Addison & Wesley. Published by. and maintainability Course Outline: o Basics of formal languages.COURSE CONTENTS BS (SE) . Backus Naur Form. parse trees. tokens. check the validity of these specifications. principles of scanners o Using tools to generate scanners. 4. students will have the ability to: o Apply a wide variety of software construction techniques and tools. and Andras Pataricza . applications of scanners. more regular expressions and transition networks. Prentice Hall in 1997 2.Software Engineering Course Name: Software Construction Credit Hours: 3 Course Structure: Lectures: 2/ Labs: 1 Prerequisites: Data Structures and Algorithms Objectives: Upon completion of this course. 8th edition. grammars. and generate code from the specifications using appropriate tools o Design simple concurrent software o Analyze software to improve its efficiency. Object-Oriented Software Construction. LL Parsing o Overview of principles of programming languages.Use of parser generators to generate languages Reference Material: 1. syntax and semantics. Relation of scanners and compilers o Parsing concepts. Sep 2005 3. Second Edition. 2004. Code Complete 2nd edition: A practical handbook of software construction. including state-based and table-driven approaches to low-level design of software o Design simple languages and protocols suitable for a variety of applications o Generate code for simple languages and protocols using suitable tools o Create simple formal specifications of low-level software modules. 2006 86 . Modelling system behaviour with extended finite state machines o SDL o Representing concurrency. Formal Methods in Computing by M. context free grammars. Software Engineering by Ian Sommerville. by Bertrand Meyer. Parsing. Ferenczi. published by Microsoft Press. reliability. Criteria for selecting programming languages and platforms o Tools for automating software design and construction. regular expressions and their relationship to state diagrams o Lexical Analysis.
Requirements Specification. Use case elicitation using automated tools e. 1998. Object modeling heuristics. Identifying objects from goals. Karl E. to understand modeling and analysis of Non-Functional Requirements. Lab Work The requirements are for the development of case applications. Requirements management. the product vision and scope for applications. Requirements Engineering: Processes and Techniques. John Wiley Sons. McGraw-Hill . Deriving operational requirements from goals. Outline of business requirements. System Requirements Engineering. 2nd Edition. selection and prioritization. Loucopoulos and Karakostas. Object modeling for requirements engineering. Information elicitation techniques. Techniques for requirements evaluation. 2003. Modeling use cases and state machines. Jackson. Modeling scenarios Fundamentals of goal-oriented requirements engineering. Object modeling notations. Requirements traceability and impact analysis. UML. Course Name: Software Design and Architecture Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Software Requirement Engineering 87 .Course Name: Software Requirement Engineering Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 1 Prerequisites: Introduction to Software Engineering Objectives: To understand Issues in Requirements Engineering. to understand and use Requirements Elicitation and Specification. the role of quality goals in the requirements selection process. and Dick. requirements engineering risks. 1995 4. Springer 2. Hull. Fundamental concepts and activities of requirements engineering. Course Outline: Definition of requirements engineering and role in system development.g. to understand and use Formal Techniques. Requirements Engineering. 2004. Goal modeling heuristics. to understand and apply Requirements Engineering Process. Software Requirements. Wiegers. Mobile Scenarios and PDA‘s etc Development of Software Requirement Specification (SRS) Requirement Engineering Group Discussion activity and resource allocation etc Reference Material: 1. Modeling quality goals. Microsoft Press 3. Kotonya and Sommerville. Modeling behavioral goals. Requirements verification and validation Management of inconsistency and conflict.
security. Evaluation and evolution of designs. Central Design Tasks. Central Design Tasks: Modularization and Layering. Design of distributed systems using middleware. Engineering concerns addressed by different views. Final Design Task: Resource Budgeting. safety. Traceability. Role of Architect: The Architect as a Key Technical Consultant. and Configuration. Continuation of the study of design patterns. Central Design Tasks: Components. Upon completion of this course. Survey of current middleware architectures. The Architect Implements. Analyze Factors. Analyze Organizational Factors. reusability. Software Architecture as a Career. Analyze Technological Factors. Component based design. The Architect Makes Decisions. Execution Architecture View: Design Activities for the Execution Architecture View. Using the four Views. Four Views of Software Architecture. 88 . Continue Developing Strategies. Uses for the Code Architecture View. Uses for the Conceptual Architecture View. Measuring internal qualities and complexity of software. and then measure and assess designs to ensure the objectives have been met o Modify designs using sound change control approaches o Use reverse engineering techniques to recapture the design of software Course Outline: Introduction: Putting Software Architecture in Context. frameworks. The Architect Advocates.Objectives: An in-depth look at software design. Designing for qualities such as performance. etc. frameworks. Uses for the Execution Architecture View. Software Architecture as a Design Plan. Final Design Task: Resource Allocation. Traceability. and architectures in designing a wide variety of software o Design and implement software using several different middleware technologies o Use sound quality metrics as objectives for designs. Basics of software evolution. Begin Developing Strategies. Connectors. Module Architecture View: Design Activities for the Module Architecture View. The Architect Coaches. Software Architecture as an Abstraction. Final Design Tasks. and Configuration. Analyze Product Factors. The Architect Coordinates. Conceptual Architecture View: Design Activities for the Conceptual Architecture View. Loose coupling between Views. Software Architecture Terminology. Final Design Task: Interface Design. Code Architecture View: Design Activities for the Code Architecture View. Develop Strategies. reengineering. and architectures. Central Design Tasks: Runtime Entities. Global Analysis: Overview of Global Analysis Activities. Traceability. and reverse engineering. Continue Developing Strategies. Communication Paths. students will have the ability to: o Apply a wide variety of design patterns. Traceability. Uses for the Module Architecture View. Measurement theory and appropriate use of metrics in design. reliability.
the existing design & architecture practices using up to date tools and technologies Applications of Software Development Life Cycle (SDLC). verification and validation techniques using variety of tools. Product assurance. Verification and Validation. Critical System Validation. Inspections.g. Planning for Software Quality Assurance. Structure. Statistical approaches to quality control. Writing of Software Design Specifications Resources: 1. and the need for a culture of quality. Software Testing. Inspections and reviews. Specification based test construction techniques. Dilip Soni. 1999. Quality Control v/s Quality Assurance. Course Name: Software Quality Engineering Credit Hours: 3 Course Structure: Lectures: 2 /Labs: 1 Prerequisites: Software Requirement Engineering Objectives: The objective of this course is to make students have ability to understand and practice: How to assure and verify Quality. open source code development etc. Inspections and reviews.L. White-box and grey-box testing. Recursion Testing etc 89 . Process assurance vs. etc).C. Problem analysis and reporting. Software verification. Clean-room approach to quality assurance. White Box Testing. Product and process assurance. Numbers. SQA Planning (Observations. Software Architecture Design . Testing. Quality process standards. Copyright © 2006 Lixin Tao. Planning Verification and Validation. Quality Assurance and Standards. Outline of requirements. Others comprehensive software testing techniques for SDLC.Lab Work Planning and Practice of existing software design methodologies. Safety Assurance. UML (for code generation). Audits. Avoidance of errors and other quality problems. Results). Applied Software Architecture. Security assessment. Software Quality Assurance (SQA) Plans. Course Outline: Introduction to software quality assurance. Quality Planning and Quality Control. Pearson. Data flow oriented test construction techniques. Product Quality and Process Quality.g. Quality Assurance in Software Projects (Phases). Quality Management. Reliability Validation. Black Box Testing. Principles of software validation. Walkthroughs and Inspections. Christine Hofmeister. Principles and Practices. Robert Nord. The Quality Challenge. Checklist. SQA-Organizational Level Initiatives. incorporation of feedback loop to support quality promotion. Standards for process quality and standards for product quality. Control flow oriented test construction techniques. its phases and thus implementation of different process models Efficient use of different modeling and design tools e. Xiang Fu and Kai Qian 2.Methodology and Styles Stipes Publishing L. Roles and Responsibilities (Reviews. How to make Reviews and Inspections most effective Lab Work: o Planning and Development of test cases o Planning and implementation of different Testing Techniques e.
Bob Hughes and Mike Cotterell . Software Quality Engineering: Testing. McGraw Hill Higher Education 2. 2005 3. Communications Techniques.Principles that work at work. maximizing the return from each stage of the software development life cycle. Team models. Weinberg. Software project Phases. Cutover/Migration. Software Testing in the Real World: Improving the Process by Kit. CPM. Perfect Software: And other illusions about testing by Gerald M. Statement of Work (SOW). ISBN 0-471-67420-6 BS (SE) . Post Project Reviews. The Software Project Manager's Handbook . Project plans. Classic Mistakes. Quality Assurance. 2nd Edition. 2004. Gantt charts. Project Monitoring and Control: Status reporting. Managing conflict and motivating. 2005. by Nina S. 4. PMI Process Groups. published by Alpha Science. 2008 Course Name: Software Project Management Credit Hours: 3 Course Structure: Lectures: 3 /Labs: 0 Prerequisites: Introduction to Software Engineering Objectives: To develop ability to plan and manage software development projects successfully. Addison & Wesley. Godbole. Software Project Management. published Dorest House. 2004 2. Using MS-Project. EVM. Closing.o Collection and Generation of test data o Practicing Testing methodologies using automated testing tool & technologies o Analysis of Test results & Extreme testing Resources: 1. matching lifecycles to projects. Resource leveling. Scheduling: Project network diagram fundamentals. Critical chain scheduling. Project metrics. students will have the ability to: 90 . Risk management and Change control Project Recovery. IEEE Computer Society Press and Wiley Interscience. Resources 1. Documentation. Planning Phase: Development lifecycle models. FP and Use Case point methods). Estimation of effort and cost (Expert Judgment.Software Engineering Courses (Electives) Course Name: Software Metrics Credit Hours: 3 Course Structure: Lectures: 3 Lab:0 Prerequisites: Software Quality Engineering (SQE) Objectives: Upon completion of this course. Course Outline: Software Crisis and Software Engineering. Software Quality Assurance: Principles and Practice (Hardcover). published by John Wiley & sons. 1998. Dwayne Phillips. Project charter. Work Breakdown Structures (WBS). Overview of Project Management. Assigning Resources. PERT. Edward. and Quantifiable Improvement by Jeff Tian.
ISO 9126 model. measuring software reliability. specification. Data flow and data structure attributes. Software Size. Software Size: Reuse. Software quality models: Boehm's model. Software Size: Length (code. COCOMO and COCOMO II. Software testability measurement. Quality management models. object point. Basic metrics for OO systems.. Especially account of ISO/ IEC 9126 External Metrics suite etc. Measurement validation Software measure classification Goal-based paradigms: Goal-Question-Metrics (GQM). Software Size: Complexity Representing concurrency. Metrics for OO software quality SQA. Cyclomatic complexity. Control-flow structure. software test metrics. Metrics for productivity measurement. Constraint model. basics of measurement theory.Applying ISO external metrics attributes to existing SDLC phases 91 . measuring external product attributes: quality. Measurements Scales Software engineering investigation. Investigation principles. McCall's model. Allocating test times . OO analysis and design metrics. Basic Measurement Theory Measurement quality. Goal-Question-IndicatorMetrics (GQIM) and Applications of GQM and GQIM Design Metrics. Types of metrics.Use of software engineering tools to estimate attributes of existing well known metrics .o Take account of the Metrics Program. Measurements and Models. Software Size: Functionality (function point. object-oriented metrics) o Measurement management Account of well known International metrics in software and system engineering Course Outline: o o o o o o o What are software metrics. design). Software Lifecycle Management (SLIM). use-case point). Measuring customer satisfaction Object-Oriented measurement concepts. Decisions based on testing. Basic software quality metrics. Formal experiments: Principles and Formal experiments: Selection Internal Metrics. and analyzing concurrent designs Software structural measurement. Investigation techniques. o Measurement theory (overview of software metrics. feature point. measuring cost and effort. Architectural measurement Software cost model.Estimate the attributes and sub-attributes of the SDLC depending upon the assigned data/project . CK metrics. empirical investigation in software engineering) o Identify the internal and external metrics attributes o Enhancing the software development process with respect to metrics o Software product and process measurements (measuring internal product attributes: size and structure. Cost models: advantages and drawbacks Software quality. definitions and techniques. goal-based framework for software measurement. Estimating number of test case. Test coverage measurement. Formal experiments: Planning. Remaining defects measurement o o o o o o Lab Work: . Test concepts. Measurement process.
Addison Wesley. Reifer. Year of Publication 4. social impact.L. Metrics and Models in Software Quality Engineering. Optimal Performance. Course Name: Software Prerequisites: Engineering Economics Credit Hours: 3 Course Structure: Lectures: /Labs: Objectives: Determine how new software development technologies affect the economics and risks of software development. the plurality of SE Means. C. Analysis. interpolation.). phase distribution. C. Guide to Advance Empirical Software Engineering by Forrest Shull.). by N. Software Metrics: A Rigorous and Practical Approach. The Raylaigh Distribution. 2001. PWS Publishing. Auerbach Publications. Applied Software Measurement: Assuring Productivity and Quality. Janice Singer (Eds. by J. Identify acquisition and lifecycle risks Course Outline: Programming aspects. by Stephen H.. Ravindranath Pandian. ISO/IEC 9126 External Metrics Reports I & II 7. Software Metrics: A Guide to Planning. Jones. Kan. Butterworth Heinemann. Don. 2000. Boehm et al. Sensitivity Analysis. Performance Models. Prentice Hall. basic software maintenance effort estimation. Making the Software Business Case: Improvement by the Numbers . 2nd ed. Identify best practices and lessons learned with Webbased developments. Understand and characterize how the paradigm shift affects or replaces our current methods of software cost.Reference Material: Additional Recommended Text and Reference Books: 1.). Springer-Verlag. economic aspects. Software Maintenance. The GOALS Approach to Software Engineering. 5. Resources: 1. definitions and assumptions. Software Engineering Economics. 2007. Fenton and S. Addison-Wesley Professional (2002) 2. policies and procedures as defined by ISACA. To review and evaluate or conduct IS audits of an organization 92 . Course Name: Information Prerequisites: None System Audit Credit Hours: 3 Course Structure: Lectures:3 / Labs: 0 Objectives: To provide basic concept of information system audit and control. Software Cost Estimation with COCOMO II . Boehm. McGraw-Hill. 1981. software trends: cost. Software Engineer's Reference Book. introduction to COCOMO. (2nd ed. 1998 3. McDermid (Edt. schedule and risk estimation. (2004). human relations aspects. Year of Publication 6.E. development effort and schedule. and Application. 3. The Software Work Breakdown Structure (WBS). CostEffectiveness Models. 2. Prentice Hall. Pfleeger.
‗ Performance and Capacity Planning with Bpel by Matthies Masour. Polices. complaint to standard. 2003 2. students will have the ability to: o Apply their knowledge of business processes in the development of applications for various industry verticals o Analyze business processes in terms of rules. Andy Scherzinger. 2004.org. Procedures and Rules (in terms of business processes) Role of People. Springer-Verlag. Business Process Automation ARIS in Practice by August Wilhelm Scheer. 3. www. report. 2004 2. IP pro count policies and process.Course Outline: IS Audit charter. Business process re engineering: IS audit proposal. Enterprise service agreement. VDM-Verlag 2007. Course Name: Business Process Automation Credit Hours: 3 Course Structure: Lectures:3/Labs:0 Prerequisites: Introduction to Software Engineering Objectives: Upon completion of this course. Procedures. Trading Partners and Suppliers in Business Processes o Business Process Simulation o Business Process Re-Engineering (objectives and techniques) o Basic concepts of Six Sigma (in terms of business process improvement) Reference Material: 1. Auditing Information Systems. complexity. Auditing Management and Organization. 3rd Ed. 93 . published by john Wiley & Sons. by Jack J. Maintenance. Auditing software development. by Information System Audit and Control Foundation. user interactions and bottlenecks o understand the concepts. Backup and procedures Resources: 1. Acquisition. evidence and follow-up.isaca. Business Process Automation. Control Objective for Information Technology (COBIT). CISA Review Manual. Auditing IT infrastructure. Champlain. by Information System Audit and Control Association. Audit computer networks and communication. Customers. views and latest methodologies of business process modeling o utilize software tools for business process designing o understand key concepts in the design and utilization of best business practices embedded in large business applications (ERP) o have an appreciation of issues pertaining to organizational design and organizational change management in the context of business process management Course Outline: o o o o o Business Process Definitions Business Process Analysis and Modelling Business Process Lifecycle Policies.
Furthermore. 2/e by James Trott (Kindle Edition . Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development. Testing strategies: Unit testing. Third Edition 2. Design Patterns Explained: A New Perspective on Object-Oriented Design. beta. by Craig Larman. Alpha. Structural testing. Managing the testing process. published by Prentice hall. o Design and implement comprehensive test plans o Apply a wide variety of testing techniques in an effective and efficient manner o Compute test coverage and yield according to a variety of criteria o Use statistical techniques to evaluate the defect density and the likelihood of faults. After the course you will have a deep understanding regarding the thoughts behind design patterns. compatibility testing. integration testing. Types of defects. profiling. and acceptance testing. The course may include following contents: General design patterns. 94 . State based testing. Developing test plans. and analysis. Coverage criteria. 2004 3.Feb 24. Black-box Vs. Deep understanding of the thoughts behind design patterns. Problem reporting. You will also have a knowledge database consisting of usable design patterns and related concepts.Course Name: Design Prerequisites: Patterns Credit Hours: 3 Course Structure: Lectures: 3 /Labs: 0 Objective: This course provides good knowledge about design patterns and how they are practically implemented in order to enhance existing systems and their design solutions. equivalence classes. boundary testing. Resources: 1. tracking. failures. which will make you well-prepared for implementation in your daily work. Learning objectives: Upon completion of this course. test driven development. 2009) Course Name: Software Testing Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 1 Prerequisites: Software Construction Objectives: Testing techniques and principles: Defects vs. Test instrumentation and tools. Classification of patterns. configuration testing. students will have the ability to: o Analyze requirements to determine appropriate testing strategies. Specific patterns for technical real-time systems. web site testing. Course Outline: The course focuses on studying a large number of general design patterns and their practical application. some patterns and idioms (language specific techniques) meant for real-time systems will be provided. Orientation around other types of patterns.
2005 3. Properties and schemas. Use of software testing tools. Specification analysis and proof. They specify computing systems formally. Software Testing by Ron Patton. Inception process: Objective of formal inspection Organizing Test cases: Decision Tables. Integration testing. reason about specifications. Course Outline: Introduction and overview: Testing and inspection concepts. Metrics and complexity. Schema texts. B. Programme verification. SpringerVerlag 2006. Cambridge. (Year of Publication) 2. The course should build skill and experience in the student. Software Testing in the Real World: Improving the Process by Kit. System testing. Generic constructions. Gabbar. Transformational development. Lab Work Additional teaching considerations: This course is intended to be 95% testing. user acceptance testing. Generics. They connect specifications to programmes through refinement and decomposition. UK. Course Name: Distributed Computing Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Introduction to Software Development 95 . Predicates. Schema expressions. Introduction to Software Testing by Paul Ammann and Jeff Offutt Published February 2008. Testing categories. Schema references. Z – Specification Language by Spiveny (Year of Publication) 3. with deep coverage of a wide variety of testing techniques. System Development using VDM by Jones. Resources: 1. 2. Sequential Systems. Modern Formal Methods and Applications by Hossam A. 2nd edition. They use theorem proving and model checking tools. . Tuples and Cartesian product types. Regression testing. Edward. Course Introduction to formal specification. Cambridge University Press. Syntactic conventions. Syntax testing. SAMS publishing. (1995) Course Name: Formal Prerequisites: None Methods Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Objectives: In this course students learn how to represent computing systems with both state-based and process algebra models. C. Outline: Resources: 1. Relations and functions. Bindings and schema types. Black box and white box testing Unit testing. State based testing. preferably with production code. and verify their properties. The Z Language. Objects and types: Sets and set types.o Conduct reviews and inspections.
fuzzy reasoning. Resource clustering. (Week 9-11) Course Outline: 1. neural network applications in control systems. Distributed processing system.Objectives: This course is intended to provide a sound background for net centric software development. 3. such as. introduction to fuzzy sets and fuzzy logic systems. CORBA. 2. . additive and shunting neural networks. Alternative models of uncertain reasoning (including belief function theory and fuzzy logic) and biologically inspired computational models (neural networks and evolutionary algorithms) are also presented. (Week 5-8) Fuzzy systems and applications: fuzzy sets. Batch processing models.14 Jun 2005) Course Name: Introduction to Soft Computing Credit Hours: 3 Course Structure: Lectures: 3/ Labs: 0 Prerequisites: Artificial Intelligence Objectives: The course provides an in-depth overview of the theoretical and the practical aspects of the soft computing paradigm. simulation schemes for belief updating. RMI. neural dynamics. short term and long-term memory. Belief Updating c. fuzzy control. learning in artificial neural networks. Neural Networks Classification Tree Naïve Bayes Applications of Predictive Models Probabilistic Reasoning using Bayesian Networks a. The main focus is on the theory and application of probabilistic graphical models (commonly known as Bayesian networks in the Artificial Intelligence community) and related topics. Distributed Systems: Principles and Paradigms by Tanen Baum. belief updating in singly and multiply connected networks. 5. Knowledge Acquistion b. 2nd Edition 2. MPI. Load balancing. RMI.NET and will highlight the interfacing of middle layer with the upper layers and system layer Course Outline: Introduction to distributed systems. parameter and structure learning of Bayesian networks. Multithreading. Middle layer architecture. Net. The course will concentrate an overview of major technologies like CORBA. Tim Kindberg. Resources: 1. knowledge elicitation issues. applications of fuzzy systems. Resource brokerage. Distributed data. introduction to biological and artificial neural network. and George Coulouris (Hardcover . Exact and Simulation-based Propagation Algorithms 96 . Distributed Systems: Concepts and Design (International Computer Science Series) by Jean Dollimore. Resource monitoring. Storage elements. 4. (Week 24) Artificial neural networks and applications: artificial neural network models. and integration of time and uncertainty. Introduction: Introduction to soft computing. Thread synchronization. fuzzy inference systems. Biological neural networks: generalization of single neuron.
Data Reduction Techniques. 2005. agglomerative and Naïve Bayesian methods. Genetic Algorithm. 1999. Data Warehousing Fundamentals. Larose. Pearson Education. Data Modeling Techniques for Data Warehousing. David Hand. OPS-5. means-ends analysis. Paulraj Ponniah. The MIT Press.d. evolutionary algorithms. Ben Coppin. Text Books/ References Books 1. semantic networks. Principles of Data Mining. Course Outline: Introduction to Common Lisp. Margaret H. productions. and Algorithms. Artificial Intelligence Illuminated. 2. Soft Computing & Intelligent Systems Design. Max Bramer. Statistical Methods in Data Mining. Dempster-Shafter Theory of Belief Functions 8. Eunsaeng Kim Ann Valencic. Data Preparation Techniques: outlier and missing data analysis. Mehmed Kantatardzic. hierarchal. Sridhar. Kevin Korb and Ann Nicholson. learning methods in Data mining. 6. breadth first search. 7. 2003. Introductory and Advanced Topics. 2003. Association Rules. 3. hill climbing. frames. ELIZA. Fuzzy Logic Resources: 1. Data Mning: Concepts. Decision Trees and Decision Rules. Knowledge Representation: Natural language. 2005. which mimic the human decision-making process and capability. Other Soft Computing Approaches in Data Mining. Data Mining Methods and Models. IBM Corporation. Models. 2007. AddisonWesley. 2. A* search. Bayesian Artificial Intelligence. 4. Influence Nets 7. predicate logic. John Wiley and Sons. Search: Depth first search. simple search. Methods. 5. scripts. Principles of Data Mining. Course Name: Artificial Intelligence Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: Data Structures Objectives: This course focuses on the set of computational tools and techniques. 2004. best first search. Cluster Analysis. pattern matching. 2001. Chuck Ballard Dirk Herreman Don Schau Rhonda Bell. rule based translators. rules. rules. AI classical systems: General Problem Solver. Symbolic Mathematics: student. 2006. Daniel T. min-max search. Course Name: Data Warehousing and Data Mining Course Structure: Lectures: 3 Lab: 0 Credit Hours: 3 Course Outline: Concepts of Data mining and Data Warehousing. solving 97 . Data Mining. 3. International Technical Support Organization. Heikki MAnnila and Padhraic Smyth. Fuzzy Logic and Fuzzy Set Theory. John Wiley and Sons. 2006. objects. Parameter and Structure Learning 6. Springer-Verlag. by Karray & De Silva. Artificial Neural Networks. Dunham and S. John Wiley and Sons.
RC-5). and tools of data security and cryptography. ATLAS. SHA-1. including authentication protocols (X. and thus. SSL. Prolog programming. Kerberos). digital signatures. RIPEMD-160. unification. Cryptography and Network Security: Principles and Practice. Artificial Course Name: Data Prerequisites: Security and Encryption Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: This is an introductory course on the methods. Prentice Hall. The second part (cryptography) covers cryptographic algorithms and design principles. Logic Programming: Resolution. PGP). PRESS. Macsyma. web security and protocols for secure electronic commerce (IPSec. electronic mail security (S/MIME. and authenticity of the documents and the communicating parties. HMAC). Sample case studies of shells and Knowledge Based Systems. This course material is of use to computer and communication engineers who are interested in embedding security into an information system. 4th edition. Reference Material: 1. Diffie-Hellman). 4th edition Pearson Education. fuzzy sets. techniques. solving algebraic equations. meta-rules. including Primes. horn-clause logic. RC-4. IDEA. 2005 Course Name: Discrete Prerequisites: None Structures–II Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 98 . modular arithmetic and discrete logarithms. random numbers. A brief appreciation of state of the art computational techniques like neural networks. Course Outline: The course consists of three parts: mathematical background. 2.509. we show how these techniques can be integrated to solve particular data and communication security problems. genetic algorithm. translating English equations. TLS. and network security. Rijndael. including conventional and symmetric encryption (DES. simplification rules. Prolog. re-write rules. Intelligence by Luger. The first part (mathematical background) introduces the principle of number theory and some results from probability theory. confidentiality. cryptography. algorithms.algebra problems. Pearson Education. Blowfish. SET). providing integrity. public key or asymmetric encryption (RSA. 2nd ed. and certificates. hash functions (MD5. key management. Resources: 1. Russell and Norvig. Artificial Intelligence: A Modern Aproach. After studying the theoretical aspects of cryptographic algorithms and protocols. The third part (network security) deals with practical applications that have been implemented and are in use to provide network security. William Stallings.
spanning trees. Pumping lemma and non-context free languages. traversal strategies. Context sensitive Grammars. Regular expressions/Regular languages. 99 . 2. Course Outline: o Review of previous course o Predicate logic: Universal and existential quantification. Some of the abstract machines shall also study as ―Transducers‖. graphs. Mathematical Induction and Recursion. Optimization and matching. modus ponens and modus tollens. Chomsky‘s hierarchy of grammars Turing Machines Theory: Turing machines. Trees and Graphs. Topics in the second course include predicate logic. Transducers (automata with output).Objectives: Continues the discussion of discrete mathematics introduced in CS105. computational complexity. Discrete Mathematical Structures by Rosen 2006. Derivations. applications o Computational complexity: Order analysis. Discrete Mathematics by Richard Johnsonbaugh 1996. and discrete probability. TM encoding. limitations of predicate logic o Recurrence relations: Basic formulae. elementary solution techniques o Graphs and trees: Fundamental definitions. Normal form grammars and parsing. Simplifying CFLs. Universal Turing Machine. Course Name: Theory of Automata and Formal Languages Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Discrete Structures Objectives: The course aims to develop an appreciation of the theoretical foundations of computer science through study of mathematical & abstract models of computers and the theory of formal languages. Variations on TM. independence o Methods of Proof. Finite automata (Fas). definition of the P and NP classes. Post machine. conditional probability. Pumping lemma and non regular language Grammars and PDA: Context free grammars. Transition graphs (TGs). elementary computability. diagonalization proof to show uncountability of the reals. Decidability. simple algorithms. applications o Matrices: Basic properties. matrices. Course Outline: Finite State Models: Language definitions preliminaries. Push-down Automata. Theory of formal languages and use of various abstract machines as ‗recognizers‘ and parsing will be studied for identifying/validating the synthetic characteristics of programming languages. recurrence relations. standard complexity classes o Elementary computability: Countability and uncountability. loop invariants. proof techniques. kleene‘s theorem. simple demonstration of the halting problem o Discrete probability: Finite probability spaces. NFAs. Pigeon whole principle. derivation trees and ambiguity. Resources: 1. trees. Defining Computers by TMs.
Francis S. Several measures of complexity are introduced.Scan-Converting lines. Dynamic programming. panning and zooming. Introduction to Algorithms. Rivest and Clifford Stein. Languages and Machines. 2001 2. NP complete problems. Jr. Shortest paths. by J Hopcraft. Fundamentals of Computer Graphics: 2nd Edition by Peter Shirley A. Languages and Computation. shading.K. John Wiley & Sons.. Polynomial and matrix calculations. by Denial Cohen. D. Recursion and recurrence relations. Course Outline: Graphics hardware. Thomas H. and segmentation.. Prentice Hall. complexity. and animation. 2006. by Thomas A.Resources: 1. MIT press. Second Edition. Inc. 4. Course Outline: Introduction. Course Name: Analysis of Algorithms Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Discrete Structures. Ronald L. Automata Theory by Martin 2. Computer Graphics Using Open GL. Search trees. Resources: 1. Disjoint Sets. String matching. Programming raster display systems. Hashing. Graph algorithms. windows and clipping. Data Structures Objectives: Detailed study of the basic notions of the design of algorithms and the underlying data structures. Charles E. 2/E. Leiserson. 2001 Course Name: Computer Graphics Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 1 Prerequisites: Object Oriented Programming Objectives: Study of various algorithms in computer graphics and their implementation in any programming language. Asymptotic notations. Resources: 1. Applications of graphics. Heaps. Ullman. Sc. and efficiency of algorithms. Cormen. Curve and surface design. Two and three dimensional imaging geometry and transformations. Divide-and-conquer approach. colour. Introduction to Automata Theory. rendering.. Network flow.graph plotting. Approximation algorithms. Introduction to Computer Theory. Sorting. Greedy approach. Sudkamp. Peters. Raster algorithms and software . characters and circles. 2005 100 . An Into to the Theory of Comp. Hill. Fundamental algorithms. Emphasis on the structure. Interactive graphics programming . 1996 3. Region filling and clipping.
Recurrent Networks (Time series . Prentice Hall. Principal Component Analysis networks (PCA) Associative Models Linear Associative Memory (LAM) . Course Outline: Introduction Contexts for and Motivation Neural Networks: Artificial Intelligence | Biological | Physics. Paul E. Genome-scale sequencing projects have led to an explosion of genetic 101 . Perceptrons . Evolutionary Programming . NJ. The objective of this course is on the understanding of various neural network and fuzzy systems models and the applications of these models to solve engineering problems. Artificial neural networks: an introduction. Backpropagation . Upper Saddle River. retrieve and assist in understanding biological information. Adaptive Resonance Theory (ART) . BSB) . Conjugate Gradient method . by Kevin L. SECOND EDITION. Temporal Differences method (TD). Levenberg-Marquardt (LM) method . Adalines Supervised Learning: Multi-Layer Networks. Neural Networks: A Comprehensive Foundation. Counterpropagation Networks (CPN) . Multi-Layer Perceptrons (MLPs) . by G. Priddy.Course Name: Artificial Neural Networks Credit Hours: 3 Course Structure: Lectures:3/ Labs: Prerequisites: Artificial Intelligence Objectives: This course presents an overview of the theory and applications of artificial neural network and fuzzy systems to engineering applications with emphasis on signal processing and control. Hopfield Networks . 2005 Course Name: Bioinformatics Course Structure: Lectures: 3/ Labs: 0 Prerequisites: Credit Hours: 3 Objectives: This course introduces the scientist to Bioinformatics. which uses computer databases to store. CascadeCorrelation Networks . Radial-Basis Networks . Finite Impulse Response (FIR) MLP ). Learning Vector Quantization (LVQ). Dreyfus-computers-. Artificial Neural Network overview. 1999 2. Brain-State-in-a-Box . Polynomial Networks . Boltzmann Machines and Simulated Annealing . Madalines . Simon Haykin. Bi-Directional Associative Memory (BAM) Optimization Problems Neural Network Approaches. Backpropagation through time . Neural networks: methodology and applications. Supervised Learning: Single-Layer Networks . Unsupervised Learning Simple Competitive Networks: Winner-take-all | Hamming network . Fuzzy logic and its connection to NNs Resources: 1. KellerTechnology & Engineering-2005 3. Kohonen Self-Organizing Maps (SOMs) .
These gene sequences are the codes. which direct the production of proteins that in turn regulate all life processes. The student will be shown how these sequences can lead to a much fuller understanding of many biological processes allowing pharmaceutical and biotechnology companies to determine for example new drug targets or to predict if particular drugs are applicable to all patients. Jean-Michel. Lesk (2002). control theory. ―Bioinformatics‖. Pierre Baldi. ClustalW. Where applicable. Pfam. BLAST. Course Outline: This interdisciplinary course provides a hands-on approach to students in the topics of bioinformatics. and biotechnology applications. Arthur M. 4. Bayesian methods. microarray expression analysis. Jean-Michel Claverie. Hands-on sessions will familiarize students with the details and use of the most commonly used online tools and resources. The use of NCBI's Entrez. 3.sequences available for automated analysis. Søren Brunak (2001). Resources: 1. John Wiley & Sons.―Bioinformatics: the machine learning approach‖. 2007 2. Lectures and labs should cover sequence analysis. Cedric Notredame. scalefree networks. engineering issues from signal processing. and engineering design issues. Contents are designed for should include for those with a computational and/or engineering background. PSI-BLAST. Published by BIOS. machine learning. it will include current real-world examples. David R. network theory. actual implementations. Incorporated.―Introduction to Bioinformatics‖. 102 . Prosite and the PDB. robotics and other domains will be expounded upon. Twyman (2002). Claverie. BLOCKS. MIT Press. Oxford University Press. PRINTS. ― Bioinformatics for Dummies‖. Richard M. Students will be introduced to the basic concepts behind Bioinformatics. John Howard Parish. Westhead.
Golub. and D.. E. the unsymmetrical eigenvalues problem. formal methods for program verification Course Outline: Sample labs and assignments: . calculation of eigenvalues and determination of eigenvectors. including solutions of linear systems.Implementation and testing of algorithms for typical linear algebra problems. Calculus Objectives: Students will gain familiarity with and facility in the use of standard techniques for the numerical solution of a variety of problems in linear algebra. 1999. Course Name: Mathematical Tools for Software Engineering Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Linear Algebra. Discrete Mathematics Objectives: Students will gain familiarity with and facility in the use of a variety of mathematical concepts and tools with significant applications in software engineering. R.. Computational Methods of Linear Algebra (2/e). Students will be introduced to various discrete transforms and apply some specific transforms to the solution of simple problems. discrete Fourier and cosine transforms and simple applications. 2005 3. various matrix operations. Lanczos methods. iterative methods for linear systems. students will be introduced to possible sources of error and techniques for estimating the magnitude. functions of matrices. D. tools for the analysis of efficiency.Building a significant project using one or more well known middleware architectures. Calculus. Sewell. Wavelets Made Easy. and C. Knuth. E. 1994 2. 103 . Course Outline: Background matrix algebra. In all cases. including mathematical models of machines and computations. Greene. D. and linear system sensitivity. the symmetric eignevalues problem. Resources: 1. orthogonalization and least squares methods. G. Van Loan. Nievergelt. evaluation of determinants and permanents. G. L. Graham. Matrix Computations (3/e). various discrete and continuous optimization techniques. matrices. subspaces. measuring vectors. including an analysis of errors.. numerical matrix algebra. Resources: 1. 1996 2. Mathematics for the Analysis of Algorithms. Error analysis and estimation for all techniques studied.. Y. Sample labs and assignments: . Concrete Mathematics: A Foundation for Computer Science (2/e). special linear systems. Gaussian elimination.Elective Supporting Courses Course Name: Computational Linear Algebra Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 1 Prerequisites: Linear Algebra. Knuth and O. Patashnik. H. 1990.. Introduction of discrete transforms.
Course Name: Operations
Credit Hours: 3
Course Structure: Lectures: 2 / Labs: 1
Prerequisites: Linear Algebra, Calculus, Discrete Mathematics, Probability and Statistics
Objectives: Students will become familiar with techniques of modeling real
world problems. They will gain facility in working with a number of the most common models and modeling patterns. They will understand and be able to apply the notions of sensitivity analysis. They will be able to select appropriate deterministic or stochastic models in a wide variety of common situations.
Course Outline: Introduction to mathematical modeling.
Linear program models, simplex method for solving LP models, sensitivity analysis, other solution techniques for LP models, specialized LP models (transport, assignment, etc.). Network based models, shortest path, min weight spanning tree, max flow, PERT/CPM. Decision models, dynamic programming, games theory. Probabilistic models, expected return models, Markov chains, stochastic processes, queueing models, stochastic inventory models. Sample labs and assignments: - Given a scenario, select and develop an appropriate model, solve it for the given parameters, and analyze the sensitivity of he solution to changes in the problem parameters.
1. Hamdi A. Taha, Operations Research: An Introduction (8/e), 2006 2. Hillier, F. S., and G. J. Leibermann, Introduction to Operations Research (8/e), 2005 Course Name: Simulation
Credit Hours: 3
Course Structure: Lectures: 2 / Labs: 3
Prerequisites: Probability and Statistics, Calculus
Objectives: This course emphasizes the development of modeling and
simulation concepts and analysis skills necessary to design, program, implement, and use computers to solve complex systems/products analysis problems regarding software engineering discipline. The key emphasis is on problem formulation, model building, data analysis, solution techniques, and evaluation of alternative designs/processes in complex systems/products. Overview of modeling techniques and methods used in decision analysis, including Monte Carlo simulation and systems dynamics modeling are presented. 1. To apply modern software packages to conduct analysis of real world data. 2. To understand the technical underpinning of modern computer simulation software. 3. The ability to apply the appropriate analytical technique to a wide variety of real world problems and data sets. 4. To summarize and present the analysis results in a clear and coherent manner. Course Outline: Introduction to Simulation and Modeling, Discrete-Event Simulation, Simulation of a Single-Server Queueing System, Alternative Approaches to Modeling and Simulations; Review of Basic Probability and 104
Statistics; Estimation of Means, Variances, and Correlations, Confidence Intervals and Hypothesis Tests for the Mean, The Laws of Large Numbers; Random number generators; Simulation of discrete, continuous probability distributions and empirical distributions; tests on simulated distributions, rejection method, simulation of multivariate distributions, correlations, and stochastic processes, simulation of models of arrival processes, Poisson Processes, Nonstationary Poisson Processes, Batch Arrivals, tests on generators, Markov- Chain Monte-Carlo simulations; Variance-Reduction Techniques.
1. A.M. Law and W.D. Kelton, ―Simulation Modeling and Analysis‖, McGraw Hill, 2000. 2. J. Banks, J.S. Carson and B.L. Nelson, ―Discrete-event System Simulation‖, Prentice Hall International, 1994. 3. Mitrani, ―Probabilistic Modeling‖, Cambridge University Press, 1998. 4. Sheldon M. Ross, ―Simulation and Modeling‖, 2002. 5. Brian Ripley, ―Stochastic Simulations‖. Course Name: Ethics
and Professional Practices for Computing Professionals
Credit Hours: 3
Course Structure: Lectures: 3 / Labs: 0 Prerequisites: None
Objectives: A Computing graduate as professional has some responsibilities
with respect to the society. This course develops student understanding about historical, social, economic, ethical, and professional issues related to the discipline of Computing. It identifies key sources for information and opinion about professionalism and ethics. Students analyze, evaluate, and assess ethical and professional computing case studies.
Course Outline: Introduction, Computing Ethics, Philosophy of Ethics, Ethics
and the Internet. Intellectual Copy Right, Accountability and Auditing, Social Application of Ethics.
1. Deborah G. Johnson, ―Computer Ethics‖, Pearson Education (2001) 3rd edition. 2. Professional Issues in Software Engineering, M.F. Bott et. al.
Curriculum for MS Software Engineering — MS (SE)
1. BS (SE/CS) 4 years degree programme, OR 2. Computer Science conversion course two years degree programme referred to as MCS or M.Sc. (Computer Science), OR 3. BCS 3-year programme degree applicants may be provisionally admitted in the MS (SE) programme. Candidates will be required to take additional courses to complete credit hour requirement of min. 130 before being formally enrolled in the MS (SE) programme. Under eligibility criteria 1-3 the university/department may recommend additional deficiency courses, from the BS (SE) curriculum, considering the deficiency of the candidates. OR 4. 16-years education science/engineering degrees. Under eligibility criterion 4 candidates will be required to complete the deficiency coursework prior to the MS (SE) coursework to ensure the prerequisite competency in SE. The deficiency coursework will be determined on the basis of the core SE courses of the BS (SE) degree.
4 semesters 30-36 credit hours from graduate Software Engineering courses including thesis
In order to obtain MS (SE) degree a student must pass a minimum of: i) ii) Four (4) courses (12 credit hours) from the core courses AND Four (4) courses of 12 credit hours graduate elective courses of which two graduate courses may be taken from other areas. AND Satisfactorily complete a Research Project Thesis of 9 credit hours.
Core Courses Following three courses are the core S. Other electives may be taken from allied areas to support the research work. Code Course Title 1 2 3 SE SE SE Requirement Engineering Software System Architecture Software System Quality Cr. 3 3 3 Semester 1-2 1-2 1-2 Elective Courses Candidate has to select a minimum of Two (2) courses from the following list of SE electives. Graduate Level SE courses (Institution may add courses to the list of Electives. Hrs.) Elective Courses 1 2 3 4 5 6 7 8 9 Software Engineering Management Software Risk Management Software Measurement and Metrics Global Software Engineering Software Configuration Management Knowledge Based software Engineering Software Dependability Software Costing and Estimation Business Process Reengineering 10 11 12 13 14 15 16 17 18 Formal Methods in Software Engineering Software Engineering Ontologies Semantic based Software Development Semantic web enabled software engineering Model Driven Software Development Machine Learning Applications in Software Engineering Software Process Engineering Software Case tools and Applications Web Engineering 107 . No.
Hrs.No. Code Course Title 1 2 3 Total SE SE SE Software System Quality Elective II Elective–III Cr.No. 3 3 3 9 Credit Hrs. Hrs. 3 3 3 9 Credit Hrs. Hrs. Code Course Title 1 2 3 Total SE SE SE Requirement Engineering Software System Architecture Elective–I Cr. Semester 2 S. Code Course Title 1 Total SE Thesis–II 6 Cr. Semester 4 S. Hrs. Code Course Title 1 2 3 Total SE SE SE Elective–IIV Elective–V Thesis–I Cr. Semester 3 S. 108 . 3 3 3 9 Credit Hrs.Sample Scheme of Study for MS (SE) 2–year Programme (4 Semesters) (30 Credit Hours) Semester 1 S.No.No. 6 33 Credit Hrs.
Requirements Engineering. Wiegers. Architecture reuse Life-cycle view of architecture design and analysis methods. Software Requirements. Goal modeling heuristics. and modifiability. Fundamental concepts and activities of requirements engineering. Identifying objects from goals. The QAW. Loucopoulos and Karakostas. Microsoft Press. interoperability. John Wiley Sons. Jackson. Springer 2. attribute-driven design. Modeling scenarios Fundamentals of goal-oriented requirements engineering. the role of quality goals in the requirements selection process. Karl E. to understand and use Formal Techniques. performance. and views. Modeling quality goals. Requirements management. Techniques for requirements evaluation. Modeling use cases and state machines. security. selection and prioritization. McGrawHill. context 109 . Documenting software architecture. software architecture evaluation. Deriving operational requirements from goals. Requirements traceability and impact analysis. such as availability. 4. Requirements Engineering: Processes and Techniques. ARID). Course Outline: Definition of requirements engineering and role in system development. Kotonya and Sommerville. Hull. software architectural styles and their relationship to system qualities. CBAM. 2003. Object modeling for requirements engineering. Information elicitation techniques. Resources: 1. a method for eliciting critical quality attributes. Requirements verification and validation Management of inconsistency and conflict.MS (SE) – Core Courses Course Name: Requirement Prerequisites: None Engineering Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Objectives: To understand Issues in Requirements Engineering. Attribute-driven design. architectural reuse. Principles of sound documentation. to understand modeling and analysis of Non-Functional Requirements. to understand and apply Requirements Engineering Process. Course Outline: Definition and overview of software architecture. Object modeling notations. Modeling behavioral goals. the architecture business cycle. Architecture Driven Design. software architecture documentation. 3. Evaluating a software architecture (ATAM. Understanding and achieving quality attributes. to understand and use Requirements Elicitation and Specification. Evaluating software architecture. System Requirements Engineering. Object modeling heuristics. Advanced concepts such as refinement. and Dick. 2nd Edition. styles. Requirements Specification. Course Name: Software Prerequisites: None System Architecture Credit Hours: 3 Course Structure: Lectures: 3 Objectives: To develop an understanding of the relationships between system qualities and software architectures. View types. requirements engineering risks. 2004.
Product and process assurance. Statistical approaches to quality control. Test Activities. Data Dependency. Fault Tolerance and Failure Containment. Addison-Wesley Professional. QUANTIFIABLE QUALITY IMPROVEMENT: Feedback Loop and Activities for Quantifiable Quality Improvement. Problem analysis and reporting. Course Outline: What Is Software Quality: Quality Assurance. and software quality improvement through systematic test planning. Resources: 1. and Klein. and Kazman. Control Flow. Establishing software quality goals and improvement measurement. Process assurance vs. software interfaces. Inspections and reviews. problem reporting and resolutions. and Techniques. Lattanze. Addison-Wesley Professional 4. Coverage and Usage Testing Based on Finite-State Machines and Markov Chains. Choosing relevant views. and Automation. Testing. Theory. Defect Classification and Analysis. design and executions.diagrams. Testing Techniques: Adaptation. 2001. and test documentation. Kazman. Coverage and Usage Testing Based on Checklists and Partitions. and the need for a culture of quality. verification and validation techniques. and Dashofy. Product assurance. Clements. Clements. and how to document interfaces. 2009 2. 2008. and Practice. research and trends in Quality: how to assure it and verify it. Software Architecture in Practice (2nd Edition). Medvidovic. variability. Building a documentation package. Bass. QUALITY ASSURANCE BEYOND TESTING: Defect Prevention and Process Improvement. Comparing Quality Assurance Techniques and Activities. Course Name: Software Prerequisites: None System Quality Credit Hours: 3 Course Structure: Lectures: 3 Objectives: The objective of this course is to study in detail the issues involved in software quality engineering. The course focuses on current practice. Avoidance of errors and other quality problems. Issues. Software Reliability Engineering. 2003. Documenting the behavior of software elements and software systems. Management. Risk Identification for Quantifiable Quality Improvement. Quality process standards. Anthony J. Quality Models and Measurements. Input Domain Partitioning and Boundary Testing. and Integration. Quality Engineering SOFTWARE TESTING: Testing: Concepts. and Interaction Testing. Software Architecture: Foundations. verification and validation activities. Specialization. Economics of testing. Taylor. Architecting Software Intensive Systems: A Practitioners Guide. Software Inspection. Sample labs and assignments o Use of automated testing tools 110 . Formal Verification. Evaluating Software Architectures: Methods and Case Studies. Auerbach Publications 3.
Essentially the ethical. Software Testing Techniques (second edition). objects oriented modeling. software quality documentation. in their future careers. Final Project workshop results will be prepared by the supervisor based on the final evaluation (70%) by a panel of IT experts. and implementing real-life software applications following software development methodologies. Course Name: Research Prerequisites: Study Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Objectives: Introduction: The aim of the course is ―to provide the students with an ability to undertake postgraduate level research and an appreciation of relevant ethical. Can effectively report the results of research activities 3. and Quantifiable Improvement. designing. All students/groups /projects will be examined by the panel. professional and legal issues provide a research domain but the overall purpose is to ensure that the students gain research skills that will support them in the rest of their courses. professional and legal issues‖. Can develop and deliver presentations to disseminate research findings 111 . and that they will undertake their research activities in an ethical and professional manner. Elective Courses Course Name: Software Prerequisites: Engineering Laboratory Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Objectives: Course Outline: This course is designed to help the student develop the capability in specifying. Client Representatives and Internal Supervisor. Abilities: 1. Software application areas covered include. 3. Boris Beizer. Multimedia. Client server. Each student/team is expected to select an area of greatest interest and implement a related general interest software application. database systems. Software Quality Engineering: Testing.‖ Wiley-IEEE Computer Society Pre 2. Can carry out research investigations using information repositories. Quality Assurance. and testing and project management. 2.o Testing of a wide variety of software o Application of a wide variety of testing techniques o Inspecting of software in teams. The evaluation will be done in a similar manner as outlined for software project. The results for the continuous assessment (30%) will be submitted by the course supervisor. Jeff Tian (2005). Internet/network computing. comparison and analysis of results Resources: 1. Current research publications and literature and URLS where such courses are being offered.
2nd Ed. Critical analysis Thinking about methods Reading for research Data Collection and Information Gathering Information Gathering: Literature Surveys Data Analysis Proposals for Research Projects and Research Papers Information Gathering: Surveys and Questionnaires Presentation of Information: Writing Academic Papers-1 Content and Referencing The students have to perform meta analyses of 25-30 research papers selected in current research topics in International Journals. by Loraine Blaxter. Professional and Legal Issues in Computing Introduction to the Concepts of Research-1: Definitions. As part of course. Forming Hypotheses. CASE in software development process. C. Hughes. How to Research. Specific CASE tools. students will be assigned a real life problem for development through CASE tools Resources: Selected software case tool documentation Course Name: Software Prerequisites: None Engineering Ontologies Credit Hours: 3 Course Structure: Lectures: 3 Objectives: The objective of this course is to study in detail the Ontologies available for software development and highlights their strengths and weaknesses in achieving the goals for which the Ontologies have been developed. M. Originality. Resources: 1. Students have to read all such papers and prepare the analysis related to model. OO Design. The course starts from the introduction to Ontologies and latest 112 . Tight Course Name: Software Prerequisites: Objectives: Case Tools & Applications Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Course Outline: The students will be appraised of. Conference papers are not allowed for review.Course Outline: Introduction to the course: International Ethical. Emerging CASE methodologies. Case tools & techniques. findings and come up with what has been done related to selected area of research and research gaps if any are explicitly identified with future work. methods. Topic and papers will be selected with approval from the instructor. Traditional CASE methodologies. specialized design tools. Quantitative and Qualitative Approaches Introduction to the Concepts of Research-2: Process. Managing CASE methodologies.
Maintenance. Tools. Some Ontologies for Software Development: Ontologies for Requirements. Online Available Ontologies (search by using Swoogle) 3. Mario Piattini (Editor) Publisher: Springer. Methods.languages used to describe / document Ontologies. Extensive Use of Online Available Latest Resources 2. 5. 1 edition (October 19. Resources: 1. There will be a lot of case studies in this course as assignments. Using Ontologies in Software Engineering 3. Use of Ontologies and its significance in development of software systems will be covered with the help of some real life examples. Comparative Study of Semantics Coverage in Ontologies as per SWEBOK 7. Then a detailed study and comparison of different Ontologies available for each phase in the software engineering development life cycle will be done. Ontologies for Software Engineering and Software Technology by Coral Calero (Editor). 2006) Language: English ISBN-10: 3540345175 ISBN-13: 978-3540345176 113 . Course Outline: 1. Ontology Engineering: Principles. and Languages 2. Measurements. Francisco Ruiz (Editor). Use of Ontologies in Domain Oriented Software Development Environments 6. Design. Alignment of Different Available Ontologies. Development of Ontologies for SWEBOK (Software Engineering Body of Knowledge): Issues and Techniques 4.
Muhammad Ali Member Assistant Professor Department of Information Technology & Computer Science Institute of Management Sciences Peshawar 7. Dr Muhammad Yousaf Associate Professor Department of Computer Science & Engineering Bahria University Islamabad Convener Secretary Member Member Member 6. MS/MPhil degree programs. Dr Naveed Ikram Associate Professor Department of Computer Science International Islamic University Islamabad 4. Professor Dr Imdad Ali Ismaili Director Institute of Information Technology University of Sindh Jamshoro 3. Professor Dr. Islamabad. The following experts participated in the meeting: 1. Professor Dr Farhana Shah Director Institute of Information Technology Quaid-i-Azam University Islamabad 2. Nazir A. The purpose of this meeting was to finalize the draft curricula for undergraduate as well as graduate students of Information Technology. Professor Dr Muhammad Sher Chairman Department of Computer Science International Islamic University Islamabad 5. Dr.National Curriculum Revision Committee (NCRC): Information Technology (IT)-2009 A three-day final meeting of National Curriculum Revision Committee was held from April 21-23. Sangi Chairman Department of Computer Science Allama Iqbal Open University Member 114 . The lengthy discussions held throughout the period finally led us to design the curricula for BS. 2009 at Higher Education Commission (HEC).
Dr Sharifullah Khan Member Associate Professor School of Electrical Engineering & Computer Sciences (SEECS) National University of Sciences and Technology Rawalpindi 14. Dr. Professor Dr Madad Ali Shah Professor Information Technology IBA Sukkur Airport Road Sukkur Member 12. Professor Dr Aqil Burney Member Chairman Department of Computer Science and Information Technology University of Karachi Karachi. Sohail Asghar Member Assistant Professor and Head of R&D Department of Computer Science Shaheed Zulfikar Ali Bhutto Institute of Science & Technology Islamabad 10. Forman Christian College Lahore 13. Professor Dr Iftikhar Hussain Shah Member Professor Department of Computer Science & Information Technology Forman Christian College Lahore 11.Islamabad 8. Professor Dr Jerald Allan Kabell Member Chairperson Department of Computer Science & Information Technology. Mr. 15. Dr Shafay Shamail Associate Professor Department of Computer Science LUMS Lahore Member 115 . Muhammad Nadeem Khokhar Member Assistant Professor and Coordinator Computer Science Department Shaheed Zulfikar Ali Bhutto Institute of Science & Technology Islamabad 9.
Professor Dr Abdul Qadir Dean Faculty of Engineering and Sciences Muhammad Ali Jinnah University (MAJU) Islamabad 18. and Management Sciences. Engineering. Quetta 116 . Syed Mansoor Sarwar Principal PU College of Information Technology (PUCIT) Punjab University Lahore Member Member 19.16. Professor Dr. Abdul Hussain Shah Bukhari Member Dean Faculty of Information and Communication Technology Balochistan University of Information Technology. NCEAC FAST National University of Computer & Emerging Sciences Karachi 17. Professor Dr. Professor Dr Zubair A Shaikh Member Representative.
He welcomed the participants and highlighted the need for reviewing the existing curriculum.g. Following are the recommendations by the committee as a result of combined consensus. software and communication technologies. IT graduates who can: a) identify needs and possibilities of the organization which may be met by appropriate use of IT resources. Riaz ul Haq. analyze the local and global impact of computing and understand professional. 117 b) c) d) e) . and their responsibilities as IT professionals. deploy. Dr.First Meeting of National Curricula Revision Committee in the Field of Information Technology The meeting started with recitation of the holy Quran. manage and support the required IT resources. The goals are to produce. The participants liked to begin the revision of the existing curriculum in light of: a) Changes already recommended by Computer Science Committee especially bringing in of the common section of Computing Part for undergraduates Revised modifications recommended by the international community (e. Member (Acad) presided over the meeting. ACM/IEEE) on previous curricula suggested in IT The feedback and innovative ideas of members of the committee based on their experiences and diverse backgrounds b) c) Revision of Goals for the Program of BS in Information Technology The participants of the committee preferred to discuss the product of the program by having a vision and setting the goals first. The members of the National Curricula Revision Committee (NCRC) (the Committee) unanimously nominated and elected Dr Farhana Shah as Convener and Dr Naveed Ikram as Secretary of the Committee. select. in coordination with organizational management. The Convener declared the floor open for discussion after brief introductory remarks and explaining rules of the game. integrate. communicate with a range of audiences and participate effectively as part of teams. legal. A sub committee was assigned the task of researching the effective goals for the next four years at least. and help in improving the qualify for higher education programs. including hardware. The work was presented before the committee for deliberation. security and social issues. ethical. The aim of the undergraduate program of IT is to provide students with skills and knowledge that enable them to take on appropriate professional positions in IT and grow into leading roles. plan.
Review of Recommendations Made by NCRC for Computer Science (2008) Regarding “Computing” Section The NCRC for Information Technology agreed to disagree upon the Computing Part with the following observations and recommendations: a) ―Introduction to Computing‖ be renamed to ―Introduction to Information and Communication Technologies (ICT)‖ and be moved from ―Computing .General Education‖. b) c) d) e) f) g) 118 .Core Courses‖ to ―Computing . The course of ―Professional Practices‖ in ―Computing – General Education‖ should cover Social. The Islamic and Pakistan Studies course should be divided in to two courses of 2 credit hours each.Supporting Sciences‖ part.Core Courses‖ to ―CS Required Supporting Courses‖. Legal and Professional issues. The NCRC for Information Technology (IT) did not agree with the recommendation(s) coming from the NCRC for Computer Science (CS) that the course ―Discrete Structures‖ should be moved from the Computing . The course ―Human Computer Interaction‖ be added to the ―Computing–Core Courses. A course of ―Basic Electronics‖ be introduced in place of ―Physics (Electromagnetism)‖ in ―Computing . However. it was recommended by the NCRC for IT that this course should remain within ―Computing–Core Courses‖.‖ The titles of the courses ―Digital Logic and Computer Architecture‖ and ―Database Systems‖ in Computing – Core Courses be changed to ―Digital Logic Design‖ and Introduction to Database Systems‖ respectively. Ethical.
The three subsets of courses revolved around Technology. Knowledge-Based Systems g. Multimedia Systems and Design d. Data Mining i. Knowledge Management b) c) However the list is suggestive not exhaustive. A consensus was built on recommendations as given below: a) Six courses worth 18 credit hours should be considered Core area for the curriculum of BS in Information Technology as follows: a. Fundamentals of Information Technology b. The Elective courses with respect to Information Technology and General areas were suggested along with Fields of Concentration as follows: a. Mobile and Pervasive Computing d. System Integration and Architecture The course of ―Principles of Management‖ should be replaced by ―Technology Management‖ in the Required Supporting area defined for the curriculum.Revision of BS Program in Information Technology The task was divided into subtasks. Web Services e. Strategy. Structure of BS in Information Technology # Category 1 Computing Courses Core Courses Supporting Areas General Education 2 Information Technology Courses IT Core Courses IT Electives Courses IT Supporting Courses 3 University Electives Credit Hours 68 37 13 18 48 18 21 9 18 119 . Network Systems k. Three sub-committees were constituted to pay special attention to details. Information Security c. Communication Systems Design b. Systems and Network Administration e. Network Security f. universities may offer other courses. Web Technologies and e-Systems j. Web Site design and Usability f. Web Systems and Technologies c. Data Warehousing h. The lay out of courses together with the contents and up to date books were brought to the main committee for further discussion. and Management respectively. revise three subsets of courses and work thoroughly on their contents.
8 Computing — Supporting Sciences (12 Credits Hours) # 12 13 14 15 Required Supporting Courses Code Prereq Course Title MT MT MT EE Calculus and Analytical Geometry Probability and Statistics Linear Algebra Basic Electronics (13/134) Credit hours 3 (3-0) 4 (4-0) 3 (3-0) 3 (3-0) Proposed Semester 1 2 4 3 Computing — General Education (18 Credits Hours) # 1 2 3 4 Required General Education Courses Code Prereq Course Title Credit hours EG English-I (Functional English) 3 (3-0) EG EG PK English-II (Technical and Report Writing) English-III (Communication Skills) Islamic and Pakistan Studies 3 (3-0) 3 (3-0) 3 (3-0) Proposed Semester 1 2 3 1 120 .Total Credit Hours 134 Computing — Core Courses (37 Credits Hours) # 1 2 3 4 5 6 7 8 9 10 11 Required Computing Courses Code Prereq Course Title CS CS CS CS CS CS CS CS CS CS CS 1 2 3 4 4 4 6 Programming Fundamentals Object Oriented Paradigm Discrete Structures Data Structure and Algorithms Digital Logic Design Operating Systems Introduction to Database Systems Introduction to Software Development Computer Communications and Networks Human Computer Interaction IT Capstone (37/134) Credit hours 4 (3-1) 3 (2-1) 3 (3-0) 3 (2-1) 3 (2-1) 3 (2-1) 3 (2-1) 3 (3-0) 3 (2-1) 3 (3-0) 6 (0-18) Proposed Semester 1 2 2 3 3 4 4 5 6 - 7.
Universities may offer other courses. IT Electives Code Prereq Course Title Communication Systems Design Information Security Communication Technologies Mobile and Pervasive Computing Web Services Web Site Design and Usability Knowledge-Based Systems # 1 2 3 4 5 6 7 Credit hours 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) 3 (3-0) Proposed Semester 121 .5 6 IT SS - Introduction to Information and Communication Technology Professional Practices (18/134) 3(2-1) 3 (3-0) 1 8 IT — Core Courses (18 Credits Hours) # 1 2 3 4 5 6 Required IT Core Courses Code Prereq Course Title Fundamentals of Information Technology Web Systems and Technologies Multimedia Systems and Design Systems and Network Administration Network Security System Integration and Architecture (18/134) Credit hours 3 (3-0) 3(2-1) 3(2-1) 3(3-0) 3(3-0) 3(3-0) Proposed Semester IT — Supporting Sciences (9 Credits Hours) Required Supporting Courses Code Prereq Course Title Technology Management Organizational Behaviour Information Systems (9/134) # Credit hours 3 (3-0) 3 (3-0) 3 (3-0) Proposed Semester IT — IT Electives (21 Credits Hours) Following is a suggestive list of the elective courses.
Hrs. 2+1 3+0 3+0 3+0 2+1 3 18 2+1 3+0 18 Cr. Hrs. 2+1 2+1 3+0 3+0 Probability and Statistics Computer Communication and Networks University Elective III Semester 4 Operating Systems Introduction to Database Systems Organizational Behaviour Semester 2 Discrete Structures Object Oriented Programming Fundamentals of IT University Elective I English-II (Communication Skills) Pakistan Studies Cr. 2+1 3+1 3+0 2+1 3+0 16 Semester 3 Digital Logic Design Data Structures and Algorithms Linear Algebra English-III (Technical and Report Writing) Cr. 3+0 2+1 3+0 3+0 3+0 2+0 17 Cr. Hrs. 3+0 2+1 3+0 3+0 3+0 2+1 18 122 Semester 5 Web Systems and Technologies University Elective IV Introduction to Software Development IT Elective I Multimedia Systems and Design Information Systems Semester 6 University Elective V Systems and Network Administration IT Elective II University Elective VI IT Elective –III Human Computer Interaction . Hrs.8 9 10 Database Management Data Warehousing Information Retrieval 3 (3-0) 3 (3-0) 3 (3-0) Scheme of Study for BS (IT) 4-Year Program (8 Semesters) (130 Credit Hours) Semester-wise 4-Year Plan Semester 1 Introduction to ICT Programming Fundamentals Calculus and Analytical Geometry Basic Electronics English-I (Functional English) Cr. Hrs. Hrs. 2+1 2+1 3+0 3+0 Islamic Studies/Ethics University Elective II 2+0 3+0 17 Cr.
6 3 3 3 12 123 .Semester 7 IT Capstone Part I (continued) Technology Management IT Elective IV Network Security System Integration and Architecture IT Elective V Cr. Hrs. Hrs. * 3 3 3 3 3 18 Semester 8 IT Capstone Part II IT Elective VI Professional Practices IT Elective VII Cr.
S No 1 2 3 4 5 6 7 8 9 10 11 12 Course Title Economics of Technology IT Planning and Evaluation IT Services Management IT Project Management E-Biz IT Audit and Assessment IT Policy. A minimum of 6 credit hours for thesis/project work/course work are recommended. Laws. project work. after incorporating the approved changes the structure of MS in IT with its complete design and details emerged as follows: Structure of MS in Information Technology Category or Area Core Elective Thesis/Project/Course work Total Credit Hours Credit Hours 12 12 6 30 Core Area S No 1 2 3 4 Course Title Advanced Database Management Systems Telecom Management Information Security and Assurance Information Technology Infrastructure Credit Hours 3 3 3 3 Elective Area The committee argued at length the elective courses and recommended the following courses as suggestive list. and Practice IT Disaster Management Distributed Databases Data Mining Advanced Topics in Databases Information Technology Architecture Credit Hours 3 3 3 3 3 3 3 3 3 3 3 3 Thesis/Project/Course work The committee. recommended that university should be given option for selecting thesis. Finally. or course work.MS Program in Information Technology The curriculum for the Master‘s program was thrashed out with diverse perspectives. after long discussion. Everybody agreed upon defining tracks consistently and suggesting courses accordingly. Universities may add more courses on similar lines. 124 .
Navathe. Co. Sudarshan. Database Systems. Elmasri and S. Implementation and Management‖. The course primarily focuses on relational data model and DBMS Course Outline: Basic database concepts. T. data networks. An introduction of the program of study in computing for which this course is being taught (CS. visual presentation applications. 2.. IT. Abraham Silberschatz. R. The course attempts to provide every student a set of productivity tools that they will be able to use for the rest of their lives. Logical database Modelling and design: Entity Relationship diagram (ERD).Connolly and C. 4. Pearson education. DBMS. Benjamin/Cummings. Functional dependencies and Normalization: 1st -3rd Normal Form and BCNF. J. Henry F. general application software like word processing.COURSE CONTENTS For BS in IT Course Name: Introduction to Database Systems Credit Hours: 3 Course Structure: Lectures: 2/Labs: 3 Prerequisites: Data Structures and Algorithms Objectives: The course aims to introduce basic database concepts. WWW. 125 . Addison Wesley Pub. operating systems. ―Database System Concepts‖. Date. a Practical Approach to Design. including computing environments. Computing: General Education Course Name: Introduction to Information and Communication Technologies Credit Hours: 3 Course Structure: Lectures: 2 / Labs: 3 Prerequisites: None (first semester course) Objectives: This course focuses on a breadth-first coverage of the use of computing and communication technologies to solve real life problems. tabular data manipulation. Structured Query language (SQL). data storage and retrieval techniques and database design techniques. Enhanced ERD Relational data model: mapping ERD to relational model. concurrency control recovery techniques and query optimization concepts. Virus. 3.Begg . Relational Algebra. software engineering and communication technology along with social and ethical issues. Korth S. ―Database Systems. C. Fundamentals of Database Systems. Reference Material: 1.). different data models. Introduction to the basic computing hardware (main building blocks). SE etc. Fundamental knowledge about Transaction processing. Email management systems. Anti-Virus and Spam Protection.
2002/ISBN: 0130929891. Challenging issues for today‘s information and communication technologies. Course Outline: Introduction to the academic discipline of IT as well as the general meaning of IT as per objectives given in the start of this program. Programming paradigms and languages. 2000. Basic network ideas and models. design. Computers Today by Suresh K. advantages and disadvantages of various presentation media.. Algorithm definition. Overview of Software Engineering and Information Communication Technology. AI. spreadsheets. Joseph Valacich. McGraw-Hill SiE. 9/e by Larry Long and Nancy Long. information technology as the use of computer based technology to organize. transmit and present information. Professional and Legal Issues. Information System Today by Leonard Jessup. Computer Science: An overview of Computer Science. 4. An Invitation to Computer Science. Computer networks and internet. Binary numbers. Use of office productivity tools. Reference Material: 1. retrieve. issues in organizational need assessment and management of large scale information systems. 2. Differences in human and machine processing of information. Prentice Hall. etc. such as word processors. 3. information transfer at the human/machine interface. Computer graphics. and to explore some of the computer based technologies used for these purposes. Social. Boolean logic. Viruses and AntiViruses. 126 . Compiler. web mail applications. Information organization via databases. BS IT Core Courses Course Name: Fundamentals Course Structure: Lectures: 3 of Information Technology Credit Hours: 3 Prerequisites: Introduction to Computing (recommended) Objectives: To introduce students to the scope of the field of Information Technology. store. basic machine organization. 5. Basandra. DBMS. sender/receiver/channel model for information transfer. modalities for information presentation. data modeling. its organization. presentation applications. Computers: Information Technology in Perspective. and implementation. along with social. Schneider and Gersting. to give them a basic understanding of information. Introduction to Computers by Peter Norton. Definitions of information. Brooks/Cole Thomson Learning. retrieval and presentation. Sherer. Graphical programming. History computer system. storage. and overview of the complete program of studies in computing and its structure. Ethical. 6th Edition. WWW.Course Outline: Number Systems. and information management systems. legal and ethical issues related with each topic. ISBN 0-07-059374-4. Operating system. Von Neumann Architecture. Suggested Text Book: 1. transmission.
and Web3. Prentice-Hall India. protocols. Information Technology Inside and Outside. Hardcover: 592 pages. Publisher: Wiley. Ray. 2004 3. content management. development.). Vaz. 2 edition (July 12. Senn (Author). Semantic Web. protocols and standards (HTTP. Richard E. Information Technology: Principles. 2001 2.). web services. John A. 3 edition (December 1. and to give the students practice in integrating these to produce a functional webbased system. The instructor is expected to cover an in-depth treatment of the web technology and applications related topics including web standards. ISBN-10: 0131436260 4. Practices. Introduction to Information Technology (Hardcover). Prentice Hall. Vaz. by James A. and Opportunities (3rd Edition) (Hardcover). ISBN-10: 0471073806 Course Name: Web Course Structure: Prerequisites: Systems and Technologies Lectures: 3 Credit Hours: 3 Fundamentals of Information Technology (required) Objectives: This course will extend the WWW Technologies and Web Based Applications architecture. etc. Web Technologies and Tools (such as scripting tools) for web application development and deployment (web servers. Ajoy Kumar and Tinku Acharya. ISBN-10: 0131436260 Reference Material: 1. Course Outline: In-depth study of World Wide Web architectures. and Opportunities (3rd Edition) (Hardcover). Prentice Hall. 2003). David. Web Services. practical exercise in web site development. Orr and Richard F. CGI. principles of web site design. xHTML. cHTML. management of large scale web based information systems.Suggested Text Book: 1. and semantic web. John A. Pearson Education (LPE). Senn (Author). deployment and management concepts studied in the course of Fundamentals of Information Technology.by Efraim Turban (Author). XML. Cyganski. etc. 2002). Orr and Richard F. Information Technology: Principles and Applications. 3 edition (December 1. Cyganski. search engine architectures. Information Technology Inside and Outside. application servers. David. Potter (Author). data access and processing. Practices. Web2. by James A. Information Technology: Principles. Web Based Applications including search engines and content management. Pearson Education (LPE). 2003). Rex Kelly Rainer (Author). web applications architecture. HTML. WML. to explore some of the technologies used for display. 127 . 2001 2. web2.
Craig. annotation. Dan.. The Web Warrior Guide to Web Programming. The Web Warrior Guide to Web Design Technologies. ISBN-10: 047051860X 8. al. step-by-step procedure in developing multimedia systems: (specification. sound. J. 2/e. Lab: 3 Fundamentals of Information Technology (required) Objectives: To introduce students to the complete process of multimedia system specification. 128 . Wiley 2006 2. Publisher: Wiley. Protocols and Practices by Leon Shklar and Richard Rosen (Paperback . storage and playback techniques.. 2003 3. et. 2 edition (October 31. images. design. testing. Cengage Learning. Diane. Bob Leasure and James Leasure. The Web Warrior Guide to Web Database Technologies. Gosselin. multimedia applications and development tools. multimedia applications. C. Zak. 2008). design. T. 2008). 4th edition (August 17. Pearson (LPE). Jackson. 2003 4. and prototyping. ISBN-10: 0321489691 Reference Material: 1. software. hardware.. Mike and Joline Morrison. Siegfried Reich. and prototyping). Web Engineering: The Discipline of Systematic Development of Web Applications by Gerti Kappel.Jul 5. 2007). Publisher: Addison Wesley. and to give the students practice in the production using a variety of media and tools.Oct 31. Introduction to multimedia systems.developing multimedia systems in the laboratory. Student projects . and Werner Retschitzegger (Paperback . including the tools and techniques for integrating multimedia content (text. Paperback: 752 pages. Cengage Learning. multimedia software development tools. Morrison.Suggested Text Books: 1. testing. Web Technologies: A Computer Science Perspective. Cengage Learning. to present design principles and techniques to maximize the effectiveness of such products. animation. video and audio capture. Nuckles. al. motion video and virtual reality) into a product. Web Wizard series for various technologies. Birgit Prýýll.. by Robert W. multimedia standards. Cengage Learning. 2008 7. 2003 2. 2006) Course Name: Multimedia Course Structure: Prerequisites: Systems and Design Credit Hours: 3 Lectures: 2. Web Applications: Concepts and Real World Design. Paperback: 420 pages. Web Application Architecture: Principles. Course Outline: Introduction to multimedia systems. Leasure. Database Driven Websites. graphics. various equipment. Programming the World Wide Web (4th Edition) (Paperback). 2002 5. et. Addison-Wesley 6. Sebesta (Author).
Li. device configuration and management. Course Name: System and Network Administration Credit Hours: 3 Semester: 5 Course Structure: Lectures: 2/Labs: 1 Suggested Prerequisites: Computer Communication and Networks. user account administration. setup and maintain Linux server machine and to perform various system administration and security related tasks on those machines. Installation and administration of heterogeneous networks using Windows and Linux platforms. File systems. remote administration. (2nd ed. In labs focus is on how to install. 2007 Reference Material: 1. Cengage Learning. Operating Systems Objectives: This course will give an overview of systems and network administration based on both Windows and Linux environments.Suggested Text Books: 1. The objective are common system administration tasks and practices and how to implement and maintain standard services like email. Ray. DNS and similar. Drew: Fundamentals of Multimedia. security. Multimedia: Making it Work. disk maintenance. Cengage Learning. Course Outline: Brief introduction to the Networks. 2006) 2. Lake. 2007. print and disk quotas. M. Configuration issues. the use of advanced scripting to ease system administration tasks. file systems and directory permission structures. Digital Multimedia: The Business of Technology. Homogenous and Heterogeneous networks. Enhanced Edition. Chapman: Digital Multimedia. 129 . Z. file sharing. System installation. S. Fundamentals of Linux user interface. Susan and Karen Bean. template implementation and cross directory implementation. Multimedia Concepts. booting and halting the system. ISBN: 0-13-127256-X 2. Chapman.). Seventh Edition by Tay Vaughan (Paperback Dec 20. 2002 3. client administration. Shuman. The course is primarily dealing with the Linux and Windows operating systems and especially with Linux-based servers and Window-based clients. J. ISBN: 0470-85890-7 3. Cengage Learning. Wiley 2004. Exploring Multimedia for Designers. configuration management. the use of schedulers. but some information about the most fundamental differences between various Linux systems will be provided. remote access. Issues involved in the setup of Heterogeneous networks. Prentice Hall 2004. Villalobos. James. M. N.
Suggested Textbooks: Reference Material: 1. integrative coding. system security. Reference Material: 1. Cryptography and Network Security: Principles and Practice. cyber crime. integrate and deploy these resources in the form of a system. Limoncelli. Suggested Text Books: 1. Windows Administration Latest Edition. Course Name: System Integration and Architecture Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: Fundamentals of Information Technology (Required). electronic mail security. 2002). Enterprise Integration: An Architecture for Enterprise Application and Systems Integration (Paperback). 4/E. integration. the 2nd Edition by Thomas A. data mapping and exchange. electronic transaction security and digital signatures. security threats and methods to avoid them. Introduction to Software Development (Recommended) Objectives: This course will prepare the students to understand the system level requirements of an organization and acquire the required information and communication resources. Paperback: 496 pages. 2. web security. Microsoft Press 3. William Stallings. sourcing. 2005.. organizational context and architecture. intersystem‘s communication. project management. Cummins (Author). Publisher: Wiley. standard security protocols. authentication applications. ISBN-10: 0471400106 130 . firewalls. intruders and viruses. introduction to cryptographic algorithms. Hogan. IP security. testing and quality assurance. policy and regulations. 1st edition (February 1. acquisition. Linux Administration Guide Latest Edition Course Name: Network Security Credit Hours: 3 Semester: 7 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Computer Communication and Network Course Outline: Principles and Practices of network security. Prentice Hall. 2005. software security and an overview of programming languages. 2. by Fred A. Government Policy documents on security issues. scripting techniques. Practice of System and Network Administration. Course Outline: System level requirements gathering and analysis.
goals and objectives. job design. motivation. equipment and systems acquisition processes. common hurdles. case study to appraise students real problems Course Outline: Introduction and issues in technology management. Small case study. etc. Robert Williams and Marks Walla. Robins Stephan. software. Reference Material: 1. organizational design. Technology transfer issues related to hardware. organizing etc. Organizational Behaviour: an Introductory Text. Course Outline: Introduction to Behavioural Science. Huczinsky and Buchanan 2. Common challenges in change management. personality. Technology strategy. IT as change enabling technology. work processes and control issues. performance and rewards. human resources. Course Name: Organizational Prerequisites: None Behaviour Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: (a) (a) To introduce organizational behaviour and its impact on work within organization. Basic management functions (Planning. stress and work. impact of IT on behaviour. negative forces and conflict management. power and politics in organizations.. Business Change and Technology challenges and issues. learning and reinforcement. training planning. assessment and selection of technology. Decision making. focusing on technology management issues.). individual behaviour. Organizational Behaviour by Fred Luthans 131 . Implementation processes. perceptions and attitudes. Griffwn. ―Management‖ 2. leadership. communication effectiveness. (b) Impact of IT on individual behaviour. team dynamics and paradigms.BS IT Supporting Courses Course Name: Technology Prerequisites: None Management Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: (a) (b) to introduce basic management functions. Control. team behaviour and organization. ―The Ultimate Window 2000 System Administration‘s Guide. change issues. Reference Material: 1. ―Principles of Management‖ 3. organizational structure. communications. DM and its implications. an organizational behaviour.
Types of IS Strategies. Team Composition. design. Alignment of both Strategies. Analog Modulation Systems. Information Systems success and Failure. This course will facilitate students to understand the advanced concepts of information systems. and success and management aspects will be placed in order to discuss the management of the technical processes involved. Course Outline: Preliminaries on Deterministic and Random Signals. Soft System Methods (SSM). Information Systems Project Evaluation. Design Issues in IS. Course Outline: Introduction and Classification of Information Systems.Course Name: Information Prerequisites: None Systems Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: Major emphasis than is usual for Information Systems analysis. Rapid Application Development (RAD). Elements of Information Theory. Transmission over Dispersive Channels. Actual Case Studies will be central to the delivery of the unit. Measuring Project Complexity. Digital Modulation Systems. developments in all aspects of Information Systems development will also be covered and discussed. Characterization of Transmission Media and Devices. Role of CIO. Lifecycle of IS Projects. CASE Tools. Recent. Digital Transmission of Analog Signals. Enterprise Information Systems. Prototype Approaches. IS Feasibility Study and Types. Source and Channel Coding 132 . Critical Success Factors. Detailed IS Design Issues. Structure of IS Projects. Case Studies. Managing Information Systems Projects. Reference Material: 1. O Brien and Marakas. 13th Edition. Advanced Design Issues. well-accepted. Cohesion and Structured Charts. 2007 BS IT Elective Courses Course Name: Communication Prerequisites: None Systems Design Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: The objective of this course is to learn theory of communication system design. Business Strategies and Types. Coupling. Managing Conflicts in Information Systems projects. IS Strategies. System Analysis of IS Projects. Major Taxonomies of Information Systems. McGrawHill.
Processing and Storage) (Spiral-bound). Nevio Benvenuto. privacy and social issues. implementation and transition issues. Database security. Information Security Best Practices by George L. Nicola Laurenti 2. Host-based and network-based security issues. Tomaso Erseghe. Software Validation and Verification Rules. Personnel security. integrity. Emergency Rules Attacks. Information Security Network Architecture Design Rules. classification and trust modelling. availability. implementation and transition issues. Application Security Rules. Network Monitoring Rules. Controls and protection models. Identification and authentication in local and distributed systems. Network Hardware Security. Areas of particular focus include secure network design. the responsibilities and basic tools for information security. Stefanek. PC Operating Security Rules. Communication System Design Using DSP Algorithms: With Laboratory Experiments for the TMS320C6713 DSK (Information Technology: Transmission. Internet Security Rules. Access controls. Security kernels. Information Auditing. Risks and vulnerabilities. It covers concepts and applications of system and data security. Risk assessment. Configuration Management Rules. Communication Systems: Fundamentals and Design Methods. Information flow. Course Name: Communication Technologies Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: None 133 . Physical Security Rules. by Steven A. Anatomy of Attack. and techniques for responding to security breaches.Suggested Textbook: 1. Operational security issues. authentication technologies and models. Course Outline: Information Security Attacks & Vulnerabilities. An introduction to confidentiality. Data Encryption Rules. Policy formation and enforcement. Tretter Course Name: Information Security Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Computer Communication and Network Objective: This course provides a broad overview of the threats to the security of information systems. Secure programming. 2006. and techniques for responding to security breaches. Rules for Selecting Security Hardware & Software. Awareness and Management Commitment to Security. Roberto Corvaja. Intrusion detection and response. Reference Material: 1. Encryption. Physical security issues. Operating System Security Rules. Maintenance and Troubleshooting Security Rules. Legal. and the levels of training and expertise needed in organizations to reach and maintain a state of acceptable security. Security Policy. Areas of particular focus include secure network design.
Tuning Schema: De-normalization and Decompositions. New Directions for Science & Technology Education. (b) to monitor the processing of database system. Database Workloads. Tuning Queries and Views.Objective: Goals for the course include developing teaching strategies consistent with the constructivist philosophy of education that help new learners understand: how science & communication technology relate to society and the environment. Database System Architectures: Centralized and Client-Server Architectures. how to use the processes of scientific inquiry and communication technological design. Assessment for Learning in Science. Database Tuning: File Structures and organizations. Index Selection. Rees. Course Outline: Introduction to Science & Technology. (2008) Readings for Science & Communication Technology. Course Name: Database Management Credit Hours: 3 Course Structure: Lectures: 2/Labs: 3 Prerequisites: Introduction to Database Systems Objectives: (a) to manage large database systems. Course Outline: Advanced Structurejd Query Language (SQL): Complex Integrity Constraints (Assertions). Encryption and Public Key Infrastructures. basic concepts from the major fields of science & communication technology. Science & Communication Technology for all Learners. Mandatory Access Control. Integral to the course is our objective to help student-teachers develop their commitment to students and student learning. Maintaining Safe Learning Environments for Science & Communication Technology. 134 . and Halpern J. Society and the Environment (STSE). Communication Technology. Parallel and Distributed Database Systems. Advance Topics in Communication Technology. Designing and managing Triggers. Distributed Catalogue Management. Cross Curricular Connections. C. furthering professional knowledge through ongoing professional learning. Views in SQL. and the application of professional knowledge to professional practice and leadership in learning communities. Interrelating Science. Role-based Access Control. Hashing and Indexing. Communicating Science & Technology. Stored Procedures. 2. Reference Text: 1. Communication Systems. Physical Design and Tuning Decisions. Database Security and Authorization: Discretionary Access Control. Recovery Techniques: Database backup and recovery from catastrophic failures. Learning through Science & Technology. Fragmentation and Replication. Communication Technology. Simon Haykin 4th Edition.
3. Introduction to Expert Systems (3rd Edition) by Peter Jackson. or latest edition. ―Database System Concepts‖. Implementation and Management‖.Begg . Gary D. Sudarshan. 3rd Edition (January 1999). Feasibility analysis. 3. ―Database Management Systems‖. Riley. Elmasri and S. Verification and validation. Navathe. AddisonWesley Longman Publishing Company. Third Edition. R. (b) to learn how to analyze. Knowledge representation and reasoning models. Knowledge acquisition and system implementation. a Practical Approach to Design. Artificial Intelligence: Structures and Strategies for Complex Problem Solving by George F. 3rd Edition. and build systems with ability to deal with knowledge in various forms. 2. design. Prentice Hall. 2. Requirements specification and design. PWS Publishing Co. Pearson education. Rule-based expert systems.. Expert Systems: Principles and Programming by Joseph C. Henry F. Course Name: Knowledge-Based Course Structure: Lectures: 3/Labs: 1 Systems Credit Hours: 4 Prerequisites: Fundamentals of Artificial Intelligence or Students should be familiar with programming and be able to work with elementary logic in propositional and predicate calculus environments. 4th Edition. 135 . Fundamentals of Database Systems. Course Outline: Introduction to knowledge-based systems. Giarratano. Gonzalez and D. Korth S. Benjamin/Cummings. Thrid Edition. ―Database Systems. Software lifecycle in knowledge-based systems.Reference Material: Latest editions of 1. 3rd Edition 2000. Raghu Ramakrishnan and Johannes Gehrke. Bayesian inference and other models of reasoning and decision making under uncertainty. challenges.Connolly and C. concepts and techniques from the field of Knowledge-Based Systems. Reference Material: 1. 4. Luger. 2. Architecture of a knowledge-based system. Thomson/PWS Publishing Company. The Engineering of Knowledge-Based Systems by A. McGraw Hill. Prentice Hall. Peter Norvig. Abraham Silberschatz. Suggested Text Books: 1. T. Benjamin/Cummings Publishing. 2004. 2nd Edition (Preprint). Dankel. Logic and automatic reasoning (forward and backward reasoning). (c) to know importance of an explanation of many systems‘ suggestions in a format accessible to humans. Objectives: (a) to understand important problems. Artificial Intelligence: A Modern Approach (Latest Edition) by Stuart Russel.
by P. Evaluation of Data Warehouse. Addison-Wesley. Differences between TPS and DSS environments. Principles of Expert Systems. OLAP in data warehousing and different types of OLAP such as MOLAP ROLAP and HOLAP. (b) case study to appraise students real problems 136 . Data Warehousing Fundamentals. by D. focusing on technology management issues. Inmon. Addison-Wesley.H. NY. 5. Data Marts. 1992 or latest edition.H. Differentiate Data Marts and Data Warehouse. Paulraj Ponniah. AddisonWesley.. van der Gaog. Data warehouse Architecture. NY. Winston. (b) to monitor the processing of database system. Hardware and software systems consideration for data warehousing. Data Warehouse Design Methodology: Entity Relationship Modeling and Dimensional Modeling... Indexing techniques used in data warehousing. John Wiley & Sons Inc. Reference Material: 1. by P. 3. John Wiley & Sons Inc. Course Outline: Introduction of the business context for data warehousing and decision support systems.4. NY. The Data Warehouse Toolkit (Second Edition). Ralph Kimball and Margy Ross. 2. John Wiley & Sons Inc. Course Name: Information Retrieval Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Data Structures and Algorithms Objectives: (a) to introduce basic management functions. A Guide to Expert Systems. Lucas and L. 6. Waterman. Course Name: Data Warehousing Credit Hours: 3 Course Structure: Lectures: 2/Labs: 3 Prerequisites: Introduction to Database Systems Objectives: (a) to manage large database systems. 1986 or latest edition. W. Artificial Intelligence. Building the Data Warehouse (Second Edition). 3rd Edition.A. Data warehouse maintenance. 1991 or latest ed.
Distributed Database Design. Recommended Text: 1. Object-Relational Databases. 2. Addison-Wesley COURSE CONTENTS FOR MS IT Course Name: Advanced Database Management Systems Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Introduction to Database Systems Course Outline: Object-Oriented Databases. and F-measure. 2005. D. The 137 . An Advanced Course in Database Systems: Beyond Relational Databases. Christopher D. Mobile Databases. Methodologies for Custom Software Development. E-Business Systems. Berthier Ribeiro-Neto. Course Name: Telecom Prerequisites: None Management Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: The course provides the understanding of the operation and management of a telecommunication business. Distributed Multimedia Database Systems. IT Project Management. Computer Software. text/Web clustering. XML Data Models. Managerial Support Systems. Cambridge University Press. Applying Information Technology: Enterprise Systems. Experimental Evaluation of IR: Performance metrics: recall. Reference Material: 1. Evaluations on benchmark text collections. ranked retrieval. Methodologies for Purchased Software Packages. Prabhakar Raghavan and Hinrich Schütze (2008): Introduction to Information Retrieval. Supporting Computer Users. classification. S. text-similarity metrics. Modeling and Applications. Current Research and Development Trends of Database Analysis. Dietrich and S. and Web metadata. cosine similarity. text mining . Urban. inverse document frequency). XML Query Languages. W. Course Contents: Introduction Information Technology: Computer Hardwar. Acquiring Information Systems: Basic Systems Concepts and Tools. Telecommunications and Networking. Design. Manning.Course Outline: Basic and advanced techniques for text-based information systems: efficient text indexing. link-based algorithms. Spatial and Geographic Databases. Temporal. Prentice Hall. Data Warehouse and OLAP Systems. XML Documents and DTD. and Ricardo Baeza-Yates (1999): Modern Information Retrieval. precision. Basic IR Models: Boolean and vector-space retrieval models. Business Intelligence. TF-IDF (term frequency. The Data Resource. Web search including crawling.
Sarbanes-Oxley. Standards and Auditing. DeHayes. Information Security. and Social Issues. privacy and security laws and regulations and assurance such as HIPAA. Ethical.html 138 . Podell. Information Security: An Integrated Collection of Essays. Biometrics. Intrusion detection.org/secshelf/book001/book001. Smartcards etc. Martin. IEEE Computer Society Press. and Professional Issues in Information Security Recommended Text: 1. Introduction to Conventional and Un-Conventional Cryptosystems. Security Mechanisms such as Hashing. Wainright E. Confidentiality. GLBA. Managing Information Technology (6th Edition).acsac. Wainright E. Jajodia. M.g. Historical Approaches to Information Security and Information Assurance. Mattord (2003). William C Perkins Course Name: Information Security and Assurance Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Network Security Objective: This course explores the issues of ethical challenges and legal issues that fact security practitioners. CISRA and other. Daniel W. Extensive Case Studies in each topic discussed in the course. Understanding and evaluation the impact of legal and ethical issues on information security practice. S. Reference Material: 1. DeHayes (Author). Implement Threat Control Measures. Martin (Author). D. Conduct Accident/Incident Investigations. Managing Information Technology: What Managers Need to Know by Carol V Brown. Principles of Information Security. Ethical. Jeffrey A. Whitman & H. Daniel W. The protection of information assets underpins the commercial viability and profitability of all enterprises and the effectiveness of public sector organizations. William C Perkins 2. Integrity authentication. and H. nonrepudiation and digital signatures. Identification of Basic Services of Security e. Techniques for planning.Information Management System: Planning Information Systems Resources. Hoffer (Author). FISMA. Course Outline: Information Assurance. (1995). J. Legal. online at http://www. Abrams. Perform Vulnerability and Thereat Analyses. Legal. Information security should not be left to chance but should be managed to ensure it provides efficient and effective safeguards for your organization‘s information assets. Information Assurance Requirement in Modern Information Systems. Patriot Act. Security Protocols for End-to-End Secure Communication on all Types of Networks. Very Effectiveness of Thereat Control Measures. managing and implementing strategies based on these regulatory requirements will be discussed. Security Policies. Hoffer. Leading the Information Systems Function. ISBN: 0619063181 2. Course Technology. eds. Define the System Boundaries. by Carol V Brown (Author). M. Jeffrey A.
3. Andrew S. Targowski. cultural and organizational change management. IT infrastructure for virtual organizations.Herrmann Course Name: Information Prerequisites: None Technology Infrastructure Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Course Outline: IT strategy and management. change management. Bruce Schneier (2002). ISBN: 0-471-25311-1 Reference Text: 1. illustrated. Tipton. Computer Security Assurance using the common criteria by Merkow & Breithaupt 4. strategic planning for IT. Aileen CaterSteel 2009. 2002 139 . Information Security Management Handbook By Harold F. control & measurement. and tools & methods. scalability. Office of Government Commerce. IT investment and valuation. Global Information Infrastructure: The Birth. Service design objectives. and architectures for the design of IT service solutions/processes. Counterpane Internet Security.3. Vision. enterprise information infrastructure. business and information technology strategy linkage. and control & measurement. Micki Krause 2. Practical Guide to Security Engineering and Information Assurance by Debra S.Edition: 6. Information Technology Governance and Service Management. cost. knowledge management (KM). implementation. documents. and Architecture. Published by The Stationery Office. long term change and release management concepts and practices. Mohamed Essaaidi 3. risk analysis. Selecting the model. IGI 2. implementation of service strategies. Development and maintenance of information technology policies. control & measurement. application management.Thomas. Secrets & Lies: Digital Security in a Networked World. and risks and critical success factors. State of IT governance Reference Material: 1. Best Practice for ICT Infrastructure Management. 1996. Information Assurance and Computer Security By Johnson P.
Valduriez (eds. Fragmentation and Allocation. Ozsu. Fundamentals of Database Systems. SPSS. Multidatabase Systems. Principles of Transaction Processing. 140 . Course Name: Data Prerequisites: Mining Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Objectives: (a) to introduce the techniques. Distributed DBMS Architecture. Morgan Kaufmann. Bernstein and E. Course Outline: Introduction to Data Mining (DM). Distributed DBMS Reliability and Replication Techniques. P. Wiley.T.): Principles of Distributed Database Systems (2nd Edition). SAS. Decision Trees. R. Neural Networks. Commercially-Available DM Tools: Excel. Query Optimization. Prentice Hall. Navathe. Whitecross. The CRISP-DM process. Association Rules & Sequences. Reference Material: 1. Integrity Constraints. and will study query processing techniques as well as transaction management and concurrency control concepts used in such systems Course Outline: Introduction to Distributed Data Processing. Query Decomposition and Data Localization. Clustering Algorithms. M. IBM. 1999 2. Data Replication. Distributed Transaction Management and Concurrency Control. Oracle. Teradata. (b) to apply DM techniques to a variety of research and application projects. Buretta. Elmasri and S. P. 1997 3. Distributed Database Design: Issues.MS IT Elective Courses Course Name: Distributed Databases Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Introduction to Database Systems Objectives: Students will learn the usage of different design strategies for distributed databases. Benjamin/Cummings. High-Dimensional Data. Classifiers. M. Newcomer. 1997 4. tools and applications of data mining. Distributed Query Processing.
Reference Material: 1. but are not limited to. ideas. The main activity of the lectures will be discussions based around a set of papers. XML) storage. • Semantic heterogeneity. This course is a combination of various advanced topics. • Semi-structured data (i. there has been an explosion of information in a variety of environments that pose significantly different data management challenges than traditional database domains. XML. 5. Research Papers form HEC Digital Library. ―Advances in Knowledge Discovery and Data Mining‖. ―Principles of Data Mining‖. ―Data Mining: A Tutorial –Based Primer‖.. sensor networks. Course Name: Information Technology Architecture Credit Hours: 3 Course Structure: Lectures: 3 / Labs: 0 Prerequisites: System Integration and Architecture 141 . Pub. In addition. • Data caching and replication. 2. 4. Soft Computing and Bioinformatics‖. Wiley and Sons Inc. scientific domains. ―Data Mining: Multimedia. The MIT Press. Pub. 3. The aim of this course is to explore the latest techniques. David Hand. Course Outline: This course is intended to be highly interactive. • Streaming data. Prentice Hall of India. Recommended topics include. trends. and what are involved in designing and evaluating the cutting-edge database technologies. and to prepare new questions prior to class discussions. Usama M. Course Name: Advanced Topics in Databases Credit Hours: 3 Course Structure: Lectures: 3/Labs: 0 Prerequisites: Advanced Database Management Objectives: In recent years. Richard Roiger & Michael Geatz. each student is required to lead the discussion on one or two of these technical papers. P2P networks etc. • Mapping between XML and relational databases.e. Examples include semantic heterogeneity. 6. • Pervasive and mobile distributed database management Reference Material: 1. Fayyad et al. the following: • Data integration. All students are required to read technical papers. Addison-Wesley. • Ontology engineering. Sushmita Mitra and Tinku Acharya. Heikki Mannila and Padhraic Smyth. World Wide Web. to answer specific questions.
Objectives: Objective of this course is to understand the Information Technology Architecture as a framework and a set of strategies for the utilization and management of information technology. Assessment Reference Material: 1. Standards. ISBN-10: 0471400106 2. Policies. Information Architecture: Information Needs. Spewak. and Communication Network for Information Storage. by Fred A. policies. 1st edition (February 1. Processing. Boar 4.opengroup. Security Framework. Enterprise Architecture Planning. Follow up.ewita. Management. Transfer. Constructing Blueprints for Enterprise IT Architectures. Infrastructure Architecture: Hardware. Steven H. and Tools for Application Development. The Open Group: http://www. Course Outline: Business Architecture: Business Strategy. 2002). Building Enterprise Information Architectures: Reengineering Information Systems. Application Architecture: Guidelines for Design and Development of Business Applications. software. Cummins (Author). Paperback: 496 pages. Benard H. Security Architecture: Security Services. Enterprise-wide IT Architecture: http://www. composed of principles. Business Support Functions and Processes. Software. Hill 5. IT Management and Governance: Planning. Decision Making. and related products that interconnect different systems and ensure their interoperability. Steven C. Cook 3. Students will be able to select and implement the computing platforms. Publisher: Wiley.com/ 6. Enterprise Integration: An Architecture for Enterprise Application and Systems Integration (Paperback). and standards that guide the engineering of an organization‘s IT systems and infrastructure in a way that ensures alignment with business needs. Information Management Processes.org/itac/ 142 . Melissa A. networks.
Third edition.Annexure . ISBN 0194313506 143 . Martinet. a) Functional English Grammar 1.A COMPULSORY COURSES COMPULSORY COURSES IN ENGLISH FOR BS (4 YEAR) IN BASIC & SOCIAL SCIENCES English I (Functional English) Objectives: Enhance language skills and develop critical thinking. clause and sentence structure Transitive and intransitive verbs Punctuation and spelling Comprehension Answers to questions on a given text Discussion General topics and every-day conversation (topics for discussion to be at the discretion of the teacher keeping in view the level of students) Listening To be improved by showing documentaries/films carefully selected by subject teachers Translation skills Urdu to English Paragraph writing Topics to be chosen at the discretion of the teacher Presentation skills Introduction Note: Extensive reading is required for vocabulary building Recommended books: 1. Practical English Grammar by A.V.V. Thomson and A. Course Contents Basics of Grammar Parts of speech and use of articles Sentence structure. Exercises 2. Third edition. ISBN 0194313492 2. Exercises 1. 1997. Oxford University Press. Oxford University Press. 1997.J. Thomson and A.J. Practical English Grammar by A. active and passive voice Practice in unified sentence Analysis of phrase. Martinet.
Writing. Fourth Impression 1993. use of library and internet Presentation skills Personality development (emphasis on content. Thomson and A. unified and coherent paragraph Essay writing Introduction CV and job application Translation skills Urdu to English Study skills Skimming and scanning. Brain Tomlinson and Rod Ellis. Writing 1. Fourth Impression 1992. ISBN 0 19 435405 7 Pages 20-27 and 35-41. Martinet. Intermediate by Marie-Christine Boutin. Speaking c) d) English II (Communication Skills) Annexure-B Objectives: Enable the students to meet their real life communication needs. Reading. Exercises 2. Oxford Supplementary Skills.b) Writing 1. Third edition. Intermediate by Marie-Chrisitine Boutin. summary and précis writing and comprehension Academic skills Letter/memo writing. Oxford Supplementary Skills. Writing. 2. Oxford Supplementary Skills. Fourth Impression 1993. minutes of meetings.J. Third Impression 1992. and speed reading. Course Contents Paragraph writing Practice in writing a good. Upper-Intermediate by Rob Nolasco. ISBN 0 19 431350 6. style and pronunciation) Note: documentaries to be shown for discussion and review Recommended books: a) Communication Skills Grammar 1. ISBN 0 19 453402 2. Upper Intermediate. ISBN 019 435405 7 Pages 45-53 (note taking). Reading/Comprehension 1. intensive and extensive. Practical English Grammar by A. ISBN 0 19 435406 5 (particularly good 144 b) .V. Oxford University Press 1986. Suzanne Brinand and Francoise Grellet. Oxford Supplementary Skills. Writing. Suzanne Brinand and Francoise Grellet.
Reading and Study Skills by John Langan 3. Advanced by Ron White. 145 . ISBN 0 19 453403 0. b) c) College Writing Skills by John Langan. 3. Brian Tomlinson and Rod Ellis.for writing memos. Presentation Skills Reading The Mercury Reader. argumentative Academic writing How to write a proposal for research paper/term paper How to write a research paper/term paper (emphasis on style. language. Stephen Ruffus and Maurice Scharton. c) Reading 1. (A reader which will give students exposure to the best of twentieth century literature. Compiled by norther Illinois University. without taxing the taste of engineering students). Martin‘s Press. ISBN 0 19 435407 3 (particularly suitable for discursive. Mandell. Kirszner and Stephen R. 2004. Study Skills by Riachard Yorky. Third Impression 1991. 2. descriptive. Mc=Graw-Hill Higher Education. A Custom Publication. 2. Kathleen Shine Cain. descriptive and argumentative writing). argumentative and report writing). Patterns of College Writing (4th edition) by Laurie G. consistency) Technical Report writing Progress report writing Note: Extensive reading is required for vocabulary building Recommended books: Technical Writing and Presentation Skills a) Essay Writing and Academic Writing 1. narrative. clarity. introduction to presentations. Third Impression 1992. English III (Technical Writing and Presentation Skills) Annexure-C Objectives: Enhance language skills and develop critical thinking Course Contents Presentation skills Essay writing Descriptive. Oxford Supplementary Skills. content. General Editiors: Janice Neulib. Advanced. Writing. Reading. Oxford Supplementary Skills. St. form. discursive.
Annexure - D
Pakistan Studies (Compulsory)
Develop vision of historical perspective, government, politics, contemporary Pakistan, ideological background of Pakistan. Study the process of governance, national development, issues arising in the modern age and posing challenges to Pakistan.
1. Historical Perspective a. Ideological rationale with special reference to Sir Syed Ahmed Khan, Allama Muhammad Iqbal and Quaid-i-Azam Muhammad Ali Jinnah. b. Factors leading to Muslim separatism c. People and Land i. Indus Civilization ii. Muslim advent iii. Location and geo-physical features.
Government and Politics in Pakistan Political and constitutional phases: a. 1947-58 b. 1958-71 c. 1971-77 d. 1977-88 e. 1988-99 f. 1999 onward
Contemporary Pakistan a. Economic institutions and issues b. Society and social structure c. Ethnicity d. Foreign policy of Pakistan and challenges e. Futuristic outlook of Pakistan
1. 2. 3. 4. 5. 6. 7. Burki, Shahid Javed. State & Society in Pakistan, The Macmillan Press Ltd 1980. Akbar, S. Zaidi. Issue in Pakistan’s Economy. Karachi: Oxford University Press, 2000. S.M. Burke and Lawrence Ziring. Pakistan‘s Foreign policy: An Historical analysis. Karachi: Oxford University Press, 1993. Mehmood, Safdar. Pakistan Political Roots & Development. Lahore, 1994. Wilcox, Wayne.The Emergence of Banglades., Washington: American Enterprise, Institute of Public Policy Research, 1972. Mehmood, Safdar. Pakistan Kayyun Toota, Lahore: Idara-e-Saqafat-e-Islamia, Club Road, nd. Amin, Tahir. Ethno - National Movement in Pakistan, Islamabad: Institute of Policy Studies, Islamabad. 146
8. 9. 10. 11. 12. 13. 14.
Ziring, Lawrence. Enigma of Political Development. Kent England: WmDawson & sons Ltd, 1980. Zahid, Ansar. History & Culture of Sindh. Karachi: Royal Book Company, 1980. Afzal, M. Rafique. Political Parties in Pakistan, Vol. I, II & III. Islamabad: National Institute of Historical and cultural Research, 1998. Sayeed, Khalid Bin. The Political System of Pakistan. Boston: Houghton Mifflin, 1967. Aziz, K.K. Party, Politics in Pakistan, Islamabad: National Commission on Historical and Cultural Research, 1976. Muhammad Waseem, Pakistan Under Martial Law, Lahore: Vanguard, 1987. Haq, Noor ul. Making of Pakistan: The Military Perspective. Islamabad: National Commission on Historical and Cultural Research, 1993.
Annexure - E ISLAMIC STUDIES (Compulsory)
This course is aimed at: 1 To provide Basic information about Islamic Studies 2 To enhance understanding of the students regarding Islamic Civilization 3 To improve Students skill to perform prayers and other worships 4 To enhance the skill of the students for understanding of issues related to faith and religious life. 2 (2-0)
Introduction to Quranic Studies 1) Basic Concepts of Quran 2) History of Quran 3) Uloom-ul -Quran Study of Selected Text of Holly Quran 1) Verses of Surah Al-Baqra Related to Faith(Verse No-284-286) 2) Verses of Surah Al-Hujrat Related to Adab Al-Nabi (Verse No-1-18) 3) Verses of Surah Al-Mumanoon Related to Characteristics of faithful (Verse No-1-11) 4) Verses of Surah al-Furqan Related to Social Ethics (Verse No.63-77) 5) Verses of Surah Al-Inam Related to Ihkam(Verse No-152-154) Study of Selected Text of Holly Quran 1) Verses of Surah Al-Ihzab Related to Adab al-Nabi (Verse No.6,21,40,56,57,58.) 2) Verses of Surah Al-Hashar (18,19,20) Related to thinking, Day of Judgment 3) Verses of Surah Al-Saf Related to Tafakar,Tadabar (Verse No-1,14) Seerat of Holy Prophet (S.A.W) I 1) Life of Muhammad Bin Abdullah ( Before Prophet Hood) 2) Life of Holy Prophet (S.A.W) in Makkah 3) Important Lessons Derived from the life of Holy Prophet in Makkah Seerat of Holy Prophet (S.A.W) II 1) Life of Holy Prophet (S.A.W) in Madina 2) Important Events of Life Holy Prophet in Madina 3) Important Lessons Derived from the life of Holy Prophet in Madina Introduction To Sunnah 1) Basic Concepts of Hadith 2) History of Hadith 3) Kinds of Hadith 4) Uloom –ul-Hadith 5) Sunnah & Hadith 6) Legal Position of Sunnah 148
―Principles of Islamic Jurisprudence‖ Islamic Research Institute. ―Emergence of Islam‖ . Islamabad (1993) 149 . ‗Introduction to Islam Mulana Muhammad Yousaf Islahi. in Islam Islamic History 1) Period of Khlaft-E-Rashida 2) Period of Ummayyads 3) Period of Abbasids Social System of Islam 1) Basic Concepts of Social System of Islam 2) Elements of Family 3) Ethical Values of Islam Reference Books: 1) 2) 3) 4) 5) 6) Hameed ullah Muhammad. ―An Introduction to the Study of Islamic Law‖ leaf Publication Islamabad.‖ Hussain Hamid Hassan. ―Muslim Conduct of State‖ Hameed ullah Muhammad. Islamabad Hameed ullah Muhammad. International Islamic University.Selected Study from Text of Hadith Introduction To Islamic Law & Jurisprudence 1) Basic Concepts of Islamic Law & Jurisprudence 2) History & Importance of Islamic Law & Jurisprudence 3) Sources of Islamic Law & Jurisprudence 4) Nature of Differences in Islamic Law 5) Islam and Sectarianism Islamic Culture & Civilization 1) Basic Concepts of Islamic Culture & Civilization 2) Historical Development of Islamic Culture & Civilization 3) Characteristics of Islamic Culture & Civilization 4) Islamic Culture & Civilization and Contemporary Issues Islam & Science 1) Basic Concepts of Islam & Science 2) Contributions of Muslims in the Development of Science 3) Quranic & Science Islamic Economic System 1) Basic Concepts of Islamic Economic System 2) Means of Distribution of wealth in Islamic Economics 3) Islamic Concept of Riba 4) Islamic Ways of Trade & Commerce Political System of Islam 1) Basic Concepts of Islamic Political System 2) Islamic Concept of Sovereignty 3) Basic Institutions of Govt. Ahmad Hasan. IRI. Pakistan.
―Introduction to Al Sharia Al Islamia‖ Allama Iqbal Open University. ―Muslim Jrisprudence and the Quranic Law of Crimes‖ Islamic Book Service (1982) H. ―Studies in Islamic Law.7) 8) 9) Mir Waliullah. Islamabad (2001) 150 .S. Bhatia. Religion and Society‖ Deep & Deep Publications New Delhi (1989) Dr. Muhammad Zia-ul-Haq.