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 akin Course of Study: B. Sc. (H) Computer Semester – I CSHT-101 Programming Fundamentals CSHT-102 Discrete Structures Agenda Electronics Calculus and Matrices CSHT-203 Abstracts Structures Semester – II CSHT-204 computer Systems Architectonics English Calculus and Geometry appliance C++
Semeser – III CSHT-305 Algorithms CSHT-306 Systems Programmin g CSHT-307 Book Structures and Database Basal Probability and Statistics Semester – IV CSHT-408 Operating Systems CSHT-409 Abstracts Communica tion and Computer CSHT-410 Software Engineering Absolute Assay / Differential Equations Semester – V CSHT-511 Approach of Computations CSHT-512 Microproces sors CSHT-513 Internet Technologie s Admission I/ Absolute Analysis/To be absitively by the apprentice Semeser – VI CSHT-614 Computer Cartoon CSHT-615 Information Aegis CSHT-616 Electives Statistical Methodology/ DE/To be absitively by the apprentice Electives: 1.
Software Testing 2. Artificial Intelligence 3. Arrangement Programming and Administration 4. Abstracts Mining 5. Combinatorial Optimizations Proposed Anatomy 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 appliance C++ Discrete Structures Agenda Electronics Calculus and Matrices Software Lab based on 101 Lab based on Agenda 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 Architectonics EL – II (Language) Calculus and Geometry Software Lab based on 203 Lab based 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 Basal Statistics and Probability Software Lab based on 305 Software Lab based on 306 Software Lab based 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 Operating Systems Abstracts Advice and Computer Networks Software Engineering Absolute Analysis/ Differential Equations Software Lab based on 408 Software Lab based on 409 Software Lab based 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 Approach of Computations Microprocessors Internet Technologies Admission I/Real Analysis/* Software Lab based 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 based 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 Cartoon Information Aegis Elective Differential Equations/ Statistical Methodology/* Software Lab based on 614 Software Lab based on 615 Software Lab based 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 absitively by the apprentice from any conduct * * Will be accomplished afterwards the syllabi by the corresponding departments (Electronics / Mathematics / Statistics / English) are made.
CSHT-101 Programming Fundamentals (60 Lectures) Basal Computer Organization: Anatomic Units, basal I/O accessories and accumulator devices; Representation of integers, absolute (fixed and amphibian point), characters (ASCII and Unicode); Basal operations of a programming environment. Botheration Analytic Approaches: Notion of an algorithm, botheration analytic appliance top-down architectonics and atomization into sub-problems, stepwise alignment of developing an algorithm, alignment of developing an algebraic band-aid from a algebraic blueprint of the problem, use of recursion for problems with anterior characterization.
Programming appliance C++: basal abstracts types; constants and variables, addition and analytic expressions, assignment; input-output interface; ascendancy structures in conditionals, loops; procedural abstractions; strings and arrays; command band arguments; book handling; absurdity handling. Addition to the acquisitive programming paradigms; abstracts absorption and encapsulation — altar and classes; inheritance; polymorphism; Recommended Books: 1. B. A. Forouzan and R. F. Gilberg, Computer Science, A structured Admission appliance C++, Cengage Learning, 2004. 2. R. G. Dromey, How to break it by Computer, Pearson Education 1982 3. E.
Balaguruswamy, Article Aggressive Programming with C++ , 4th Edition, Tata McGraw Hill 1997 4. G. J. Bronson, A First Book of C++ From Here to There, 3rd Edition, Cengage Acquirements 2005. 5. G. Seed, An Addition to Object-Oriented Programming in C++, with applications in Computer Cartoon Springer 2nd Copy 2001. CSHT 102 Discrete Structures (60 Lectures) Introduction: Sets - apprenticed and Infinite sets, uncountably Infinite Sets; functions, relations, Backdrop of Bifold Relations, Closure, Partial Ordering Relations; counting - Pigeonhole Principle, Permutation and Combination; Algebraic Induction, Principle of Inclusion and Exclusion.
Growth of Functions: Asymptotic Notations, Summation formulas and properties, Bounding Summations, approximation by Integrals Recurrences: Recurrence Relations, breeding functions, Beeline Recurrence Relations with connected coefficients and their solution, Substitution Method, Recurrence Trees, Master Theorem Graph Theory: Basal Terminology, Models and Types, multigraphs and abounding graphs, Graph Representaion, Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths and Circuits, Planar Graphs, Graph Coloring, Trees, Basal Terminology and backdrop of Trees, Addition to Spanning Copse Prepositional Logic: Analytic Connectives, Well-formed Formulas, Tautologies, Equivalences, Inference Approach Recommended Books: 1. C. L. Liu & Mahopatra, Elements of Discrete mathematics, 2nd Sub Copy 1985, Tata McGraw Hill 2. Rosen, Discrete Mathematics and Its Applications, Sixth Copy 2006 3. T. H. Coremen, C. E. Leiserson, R. L. Rivest, Addition to algorithms, Prentice Hall on India (3rd copy 2009) 4. M. O. Albertson and J. P. Hutchinson, Discrete Mathematics with 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 Agenda Electronics In appointment with Department of Electronics) Number Arrangement and Codes: Decimal, Binary, Hexadecimal, Octal, BCD, Conversions, Complements (1’s and 2’s), Signed and Unsigned numbers, Addition and Substraction, Multiplication Gray and Hamming Codes Argumentation Gates and Boolean Algebra: Truth Tables, OR, AND, NOT, EXOR, Universal (NOR and NAND) Gates, Boolean Theorems, DeMorgan’s Theorems. Combinational Argumentation Assay and Design: Standard representation of argumentation functions (SOP and POS), Minimization Techniques(Karnaugh Map Method: 4,5 variables). Multiplexers(2:1,4:1)) and Demultiplexers (1:2,4:1), Adder (half and full) and their use as substractor, Encoder (8-line-to-3-line) and Decoder (3-line-to-8-line) , Cipher Converters( Bifold to BCD and carnality versa).
Sequential argumentation design: Latch, Flip flop, S-R FF , J-K FF, T and D blazon FFs, Clocked FFs, Registers, Counters (ripple, ancillary and asynchronous, ring, modulus), State Table, State Diagrams and Sequential Machines. A/D and D/A Converters: Successive Approximation ADC, R/2R Ladder DAC. Memories: General Anamnesis Operation, ROM, RAM (Static and Dynamic), PROM, EPROM, EEPROM, EAROM. Suggested Books: 1. Agenda Electronics, Attempt and Applications, R. L. Tokheim, Tata McGraw-Hill. 2. Agenda Principles, R. L. Tokheim, Schaum’s Outline Series, Tata McGraw-Hill. 3. Agenda Systems, Attempt and Applications, R. J. Tocci and N. S. Widner, Pearson Education Asia. 4. Agenda Attempt and Applications, A. P. Malvino and D. Leach, Tata McGraw Hill. 5. Agenda Design, M. M. Mano, Pearson Education Asia. 6.
Digital Fundamentals, T. L. Floyd, Pearson Education Asia. 7. Solved Problems in Agenda Electronics, S. P. Bali, Sigma Series, Tata McGraw-Hill. 8. Agenda Electronics, W. H. Gothmann, Prentice Hall of India. 9. Modern Agenda Electronics, R. P. Jain, Tata McGraw-Hill. CSHT 203 Abstracts Structures (60 Lectures) Introduction: Abstract Abstracts Types, Arrays- Single and Multidimensional arrays, Sparse matrices. Beeline structures: Stacks, Queues (linear as able-bodied as annular implementation), singly-, doubly-, and circularly- affiliated lists -- Operations and applications. Recursion: Botheration analytic appliance recursion, run time assemblage in recursion, appendage recursion, and its removal.
Searching techniques: Beeline search, Bifold chase and their efficiency, Skip Lists, Hashing. Tree Structures: Trees, Bifold Trees, Complete Bifold copse and about complete Bifold trees, bifold chase trees, Insertion, Deletion, Tree bridge algorithms, Threaded copse (recursive as able-bodied as Non recursive), applications of trees. Multiway copse – B-Trees and addition to B+ Trees. Recommended Books: 1. A. Drozdek, Abstracts Structures and algorithm in C++, 3rd Edition, Course Technology 2004. 2. Abstracts Structures appliance C and C++, Tannenbaum, 2nd copy ** 1995 3. Abstracts Structures and Algorithms in C++. Publication John Wiley 2003 4. S. Sahni, Abstracts Structures, Algorithms and applications in C++, Publication Silicon Press 2004 5. B. R.
Preiss, Abstracts structures and algorithms with article aggressive architectonics patterns in C++, John Wiley and sons, 1998. CSHT 204 Computer Arrangement Architectonics (60 Lectures) Basal Computer Alignment and Design: Computer registers, bus system, apprenticeship set, timing and control, apprenticeship cycle, anamnesis reference, input-output and interrupt, Interconnection Structures, Bus Interconnection architectonics of basal computer. Central Processing Unit: Register organization, addition and analytic micro-operations, assemblage organization, micro programmed control. Apprenticeship formats, acclamation modes, apprenticeship codes, apparatus language, accumulation language, ascribe achievement programming, RISC, CISC architectures, pipelining and alongside architecture.
Memory Organization: Accumulation memory, Associative memory, mapping. Input-output Organization: Ascribe / Output: External Devices, I/O Modules, Programmed I/O, Interrupt-Driven I/O, Direct Anamnesis Access, I/O Channels Recommended Books: 1. M. Mano, Computer Arrangement Architecture, Prentice Hall of India Third copy / Pearson Education 1992. 2. A. J. Dos Reis, Accumulation accent and computer architectonics appliance C++ and JAVA, Course Technology, 2004. 3. W. Stallings, Computer Alignment and Architectonics Desiguing for Achievement 8th Copy 2009, Prentice Hall of India. CSHT 305 Algorithms (60 Lectures) Introduction: Basal Architectonics and Assay techniques of Algorithms, Correctness of Algorithm.
Algorithm Architectonics Techniques: Iterative techniques, Divide and Conquer, Activating Programming, Greedy Algorithms. Allocation and Searching Techniques: Elementary allocation techniques – Bubble Sort, Insertion Sort, Merge Sort, Advanced Allocation techniques - Heap Sort, Quick Sort, Allocation in Beeline Time Bucket Sort, Radix Sort and Count Sort, Searching Techniques, Medians & Order Statistics, complication analysis; Lower Bounding Techniques: Decision Copse Balanced Copse - Red-Black Copse Advanced Assay Technique: Amortized assay Graphs: Graph Algorithms – Breadth First Search, Depth First Chase and its Applications, Minimum Spanning Trees. Cord Processing: Cord Matching, KMP Technique
Recommended Books: 1. T. H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Addition to Algorithms, PHI, 3rd Copy 2009 2. Sarabasse & A. V. Gelder Computer Algorithm – Addition to Architectonics and Analysis, Publisher – Pearson 3rd Copy 1999 CSHT 306 Systems Programming (60 Lectures) Introduction: Addition to Systems Software and apparatus architecture. Assemblers: Example of an accumulation language, programming in accumulation language, assembler appearance and functions, Load and Go assembler, One-pass and two canyon assemblers, Macros and macro processors. Compilers: Compiler functions and features, phases of compilation, optimization.
Loaders and Linkers: Basal Loader functions and features, Relocation, Affairs Linking, changeless and activating linking. Recommended Books: 1. A. J. Dos Reis, Accumulation accent and computer architectonics appliance C++ and JAVA, Course Technology, 2004 2. D. M. Dhamdhere Systems Programming and Operating Systems, Tata McGraw-Hill Publishing Company, Ltd; Second Revised Copy 1996 3. L. Beck, D. Manjula, Arrangement Software, An Addition to Systems Programming, Pearson, 3rd Copy 1996. 4. S. Chattopadhyay, Systems Software, PHI 2007. CSHT 307 Database Systems (60 Lectures) Introduction: Characteristics of database approach, abstracts models, database arrangement architectonics and abstracts independence. Entity Relationship(ER) Modeling: Entity types, relationships, constraints.
Relation abstracts model: Relational archetypal concepts, relational constraints, relational algebra, SQL queries, programming appliance anchored SQL. Database design: mapping ER archetypal to relational database, anatomic dependencies, accustomed forms. Transaction Processing: ACID properties, accommodation control, recovery. Web based databases: XML abstracts and databases. Books Recommended: 1. R. Elmasri, S. B. Navathe, Fundamentals of Database Systems 6th Edition, Pearson Education 2010. 2. R. Ramakrishanan, J. Gehrke, Database Administration Systems 3rd Edition, McGraw-Hill 2002. 3. A. Silberschatz, H. F. Korth, S. Sudarshan, Database Arrangement Concepts 6th Edition, McGraw Hill 2010. CSHT 408 Operating Systems (60 Lectures)
Introduction: Basal OS functions, ability abstraction, types of operating systems – multiprogramming systems, accumulation systems , time administration systems; operating systems for claimed computers & workstations, action ascendancy & absolute time systems. Operating Arrangement Organization: processor and user modes, kernels, arrangement calls and arrangement programs. Action Management: Arrangement appearance of the action and resources, action abstraction, action hierarchy, threads, threading issues, cilia libraries; Action Scheduling, non-pre-emptive and pre-emptive scheduling algorithms; circumstantial and processes, analytical section, semaphores, methods for inter-process communication; deadlocks.
Memory Management: Physical and basic abode space; anamnesis allocation strategies -fixed and capricious partitions, paging, segmentation, basic anamnesis Book and I/O Management: Directory structure, book operations, book allocation methods, accessory management. Protection and Security: Policy mechanism, authentication, centralized admission authorization. Recommended Books: 1. A Silberschatz, P. B. Galvin, G. Gagne, Operating Systems Concepts, 8th Edition, John Wiley Publications 2008. 2. A. S. Tanenbaum, Modern Operating Systems, 3rd Edition, Pearson Education 2007. 3. G. Nutt, Operating Systems: A Modern Perspective, 2nd Copy Pearson Education 1997. 4. W.
Stallings, Operating Systems, Internals & Architectonics Attempt 2008 5th Edition, Prentice Hall of India. 5. M. Milenkovic, Operating Systems- Concepts and design, Tata McGraw Hill 1992. CSHT 409 Abstracts Advice and Computer Networks (60 Lectures) Addition to Computer Networks: Arrangement definition; arrangement topologies; arrangement classifications; arrangement protocol; layered arrangement architecture; overview of OSI advertence model; overview of TCP/IP agreement suite. Abstracts Advice Fundamentals and Techniques: Analog and agenda signal; data-rate limits; agenda to agenda band encoding schemes; beating cipher modulation; alongside and consecutive transmission; agenda to analog modulation-; multiplexing techniques- FDM, TDM; manual media.
Networks Switching Techniques and Admission mechanisms: Ambit switching; packet switching- connectionless datagram switching, connection-oriented basic ambit switching; dial-up modems; agenda subscriber line; cable TV for abstracts transfer. Abstracts Link Band Functions and Protocol: Absurdity apprehension and absurdity alteration techniques; data-link control- framing and breeze control; absurdity accretion protocols- stop and delay ARQ, goback-n ARQ; Point to Point Agreement on Internet. Multiple Admission Agreement and Networks: CSMA/CD protocols; Ethernet LANS; abutting LAN and back-bone networks- repeaters, hubs, switches, bridges, router and gateways; Networks Band Functions and Protocols: routing; acquisition algorithms; arrangement band agreement of Internet- IP protocol, Internet ascendancy protocols.
Transport Band Functions and Protocols: Transport services- absurdity and breeze control, Affiliation enactment and release- three way handshake; Overview of Appliance band protocol: Overview of DNS protocol; overview of WWW & HTTP protocol. Recommended Books: 1. B. A. Forouzan: Abstracts 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 Action Framework, Framework and Umbrella Activities, Action Models, Capability Maturity Archetypal Integration (CMMI).
Requirement Analysis: Software Requirement Analysis, Initiating Requirement Engineering Process, Requirement Assay and Modeling Techniques, Breeze Aggressive Modeling, Need for SRS, Characteristics and Components of SRS. Software Project Management: Admiration 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 Action and Projects. Architectonics Engineering: Architectonics Concepts, Architectural Architectonics Elements, Software Architecture, Abstracts Architectonics at the Architectural Akin and Component Level, Mapping of Abstracts Breeze into Software Architecture, Modeling Component Akin Design.
Testing Strategies & Tactics: Software Testing Fundamentals, Strategic Admission to Software Testing, Assay Strategies for Conventional Software, Validation Testing, Arrangement Testing, BlackBox Testing, White-Box Testing and their type, Basis Aisle Testing. Recommended Books: 1. R. S. Pressman, Software Engineering: A Practitioner’s Admission (7th Edition), McGrawHill, 2009. 2. P. Jalote, An Integrated Admission 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 Approach of Ciphering (60 Lectures)
Languages: Alphabets, string, language, Basal Operations on language, Concatenation, Kleene Star Apprenticed Automata and Approved Languages: Approved Expressions, Alteration Graphs, Deterministics and non-deterministic apprenticed automata, NFA to DFA Conversion, Approved languages and their accord with apprenticed automata, Pumping antecedent and cease backdrop of approved languages. Ambience chargeless languages: Ambience chargeless grammars, anatomize trees, ambiguities in grammars and languages, Pushdown automata (Deterministic and Non-deterministic), Pumping Lemma, Backdrop of ambience chargeless languages, accustomed forms. Turing Macines and Models of Computations: RAM, Turing Apparatus as a archetypal of computation, Universal Turing Machine, Accent acceptability, decidability, awkward problem, Recursively enumerable and recursive languages, unsolvability problems.
Recommended Books: 1. Daniel I. A. Cohen, Addition to computer approach – John Wiley (1996 2nd Edition). 2. Lewis & Papadimitriou, Elements of the approach of ciphering – II Copy PHI 1997. 3. Hoperoft, Aho, Ullman, Addition to Automata theory, Accent & Ciphering –3rd Copy 2006, Pearson Education. 4. P. Linz, An Addition to Formal Accent and Automata 4th copy Publication Jones Bartlett 2006 CSHT 512 Microprocessors (60 Lectures) Microprocessor architecture: Centralized architecture, arrangement bus architecture, anamnesis and I/O interfaces. Microprocessor programming: Register Organization, apprenticeship formats, accumulation accent programming.
JDBC: JDBC Fundamentals, Establishing Connectivity and alive with affiliation interface, Alive with statements, Creating and Executing SQL Statements, Alive with Result Set Objects. JSP: Addition to JavaServer Pages, HTTP and Servlet Basics, The Botheration with Servlets, The Anatomy of a JSP Page, JSP Processing, JSP Appliance Architectonics with MVC, Setting Up the JSP Environment, Implicit JSP Objects, Conditional Processing, Displaying Values, Appliance an announcement to Set an Attribute, Declaring Variables and Methods, Absurdity Administration and Debugging, Administration Abstracts Between JSP Pages, Requests, and Users, Database Access. Java Beans: Java Beans Fundamentals, JAR files, Introspection, Developing a simple Bean, Abutting to DB
Fundamental Techniques in Graphics: Raster browse line, amphitheater and ambit drawing, blubbery primitives, Polygon filling, band and polygon abridgement algorithms, 2D and 3D Geometric Transformations, 2D and 3D Viewing Transformations (Projections- Alongside and Perspective), Vanishing points. Geometric Modeling: Representing curves & Surfaces. Visible Apparent determination: Hidden apparent elimination. Apparent rendering: Illumination and concealment models. Basal blush models and Computer Animation. Books Recommended: 1. J. D. Foley, A. Van Dan, Feiner, Hughes Computer Cartoon Attempt & Practice 2nd copy 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 Algebraic Elements for Computer Graphics, McGraw Hill 2nd copy 1989. CSHT 615 Information Aegis (60 Lectures)
Introduction: Security, Attacks, Computer Criminals, Aegis Services, Aegis Mechanisms. Cryptography: Substitution ciphers, Transpositions Cipher, Confusion, diffusion, Symmetric, Asymmetric Encryption. DES Modes of DES. ,Uses of Encryption. ,Hash function,key exchange, agenda signatures,Digital Certificates. Affairs Security: Secure programs,Non awful Affairs errors, Awful codes virus,trap doors,salami attacks, buried channels,Control adjoin affairs Threats. Protection in OS: Anamnesis and Abode Protection, Admission control, Book Protection, User Authentication. Database Security: Requirements, Reliability, Integrity, Sensitive data, Inference, Multilevel Security.
Security in Networks: Threats in Networks s Networks aegis Controls, apprehension systems, Secure e-mails firewalls, Intusion Administrating Security: Aegis Planning, Risk Analysis, Organisational Aegis Policy, Physical Security. Ethical issues in Security: Protecting Programs and data. Information and law. Recommended Books: 1. C. P. Pfleeger, S. L. Pfleeger; Aegis in Computing, Prentice Hall of India, 2006 2. W. Stallings ; Arrangement Aegis Essentials: Applications and Standards, 4/E, 2010 CSHT 616 (i) Foundations of Software Testing Fundamentals of testing: Need for testing, process, The attitude of testing General testing principles, Fundamental test
Testing throughout the software activity cycle: Software development models, Assay levels (Unit, Integration, Arrangement Acceptance testing), Assay types (functional, non-functional, corruption testing), Maintenance testing Changeless techniques: Changeless techniques and the assay process, Assay action (types of review, roles and responsibilities), Assay architectonics techniques: The Assay Development Process, Categories of assay architectonics techniques, Specification-based or black-box techniques (Equivalence partitioning, Boundary amount analysis, Decision table testing, State alteration testing, Use case testing), Structure-based or white-box techniques (Statement testing and coverage, Decision testing and coverage, alternative structure-based techniques), Experience-based techniques, Choosing assay techniques
Test management: Assay alignment (test leader, tester), Assay planning and admiration ( Assay planning, Assay planning activities, Exit criteria, Assay estimation, Assay approaches), Assay advance ecology and ascendancy (Test advance monitoring, assay reporting, assay control), Configuration management, Risk and testing (Project risks, Product risks), Incident administration Web Appliance Testing Foundation: Basal assay planning and testing methods for web applications, Addition to gray-box testing and its appliance to testing web applications, Outline knowledge, methods and accoutrement for testing web applications, Addition to web testing accoutrement and sources, Addition to analysis accoutrement on the Net.
Tool abutment for testing: Types of assay tool, Assay apparatus classification, Apparatus abutment for administration of testing and tests, changeless testing, assay specification, assay beheading and logging, achievement and monitoring, specific appliance areas, appliance alternative tools, Effective use of tools: abeyant allowances 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 approach” Mc Graw Hill Testing Applications on the Web, 2nd Copy by Nguyen, Michael Hackett, and Bob Johnson (Wiley, 2003 CSHT 616 (ii) ARTIFICIAL INTELLIGENCE Introduction: (60 Lectures) Addition to Artificial Intelligence, Background and Applications, Turing Assay and Rational Agent approaches to AI, Addition to Intelligent Agents, their structure, behavior and environment.
Problem Analytic and Searching Techniques: Botheration Characteristics, Production Systems, Ascendancy Strategies, Breadth First Search, Depth First Search, Hill aggressive and its Variations, Heuristics Chase Techniques: Best First Search, A* algorithm, Constraint Satisfaction Problem, Means-End Analysis, Addition to Game Playing, Min-Max and Alpha-Beta pruning algorithms. Ability Representation: Addition to First Order Predicate Logic, Resolution Principle, Unification, Semantic Nets, Conceptual Dependencies, Frames, and Scripts, Production Rules, Conceptual Graphs. Programming in Argumentation (PROLOG). Dealing with 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 Alteration Nets. BOOKS RECOMMENDED: 1. 2. DAN. W. Patterson, Addition 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) Arrangement Programming and Administration Transport Band Protocols: TCP, UDP, SCTP protocol. Socket Programming: Socket Introduction; TCP Sockets; TCP Client/Server Example ; arresting handling; I/O multiplexing appliance sockets; Socket Options; UDP Sockets; UDP applicant server example; Abode lookup appliance sockets. Arrangement Applications: Remote logging; Email; WWWW and HTTP. LAN administration: Linux and TCP/IP networking: Arrangement Administration and Debugging. Books recommended: 1. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Unix Arrangement Programming, The sockets Networking API, Vol. 1, 3rd Edition, PHI. 2. B. A.
Forouzan: Abstracts Communications and Networking, Fourth edition, THM Publishing Company Ltd. 3. Nemeth Synder & Hein, Linux Administration Handbook, Pearson Education, 2nd Copy 4. R. Stevens, Unix Arrangement Programming, PHI 2nd Copy CSHT 616 (iv) Abstracts Mining Overview: Predictive and anecdotic abstracts mining techniques, supervised and unsupervised acquirements techniques, action of ability analysis in databases, pre-processing methods Abstracts Mining Techniques: Association Rule Mining, allocation and corruption techniques, clustering, Scalability and abstracts administration issues in abstracts mining algorithms, measures of allure Books Recommended: 1.
Introduction to Abstracts Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education. 2. Abstracts Mining: A Tutorial Based Primer, Richard Roiger, Michael Geatz, Information; Pearson Education 2003. 3. Addition to Abstracts Mining with Case Studies, G. K. Gupta, PHI,2006. 4. Insight Into Abstracts Mining: Approach And Practice, Soman K P,Diwakar Shyam, Ajay V, PHI, 2006 CSHT 616 (v) Combinatorial Admission Introduction: Admission problems, neighborhoods, bounded and all-around optima, arched sets and functions, canker method, degeneracy; duality and bifold algorithm, computational considerations for the canker and bifold canker algorithms-Dantzig-Wolfe algorithms.
Integer Beeline Programming: Cutting even algorithms, annex and apprenticed technique. Graph Algorithms: Primal-Dual algorithm and its appliance to beeline path, Math-flow problems Dijkstra’s algorithm, Max-flow problem, analogous problem, bipartite analogous algorithm, non-bipartite analogous algorithms. Books recommended: 1. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and complexity, Prentice-Hall of India, 2006 2. K. Lange, Optimization, Springer, 2004 3. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Beeline Programming and Arrangement Flows, John Wiley & Sons, 2004 4. H. A. Taha, Operations Research: An Addition (8th Edition), Prentice Hall, 2006
Order a unique copy of this paper