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