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