You are on page 1of 7

6th Sem Inforamtion Science Syllabus IS 601: SOFTWARE ENGINEERING Note: FOUR questions from Part A and FOUR

questions from part B to be set. Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set 4 Hours/ week Class Marks: 25 Exam. Marks: 100 PART A Chapter 1. Introduction 6Hours Software products and software process, Process models, Waterfall model, Evolutionary development, Boehms spiral model and overview of risk management, Process visibility, Computer-based systems Engineering: Systems and their environment, System procurement, System engineering process, System architecture modelling, Human factors, System reliability engineering. Chapter 2. Requirements Engineering 6Hours Requirements engineering process, The software requirements document, Validation of requirements, Evolution of requirements. Analysis of requirements: Viewpointoriented analysis, Method-based analysis., System models: Data-flow models, Semantic data models, Data dictionaris, REquirements definition and specification non-functional requirements. Prototyping in the software, proceed and prototyping techniques, user-interface prototyping. Chapter 3. Software Design 6Hours Design process and strategies, Design quality: Architectuaral Design: System structuring, control models, modular decomposition, Domain-specific architectures; Function-orinted Design: Data-flow design, structural decompositioning, Detailed design. Chapter 4. User-Interface Design, Reliability 6Hours User-Interface Design: Principles, User-System interactions, Information presentation, User guidance, Interface evaluation. Relialbilty: REliability metrics, Reliability specification, Statistical Testing, REliability growth modelling. Programming for Reliability: Fault avboidance, Fault tolerance, Exception Handling, Defensive programming.

PART B Chapter 5. Verification and Validation 6Hours V and V: The testing process, Test planning and Test strategies; Defect Testing; Blackbox testing, Structural testing, Interface testing, Static verification: Program inspections, Mathematically-based verification, Static analysis tools, Cleanroom softwaare development. Chapter 6. Project Management 6Hours

Managing People: Cognitive fundamentals and Management implications, Project staffing, Group working, Working environments. Software cost-estimation: Productivity and productivity metrics(code size, function point count), Costestimation techniques, Algorithmic cost modeling(single variable and COCOMO matrix models), Project duration and staffing. Chapter 7. Quality Management 6Hours Quality: Procss quality assurance(including overview of ISO 9000), Quality reviews, Software standards, Documentation standards, Software metrics, Product Quality Metric. Chapter 8. Process Improvement, CASE 6Hours Process and product quality, Process analysis and modeling, Process measurement, The SEI capability Maturity model, Process classification. Introduction to CASE, CASE classification, Integrated CASE, The CASE life cycle. REFERENCES: 1. Ian Sommerville, Software Engineering, Fifth Edition, Addison-Wesley, 1996. 2. Roger S. Pressman, Software Engineering. A Practitioners Approach, Fourth Edition, Mcgraw-Hill, 1997. 3. K. K. aggarwal ebnl: Software Engineering, New Age International Publisher, 2001. 4. Stephen R Sehach: Object Oriented & Classical Software Engineering, McGrawHill, 2002. 5. Software Engineering with Java Schach, TMH, 1998. 6. Pankaj Jalote: Software Engineering, Narosa Publication.

IS. 602 LINUX INTERNALS Note: FOUR questions from Part A and FOUR questions from part B to be set. Students should answer FIVE questions selecting at least TWO from each part. For every SIX hours of syllabus ONE question may be set 4 Hours/ week Class Marks: 25 Exam. Marks: 100

PART A CHAPTER 1: INTRODUCTION 12Hours LINUX The Operating System: Comiling the Kernel, Introduction to the Kernel: Important data structures, Main algorithms, Implementing System Calls, Memory Management: Architecture independent memory model, Virtual Address space for a process, Block device caching, Pages under LINUX. CHAPTER 2: IPC, FILE SYSTEM 12Hours IPC: Synchronization in the kernel communication via files, Pipes Debugging using ptrace, System V IPC, IPC with sockets. File system: Basic Principles, Representation of Files system in the kernel, The Proc file system and Ext 2 file system. delete

PART - B CHAPTER 3: DEVICE DRIVERS, MODULES AND DEBUGGING 12Hours Device Drivers: Character and Block devices, Polling and interrupts, The hardware, Implementing in the passing, The Kernel daemon, An examples module, Debugging: Concepts, The debugger printk(), Debugging with gdb. CHAPTER 4: NETWORK IMPLEMENTATION 6Hours Introductory concepts, Important Structures, Network Device under LINUX, ARP, IP, UDP and TCP the packet interface. CHAPTER 5: SYSTEM CALLS, COMMANDS, FILE SYSTEM, BOOT PROCESS. 6Hours System Calls: Process Management. The file system communication Memory management, Initialization. All that remains, Kernel- related commands: free ps, top init, shutdown, strace, traceroute, mount, configuring kernel network interface, Serial Interface, and Parallel Interface. The Proc file system The/ Proc/ Director, the net/ directory/ the self/ director, the sys/ directory. The boot process: carry out boot process. LILO- The LINUX Loader. REFERENCES: 1. M. Beck etal LINUX Kernel Book, John Wiley, 1998. 2. Reny card etal The LINUX Kernal Book, John Wiley 1998. 3. Mark G Sobel A Practical Guide to LINUX, Addison Wesley 1997.

CI 606: DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY (Regular Laboratory) 3 Hours/week Class Marks: 25 Exam. Marks: 100 Problems on: Kruskals algorithm Prims algorithm Shortest path, Scheduling Time and space complexity of binary search Quicksort

Dynamic Programming: Knapsack problem Floyds algorithm DFS & BFS- searches Queen problem Assignment problem: Travelling sales person problem


4 Hrs/week Class Marks: 25 Exam Marks: 100 PART A Chapter 1: ELEMENTRY ALGORITHMS (12 Hrs) Introduction, Problems and instances, The efficiency of algorithms, Average and worst-case analysis, Examples, Asymptotic notation, and other operation on asymptotic notation, Problems. Analysis of algorithms, Analysis of control structure. Greedy algorithms: General characteristics, Graphs, Kruskals algorithm and Prims algorithm, Shortest paths, The Knapsack problem, Scheduling problems. Chapter 2: DIVIDE AND CONQER (6 Hrs) Introduction, Binary search, sorting by merging, Quick sort, Finding the median, Matrix multiplication, Exponentiation. Chapter 3: DYNAMIC PROGRAMMING (6 Hrs) Principle of optimality, The knapsack problem, shortest paths, Chained matrix multiplication, Approaches using recursion, Memory functions. PART B Chapter 4: EXPLORING GRAPHS (18 Hrs) Depth-first search, Breadth-first search, Backtracking and Branch-and-bound. Computational complexity: Information-theoretic arguments, Adversary arguments, Linear reduction, Introduction to NP-complements. Chapter 5: HEURISTIC AND APPROXIMATE ALGORITHMS (6 Hrs) Heuristic algorithms, Coloring a graph, the traveling salesperson, Approximate algorithms, The metric traveling salesperson, The knapsack problem, Bin packing. References: 1. Gilles Brassard & Paul Bratley, Fundamental Algorithms, Prentice-Hall. 2. Cormen, Leizerson & Rivest, Introduction to Algorithms, Prentice-Hall. 3. Aho, HopCroft, Ullman, The Design and Analysis of Computer Algorithms, Addison-Wersley. 4. Horowitz & Sahni, Fundamentals of Computer Algorithms, Galgotia Publication. 5. Mastering Algorithm with C: O` Reilly, Kye London, 2001. 6. A.M. Padma Reddy, Analysis and Design of Algorithms, Sri Nandi Publications.

CI 602: DATA COMMUNICATIONS 4 Hrs/week Class Marks: 25 Exam Marks: 100 PART A Chapter 1: INTRODUCTION (6 Hrs) Data communication, Networking, Protocols and Protocol architecture, standards, Data transmission concepts, Analog and Digital transmission, Transmission impairments. Chapter 2: TRANSMISSION MEDIA (18 Hrs) Guided transmission media and wireless transmission, Data encoding Digital and Analog data and signals, spread spectrum, Data communication interface asynchronous and synchronous transmission, line configuration and interfacing, Data link control Flow control, Error detection and error control, HDLC and

other data link protocols, Multiplexing Frequency division, synchronous time division, and statistical time division multiplexing. PART B Chapter 3: SWITCHING (12 Hrs) Switched networks, Circuit switched networks, Switching concepts, Routing in circuit - switched networks, Control signaling, Packet switching principles, Routing and congestion control, x.25 protocol standard. Chapter 4: LOCAL AREA NETWORKS (12 Hrs) LAN technology LAN architecture, Bus / tree ring, star and wireless LANs, LAN systems Ethernet and fast Ethernet (CSMA / CD), token ring and FDDI, 100 VG - Any LAN, ATM LANs, Fiber channel, wireless LANs, Bridges Bridge operation and routing with bridges. References: 1. W. Stallings, Data and Computer Communications, Fifth Edition, PHI, 1998. 2. A.S. Tenenbaum, Computer Networks, Third Edition, PHI, 1996. 3. S. Keshav, An Engineering approach to Computer Networking, Addison Wesely. 4. Michael A Miller, Data & Network Communication, Thomson Learning, 2001. 5. Behrouz a Forouzn, Data Communications & Networks, 2nd Edition, TMH, 2000. 6. James Martin, Telecommunication & the Computers, 2000. 7. Mark Campa, Designing 7 Complementary, Thomson Learning, 2001. 8. Shay, Data Communication & Networks, Thomson Learning, 2001.

CI 603: OPERATING SYSTEMS Note: Four questions from Part A and Four questions from Part B to be set. Students should answer Five questions selecting at least Two from each part. For every six hours of syllabus one question may be set. 4 hrs/week Class Marks: 25 Exam. Marks: 100 PART A

Chapter 1: INTRODUCTION Batch Systems, Concepts of Multi-Programming and Time sharing, Parallel, Distributed and real-time systems, Operating Systems, Operating system structures- Operating system components and services, System calls and System programs, Virtual machines. Chapter 2: PROCESS MANAGEMENT Process concept, Process scheduling, Cooperating processes, Threads and interprocess communication, CPU scheduling- Scheduling criteria, Scheduling algorithms, Multiple processor scheduling and real-time scheduling, Algorithm evaluation. Chapter 3: PROCESS SYNCHRONISATION AND DEAD LOCKS The criteria section problem, Synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions and monitors. Dead locks- System model, Characterization, Dead lock prevention, Avoidance and detection, Recovery from dead lock, Combined approach.


Memory management- Logical and physical address space, Swapping, Contiguous allocation, Paging and Segmentation. Segmentation with paging in MULTICS and Intel 386. Virtual Memory- Demanding paging and its performance. Page replacement algorithms. Allocation of Frames. Thrashing, Page size and other considerations. Demand segmentation, File system, Secondary storage structures, Protection and Security, File Concept, Access methods, Directory structure, Protection and consistency semantics. File system structure, Allocation methods. Free space managements, Directory implementation. Efficiency and performance, Recovery, Disk structure, Disk scheduling methods. Disk management, Swap-apace management, Disk reliability. Chapter 5: PROTECTION AND SECURITY Protection- Goals of protection, Domain of protection, Access matrix and its implementation, Revocation of access. Security- Authentication, Passwords. Threats and threat monitoring. Encryption. Computer security classifications. Chapter 6: CASE STUDY Windows NT, Design principles, System components, Environmental subsystems, File system, Networking and Programmer interface. References: 1. Silberaschalz and Galvin, Operating System Concepts, Fifth Edition, AddisonWesley, 1998. 2. Milan Milancovie, Operating Systems, Concepts and Design, Second Edition, McGrawHill, 1992. 3. Harvey M Deital, Operating Systems, Second Edition, Addison-Wesley, 1990. 4. Dhamdhere: System Programming & Operating Systems, TMH, 2000. 5. Singhal & Shivaratri: Operating Systems, TMH, 2001. 6. Godbole: Operating Systems, TMH, 2001.

CI 604: ARTIFICIAL INTELLIGENCE Note: Four questions from Part A and Four questions from Part B to be set. Students should answer Five questions selecting at least Two from each part. For every six hours of syllabus one question may be set. 4 hrs/week Class Marks: 25 Exam. Marks: 100 PART A Chapter 1: INTRODUCTION Artificial Intelligence: Its scope, History and application, AI as representation and search. The predicate Calculus, Interference rules, A logic based financial adviser, Structures and strategies for state space search, Graph theory, Strategies for space search, Using state space to represent reasoning with the predicate calculus. Chapter 2: HEURISTIC SEARCH Heuristic search: An algorithm for Heuristic search, admissibility, Monotonicity and Informedness. Heuristics in games. Complexity issues, control and implementation of state space search-predicate calculus and planning, The Black Board architecture for problem solving. Chapter 3: KNOWLEDGE BASED SYSTEMS Knowledge- Intensive problem solving- Overview of expert system technology, Rule based expert systems. Model based reasoning, Case based reasoning. The knowledge representation problem, Reasoning with uncertain or incomplete information- The statistical approach to uncertainty. Non-monotonic systems, Reasoning with fuzzy sets.

PART B Chapter 4: KNOWLEDGE REPRESENTATION AND LISP Knowledge representation- Languages, Issue in knowledge representation. A survey of network representation, Conceptual graphs, A network representation language, Structured representations. Further issues in knowledge representation. Introduction to LISP- Search in LISP, A functional approach to the farmer, wolf, goat and cabbage problem. Higher-order functions and procedural abstraction. Search strategies in LISP. A recursive unification function. Interpreters and embedded languages. Logic programming in LISP. Streams and delayed evaluation. An expert system shell in LISP. Chapter 5: AUTOMATED REASONING Automated reasoning- Weak methods in theorem proving, The general problem solver and difference tables. Resolution theorem proving. Further issues in automated reasoning. Machine learning: Connectionist- Foundations for connectionist networks, perception learning, back propagation learning, Competitive learning Hebbian coincidence learning, Attractor networks or memories. Machine learning: Social and emergent-models, the genetic life and society based learning. References: 1. G.F. Luger and W.A. Subblefield, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, Third Edition, Addison-Wesley, 1998. 2. P.H. Winston, Artificial Intelligence, Third Edition, Addison-Wesley, 1992. 3. E. Rich and Knight, Artificial Intelligence, Second Edition, TMH, 1991.