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