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 2010 Semester Systems at the undergraduate roll Course of Study: B. Sc. (H) Computer Semester – I CSHT-101 Programming Fundamentals CSHT-102 Discrete Structures Digital Electronics Calculus and Matrices CSHT-203 Basis Structures Semester – II CSHT-204 computer Systems Erection English Calculus and Geometry using C++
Semeser – III CSHT-305 Algorithms CSHT-306 Systems Programmin g CSHT-307 Improve Structures and Database Basic Probability and Statistics Semester – IV CSHT-408 Clear Systems CSHT-409 Basis Communica tion and Computer CSHT-410 Software Engineering Actual Resolution / Differential Equations Semester – V CSHT-511 Speculation of Computations CSHT-512 Microproces sors CSHT-513 Internet Technologie s Optimization I/ Actual Analysis/To be unwavering by the tyro Semeser – VI CSHT-614 Computer Graphics CSHT-615 Information Shelter CSHT-616 Electives Statistical Methodology/ DE/To be unwavering by the tyro Electives: 1.
Software Testing 2. Artificial Intelligence 3. Network Programming and Administration 4. Basis Mining 5. Combinatorial Optimizations Proposed Make and Syllabi for B. Sc. (H) Computer Science – July 2010 Semester I Coding Title L–T–P Credits Total Marks 100 Pre-requisites CSHT-101 Programming Fundamentals using C++ Discrete Structures Digital Electronics Calculus and Matrices Software Lab naturalized on 101 Lab naturalized on Digital Electronics 5 – 0-0 5 - CSHT-102 ** ** CSHP-101 5 – 0-0 5 100 - 0-0-8 4 100 Semester II Coding Title L–T–P Credits Total Marks 100 100 Pre-requisites CSHT-203 CSHT-204 ** ** CSHP-202 CSHP-203
Data Structures Computer Systems Erection EL – II (Language) Calculus and Geometry Software Lab naturalized on 203 Lab naturalized on 204 5 – 0-0 5 –0-0 5 5 101 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 Algorithms Systems Programming 5-0-0 5 – 0 -0 5 5 101,203 101, 203 CSHT-307 ** CSHP-304 CSHP-305 CSHP- 306 Database Systems Basic Statistics and Probability Software Lab naturalized on 305 Software Lab naturalized on 306 Software Lab naturalized on 307 5–0-0 5 100 101, 203 0-0-4 0-0-4 0-0-4 2 2 2 50 50 50 Semester IV Coding Title L–T–P Credits Total Marks 100 100
Pre-requisites CSHT-408 CSHT-409 Clear Systems Basis Despatch and Computer Networks Software Engineering Actual Analysis/ Differential Equations Software Lab naturalized on 408 Software Lab naturalized on 409 Software Lab naturalized on 410 5 – 0-0 5 – 0-0 5 5 101, 203 CSHT-410 ** 5 – 0-0 5 100 101, 203 - CSHP-407 CSHP-408 CSHP-409 0-0-4 0-0-4 0-0-4 2 2 2 50 50 50 Semester V Coding Title L–T–P Credits Total Marks 100 100 100 Pre-requisites CSHT-511 CSHT-512 CSHT-513 ** CSHP-510 Speculation of Computations Microprocessors Internet Technologies Optimization I/Real Analysis/* Software Lab naturalized on 512 5 – 0– 0 5–0-0 5–0-0 5 5 5 01 204 409 0-0-4 2 50 CSHP-511 Lab naturalized on 513 0-0-4 2 50 Semester VI Coding Title L–T–P Credits Total Marks 100 100 100 Pre-requisites CSHT-614 CSHT-615 CSHT-616 ** Computer Graphics Information Shelter Elective Differential Equations/ Statistical Methodology/* Software Lab naturalized on 614 Software Lab naturalized on 615 Software Lab naturalized on 616 5-0-0 5-0-0 5-0-0 5 5 5 - CSHP-612 CSHP-613 CSHP-614 0-0-4 0-0-4 0-0-4 2 2 2 50 50 50 • To be unwavering by the tyro from any strictness * * Will be finalized succeeding the syllabi by the relative departments (Electronics / Mathematics / Statistics / English) are made.
CSHT-101 Programming Fundamentals (60 Lectures) Basic Computer Organization: Administrative Units, basic I/O shows and storage shows; Fidelity of integers, actual (unroving and unmoulded purpose), characters (ASCII and Unicode); Basic operations of a programming environment. Height Solving Approaches: Notion of an algorithm, height solving using top-down contemplation and reelucidation into sub-problems, stepwise systemology of developing an algorithm, systemology of developing an algorithmic elucidation from a mathematical demonstration of the height, use of recursion for heights delay inductive characterization.
Programming using C++: basic basis marks; invariables and fickles, arithmetic and argumentative countenances, assignment; input-output interface; guide makes in conditionals, loops; procedural perquisites; strings and arrays; enjoin outoutsequence arguments; improve handling; fault handling. Taking to the inspection-oriented programming paradigms; basis perquisite and encapsulation — inspections and assortes; inheritance; polymorphism; Recommended Books: 1. B. A. Forouzan and R. F. Gilberg, Computer Science, A maked Advent using C++, Cengage Learning, 2004. 2. R. G. Dromey, How to clear-up it by Computer, Pearson Education 1982 3. E.
Balaguruswamy, Inspection Oriented Programming delay C++ , 4th Edition, Tata McGraw Hill 1997 4. G. J. Bronson, A First Book of C++ From Here to There, 3rd Edition, Cengage Tuition 2005. 5. G. Seed, An Taking to Object-Oriented Programming in C++, delay impressions in Computer Graphics Springer 2nd Edition 2001. CSHT 102 Discrete Structures (60 Lectures) Introduction: Sets - terminable and Interminable sets, uncountably Interminable Sets; businesss, relations, Properties of Binary Relations, Closure, Partial Ordering Relations; counting - Pigeonhole Principle, Permutation and Combination; Mathematical Induction, Principle of Inclusion and Exclusion.
Growth of Functions: Asymptotic Notations, Summation formulas and properties, Bounding Summations, route by Integrals Recurrences: Recurrence Relations, generating businesss, Direct Recurrence Relations delay infickle coefficients and their elucidation, Substitution Method, Recurrence Trees, Master Theorem Graph Theory: Basic Terminology, Models and Types, multigraphs and weighted graphs, Graph Representaion, Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths and Circuits, Planar Graphs, Graph Coloring, Trees, Basic Terminology and properties of Trees, Taking to Spanning Trees Prepositional Logic: Argumentative Connectives, Well-formed Formulas, Tautologies, Equivalences, Inference Speculation Recommended Books: 1. C. L. Liu & Mahopatra, Elements of Discrete mathematics, 2nd Sub Edition 1985, Tata McGraw Hill 2. Rosen, Discrete Mathematics and Its Applications, Sixth Edition 2006 3. T. H. Coremen, C. E. Leiserson, R. L. Rivest, Taking to algorithms, Prentice Hall on India (3rd edition 2009) 4. M. O. Albertson and J. P. Hutchinson, Discrete Mathematics delay Algorithms 1988 Johnwiley Publication 5. J. L. Hein, Discrete Structures, Logic, and Computability, Jones and Bartlett Publishers, 3rd Edition, 2009 6. D. J. Hunter, Essentials of Discrete Mathematics, Jones and Bartlett Publishers, 2008 Digital Electronics In table delay Department of Electronics) Number Scheme and Codes: Decimal, Binary, Hexadecimal, Octal, BCD, Conversions, Complements (1’s and 2’s), Signed and Unsigned gum, Addition and Substraction, Multiplication Gray and Hamming Codes Logic Gates and Boolean Algebra: Truth Tables, OR, AND, NOT, EXOR, Universal (NOR and NAND) Gates, Boolean Theorems, DeMorgan’s Theorems. Combinational Logic Resolution and Design: Standard fidelity of logic businesss (SOP and POS), Minimization Techniques(Karnaugh Map Method: 4,5 fickles). Multiplexers(2:1,4:1)) and Demultiplexers (1:2,4:1), Adder (half and liberal) and their use as substractor, Encoder (8-line-to-3-line) and Decoder (3-line-to-8-line) , Rule Converters( Binary to BCD and defect versa).
Sequential logic contemplation: Latch, Flip flop, S-R FF , J-K FF, T and D mark FFs, Clocked FFs, Registers, Counters (ripple, contemporary and incontemporaneous, ring, modulus), State Table, State Diagrams and Sequential Machines. A/D and D/A Converters: Successive Route ADC, R/2R Ladder DAC. Memories: General Reminiscence Operation, ROM, RAM (Static and Dynamic), PROM, EPROM, EEPROM, EAROM. Suggested Books: 1. Digital Electronics, Principles and Applications, R. L. Tokheim, Tata McGraw-Hill. 2. Digital Principles, R. L. Tokheim, Schaum’s Outoutsequence Series, Tata McGraw-Hill. 3. Digital Systems, Principles and Applications, R. J. Tocci and N. S. Widner, Pearson Education Asia. 4. Digital Principles and Applications, A. P. Malvino and D. Leach, Tata McGraw Hill. 5. Digital Design, M. M. Mano, Pearson Education Asia. 6.
Digital Fundamentals, T. L. Floyd, Pearson Education Asia. 7. Solved Problems in Digital Electronics, S. P. Bali, Sigma Series, Tata McGraw-Hill. 8. Digital Electronics, W. H. Gothmann, Prentice Hall of India. 9. Modern Digital Electronics, R. P. Jain, Tata McGraw-Hill. CSHT 203 Basis Structures (60 Lectures) Introduction: Abstract Basis Types, Arrays- Single and Multidimensional arrays, Sinterpret matrices. Direct makes: Stacks, Queues (direct as courteous-mannered-mannered as spherical implementation), singly-, doubly-, and spherically- linked lists -- Operations and impressions. Recursion: Height solving using recursion, run season stack in recursion, follower recursion, and its opposition.
Searching techniques: Direct quest, Binary quest and their teachableness, Skip Lists, Hashing. Tree Structures: Trees, Binary Trees, Finished Binary trees and approximately finished Binary trees, binary quest trees, Insertion, Deletion, Tree traversal algorithms, Threaded trees (recursive as courteous-mannered-mannered as Non recursive), impressions of trees. Multiway trees – B-Trees and taking to B+ Trees. Recommended Books: 1. A. Drozdek, Basis Structures and algorithm in C++, 3rd Edition, Course Technology 2004. 2. Basis Structures using C and C++, Tannenbaum, 2nd edition ** 1995 3. Basis Structures and Algorithms in C++. Publication John Wiley 2003 4. S. Sahni, Basis Structures, Algorithms and impressions in C++, Publication Silicon Press 2004 5. B. R.
Preiss, Basis makes and algorithms delay inspection oriented contemplation patterns in C++, John Wiley and sons, 1998. CSHT 204 Computer Scheme Erection (60 Lectures) Basic Computer Make and Design: Computer records, bus scheme, advice set, timing and guide, advice cycle, reminiscence allusion, input-output and break, Interassociation Structures, Bus Interassociation contemplation of basic computer. Central Processing Unit: Register make, arithmetic and argumentative micro-operations, stack make, micro programmed guide. Advice formats, discourseing modes, advice rules, means phraseology, nock phraseology, input output programming, RISC, CISC erections, pipelining and analogous erection.
Memory Organization: Cache reminiscence, Associative reminiscence, mapping. Input-output Organization: Input / Output: External Devices, I/O Modules, Programmed I/O, Interrupt-Driven I/O, Direct Reminiscence Access, I/O Channels Recommended Books: 1. M. Mano, Computer Scheme Architecture, Prentice Hall of India Third edition / Pearson Education 1992. 2. A. J. Dos Reis, Nock phraseology and computer erection using C++ and JAVA, Course Technology, 2004. 3. W. Stallings, Computer Make and Erection Desiguing for Operation 8th Edition 2009, Prentice Hall of India. CSHT 305 Algorithms (60 Lectures) Introduction: Basic Contemplation and Resolution techniques of Algorithms, Correctness of Algorithm.
Algorithm Contemplation Techniques: Iterative techniques, Divide and Conquer, Dynamic Programming, Greedy Algorithms. Sorting and Searching Techniques: Elementary sorting techniques – Bubble Sort, Insertion Sort, Merge Sort, Advanced Sorting techniques - Heap Sort, Quick Sort, Sorting in Direct Season Bucket Sort, Radix Sort and Count Sort, Searching Techniques, Medians & Order Statistics, complication resolution; Lower Bounding Techniques: Decision Trees Balanced Trees - Red-Black Trees Advanced Resolution Technique: Amortized resolution Graphs: Graph Algorithms – Breadth First Search, Depth First Quest and its Applications, Minimum Spanning Trees. String Processing: String Matching, KMP Technique
Recommended Books: 1. T. H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Taking to Algorithms, PHI, 3rd Edition 2009 2. Sarabasse & A. V. Gelder Computer Algorithm – Taking to Contemplation and Analysis, Publisher – Pearson 3rd Edition 1999 CSHT 306 Systems Programming (60 Lectures) Introduction: Taking to Systems Software and means erection. Assemblers: Example of an nock phraseology, programming in nock phraseology, assembler features and businesss, Load and Go assembler, One-by and two by assemblers, Macros and macro arrangementors. Compilers: Compiler businesss and features, phases of patchwork, optimization.
Loaders and Linkers: Basic Loader businesss and features, Relocation, Program Linking, static and dynamic linking. Recommended Books: 1. A. J. Dos Reis, Nock phraseology and computer erection using C++ and JAVA, Course Technology, 2004 2. D. M. Dhamdhere Systems Programming and Clear Systems, Tata McGraw-Hill Publishing Company, Ltd; Second Revised Edition 1996 3. L. Beck, D. Manjula, Scheme Software, An Taking to Systems Programming, Pearson, 3rd Edition 1996. 4. S. Chattopadhyay, Systems Software, PHI 2007. CSHT 307 Database Systems (60 Lectures) Introduction: Characteristics of basisbase advent, basis marks, basisbase scheme erection and basis anarchy. Entity Relationship(ER) Modeling: Entity marks, intercommunitys, constraints.
Relation basis mark: Psychical mark concepts, psychical constraints, psychical algebra, SQL queries, programming using embedded SQL. Database contemplation: mapping ER mark to psychical basisbase, administrative dependencies, ordinary forms. Transaction Processing: ACID properties, concurrency guide, replacement. Web naturalized basisbases: XML documents and basisbases. Books Recommended: 1. R. Elmasri, S. B. Navathe, Fundamentals of Database Systems 6th Edition, Pearson Education 2010. 2. R. Ramakrishanan, J. Gehrke, Database Superintendence Systems 3rd Edition, McGraw-Hill 2002. 3. A. Silberschatz, H. F. Korth, S. Sudarshan, Database Scheme Concepts 6th Edition, McGraw Hill 2010. CSHT 408 Clear Systems (60 Lectures)
Introduction: Basic OS businesss, show perquisite, marks of clear schemes – multiprogramming schemes, conspire schemes , season sharing schemes; clear schemes for indivisible computers & workstations, arrangement guide & actual season schemes. Clear Scheme Organization: arrangementor and user modes, kernels, scheme calls and scheme programs. Arrangement Management: Scheme inspection of the arrangement and shows, arrangement perquisite, arrangement hierarchy, sequences, sequenceing issues, sequence libraries; Arrangement Scheduling, non-pre-emptive and pre-emptive scheduling algorithms; correlative and arrangementes, ticklish exception, semaphores, systems for inter-arrangement despatch; deadlocks.
Memory Management: Physical and practical discourse space; reminiscence allocation strategies -unroving and fickle partitions, paging, segmentation, practical reminiscence Improve and I/O Management: Directory make, improve operations, improve allocation systems, dedefect superintendence. Protection and Security: Policy means, notoriety, inside entrance authorization. Recommended Books: 1. A Silberschatz, P. B. Galvin, G. Gagne, Clear Systems Concepts, 8th Edition, John Wiley Publications 2008. 2. A. S. Tanenbaum, Modern Clear Systems, 3rd Edition, Pearson Education 2007. 3. G. Nutt, Clear Systems: A Modern Perspective, 2nd Edition Pearson Education 1997. 4. W.
Stallings, Clear Systems, Internals & Contemplation Principles 2008 5th Edition, Prentice Hall of India. 5. M. Milenkovic, Clear Systems- Concepts and contemplation, Tata McGraw Hill 1992. CSHT 409 Basis Despatch and Computer Networks (60 Lectures) Taking to Computer Networks: Network definition; network topologies; network assortifications; network protocol; laminaed network erection; overinspection of OSI allusion mark; overinspection of TCP/IP protocol cortege. Basis Despatch Fundamentals and Techniques: Analog and digital conspicuous; basis-rate limits; digital to digital outoutsequence encoding schemes; pulse rule modulation; analogous and serial transmission; digital to analog modulation-; multiplexing techniques- FDM, TDM; transmission resources.
Networks Switching Techniques and Entrance meanss: Tour switching; packet switching- associationless basisgram switching, association-oriented practical tour switching; dial-up modems; digital subscriber outline; cable TV for basis sell. Basis Link Lamina Functions and Protocol: Fault counteraction and fault chastisement techniques; basis-link guide- framing and run guide; fault replacement protocols- bung and abide ARQ, goback-n ARQ; Purpose to Purpose Protocol on Internet. Multiple Entrance Protocol and Networks: CSMA/CD protocols; Ethernet LANS; connecting LAN and back-bone networks- repeaters, hubs, switches, bridges, router and gateways; Networks Lamina Functions and Protocols: routing; routing algorithms; network lamina protocol of Internet- IP protocol, Internet guide protocols.
Transport Lamina Functions and Protocols: Transport services- fault and run guide, Association state and release- three way handshake; Overinspection of Impression lamina protocol: Overinspection of DNS protocol; overinspection of WWW & HTTP protocol. Recommended Books: 1. B. A. Forouzan: Basis Communications and Networking, Fourth edition, THM Publishing Company Ltd 2007. 2. A. S. Tanenbaum: Computer Networks, Fourth edition, PHI Pvt. Ltd 2002. CSHT 410 Software Engineering (60 Lectures) Introduction: The Evolving Role of Software, Software Characteristics, Changing Nature of Software, Software Engineering as a Layered Technology, Software Arrangement Framework, Framework and Umbrella Activities, Arrangement Models, Capability Maturity Mark Integration (CMMI).
Requirement Analysis: Software Requirement Analysis, Initiating Requirement Engineering Process, Requirement Resolution and Modeling Techniques, Run Oriented Modeling, Need for SRS, Characteristics and Components of SRS. Software Project Management: Genius in Project Planning Process, Project Scheduling. Risk Management: Software Risks, Risk Identification, Risk Projection and Risk Refinement, RMMM Plan. Quality Management: Quality Concepts, Software Quality Assurance, Software Reviews, Metrics for Arrangement and Projects. Contemplation Engineering: Contemplation Concepts, Architectural Contemplation Elements, Software Architecture, Basis Contemplation at the Architectural Roll and Component Level, Mapping of Basis Run into Software Architecture, Modeling Component Roll Design.
Testing Strategies & Tactics: Software Testing Fundamentals, Strategic Advent to Software Testing, Trial Strategies for Conventional Software, Validation Testing, Scheme Testing, BlackBox Testing, White-Box Testing and their mark, Basis Route Testing. Recommended Books: 1. R. S. Pressman, Software Engineering: A Practitioner’s Advent (7th Edition), McGrawHill, 2009. 2. P. Jalote, An Integrated Advent to Software Engineering (2nd Edition), Narosa Publishing House, 2003. 3. K. K. Aggarwal and Y. Singh, Software Engineering (revised 2nd Edition), New Age International Publishers, 2008. 4. I. Sommerville, Software Engineering (8th edition), Addison Wesle, 2006. 5. D. Bell, Software Engineering for Students (4th Edition), Addison-Wesley, 2005. 6. R. Mall, Fundamentals of Software Engineering (2nd Edition), Prentice-Hall of India, 2004. CSHT 511 Speculation of Deduction (60 Lectures)
Languages: Alphabets, string, phraseology, Basic Operations on phraseology, Concatenation, Kleene Star Terminable Automata and Customary Languages: Customary Expressions, Transition Graphs, Deterministics and non-deterministic terminable automata, NFA to DFA Conversion, Customary phraseologys and their intercommunity delay terminable automata, Pumping lemma and shutting up properties of customary phraseologys. Composition playing phraseologys: Composition playing grammars, interpret trees, ambiguities in grammars and phraseologys, Pushdown automata (Deterministic and Non-deterministic), Pumping Lemma, Properties of composition playing phraseologys, ordinary forms. Turing Macines and Models of Computations: RAM, Turing Means as a mark of deduction, Universal Turing Machine, Phraseology acceptability, decidability, halting height, Recursively enumerable and recursive phraseologys, unsolvability heights.
Recommended Books: 1. Daniel I. A. Cohen, Taking to computer speculation – John Wiley (1996 2nd Edition). 2. Lewis & Papadimitriou, Elements of the speculation of deduction – II Edition PHI 1997. 3. Hoperoft, Aho, Ullman, Taking to Automata speculation, Phraseology & Deduction –3rd Edition 2006, Pearson Education. 4. P. Linz, An Taking to Formal Phraseology and Automata 4th edition Publication Jones Bartlett 2006 CSHT 512 Microprocessors (60 Lectures) Microprocessor erection: Inside erection, scheme bus erection, reminiscence and I/O interfaces. Microprocessor programming: Register Organization, advice formats, nock phraseology programming.
JDBC: JDBC Fundamentals, Establishing Connectivity and instituted delay association interface, Instituted delay statements, Creating and Executing SQL Statements, Instituted delay Result Set Objects. JSP: Taking to JavaServer Pages, HTTP and Servlet Basics, The Height delay Servlets, The Anatomy of a JSP Page, JSP Processing, JSP Impression Contemplation delay MVC, Setting Up the JSP Environment, Implicit JSP Objects, Conditional Processing, Displaying Values, Using an countenance to Set an Attribute, Declaring Variables and Methods, Fault Handling and Debugging, Sharing Basis Between JSP Pages, Requests, and Users, Database Access. Java Beans: Java Beans Fundamentals, JAR improves, Introspection, Developing a weak Bean, Connecting to DB
Fundamental Techniques in Graphics: Raster examine outline, dissipation and omission scheme, misty primitives, Polygon supply, outoutsequence and polygon clipping algorithms, 2D and 3D Geometric Transformations, 2D and 3D Viewing Transformations (Projections- Analogous and Perspective), Vanishing purposes. Geometric Modeling: Representing curves & Surfaces. Visible Manner determination: Hidden manner elimination. Manner rendering: Illumination and shading marks. Basic speciousness marks and Computer Animation. Books Recommended: 1. J. D. Foley, A. Van Dan, Feiner, Hughes Computer Graphics Principles & Practice 2nd edition Publication Addison Wesley 1990. 2. D. Hearn, Baker: Computer Graphics, Prentice Hall of India 2008. 3. D. F. Rogers Procedural Elements for Computer Graphics, McGraw Hill 1997. 4. D. F. Rogers, Adams Mathematical Elements for Computer Graphics, McGraw Hill 2nd edition 1989. CSHT 615 Information Shelter (60 Lectures)
Introduction: Security, Attacks, Computer Criminals, Shelter Services, Shelter Mechanisms. Cryptography: Substitution ciphers, Transpositions Cipher, Confusion, clearance, Symmetric, Asymmetric Encryption. DES Modes of DES. ,Uses of Encryption. ,Hash business,key substitute, digital signatures,Digital Certificates. Program Security: Secure programs,Non intolerant Program faults, Intolerant rules poison,pitfall doors,salami attacks, clandestine channels,Control counter program Threats. Protection in OS: Reminiscence and Discourse Protection, Entrance guide, Improve Protection, User Authentication. Database Security: Requirements, Reliability, Integrity, Sensitive basis, Inference, Multiroll Security.
Security in Networks: Threats in Networks s Networks shelter Controls, counteraction schemes, Secure e-mails firewalls, Intusion Administrating Security: Shelter Planning, Risk Analysis, Organisational Shelter Policy, Physical Security. Ethical issues in Security: Protecting Programs and basis. Information and law. Recommended Books: 1. C. P. Pfleeger, S. L. Pfleeger; Shelter in Computing, Prentice Hall of India, 2006 2. W. Stallings ; Network Shelter Essentials: Applications and Standards, 4/E, 2010 CSHT 616 (i) Foundations of Software Testing Fundamentals of trialing: Need for trialing, arrangement, The psychology of trialing General trialing principles, Fundamental trial
Testing throughout the software vivacity cycle: Software crop marks, Trial rolls (Unit, Integration, Scheme Acceptance trialing), Trial marks (functional, non-functional, retirement trialing), Maintenance trialing Static techniques: Static techniques and the trial arrangement, Reinspection arrangement (types of resurvey, roles and responsibilities), Trial contemplation techniques: The Trial Crop Process, Categories of trial contemplation techniques, Specification-naturalized or black-box techniques (Equivalence partitioning, Boundary rate resolution, Decision table trialing, State transition trialing, Use occurrence trialing), Structure-naturalized or white-box techniques (Statement trialing and coverage, Decision trialing and coverage, other make-naturalized techniques), Experience-naturalized techniques, Choosing trial techniques
Test superintendence: Trial make (trial guide, trialer), Trial planning and genius ( Trial planning, Trial planning activities, Exit criteria, Trial genius, Trial adventes), Trial advancement monitoring and guide (Test advancement monitoring, trial reporting, trial guide), Configuration superintendence, Risk and trialing (Project risks, Product risks), Incident superintendence Web Impression Testing Foundation: Basic trial planning and trialing systems for web impressions, Taking to gray-box trialing and its impression to trialing web impressions, Outoutsequence understanding, systems and dupes for trialing web impressions, Taking to web trialing dupes and sources, Taking to request dupes on the Net.
Tool stay for trialing: Types of trial dupe, Trial dupe assortification, Dupe stay for superintendence of trialing and trials, static trialing, trial demonstration, trial preventive and logging, operation and monitoring, favoring impression areas, using other dupes, Effective use of dupes: germinative benefits and risks Recommended Books: 1. 2. 3. 4. 5. Boris Beizer, “Software Testing Techniques”, Van Nostrand Reinhold Louise Tamres, “Software Testing”, Pearson Education Paul Jogerson, “Software Testing” CRC Press Roger R Pressman, “Software Engineering – A Practitioner’s advent” Mc Graw Hill Testing Applications on the Web, 2nd Edition by Nguyen, Michael Hackett, and Bob Johnson (Wiley, 2003 CSHT 616 (ii) ARTIFICIAL INTELLIGENCE Introduction: (60 Lectures) Taking to Artificial Intelligence, Background and Applications, Turing Trial and Rational Agent adventes to AI, Taking to Intelligent Agents, their make, bearing and environment.
Problem Solving and Searching Techniques: Height Characteristics, Production Systems, Guide Strategies, Breadth First Search, Depth First Search, Hill climbing and its Variations, Heuristics Quest Techniques: Best First Search, A* algorithm, Constraint Satisfaction Problem, Means-End Analysis, Taking to Game Playing, Min-Max and Alpha-Beta pruning algorithms. Understanding Representation: Taking to First Order Predicate Logic, Reelucidation Principle, Unification, Semantic Nets, Conceptual Dependencies, Frames, and Scripts, Production Rules, Conceptual Graphs. Programming in Logic (PROLOG). Dealing delay Uncertainty and Inconsistencies:
Truth Maintenance System, Default Reasoning, Probabilistic Reasoning, Bayesian Probabilistic Inference, Possible World Representations. Understanding Natural Languages: Parsing Techniques, Context-Free and Transformational Grammars, Recursive and Augmented Transition Nets. BOOKS RECOMMENDED: 1. 2. DAN. W. Patterson, Taking to A. I and Expert Systems – PHI, 2007. Russell & Norvig, Artificial Intelligence-A Modern Approach, LPE, Pearson Prentice Hall, 2nd edition, 2005. Rich & Knight, Artificial Intelligence – Tata McGraw Hill, 2nd edition, 1991. W. F. Clocksin and Mellish, Programming in PROLOG, Narosa Publishing House, 3rd edition, 2001. 5.
Ivan Bratko, Prolog Programming for Artificial Intelligence, Addison-Wesley, Pearson Education, 3rd edition, 2000. 3. 4. CSHT 616 (iii) Network Programming and Administration Transport Lamina Protocols: TCP, UDP, SCTP protocol. Socket Programming: Socket Introduction; TCP Sockets; TCP Client/Server Example ; conspicuous handling; I/O multiplexing using sockets; Socket Options; UDP Sockets; UDP client server example; Discourse lookup using sockets. Network Applications: Remote logging; Email; WWWW and HTTP. LAN administration: Linux and TCP/IP networking: Network Superintendence and Debugging. Books recommended: 1. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Unix Network Programming, The sockets Netinstituted API, Vol. 1, 3rd Edition, PHI. 2. B. A.
Forouzan: Basis Communications and Networking, Fourth edition, THM Publishing Company Ltd. 3. Nemeth Synder & Hein, Linux Administration Handbook, Pearson Education, 2nd Edition 4. R. Stevens, Unix Network Programming, PHI 2nd Edition CSHT 616 (iv) Basis Mining Overview: Predictive and vivid basis mining techniques, supervised and unsupervised tuition techniques, arrangement of understanding solution in basisbases, pre-processing systems Basis Mining Techniques: Association Rule Mining, assortification and retirement techniques, clustering, Scalability and basis superintendence issues in basis mining algorithms, measures of interestingness Books Recommended: 1.
Introduction to Basis Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education. 2. Basis Mining: A Tutorial Naturalized Primer, Richard Roiger, Michael Geatz, Information; Pearson Education 2003. 3. Taking to Basis Mining delay Occurrence Studies, G. K. Gupta, PHI,2006. 4. Insight Into Basis Mining: Speculation And Practice, Soman K P,Diwakar Shyam, Ajay V, PHI, 2006 CSHT 616 (v) Combinatorial Optimization Introduction: Optimization heights, neighborhoods, national and global optima, intumescent sets and businesss, weakx system, degeneracy; duality and dual algorithm, deductional considerations for the weakx and dual weakx algorithms-Dantzig-Wolfe algorithms.
Integer Direct Programming: Cutting roll algorithms, scion and frisk technique. Graph Algorithms: Primal-Dual algorithm and its impression to shortrial route, Math-run heights Dijkstra’s algorithm, Max-run height, matching height, bipartite matching algorithm, non-bipartite matching algorithms. Books recommended: 1. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and complication, Prentice-Hall of India, 2006 2. K. Lange, Optimization, Springer, 2004 3. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Direct Programming and Network Flows, John Wiley & Sons, 2004 4. H. A. Taha, Operations Research: An Taking (8th Edition), Prentice Hall, 2006