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