UNIVERSITY OF THE PUNJAB NOTIFICATION 1 is hereby notified that the Vice-Chancellor has. under section 15 (3) of the University of the Punjab Act. 1973. in anticipation of the approval of the other relevant bodies. approved the recommendations, of the Board of Studies in Information Technology & Computer Science regarding renaming of B.Sc (Hons.) in Computer Science as BS (Computer Science), and the new curriculum: for the four years BS (Computer Science) Degree Programme under Annual System for Alfiliated Colleges to be implemented from the session 2006. The new curriculum is attached vide Annexure “A” Le Admin, Block Prof. Dr. Muhammad Naeem Khan Azam Campus, Registrar No. 1/2106/Acad. Dated: 10 Copy ofthe above is forwarded to the following for inform: necessary action: - 1. Dean. Faculty of Sciences 2. Principal. PUCTT 3. Members of the Board of Studies in Information Technology & Computer Science Director, Undergraduate Programme The Principals. Atfiliated Colleges 6. Controller of Examinations Deputy Controller (L:xaminations) . Deputy Registrar (AN 9. A.O. (Statutes) 10, A.O. (Seereey) 1 A.O, (Information Cell) 12. Secretary to the Vice-Chancellor Sceretary to the Registrar 4o t Requirements for B.S. Degre Course Contents ‘Summary of Computer Seience Degree Requirements Category Computing Core Courses ‘Computer Science ~ Core Courses Computer Science - Technical Electives Mathematics Natural Sciences Humanities and Social Sciences Total Credit Hours (a) General Education Requirements (51 credit hours) Mathematics MA 101 (Caleulus 1) MA 102 (Cateulus 11) MA 210 (Linear Algebra) MA 250 (Probability and Statistics) MA 310 (Numerical Analysis) ‘Natural Sciences: NS 101 (Mechanics and Wave Motion) [NS 103 (Electricity and Magnetism) Humanities and Social Sciences English EN 101 (Writing Workshop) EN 201 (Communication Stills) EN 205 (Business and Technical Writing) Humanities HM 150 (Islamic Studies 1) HM 250 (Istamic Studies 11) HM 260 (Arabic Language) Two electives* a) SS 171 (Pakistan Studies) ‘Two electives** Annexure-A Computer Science Credit Hours 7 24 Credit Hours 15 + The following courses are potential electives in the Humanities area: Introduction to Islamic History, Introduction to Psychology, Introduction to Philosophy, Comparative Religions, English Literature, Urdu Literature, Chinese/French /German/Japanese Languaze® ‘** The following courses are potential electives in the Social Sciences area: Introduction to Economics, Introduction to Social Sciences, Introduction to Political Science, Introduction to Management, Introduction to Sociology. History of Civilization (b) Core Courses in Computing (37 credit hours) Programming Fundamentals Discrete Mathematics Data Structures and Algorithms Digital Logie Design Digital Logie Design Lab ‘Computer Organization and Assembly Language ‘Computer Organization and Assembly Language Lab Object Oriented Programming Operating Systems Computer Networks Computer Networks Lab Database Systems Sofiware Engineering, ‘Object Oriented Analysis and Design CMP 141 CMP 200 CMP 210 CMP 120 CMP 121 CMP 225 CMP 226 CMP 241 CMP 325 CMP 330 CMP 331 CMP 370 CMP 390 CMP 391 (©) Core Courses in Computer Science (24 eredit hours) Introduction to Computing ‘Theory of Automata and Formal Languages Analysis of Algorithms Intemet Programming Artificial Intelligence Systems Programming Capstone Project I Capstone Project Il 8 101 cs 201 cs310 cs 342 cs 360 cs 421 cs 491 cs 492 (a) Elective Courses in Computer Science (18 credit hours) The following is a list of sample elective courses Compiler Construction Programming Languages Computer Graphics Human Computer Interaction Advance Database Data Warehousing cs 400 cs 445 cs 450 cs 460 8371 8372 Credit Hours Credit Hours 3 3 3 3 3 3Data Mining Project Management Design Patterns Geographical Information System Internetworking with UNIX TCPAP Wireless Communications and Systems CS XXX Network Security 8432jx # BD Punjab University College of Information recanotog 2) a ABp) University of the Punjab, Allama Iqbat (Old) Campus, Lahore 54000. iy a ‘The Conwoller of Examinations ty ‘University of the Punjab Lahore Subject: SYLLABUS FOR BS COMPUTER SCIENCE Reference: Your letter No.574-SQP dated 06.03.2008 Copy of the syllabus for BS Computer Science 1%, 2%, 3%, and 4" year is forwarded for information and office record please. 4 we bane Dr. SyedStansoor Sarwar Principal Q Tepes Enel: Annex A’ (pages 20) OG Principals Affiliated CollegesPunjab University College of Information Technology University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000. pooenns |) ‘SYLLABUS - BS COMPUTER SCIENCE il FIRST YEAR Sy length, Unit tangent, normal, and Binomial vectors, Curvature, Functions of two or more variables, Partial derivatives, The Chain rule, Directional derivatives and Gradients, Tangent planes and normal vectors, Maxima and minima of functions of two variables, Lagrange multipliers, Double integral , Parametric surfaces, Surface area, Triple integral, Line integrals, Green's Theorem, Surface integrals; application of surface integrals, Divergence Theorem, Stoke’s Theorem. Prerequisites MA 101 = Calculus I Text Book ‘Anton, Bivens and Davis, Calculus, 7th Edition, John Wiley and sons, 2002.1SBN: 9971- 51-431-1 Reference Books + Thomas and Finney, Calculus with Analytic Geometry, Addison Wesley, 9" Ed, 1999. ISBN: 0201163209 CMP 140 Programming Fundamentals (Paper ILI - 100 Marks) Objective Computer programming is an art of developing computational solutions to precisely describable problems. The purpose of this course is to introduce students with basic concepts of structured programming. After completing this course, they should be able to wwrite elegant structured programs to solve different computational problems, Programs are demonstrated using the C++ programming language. However, the concepts are taught ina language-independent fashion. Note that the basic purpose of this course is to leam programming instead of a particular programming language. The following topies will be covered in this course: Introduction to Programming Languages and Compilers; Flowcharts, Pseudo-code; Data Storage; Introduction to C++, Classes, Objects, and UML; Control Statements; Functions and Recursion; Debugging; Command Line Arguments; Preprocessor; Arrays; Pointers and Pointer-Based Strings; File Processing; Structures and Unions; SelfReferential Classes. Prerequisites S100 /IT 100 - Introduetion to Computing Text Book . Deitel & Deitel, C++ - How to Program 3" Edition, Pearson — Prentice Hall (2005), ISBN: 0130384747 Reference Books © Walter Savitch, Problem Solving with C++: The Object of Programming, Addison- Wesley, ISBN-10: 0321268652 © Robert Lafore, Object-Oriented Programming in C ISBN-10: 0672323087Car /@\ Punjab University College of Information Technology (3) University of the Punjab, Allama Iqbal (Old) Campus, Lahore $4000. 4 (> ar CMP 120 — Digital Logie Design (Paper IV - 100 Marks) Objective The primary objective of the course is to develop in students a thorough understanding of digital logic design principles. The following topics will be covered in the course: Number Systems, Codes (Paralle/Serial), Logic Gates, Boolean Algebra, Boolean Algebra, Positive/Negative Logic, Boolean Algebra (Dual/De-Morgan), Algebraic simplification, Combinational Logic, Truth Tables, Min/Max terms, Combinational Logic, K-Maps, Don’t Cares, Multiple outputs, Combinational Logic, 5-6 K-Maps, Combinational Logic Design Practices, Negative numbers, Addition, multiplication, parity, decoders, Encoder, ‘Multiplexor /Demux, Hazards, Tristate, Latches & Flip Flops, Counters / Registers, Synchronous Counters, Sequential Logic Design Principles (Wakerly), Mealy / Moore Design—Sequential Circuits—(Wakerly), ROMS, SRAMS, DRAMS, Memory Organization, ADC / DAC Interf Analog World, Digital Electronics, Characteristics, Parameters, Digital Electronics, Logic Families, TTL, CMOS, BiCMOS, ECL, Low- Voltage Logic, Open/Tristate Wired Logic, Bus Tnterface Logic, Mixing CMOS/TTL Prerequisites None Text Book Tocci & Widmer, Digital Systems, Principles and Applications, 8 Edition, Pul Pearson Education ished by Reference Books John F. Wakerly, Digital Design, Principles & Practices, 3 Edition Updated, Published by Prentice Hall NSI01 - Mechanics and Wave Motion (Paper V ~ 50 Marks) Objectives To teach students calculus based general physics by way of learning about the following topics in depth: Measurement and vectors, Motion in one, two and three dimensions, Newton's laws of motions, Work and energy principles, Laws of conservation of momentum and energy, One- and two-dimensional collisions, Rotational kinematics and dynamics, Conservation of angular momentum, Gravitation, Oscillations and waves. Prerequisites None Textbook Resnick, Halliday and Krane, Physics, vol. 1. ISBN: 978-0-471-32057-9 Reference Material 603365 = University Physics, vol. 1, by Sears and ZemanskyLe B® Punjab University College of Information Technology @ University of the Punjab, Allama Iqbal (Old) Campus, Lahore $4000. NS103 - Electricity and Magnetism (Paper V- 50 Marks) Objectives The primary objective of the course is to teach student caleulus based general physics, particularly basic concepts of thermodynamics, electricity, and magnetism. The following topics will be covered in the course: Temperature, Thermal expansion, Kinetic theory and the ideal gas, Heat and First law of thermodynamics, Entropy and Second law of thermodynamics, Review of Vectors, Electric Charge and Coulomb's law, Electric field, Gauss's law, Electric potential, Capacitors and dielectrics, Current and resistance, Ohm’s Law, Simple resistive circuits (series and parallel), Magnetic field, Ampere’s law, Faraday’s law of induction, Lien’s Laws, Ampere’s Law and its applications. Prerequisites Mechanics and Wave Motion Text Book Halliday, Resnick, and Walker, Fundamentals of Physics Extended, Sixth Edition, ISBN 978-0-471-32000-5 Reference Books Sears and Zemansky, University Physics, vol. 1 and 2. ISBN-10: 0201603365(BS Punjab University College of Information Technology My ! University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000, Se SECOND YEAR 5 CMP200 - Discrete Mathematics (Paper VI- 100 Marks) Objectives This course introduces the foundations of discrete mathematics as they apply to Computer Science, focusing on providing a solid theoretical foundation for further work. It aims to develop understanding and appreciation of the finite nature inherent in most Computer Science problems and structures through study of combinatorial reasoning, abstract algebra, iterative provedures, predicate calculus, tree and graph structures. The following topics will be covered in the-course: Introduction to logic and proofs, Direct proofs, proof by contradiction, Sets, Combinatorics, Sequences, Formal logic, Prepositional and predicate calculus, Methods of Proof, Mathematical Induction and Recursion, loop invariants, Relations and functions, Pigeon whole principle, Trees and Graphs, Elementary number theory, Optimization and matching, Fundamental structures, Functions (Subjections, injections, inverses, composition), relations (reflexivity, symmetry, transitivity, equivalence relations), sets (Venn diagrams, complements, Cartesian products, power sets), pigeonhole principle; cardinality and countability. Prerequisites None Text Book Rosen, Discrete Mathem 0072424346 and Its Applications, Sth edition, McGraw-Hill, ISBN: Reference Material + Richard Johnsonbaugh, Discrete Mathematics, Prentice Hall, ISBN: 0135182425 * Kolman, Busby & Ross, Discrete Mathematical Structures, 4th Edition, 2000, Prentice-Hall, ISBN: 0130831433 CMP240 - Object Oriented Programming (Paper VII - $0 Marks) Objectives The course aims to focus on object-oriented concepts, analysis and software development. The following topics will be covered in the course: Evolution of OO, OO concepts and principles, problem solving in OO paradigm, OO program design process, classes, methods, objects and encapsulation, constructors and destructors, operator and function overloading, virtual functions, derived classes, inheritance and polymorphism, /O and file processing, exception handling. Prerequisites Introduction to Computing, Programming Fundamentals Text Book Budd, Understanding Object Oriented Programming, Addison WesleyPunjab University College of Information Technology LT University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000. a @ Reference Material + Deitel_and Deitel, Java: How to Programme, S/e, Prentice Hall, ISBN: 0131016210/0131202367 International Edition. * Deitel and Deitel, C++: How to Programme, 4/e, Pearson. * Bruce Eckel, Thinking in C++, 2nd Edition, Prentice Hall, CMP210 - Data Structures and Algorithms (Paper VII -50 Marks) Objectives This course is designed to teach students structures and schemes, which allow them to write programs to efficiently manipulate, store, and retrieve data. “An apprentice carpenter may want only hammer and saw, but a master craftsman employs many precision tools”. Computer programming likewise requires sophisticated tools to cope with complexity of real applications and only practice with these tools will build skill in their use. This subject deals to make students convenient in building a memory and time efficient data structures for the implementation of large-scale (data intensive) computer systems. The following topics will be covered in the course: Introduction to Data Structures and Algorithms Review of Object Oriented Programming Concepts, Algorithm Specification, Big Oh notation, Introduction to ADTs, Sparse Matrices, Stack, Recursion, Queue, Circular and Double Ended Queue, Self-Referencing Classes and Dynamic Memory Allocation, Singly Linked Lists, Doubly Linked Lists, Binary Search Tree, Introduction to Balanced and AVL, Trees, Heaps, Searching, Hashing, Overflow Handling, Dynamic Hashing, Sorting types and Techniques (Selection, Bubble, Insertion, Shell, Radix, Merge, Quick, Heap, and Tree sorts), Graphs, Adjacency List and Adjaceney Matrix, Breadth First Search and Depth First Search, Spanning Trees (BFSST, DFSST), Standard Template Library Prerequisites Object Oriented Programming Discrete Mathematics Text Book Tenenbaum, M. Augenstein, and Y, Lang Sam, “Data Structures using C and C++" 2nd Ed., Prentice Hall, 1999, ISBN-10: 0130369977 Reference Material * Frank M. Carrano, Paul Helman, Robert Veroff, Data Abstraction and Problem Solving with C++, 2nd edition, Addison-Wesley, 1998. ISBN-10: 0201874024 + Lafore, Data Structures and Algoritims, SAMS teach yourself, Sams Publishing, 1999, ISBN 9780672324536. + Horowitz, Sahni, and Mehta, Fundamentals of Data Structures in C++, Computer Science Press, 1995, ISBN-10: 0929306376 * Standish, Data Structures in JAVA, Addison W ‘esley, 2000, ISBN-10: 020130564X © Robert L. Kruse, Data Structure and_ Program Design, SBN-10: 0137689950\, Punjab University College of Information Technology ) University of the Punjab, Allama Iqbal (Old) Campus, Lahore 4000. mS EN201 - Communication Skills (Paper VIII — 50 Marks) Objectives / ‘The aim of this course is to develop good English writing, language usage and reading ‘skills, to appreciate the importance of business communication and to develop understanding of communication concepts, principles, theories and problems. It will also help in developing good oral communication and presentation skills. The following topics will be covered in the course: Principles of writing good English, understanding the composition process, Comprehension and expression, Use of grammar and punctuation, Process of writing, observing, audience collecting, composing, drafting and revising, persuasive writing, reading skills, listening skills end comprehension, skills for taking notes, Business communications, planning messages, writing concise but with impact, Letter formats, mechanics of business, letter writing, letters, memo and applications, summaries, proposals, writing resumes, styles and formats, oral communications, verbal and nonverbal communication, conducting meetings, small group communication, taking minutes, Presentation skills, Presentation strategies, material gathering, material organization strategies, time management, opening and concluding, use of audio-visual aids, delivery and presentation. Prerequisites None Text Book ‘Vawdrey, Stoddard, Bell, Practical Business English, ISBN-10: 0256102740 Reference Material ©) Herta A. Murphy, Effective Business Communication, ISBN-10: 007044398X EN205 - Business and Technical Writing (Paper VII ~ 50 Marks) Objectives The objective of this course is to upgrade students’ ability to write effectively in the world of science, technology and business, to produce experts and specialists in the business and technical writing, to enhance students’ skills for the effective delivery of technical information to audience (listeners or viewers). It will help the students to generate thorough understanding of common types of reports, special format items and other technical features of business documents, to develop verbal and non verbal communication skills for an effective display of personality. The following topics will be covered in the course: Business communication overview, Communication and organizational effectiveness, Process of creating effective messages, five planning steps and organizational plans, Different Forms of Written communication including Persuasive messages, Good News and Neutral messages, Bad News, Memorandum writing, Letter writing, Informative and positive messages, Academic, research and business proposals writing, Formal Report Writing, Business Research Methods, Documentation and Research Citation, Oral presentation, Strategies for an effective Audience Analysis, Non-Punjab University College of Information Technology University of the Punjab, Allama Iqbal (Old) Campus, Lahore $4000. ion, Employment communication, Cross-cultural communication, Business Communication and the Ethical Contexts. Prerequisites: ‘None ‘Text Book Greenfield, T., Research Methods, Guidance for Postgraduates, Amold, 1996, ISBD 0340806567 Reference Material: Handouts provided by the instructor S211 - Theory of Automata and Formal Languages (Paper IX - 100 Marks) 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. Theory of formal languages and use of various abstract machines ag ‘recognizers’ and parsing will be studied for identifying/validating the synthetic characteristics of programming languages. Some of the abstract machines shall also study as ‘Transducers’. The following topics will be covered in the course: Formal language, Defining Language, Regular Expression, Finite Automata, Transition Graphs, Kleene’s Theorem, Finite Automata with output, Regular Languages, Non regular Languages, Decidability, Demonstration Of JFLAP, Context Free Grammars, Grammatical Format, Pi ywn Automata (PDA), CFG=PDA, Non-Context-Free Languages, Context-Free Languages, Decidability, Turing Machine, The Chomsky Hierarchy Prerequisites Discrete Structures Text Book Denial Cohen, Introduction to Computer Theory, John Wiley & Sons, Inc. ISBN-10) 0471137723 Reference Material © J Hoperaft, D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wisely, 2™ Edition, ISBN-10: 0201441241 + Thomas A. Sudkamp, Languages and Machines, An Intro to the Theory of Comp. Sc. 2le Addison Wesley. ISBN-10: 0201821362 CMP223 - Computer Organization and Assembly Language (Paper X ~ 100 Marks) Objectives The main objective of this course is to introduce the organization of computer systems and usage of assembly language for optimization and control. Emphasis should be given to expose the low-level loge employed for problem solving while using assembly language asa tool. The students will be capable to acquire knowledge that is specific to Intel 80x 86 8I fo ex + (3 Punjab University College of Information Technology -—_ ey University of the Punjab, Allama Iqbal (Old) Campus, Lahore £4000. fx ee WY Processor families, as well as knowledge that is universal. They will leam the Programming methodologies showing how to use Assembly Language for Application Software's, System Programming and Terminate and Stay Resident. They ‘wil develop / Programs based on the interaction between Assembly Language and Operating System, Security Software's, encryption and decryption programs, programs for Reverse Reknecting, programs for small scale Embedded Systems and Games. specially Networking Games using serial and parallel ports. Following topics will be covered in this gourse: Processor Architecture and Organization, Memory Architecture, Intel 8086 Registers, Addressing Modes, Memory Adiressing, MOV The Basie. Instruction, Peougeer, Mathematical and Bit wise Logical instruction, Stack Instructions, Interrupts, Memory Models, Practice of Program Writing and Debugging, Control Transfer snd Conditional Action Instructions, Procedures, Macros, Shift and Rotate Instructions, Procedures to Input and Display Binary, Decimal, Hexadecimal Numbers, Reading DOS Gommand Tail, Data Communication, File Handling, Recursion, High-Level Logic Structures, Interfacing of Assembly and C+ , Languages, Storage of Real Numbers, Math so-processor, String instructions, Introduction to Machine Code, Protected Mode, ‘Terminate and Stay Resident Programs, Micro Controller Programming (8051) Prerequisites Digital Logic Design Text Book Bary B. Brey, The Intel Microprocessors 8086/8088, 80186/801S8, 80286, 80386, 80486, Pentium and Pentium Pro Processor, ISBN-10: 0139954082 Kip R, Irvine, Assembly Language for ine! Based Computers, Thisd Edition, 1999, -Hall Publishing, 1999, ISBN-10: 0132383101 Pret Reference Material * Assembly Language Reference by Que. Corporation, * T Scott Mackenzie, 8051 Micro-controller Programming, 3 Edition, ISBN-10: 0137800088 MA210 - Linear Algebra (Paper XI- 50 Marks) Objective The purpose of this course is to provide a solid foundation in Linear Algebra. It will enable the students to master the concepts and to know when and how to apply linear algebra, Applications are taken from such areas as Cryptography, Fractals, Chaos, Computer Graphics, Game of Stategy, Computer Tomography, Warps and Morphs. The Software MATLAB will be used for the implementation of Linear Algebra. The following topics will be covered in this course: Introduction to Linear Algebra (History, differentiation between Matrix Algebra and Linear Algebra), Concept of a matrix with real entries, Operations of matrices (Addition, multiplication, scalar multiplication, trace, transpose), Determinant of a matrix and its properties. Singular and non-singular matrices Row/Column elementary Operations defined on a matrix Inversion of a matrix (by clementary operations), Reduction of matrix into echelon and reduced echelon form byf Punjab University College of Information Technology ~~ @) University of the Punjab, Allama ‘Iqbal (Old) Campus, Lahore $4000. a) Se /e glementary operations. Rank of a matrix, Introduction to system of linear equations Solution of system of linear equations by Gauss elimination method, Concept of algebraic Structures (Semi group, Group, abelian group), Sub groups, Cosets, Mappings, Ring and Field, Introduction to vector spaces, Linear combination, linear span, Linear dependence Gi independence of vectors, Concept of basis and dimension, Linear transformations, Kemel and Range, Matrix representations of a linear transformation, Matis fansformations (dilation, contraction, reflection, compressions and expansion), Affine Transformations (Shearing, Scaling, Rotation, and Translations), Concepts of Eigen value and eigenvector, Characteristic equation, Eigenvalues of an upper & lower triangular matrix, Diagonalization of matrices, Matrix Functions, Concepts of Norm and inner product space. Prerequisites Calculus — II Text Book Anton ~ Rorres “Elementary Linear Algebra, application version”. 8th Edition, Jokn Wiley & Sons, Inc. 2000, ISBN: 978-0-471-44902-7 Reference Material * David C Lay, Linear Algebra, Pearson Addison Wesley, 1999, ISBN; 0201660369 MA250 - Probability and Statistics (Paper XI- 50 Marks) Objectives {iis course is aimed to introduce the conespt of statistics, randomness and probability and build on these concepts to develop tools and techniques to work with random varisbles. The following topics will be covered in this course: Introduction to Statistics, Descriptive Statistics, Statistics in decision making, Graphical representation of Data Stem-and Lead Plot, Box- Cox plots, Histograms and Ogive, measures of central tendencies, dispersion for srouped and ungrouped Data, Moments of frequency distribution; examples with real lie, use of Elementary statistieal packages for explanatory Data analysis. Counting techniques definition of probability with classical and relative frequency, subjective approaches, sample space, events, laws of Probability. General Probability Distributions, Conditional probability, Bayes theorem with application to Random variable (Discrete and continuous) Binomial, Poisson, Geometric, Negative Binomial Distributions, Exponential Gamma and Normal distributions, Regression and Correlation. Prerequisites None Text Book Walpole, Introduction to Statistics, Prentice Hall, 1982, ISBN: 0024241504. 10/ZX, Punjab University College of Information Technology et Ss) University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000. . oy Reference Mater © G. Cowan G, Statistical Data Analysis, Clarendon, Oxford, 1998, ISBN13. 9780198501558 = Mariano R, Advances in Statistical Analysis and Statistical Computing II, JAI Press, Greenwich, Conn, 1993 ul< 2 Punjab University College of Information Technology (Q)) University of the Punjab, Allama Iqbal (Old) Campus, Lahore $4000 Ad @ THIRD YEAR CMP 320 Operating Systems (Paper XII - 100 Marks) Objectives The objective of this course is to give students knowledge of construction and working of Operating systems, to enable them to understand management and sharing of computer resources, communication and concurrency and develop effective and efficient applications and also to appreciate the problems and issues regarding multi-user, multitasking, end distributed systems. The following topics will be covered in the course: Introduction to Main Frames Sysiem, multi programmed System, batch system, Time sharing system, Desktop System, Multiprocessor system, distributed system, client server, Real time system, Hand held System, Computer System Structure, Caching, Coherency and consistency, Operating System Structure, Process management, System calls, Process control, Communication, micro-kemels, Virtual machines, Processes, Threads, multithreading models, CPU Scheduling, Process Synchronization, Critical section problem, Semaphores, Deadlock, Memory Management, Memory allocation, Fragmentation, Paging, Segmentation, Virtual Memory, Demand paging, Page replacement, Allocation of frames, Thrashing, File System Interface, Directory structure, File system mounting, File System Implementation, NFS, Protection. Prerequisites Data Structures and Algorithms Text Book Silberschatz A., Peterson, J.L., and Galvin P.C., Applied Operating Systems Concepts, 6th Edition, 1998. ISBN-10: 0471365084 Reference Material * Tanenmaum A.S., Modern Operating Systems, 2nd Edition, 2001. ISBN-10: 0130313580 + Silberschatz, Galvin, Gagne, Operating Systems Concepts, John Wiley, ISBN-10: 0471694665 CMP290 - Software Engineering (Paper XIII - 100 Marks) Objectives The aim of this is course is to study various software development models and phases of software development life cycle. The concepts of project management, change control, process management, software development and testing are introduced through hands-on Team Projects. The following topics will be covered in the course: The Scope of Software Engineering, Software Process, Software Development Life Cycle, Project Management Concepts, (Planning, Costing, Risk Analysis, Quality Assurance, Risk Management, 4Ps of Project Management), Software Measurement concepts, Product metrics (LOC based and EP based metrics), Software Quality Metrics, Software Project Planning, Software Cost Estimation techniques, COCOMO model, Project Scheduling, (GANTT chart, Critical Path/ /- & Punjab University College of Information Technology i) University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000. eS Method), Requirements Engineering, Use Case Techniques, Entity Relationship Diagram, State Transition Diagram, Data Flow Diagrams, Software Designing, Abstraction, refinement, modularity, software architecture, Cohesion & Coupling, Architectural Design, Data Design, Mapping ER to Data Model, Interface Design, Human Computer Interface, Modular Design, Mapping Design to Code, Software Testing, White Box Testing & Black Box Testing, Test Case Design using Cyclometic Complexity Technique, Debugging practices, Software Inspection, Software Quality Assurance, Software Quality Standards, Prerequisites Databases Text Book Roger Pressman, Software Engineering: A Practioner’s Approach, McGraw-Hill, 2005. ISBN 9780073019338 Reference Material * lan Sommerville, Software Engineering, 6th Edition ISBN-10: 020139815X CMP370 - Database Systems (Paper XIV ~ 100 Marks) Objectives ‘The course aims to introduce basic database concepts, different data models, data storage and retrieval techniques and database design techniques. The course primarily focuses on relational data model and DBMS concepts. The following topics will be covered in the course: Traditional File Based Systems, Roles in Database Environment, ANSI-SPARC Architecture, Data Manipulation Language (DML), Data Models, Multi-User DBMS Architectures, Relational Data Structures, Database Schemas, Relational Integrity, Introduction to SQL, Data Manipulation, Creating a Database, Tables, Index, Views, Transactions, Database Application Life Cycle, Database Planning, Database Design, Data Administration & Database Administration, Entity Types, Relationship Types, Structural Constrains, Problems with ER Models, Specialization/Generalization For EERD, Anomalies, Functional Dependency, Process of Normalization, Database Design Methodology, Database Security, Client Server Architecture, Centralized and Distributed Databases, Advance Topics. Prerequisites Data Structures and Algorithms Text Book CJ.Date, Darab 0321197844 se Systems, Addison Wesley Publications Co., 2004, ISBN-L0: Reference Material * R.Connolly and P.Begg, Database Systems: A Practical Approach to Design, Implementation and Management, Addison-Wesley Publications Company, 2003. 3N-10: 0201342871 ®FZ. Punjab University College of Information Technology “ 4 Se) University of the Punjab, Allama Iqbal (Old) Campus, Lahore 54000. Sy +. Elmasri and Navathe, Fundamentals of Database Systems, 3/E, Addison-Wesley, ISBN: 0201741539 CS310 - Analysis of Algorithms (Paper XV - 100 Marks) Objectives: The objective of this course involves a detailed study of the basic notions of the design of algorithms and the underlying data structures. Several measures of complexity are introduced. Emphasis will be given on the structure, complexity, and efficiency of algorithms. The following topics will be covered in the course: Introduction; Asymptotic notations, Recursion and recurrence relations, Divide-and-conquer approach, Sorting, Search tees, Heaps, Hashing, Greedy approach, Dynamic programming, Graph algorithms, Shortest paths, Network flow, Disjoint Sets, Polynomial and matrix calculations, String matching, NP complete problems, Approximation algorithms. Prerequisites Discrete Structures, Data Structures Text Book T. H, Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, McGraw-Hill, New York, NY, 1990, ISBN-10: 0262531968 Reference Material None f ‘MA105-Numerical Analysis (Paper XVI ~ 100 Marks) This course is concerned with the design and analysis (Stability, Consistency, Convergence, Accuracy) of methods for solving mathematical problems that arise in many fields, especially science and engineering. Scientific Computing is now mentioned as a third branch, having a status that is essentially equal to, perhaps even eclipsing, that of its two older (theoretical and experimental) siblings. This is due to efficient numerical techniques (which you shall lean during the course). We can thus simulate any physical process numerically, and this leads to the routine solution of complicated problems that would have seemed impossible not so long ago. This course will be taught using JAVA / MATLAB/MAPLE. Review (Paper XV - 100 Marks) of Calculus (Rolle’s Theorem, Mean Value Theorem, Taylor's & Maclaurin’s series), Computer arithmetic, Error & its measurements (absolute error, relative error, percentage error), types of error, sources of error. Solution of Equations In One Variable: The Bisection Method, Fixed-Point Iteration, Newton-Raphson Method, Secant Method, Method Of False Position, Error Analysis for Iterative Methods Interpolation and Polynomial Approximation: Interpolation and Language Polynomial, rence:(Newton forward divided difference formula & backward divided - ‘ormula), Cubic Splines Interpolation, Hermite Interpolation, Natural cubic splines, Cubic B-splines, Parabolic and Cubic Runout Splines, Bet: Splines, Bezier Cures and Surfaces. Numerical Differentiation and Integration: (Forward-difference &backward- 14