B.Sc.

(H) Computer Science 3-YEAR FULL TIME PROGRAMME

RULES, REGULATIONS AND COURSES CONTENTS

DEPARTMENT OF COMPUTER SCIENCE FACULTY OF MATHEMATICAL SCIENCES UNIVERSITY OF DELHI DELHI – 110007

March Semester Systems at the undergraduate level 8, 2011 Course of Study: B.Sc.(H) Computer Science
Semester – I
CSHT-101 Programming Fundamentals CSHT-102 Discrete Structures ELHT 301 Digital Electronics MAPT 101 Calculus and Matrices CSHT-203 Data Structures

Semester – II
CSHT-204 Computer Systems Architecture ENPT 201 Technical Writing and Communicatio n in English MAPT 202 Calculus and Geometry

Semeser – III
CSHT-305 Design and Analysis of Algorithms CSHT-306 Systems Programming CSHT-307 Database Systems STC 301 Basic Statistics and Probability

Semester – IV
CSHT-408 Operating Systems CSHT-409 Data Communication and Computer Networks CSHT-410 Software Engineering MAPT 404 Differential Equations

Semester – V

Semeser – VI

CSHT-511 Theory of Computations

CSHT-512 Microprocessors

CSHT-513 Internet Technologies

Operational Research I/ MAPT 505 Real Analysis

CSHT-614 Computer Graphics

CSHT-615 Information Security

CSHT-616 Elective

STC 402 Statistical Methodology

Electives: 1. Software Testing 2. Artificial Intelligence 3. Network Programming and Administration 4. Data Mining 5. Combinatorial Optimizations

203 101.Proposed Structure and Syllabi for B.(H) Computer Science – July 2010 Semester I Coding Title L–T–P 5 – 0-0 5 – 0-0 Credits Total Marks 100 100 Pre-requisites CSHT-101 CSHT-102 ELHT . 203 .Sc.301 MAPT 101 CSHP-101 Programming Fundamentals Discrete Structures Digital Electronics Calculus and Matrices Software Lab based on 101 Lab based on Digital Electronics 5 5 - 0-0-8 0-0-4 4 2 100 50 Semester II Coding Title L–T–P 5 – 0-0 5 –0-0 Credits Total Marks 100 100 Pre-requisites CSHT-203 CSHT-204 ENPT 201 Data Structures Computer Systems Architecture Technical Writing and Communication in English Calculus and Geometry Software Lab based on 203 Lab based on 204 5 5 101 - MAPT 202 CSHP-202 CSHP-203 0-0-8 0-0-4 4 2 100 50 Semester III Coding Title L–T–P Credits Total Marks 100 100 Pre-requisites CSHT-305 CSHT-306 Design and Analysis of Algorithms Systems Programming 5-0-0 5 – 0 -0 5 5 101.

203 - 0-0-4 0-0-4 0-0-4 2 2 2 50 50 50 Semester V Coding Title L–T–P 5 – 0– 0 5–0-0 5–0-0 Credits Total Marks 100 100 100 Pre-requisites CSHT-511 CSHT-512 CSHT-513 ** / MAPT 505 CSHP-511 CSHP-512 Theory of Computations Microprocessors Internet Technologies Operational Research I/ Real Analysis Software Lab based on 512 Lab based on 513 5 5 5 301 204 409 0-0-4 0-0-4 2 2 50 50 . 203 CSHT-410 MAPT 404 CSHP-408 CSHP-409 CSHP-410 5 100 101.301 CSHP-304 CSHP-305 CSHP.307 Database Systems Basic Statistics and Probability Software Lab based on 305 Software Lab based on 306 Software Lab based on 307 Software Lab based on STC 301 5–0-0 5 100 101.CSHT-307 STC . 203 0-0-4 0-0-4 0-0-4 0-0-4 2 2 2 2 50 50 50 50 Semester IV Coding Title L–T–P 5 – 0-0 5 – 0-0 5 – 0-0 Credits Total Marks 100 100 Pre-requisites CSHT-408 CSHT-409 Operating Systems Data Communication and Computer Networks Software Engineering Differential Equations Software Lab based on 408 Software Lab based on 409 Software Lab based on 410 5 5 101.306 CSHP .

Sc. 1) Duration of Theory Exam: 3 hrs. 3) .(H) Electronics. 2) Infrastructure required: Networked lab with Internet facility on at least 20 nodes. Duration of Practical Exam: 6hrs.Sc.Sc. (Physical Sciences) and ELHT 301 to be taken from B. Batch size for practical exams: Every lab session should be supervised by a teacher and the batch size should be restricted to 20. STC 402 ―Statistical Methodology‖ and Operational Research I to be taken from B.Semester VI Coding Title L–T–P Credits Total Marks 100 100 100 0-0-4 0-0-4 0-0-4 0-0-4 2 2 2 2 50 50 50 50 Pre-requisites CSHT-614 CSHT-615 CSHT-616 STC . LCD projection systems should be provided in class room/lab. For a class of more than 20 students. additional groups should be formed for every 20 students. Syllabi of STC 301 ―Basic Statistics and Probability‖. Mathematical Sciences .402 CSHP-613 CSHP-614 CSHP-615 CSHP-616 Computer Graphics Information Security Elective Statistical Methodology Software Lab based on 614 Software Lab based on 615 Software Lab based on 616 Software Lab based on STC -402 5-0-0 5-0-0 5-0-0 5 5 5 Syllabi of MAPT 101. MAPT 404. MAPT 202. for 2 credit papers Internal Assessment as per University rules. MAPT 505 and ENPT 201 to be taken from B. for 4 credit papers 4hrs.

2004.Pigeonhole Principle. Dromey. How to solve it by Computer. Properties of Binary Relations. . Principle of Inclusion and Exclusion. Object Oriented Programming with C++ . Representation of integers. counting . loops. control structures in conditionals. Basic operations of a programming environment. A structured Approach using C++. basic I/O devices and storage devices. A First Book of C++ From Here to There. Cengage Learning. Pearson Education 1982 3. file handling. use of recursion for problems with inductive characterization. F. Balaguruswamy. uncountably Infinite Sets. 4th Edition. Computer Science. G.G. Introduction to the object-oriented programming paradigms. arithmetic and logical expressions. 5.finite and Infinite sets. assignment. E. command line arguments. Recommended Books: 1. methodology of developing an algorithmic solution from a mathematical specification of the problem. G. strings and arrays. data abstraction and encapsulation — objects and classes. Bronson. Closure. error handling. R. constants and variables. polymorphism. problem solving using top-down design and decomposition into sub-problems. Problem Solving Approaches: Notion of an algorithm. with applications in Computer Graphics Springer 2nd Edition 2001. Seed.CSHT-101 Programming Fundamentals Basic Computer Organization: Functional Units. 3rd Edition. Mathematical Induction. procedural abstractions. Forouzan and R. Programming Constructs basic data types. relations.J. An Introduction to Object-Oriented Programming in C++. stepwise methodology of developing an algorithm. functions. inheritance. characters (ASCII and Unicode). Permutation and Combination. Gilberg. Cengage Learning 2005. A. Tata McGraw Hill 1997 4. B. CSHT 102 Discrete Structures Introduction: Sets . 2. Partial Ordering Relations. real (fixed and floating point). input-output interface.

Inference Theory Recommended Books: 1. Tata McGraw Hill 2. Octal. Jones and Bartlett Publishers. M. L.H. O. Leiserson. and Computability.4:1). T. Encoder (8-line-to-3-line) and Decoder (3-line-to-8-line) . Coremen. Binary. 2nd Sub Edition 1985. Addition and Substraction.Growth of Functions: Asymptotic Notations. Trees. Linear Recurrence Relations with constant coefficients and their solution. Bounding Summations.L. J.4:1)) and Demultiplexers (1:2. P. Elements of Discrete mathematics. Models and Types. Hunter. AND. R. Prentice Hall on India (3rd edition 2009) 4. Combinational Logic Analysis and Design: Standard representation of logic functions (SOP and POS). D. C. Minimization Techniques(Karnaugh Map Method: 4. Hexadecimal. Liu & Mahopatra. Substitution Method. OR. multigraphs and weighted graphs. Multiplication Gray and Hamming Codes Logic Gates and Boolean Algebra: Truth Tables.5 variables). Multiplexers(2:1. C. Summation formulas and properties. Master Theorem Graph Theory: Basic Terminology.J. Introduction to algorithms. Adder (half and full) and their use as substractor. Tautologies. Discrete Mathematics and Its Applications. Euler and Hamiltonian Paths and Circuits. Introduction to Spanning Trees Prepositional Logic: Logical Connectives. EXOR. Graph Representaion. Discrete Mathematics with Algorithms 1988 Johnwiley Publication 5. 2008 ELHT 301 Digital Electronics Number System and Codes: Decimal. L. Recurrence Trees. Boolean Theorems. Rosen. Complements (1’s and 2’s). NOT. Jones and Bartlett Publishers. Basic Terminology and properties of Trees. generating functions. Sixth Edition 2006 3. Essentials of Discrete Mathematics. 2009 6. Equivalences. Hein. Graph Coloring. DeMorgan’s Theorems. Signed and Unsigned numbers. BCD. Hutchinson. approximation by Integrals Recurrences: Recurrence Relations. Universal (NOR and NAND) Gates. Rivest. Planar Graphs. Well-formed Formulas. Graph Isomorphism. Logic. 3rd Edition. Conversions. Discrete Structures. Connectivity. Albertson and J. Code Converters( Binary to BCD and vice versa).E. .

Recommended Books: 1. Complete Binary trees and almost complete Binary trees.Single and Multidimensional arrays. 8. Floyd. Queues (linear as well as circular implementation). singly-. 2. State Diagrams and Sequential Machines. 5. Publication John Wiley 2003 . PROM. Leach. R. Sparse matrices.H. and its removal. M. Tokheim. Digital Fundamentals. Digital Systems. tail recursion. Principles and Applications. 6. Bali.P. Digital Electronics. Tree traversal algorithms. S-R FF .Sequential logic design: Latch. Digital Principles and Applications. Sigma Series. R/2R Ladder DAC. ring. 3.L. Tata McGraw Hill. Arrays. Insertion. State Table. Multiway trees – B-Trees and introduction to B+ Trees. and circularly. Pearson Education Asia. Schaum’s Outline Series. Tokheim. Data Structures and Algorithms in C++. Searching techniques: Linear search. Tree Structures: Trees.J.P. Linear structures: Stacks. Principles and Applications. 9. 7.L. A. Skip Lists. 4. Tata McGraw-Hill. A/D and D/A Converters: Successive Approximation ADC. applications of trees. CSHT 203 Data Structures Introduction: Abstract Data Types. EPROM. T and D type FFs. A. Tata McGraw-Hill. Counters (ripple. Digital Design. Modern Digital Electronics. Threaded trees (recursive as well as Non recursive). EAROM. 3rd Edition. Tata McGraw-Hill. run time stack in recursion . S. modulus).linked lists -. Tocci and N. Registers. 2nd edition ** 1995 3. Data Structures and algorithm in C++. Pearson Education Asia. ROM. R. R. Mano.S. Malvino and D.Operations and applications. Solved Problems in Digital Electronics. Widner. Gothmann. Pearson Education Asia.M.L. Course Technology 2004. Prentice Hall of India. 2. RAM (Static and Dynamic). Flip flop. T. binary search trees. W. doubly-. Jain. Deletion. EEPROM. Data Structures using C and C++. Suggested Books: 1. Tata McGraw-Hill.P. Binary search and their efficiency. J-K FF. Binary Trees. Digital Principles. Clocked FFs. Tannenbaum. synchronous and asynchronous. Digital Electronics. Recursion: Problem solving using recursion. Memories: General Memory Operation. R. Drozdek. Hashing.

Greedy Algorithms. J. Searching Techniques. 2. Mano. Prentice Hall of India Third edition / Pearson Education 1992. Direct Memory Access. Dynamic Programming. Associative memory. input-output and interrupt. Medians & Order Statistics. 1998. CSHT 204 Computer System Architecture Basic Computer Organization and Design: Computer registers. instruction cycle. complexity analysis. Advanced Sorting techniques . Radix Sort and Count Sort. 2004. I/O Modules. RISC. Interrupt-Driven I/O. Sahni. Assembly language and computer architecture using C++ and JAVA. Sorting and Searching Techniques: Elementary sorting techniques – Bubble Sort. 3. Computer System Architecture. Data Structures. Programmed I/O. I/O Channels Recommended Books: 1. Correctness of Algorithm. CISC architectures. memory reference. Instruction formats. instruction set. pipelining and parallel architecture.Heap Sort. Stallings. . Computer Organization and Architecture Desiguing for Performance 8th Edition 2009. Sorting in Linear Time Bucket Sort. CSHT 305 Design and Analysis of Algorithms Introduction: Basic Design and Analysis techniques of Algorithms. input output programming. Divide and Conquer. Publication Silicon Press 2004 5. Preiss. Algorithm Design Techniques: Iterative techniques. arithmetic and logical micro-operations. assembly language. Memory Organization: Cache memory. machine language. addressing modes. Central Processing Unit: Register organization. B. Prentice Hall of India.4. timing and control. Course Technology. M. Merge Sort. instruction codes. Quick Sort. Dos Reis. A. Bus Interconnection design of basic computer. S. stack organization.R. Input-output Organization: Input / Output: External Devices. Insertion Sort. mapping. John Wiley and sons. micro programmed control. Algorithms and applications in C++. Data structures and algorithms with object oriented design patterns in C++. W. Interconnection Structures. bus system.

Dhamdhere Systems Programming and Operating Systems. 2004 2. Sarabasse & A. KMP Technique Recommended Books: 1. D. optimization.Lower Bounding Techniques: Decision Trees Balanced Trees . A. Load and Go assembler. Program Linking. Second Revised Edition 1996 3. 3rd Edition 1996. D. programming in assembly language. 4. Ronald L. Relocation. An Introduction to Systems Programming.Red-Black Trees Advanced Analysis Technique: Amortized analysis Graphs: Graph Algorithms – Breadth First Search. Macros and macro processors. PHI. One-pass and two pass assemblers. Loaders and Linkers: Basic Loader functions and features. System Software. String Processing: String Matching. Gelder Computer Algorithm – Introduction to Design and Analysis. Cormen. CSHT 307 Database Systems . Assemblers: Example of an assembly language. Minimum Spanning Trees. Chattopadhyay. Dos Reis. Rivest. phases of compilation. Beck.M. Clifford Stein Introduction to Algorithms. Ltd. Charles E. Tata McGraw-Hill Publishing Company. Systems Software.H. assembler features and functions. Compilers: Compiler functions and features. L. Course Technology. Depth First Search and its Applications. Leiserson. Recommended Books: 1. Manjula. Pearson.V. S. static and dynamic linking. Publisher – Pearson 3rd Edition 1999 CSHT 306 Systems Programming Introduction: Introduction to Systems Software and machine architecture. 3rd Edition 2009 2. PHI 2007. J. Assembly language and computer architecture using C++ and JAVA. T.

concurrent and processes. Korth.B. resource abstraction. non-pre-emptive and pre-emptive scheduling algorithms. file allocation methods.Introduction: Characteristics of database approach. Fundamentals of Database Systems 6th Edition. thread libraries. types of operating systems – multiprogramming systems. J. deadlocks. recovery. authentication. system calls and system programs. normal forms. device management. constraints. Memory Management: Physical and virtual address space. time sharing systems. process abstraction. process hierarchy. Database design: mapping ER model to relational database. A. semaphores. 2. R. McGraw Hill 2010. Process Scheduling. relational algebra. Navathe. operating systems for personal computers & workstations. relational constraints. Process Management: System view of the process and resources.F. Gehrke. segmentation. SQL queries. R. Books Recommended: 1. threading issues. Operating System Organization: processor and user modes. Silberschatz. paging. threads. Ramakrishanan. internal access authorization. methods for inter-process communication. process control & real time systems. Elmasri. H. batch systems . database system architecture and data independence. functional dependencies. memory allocation strategies -fixed and variable partitions. Relation data model: Relational model concepts. 3. . S. Transaction Processing: ACID properties. Entity Relationship(ER) Modeling: Entity types. Sudarshan. relationships. critical section. Web based databases: XML documents and databases. kernels. S. file operations. programming using embedded SQL. virtual memory File and I/O Management: Directory structure. CSHT 408 Operating Systems Introduction: Basic OS functions. data models. Database Management Systems 3rd Edition. Pearson Education 2010. Protection and Security: Policy mechanism. concurrency control. Database System Concepts 6th Edition. McGraw-Hill 2002.

overview of TCP/IP protocol suite. switches. connecting LAN and back-bone networks. multiplexing techniques.Recommended Books: 1. Nutt. network protocol. hubs. digital to digital line encoding schemes. M. packet switching. Internet control protocols. 2nd Edition Pearson Education 1997. TDM.error and flow control. 5.stop and wait ARQ. pulse code modulation.S. CSHT 409 Data Communication and Computer Networks Introduction to Computer Networks: Network definition. network topologies. Connection establishment and release. Multiple Access Protocol and Networks: CSMA/CD protocols. Pearson Education 2007. router and gateways. Tata McGraw Hill 1992. Data Link Layer Functions and Protocol: Error detection and error correction techniques.three way handshake.framing and flow control.FDM. Ethernet LANS. G. Milenkovic. Gagne. Prentice Hall of India. Modern Operating Systems. 3rd Edition. Operating Systems: A Modern Perspective. G.IP protocol.B. 4. layered network architecture. overview of WWW & HTTP protocol. network classifications. data-link control. transmission media. Stallings. network layer protocol of Internet. Operating Systems Concepts. digital subscriber line. 2. Internals & Design Principles 2008 5th Edition. connection-oriented virtual circuit switching. 3. digital to analog modulation-. overview of OSI reference model. Galvin.connectionless datagram switching. W. A. John Wiley Publications 2008. Transport Layer Functions and Protocols: Transport services. P. Networks Switching Techniques and Access mechanisms: Circuit switching.repeaters. data-rate limits.Concepts and design. error recovery protocols. Operating Systems. parallel and serial transmission. Tanenbaum. Data Communication Fundamentals and Techniques: Analog and digital signal. 8th Edition. Operating Systems. Networks Layer Functions and Protocols: routing. bridges. cable TV for data transfer. Recommended Books: . A Silberschatz. routing algorithms. dial-up modems. Overview of Application layer protocol: Overview of DNS protocol. Point to Point Protocol on Internet. goback-n ARQ.

Sommerville. CSHT 410 Software Engineering Introduction: The Evolving Role of Software. Test Strategies for Conventional Software. Aggarwal and Y. RMMM Plan.K. Ltd 2002. Data Design at the Architectural Level and Component Level. Quality Management: Quality Concepts. 2005. B. 6. 2008. Mall. Software Engineering: A Practitioner’s Approach (7th Edition). Architectural Design Elements. Design Engineering: Design Concepts. Testing Strategies & Tactics: Software Testing Fundamentals. Changing Nature of Software. System Testing. Requirement Analysis and Modeling Techniques. Software Reviews. Need for SRS. 2. S. Addison Wesle. Software Architecture. Flow Oriented Modeling. Process Models. A. Fourth edition. D. Jalote. Software Process Framework. Requirement Analysis: Software Requirement Analysis. 5. New Age International Publishers. Framework and Umbrella Activities. Software Engineering (8th edition). Forouzan: Data Communications and Networking. R. Project Scheduling. Capability Maturity Model Integration (CMMI). Recommended Books: 1. PHI Pvt. Bell. Software Engineering (revised 2nd Edition). Strategic Approach to Software Testing. R. 2003. Metrics for Process and Projects. 2004. Mapping of Data Flow into Software Architecture. Basis Path Testing. Fourth edition. 3. 2006. An Integrated Approach to Software Engineering (2nd Edition). THM Publishing Company Ltd 2007. Modeling Component Level Design. 2.1. Prentice-Hall of India. Addison-Wesley. Tanenbaum: Computer Networks. Fundamentals of Software Engineering (2nd Edition). K. McGrawHill. I. Narosa Publishing House. Risk Management: Software Risks.S. . Validation Testing. Software Engineering as a Layered Technology. Software Project Management: Estimation in Project Planning Process. 2009. A. Characteristics and Components of SRS. P. 4. Initiating Requirement Engineering Process. Risk Projection and Risk Refinement. Risk Identification. Software Engineering for Students (4th Edition). BlackBox Testing. Software Quality Assurance. White-Box Testing and their type. Singh. Software Characteristics. Pressman.

Regular languages and their relationship with finite automata. memory and I/O interfaces. Ullman.Cohen. Linz. Pumping lemma and closure properties of regular languages. DMA controller. Hoperoft. ambiguities in grammars and languages. . 3. Introduction to Automata theory. Kleene Star Finite Automata and Regular Languages: Regular Expressions. 4. Properties of context free languages. Deterministics and non-deterministic finite automata. halting problem. P. instruction formats.CSHT 511 Theory of Computation Languages: Alphabets. normal forms. I/O interface. keyboard. unsolvability problems. Interfacing: Memory address decoding. language. Microprocessor programming: Register Organization. Turing Macines and Models of Computations: RAM. video controllers. cache memory and cache controllers. Recursively enumerable and recursive languages. timer. Elements of the theory of computation – II Edition PHI 1997. Basic Operations on language. parse trees. Lewis & Papadimitriou. Recommended Books: 1. Turing Machine as a model of computation. communication interfaces. Pumping Lemma. An Introduction to Formal Language and Automata 4th edition Publication Jones Bartlett 2006 CSHT 512 Microprocessors Microprocessor architecture: Internal architecture. decidability. assembly language programming. Concatenation. NFA to DFA Conversion. Daniel I.A. Universal Turing Machine. Introduction to computer theory – John Wiley (1996 2nd Edition). Transition Graphs. 2. Pushdown automata (Deterministic and Non-deterministic). Pearson Education. interrupt controller. display. Context free languages: Context free grammars. Aho. string. system bus architecture. Language & Computation –3rd Edition 2006. Language acceptability.

Connecting to DB Recommended Books: 1. Interfacing. 5. Developing a simple Bean. The 8088 and 8086 Microprocessors Programming. Displaying Values. Array and ArrayList class . Programming and Interfacing. Implicit JSP Objects. JSP Processing. Working with statements. Basic elements of Computer graphics. CSHT 614 Computer Graphics Introduction to Graphics systems. CSHT 513 Internet Technologies JavaScript: Data types. TMH. Jim Keogh. Fourth Edition 2005. Working with Result Set Objects. .javascript. Creating and Executing SQL Statements. Java 7 . Establishing Connectivity and working with connection interface. Barry B. operators. Conditional Processing. JDBC: JDBC Fundamentals. Exception Handling.The Complete Reference. Web Enabled Commercial Application Development Using Html. The Anatomy of a JSP Page. and Users. 4. Walter A Triebel. Introspection. Input/Output. Wiley Publication . 2002. BPB Publications. The Complete Reference J2EE. Herbert Schildt. BIG Java Cay Horstmann. JSP: Introduction to JavaServer Pages. Java: Use of Objects. Java Server Pages. Sharing Data Between JSP Pages. Requests.Recommended Books: 1. Applications of computer graphics. Java Beans: Java Beans Fundamentals. 2. The Problem with Servlets. Third Edition. Error Handling and Debugging. Brey : The Intel Microprocessors : Architecture. O'Reilly Media December 2003. 2. functions. Avtar Singh. Hans Bergsten. 3rd Edition. Designing classes. Pearson Education. Database Access. Setting Up the JSP Environment. 2009. events and event handling. Hardware. Dhtml. Sixth Edition. Perl Cgi By Ivan Bayross. control structures. Using an expression to Set an Attribute. and Applications.. 2009. 8th Edition. 2009 3. Software. JSP Application Design with MVC. Declaring Variables and Methods. PHI. HTTP and Servlet Basics. Inheritance. JAR files.

Cryptography: Substitution ciphers. Reliability.Van Dan. Visible Surface determination: Hidden surface elimination. diffusion. circle and ellipse drawing. Symmetric. File Protection. Adams Mathematical Elements for Computer Graphics. Physical Security. Sensitive data. DES Modes of DES. Integrity. 2D and 3D Viewing Transformations (Projections. 2D and 3D Geometric Transformations. Geometric Modeling: Representing curves & Surfaces. Database Security: Requirements. J. Books Recommended: 1. line and polygon clipping algorithms.F.Non malicious Program errors. McGraw Hill 1997.F. Intusion Administrating Security: Security Planning. Feiner.Foley.. Baker: Computer Graphics. Access control. covert channels.Parallel and Perspective).D. Organisational Security Policy.key exchange. User Authentication. Multilevel Security. thick primitives.Rogers. CSHT 615 Information Security Introduction: Security. Computer Criminals. Risk Analysis.Hearn. Basic color models and Computer Animation. Vanishing points. Asymmetric Encryption. Attacks. Surface rendering: Illumination and shading models. Security in Networks: Threats in Networks s Networks security Controls. Fundamental Techniques in Graphics: Raster scan line. digital signatures. Ethical issues in Security: .Rogers Procedural Elements for Computer Graphics. Security Services.Hash function.trap doors. detection systems. Inference. Secure e-mails firewalls.Protection in OS: Memory and Address Protection. Security Mechanisms. Prentice Hall of India 2008. D. Transpositions Cipher. input/output devices.Uses of Encryption. A. Program Security: Secure programs. Hughes Computer Graphics Principles & Practice 2nd edition Publication Addison Wesley 1990. D. Confusion. Malicious codes virus. Polygon filling. 2. D. McGraw Hill 2nd edition 1989. 4..salami attacks. 3.Digital Certificates.Graphics Hardware: Architecture of Raster and Random scan display devices.Control against program Threats.

Pfleeger. The psychology of testing General testing principles. Incident management Web Application Testing Foundation: Basic test planning and testing methods for web applications. Test types (functional. S. other structure-based techniques). performance and monitoring. State transition testing. Test levels (Unit. test specification. Product risks). Test design techniques: The Test Development Process. Outline knowledge. test reporting. 4. Decision testing and coverage. process. Test planning activities. Categories of test design techniques. test control). Effective use of tools: potential benefits and risks Recommended Books: 1. 2. Test tool classification. non-functional. Test estimation. Boundary value analysis. regression testing). ―Software Engineering – A Practitioner’s approach‖ Mc Graw Hill . Decision table testing. Network Security Essentials: Applications and Standards. static testing. Tool support for management of testing and tests. Information and law. Exit criteria. Choosing test techniques Test management: Test organization (test leader. P. test execution and logging. W. 2010 CSHT 616 (i) Software Testing Fundamentals of testing: Need for testing. Test planning and estimation ( Test planning. Test approaches). Tool support for testing: Types of test tool. Test progress monitoring and control (Test progress monitoring. Configuration management. tester). Pearson Education Paul Jogerson. Specification-based or black-box techniques (Equivalence partitioning. Stallings . Structure-based or white-box techniques (Statement testing and coverage. 4/E. Security in Computing. Boris Beizer. Fundamental test Testing throughout the software life cycle: Software development models. Introduction to web testing tools and sources. Experience-based techniques. Van Nostrand Reinhold Louise Tamres. C. 2006 2. Recommended Books: 1.Protecting Programs and data. Introduction to gray-box testing and its application to testing web applications. Maintenance testing Static techniques: Static techniques and the test process. ―Software Testing‖. Review process (types of review. Use case testing). ―Software Testing Techniques‖. Pfleeger. Risk and testing (Project risks. using other tools. Prentice Hall of India. L. 3. System Acceptance testing). Integration. roles and responsibilities). ―Software Testing‖ CRC Press Roger R Pressman. Introduction to research tools on the Net. methods and tools for testing web applications. specific application areas.

behavior and environment. Testing Applications on the Web. 3rd edition. 2nd edition. 2003 CSHT 616 (ii) Artificial Intelligence Introduction: Introduction to Artificial Intelligence. Dealing with Uncertainty and Inconsistencies: Truth Maintenance System. 2. Production Systems. Means-End Analysis. 2007. Problem Solving and Searching Techniques: Problem Characteristics. Clocksin and Mellish. 3rd edition. Michael Hackett. Breadth First Search. Artificial Intelligence-A Modern Approach.5. . Introduction to A. 2nd Edition by Nguyen. Rich & Knight. and Scripts. Turing Test and Rational Agent approaches to AI.F. 5. Control Strategies. Programming in Logic (PROLOG). Probabilistic Reasoning. Depth First Search. W. and Bob Johnson (Wiley. Min-Max and Alpha-Beta pruning algorithms. Default Reasoning. Hill climbing and its Variations. 3. 2nd edition. Addison-Wesley. Understanding Natural Languages: Parsing Techniques. Conceptual Graphs. DAN. Bayesian Probabilistic Inference. Russell & Norvig. Resolution Principle. Recursive and Augmented Transition Nets. Constraint Satisfaction Problem. Unification. Prolog Programming for Artificial Intelligence. Conceptual Dependencies. 4. Production Rules.I and Expert Systems – PHI. Context-Free and Transformational Grammars. Introduction to Intelligent Agents. Artificial Intelligence – Tata McGraw Hill. Pearson Prentice Hall. BOOKS RECOMMENDED: 1. Semantic Nets. Narosa Publishing House. Ivan Bratko. their structure. 1991. Heuristics Search Techniques: Best First Search. Programming in PROLOG.W. Frames. LPE. Patterson. Pearson Education. Background and Applications. Knowledge Representation: Introduction to First Order Predicate Logic. Introduction to Game Playing. A* algorithm. 2001. 2005. 2000. Possible World Representations.

G. Pang-Ning Tan. pre-processing methods Data Mining Techniques: Association Rule Mining. The sockets Networking API. classification and regression techniques. Information. Socket Programming: Socket Introduction. PHI 2nd Edition CSHT 616 (iv) Data Mining Overview: Predictive and descriptive data mining techniques.K. 3rd Edition. Insight Into Data Mining: Theory And Practice. measures of interestingness Books Recommended: 1. Vipin Kumar. process of knowledge discovery in databases. Stevens. THM Publishing Company Ltd. Address lookup using sockets. TCP Sockets. Michael Geatz.CSHT 616 (iii) Network Programming and Administration Transport Layer Protocols: TCP. 2. Linux Administration Handbook. 3. Pearson Education. TCP Client/Server Example . A. WWWW and HTTP. 2. clustering. Michael Steinbach. PHI. SCTP protocol. Nemeth Synder & Hein. 2006 . Pearson Education. Pearson Education 2003.Diwakar Shyam. B. UDP client server example. Data Mining: A Tutorial Based Primer. UDP Sockets. Richard Stevens. Introduction to Data Mining with Case Studies. PHI. Gupta.2006. 1. Socket Options. PHI. Network Applications: Remote logging. Vol. Andrew M. 3. Unix Network Programming. I/O multiplexing using sockets. signal handling. Ajay V. 4. Books recommended: 1. Scalability and data management issues in data mining algorithms. Soman K P. supervised and unsupervised learning techniques. 2nd Edition 4. Bill Fenner. W. Rudoff. Unix Network Programming. UDP. Richard Roiger. Fourth edition. Forouzan: Data Communications and Networking. Introduction to Data Mining. LAN administration: Linux and TCP/IP networking: Network Management and Debugging. R. Email.

Graph Algorithms: Primal-Dual algorithm and its application to shortest path. John J. Jarvis and Hanif D. neighborhoods. Papadimitriou and K. Taha. Prentice-Hall of India. Mokhtar S. 2004 4. simplex method. Springer. H. 2004 3.A. bipartite matching algorithm.CSHT 616 (v) Combinatorial Optimization Introduction: Optimization problems. computational considerations for the simplex and dual simplex algorithms-Dantzig-Wolfe algorithms. Lange. Linear Programming and Network Flows. Sherali. non-bipartite matching algorithms. Math-flow problems Dijkstra’s algorithm. 2006 .H. local and global optima. Books recommended: 1. Max-flow problem. Combinatorial Optimization: Algorithms and complexity. duality and dual algorithm. branch and bound technique. John Wiley & Sons. convex sets and functions. degeneracy. C. Steiglitz. Prentice Hall. Optimization. Integer Linear Programming: Cutting plane algorithms. K.Bazaraa. 2006 2. Operations Research: An Introduction (8th Edition). matching problem.

Sign up to vote on this title
UsefulNot useful