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