This action might not be possible to undo. Are you sure you want to continue?

1 2 3 4 5 6 7 Topic Introduction Computer system structures Operating system structures Processes Threads CPU Scheduling Process Synchronization 1 2.1 – 2.5 3.1 – 3.8 4.1 – 4.5.4 5.1 – 5.4, 5.7 6.1 – 6.5,6.7.3 7.1 – 7.4, 7.5.1 – 7.5.2 8 9 10 11 12 13 14 15 16 Deadlocks Memory Mgt. Virtual memory File system interface File system interface Mass storage structures Protection Security Device Management 8.1 – 8.3 9 10.1 – 10.6 11 12.1 – 12.7 14.1 – 14.4 18.1 – 18.2.2 19.1 – 19.4 5 [1] [1] [1] [1] [1] [1] [1] [1] [2] Chapter Reference [1] [1] [1] [1] [1] [1] [1]

References : [1] Operating Systems concepts by Silberchaltz Galvin (VI th edition) [2] Operating Systems: A Modern Perspective (G.Null) 402 – Software Engineering Chapter 1 The Product 2 The Process 3 The Project management concepts 4 Software Process and Project metrics 5 Software Project Planning 6 Risk analysis and Management 7 Project Scheduling and tracking 8 Software Quality Assurance 9 Software configuration management 10 System engineering 11 Analysis Concepts and Principles 12 Analysis modeling 13 Design Concepts and principles 14 Architectural Design 17 Software testing Techniques 18 Software Testing Strategies Topic Upto 1.2 Complete Upto 3.2 Upto 4.5 Complete 6.1-6.4,6.6 7.1.2,7.2,7.3,7.6,7.7 8.1,8.3,8.4,8.6,8.7,8.8,8.10 Complete Upto 10.3 Upto 11.3 Complete Complete 14.1,14.2,14.5,14.6 Upto 17.6.4,17.7.3 18.1 except 18.1.4,18.3-18.6 [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] Reference

Aggarwal and Yogesh Singh 403 – Programming Paradigms S.6 Complete Complete Reference [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [1] [2] [2] [3] References: [1] Programming languages.Sommervlle(Addison Wesley) • Fundamentals of Software Engineering by C.2. • Pedrycz (John Wiley) • Software Engineering by I.6 Except 2. V Edition by – Roger S. References: [1] Software Engineering – A Practitioner’s Approach.Peters. complex exponential function 2.1.K.E.Pratt and Marvin V. Narosa.2. • Software Engineering Fundamentals by Ali Behforooz.3.7 Programming in Prolog Topic Except 1.3 Case of complex roots.7) by Pearson Education. [2] Programming languages By Ravi Sethi Addisson Wesley.2 Only 4. • Software Engineering : An Engineering approach by J.5.2 to 19.D Mandrioli(PHI) • System Analysis and Design by Elias M.5.5 & 2.2.2.1 Homogeneous linear equations of second order 2.Ghezzi. Frederick J.4 Except 6. by K.No. 404 – Differential Equations SECTION WITH TITLE 2.6 Euler-cauchy equation 2.2 Except 5. M. Design and Implementation Edition by Terrence W.4 Differential operators 2.Second order Homogeneous equations with constant coefficients 2. may be done from Jalote or any other book mentioned in other references.F.4 Upto 3.71 Typical problems to be done in the class 1 – 26 p. Awad(Galgotia).7 [1] Note : Emphasize must be on case studies.4 Complete Complete Till page 426 A.2.Hudson (Oxford) • Introduction to S. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Chapter Language Design Issue Impact of M/C architecture Language translation Issue Modelling Language Properties Elementary data types Encapsulation Inheritence Sequence Control Subprogram Control Storage Management ML LISP Language Description Logic Programming 1.19 Technical Metrics for Software 19.W.7 REF [1] THEORY CLASSES 2 All examples theory without proof 1 PROBLEMS + LAB WORKS 3-19 p. Ivan Bratt.Jazayeri. 83 1 – 18 and 20 p. 96 1 – 17 CLASSES 2 [1] 1 [1] 1 1 [1] [1] [1] Explanation 1 2 2 2 1 .2.5 Except 7.5 Except 2. 80 1 – 14 p.7 A. 75 1 – 23 p.Zelkowitz.Pressman (McGraw Hill) Other References: • Software Engineering by Pankaj Jalote . [3] Programming in Prolog for AI edition (Ch.3.

xV or . Differential equations 5. 198 1 –21 p. (Vis a function of x) including cases of failure. Second shifting theorem Dirac’s Delta function [1] [1] [1] One e. p.H.9. Legendre polynomial 4.6 Bessel functions of second kind 5.B. : edition.g.7 8.20. Analytical and Computational methods of Advanced Engineering Mathematics by G. cosax/ sinax.4 Differentiation and integration of transforms 5. [1] [2] .C.Ross.1 Power series method 4.17.1 9.13 p 273 2 2 2 5.13.111 1 –12 p.5 Bessel’s equation.13.3 Unit step function. T.Existence and Uniqueness theory.9. 273 lab work: sketching 2. and 4 of [2] may be referred for explaining relevant examples. References: Advanced Engineering Mathematics by Erwin Kreyszig. Additions: 1.3 Legendre’s equation. 216 11.2. 2.14. 103 1 – 17 p. [3] Differential Equations : An introduction with Mathematica by C. C. Note 2: [3] may be referred for further reading. Preliminary ideas of first order differential equation with special reference to integrating factors. Wronskian 2.23. 226 1 1 3 [1] [1] [1] 1-9 12. 100 [1] [1] [1] [1] 1 1 1 2 theory to be explained without proof of theorem and with e.Wilcox. p.) § 5-1.7.3.4 Frobenious method 4.T.10. with its application to Sin ax and or cos ax Laplace Transform (L. 13.5.10 Solutions by variation of parameters 4.8 Non-homogenous equations 2.7 Systems of differential equations [1] [1] Only method to be explained 1 Only examples to be explained 1 1 – 14 p 283 1 Note 1 : Chapter 2.3.209 2 – 15. Bessel functions 4.2 Theory of power series method p. of each case 1 Recurrence relation and all formulas existing in the theory and problems Explanation only 1 Examples to be explained 1 Theorems without proof. 3.15.8.1516.Gustafson.3. of power series 1. . p. § 5-5 (Convolution) [1] Evaluations os somr integrals as with the help of L. 204 1 2 1 2 4. 10 p.g. Operator methods for finding particular Integrals for cases when are (x) is of the type . p.20 p 264 2. 12.8.6. problems and examples 1.21.2 Transforms of derivatives and integrals.

c). WAP for implementing medical diagnostic system.e] Power of a no.5. Q.6.10.9.q).4. Palindrome Q. Multiplication of two numbers using recursion.b.1.r). edge (q.r). Consider a cyclic directed graph [edge (p.g. (H) Computer Science Semester IV Lab. Q. WAP to generate integers from 1 to 100 by back tracking on successive calls (use accumulator) Q. edge (q. Reversing a list Finding last element of list /2 nd/last/n th element Obtain a list after deleting all occurrences of a particular element from a give list. Q.8.2. [a. Q. Appending of 2 lists Delete all occurrence of an element Remove duplicates Write a program to flatten the given list e.B. .[a. WAP for implementing login routine which prompts a user for username and password.c. Q. Traverse a binary tree in preorder/post order/in-order. Assignments : PROLOG Q. Q. Edge (s. Merging two ordered list.t)] where edge (A. WAP for the following: (a) (b) (c) (d) (e) (f) (g) Q.s).(b.d. WAP using recursion (a) (b) (c) (d) (e) (f) Quick sort/Insertion sort/Bubble sort Tower of havoi Fibonacci series Factorial Generates a list of all permutations of the elements in a list of members.Sc.(d).3.e] i.e. edge (q.B) is a predicate indicating directed edge in a graph from a node A to a node B WAP to check whether there is a route from one node to another node.7.

Sign up to vote on this title

UsefulNot useful- Cylindrical SOV
- Syllabus2011BME210(1)
- DSCI 320 Test 1 – Practice Tests Chs 1-8
- Lec 5
- CTE I - Computer Basics (1)
- B.Tech-1
- Mutiple Choice Computer Knowledge
- Computer System
- Bpharma2013 Admission
- MELJUN CORTES Software Basis Operating System
- ZahiaEtAl2004 Falta Esse
- CAT 1997 Solutions
- 3-Civil
- Sybullas It
- De Answers
- 3D Static and Dynamic Analysis
- 02 Equi
- anish-140323065528-phpapp02
- SPM-M.tech_
- Rib AlgI Spr07
- I Predavanje
- Paper
- Process Dynamics and Control 2011 for Students
- TECHNIQUE APPLICATION MATHEMATICS SPM
- Ma 209
- 2015 1 Ked Mahsuri (q)
- Step Method Procedure.pdf
- Math Equation Solver
- CV
- small signal stability of SMIB without amortisseur.pdf
- IVsemester