5th sem syllabi

College of Engineering
School of Technology

Syllabi
For
B-Tech Computer Science & Engineering (CSE)
5th Semester

(Semester-V)

Islamic University of Science & Technology

Awantipora, Pulwama Kashmir-192122
B-Tech Computer Science & Engineering

Semester-V

Course Code Course Title L–T–P Credit

CSE 501T Object Oriented Programming & System Design 3–1–0 4
CSE 502T Software Engineering 3 – 1– 0 4
CSE 503T Microprocessors 3–1–0 4
CSE 504T Algorithm Analysis & Design 3–1–0 4
CSE 505T Mathematics-V (Numerical Methods) 3–1–0 4
CSE 506T Environmental Science & Non-Conventional Energy 2–0–0 2
CSE 507T Computer Organization & Architecture 3–1–0 4
CSE 508P Object Oriented Programming & System Design Laboratory 0–0–2 1
CSE 509P Microprocessors Laboratory 0–0–2 1
CSE 510P Algorithm Analysis Lab 0–0–2 1
Total Credits 20 – 6 – 5 29

Object Oriented Programming and System Design

CSE-501T
L T P
3 1 0
Unit-I

Fundamental Object oriented analysis and Design

Object & classes, Links and Associations, Generalization and Inheritance, Aggregation,
Abstract classes, A sample object model, Multiple Inheritance, Meta data, candidate keys,
constraints.

Unit-II

Dynamic Modeling
Events and States, Operations and Methods, Nested state Diagrams, Concurrency, Relation of
Object and Dynamic Models, advanced dynamic model concepts, a sample dynamic model.

Unit-III

Functional Modeling
Functional Models, Data flow Diagrams, Specifying Operations, Constraints, a sample
Functional model.
Unit-IV

Translating object oriented design into an implementation, OMT Methodologies, examples

and case studies to demonstrate methodology, comparison of Methodology, SA/SD, and JSD.
Unit-V

Programming in C++
Limitations in structured programming-Characteristics of Object Oriented Language, Classes
and objects in C++, Functions, Constructors, Destructors, Inheritance, Functions overloading,
Operator Overloading, I/O Operations. Real life applications, Extended Classes, Pointer,
Virtual functions, Polymorphisms, Working with files, Class templates, Function templates.

Books Recommended:

1. Rambaugh James etal, Object Oriented Design and Modeling , PHI-1997

2. Bjarne Stroustrup, C++ Programming Language , Addison Wesley
3. Balagurusamy E, Object Oriented Programming with C++ , TMH, 2001
4. Booch Grady, Object Oriented Analysis and Design with application 3/e , Pearson
5. Lipman, Stanley B, Jonsce Lajole, C++ Primer Reading , AWL, 1999
6. Dillon and Lee, Object Oriented Conceptual Modeling , New Delhi PHI-1993
7. Stephen R. Shah, Introduction to Object Oriented Analysis and Design , TMH
8. Berzin Joseph, Data Abstraction: the object oriented approach using C++ , McGraw
Hill
9. Mercer, Computing Fundamental with C++ , Palgrave Macmillan

Software Engineering
CSE-502T
L T P
3 1 0
UNIT – 1:

Introduction:
Software Crisis, Software Processes, Software life cycle models: Waterfall, Prototype,
Evolutionary and Spiral models, Overview of Quality Standards like ISO 9001, SEI-CMM.
Software Metrics:
Size Metrics like LOC, Token Count, Function Count, Design Metrics, Data Structure
Metrics,
Information Flow Metrics.

UNIT – 2:

Software Project Planning:

Cost estimation, static, Single and multivariate models, COCOMO model, Putnam Resource
Allocation Model, Risk management.
Software Requirement Analysis and Specifications:
Problem Analysis, Data Flow Diagrams, Data Dictionaries, Entity-Relationship diagrams,
Software Requirement and Specifications, Behavioural and non-behavioural requirements,
Software Prototyping.

UNIT – 3:

Software Design:
Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented
Design, Object Oriented Design, User Interface Design.
Software Reliability:
Failure and Faults, Reliability Models: Basic Model, Logarithmic Poisson Model, Calender
time Component, Reliability Allocation.

UNIT – 4:

Software Testing:
Software process, Functional testing: Boundary value analysis, Equivalence class testing,
Decision table testing, Cause effect graphing, Structural testing: Path testing, Data flow and
mutation testing, unit testing, integration and system testing, Debugging, Testing Tools &
Standards.

UNIT 5:

Software Maintenance:
Management of Maintenance, Maintenance Process, Maintenance Models, Reverse
Engineering, Software Re-engineering, Configuration Management, Documentation.

Books Recommended:

1. R. S. Pressman, “Software Engineering – A practitioner’s approach”, 3rd ed.,

McGraw Hill Int. Ed., 1992.
2. K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International,
2001

Reference:
1. R. Fairley, “Software Engineering Concepts”, Tata McGraw Hill, 1997.
2. P. Jalote, “An Integrated approach to Software Engineering”, Narosa, 1991.
3. Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN,
1996.
4. James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons
5. I. Sommerville, “Software Engineering ”, Addison Wesley, 1999.

Microprocessors
 CSE-503T
L T P
3 1 0
UNIT I

Evolution and introduction to microprocessors, internal architecture(ALU, Register Array,

timing and Control Unit), Organization of microprocessor based system, Memory-Read only
Memory(ROM), Random access memory(RAM), Input/output devices, system bus,
microprocessor languages(machine language, assembly language), ASCII code.

UNIT II

8085 pinout diagram, function of different pins, data bus, address bus, multiplexing and
demultiplexing of address/data lines, control bus, control and status signals, internal
architecture (ALU, Register Array, timing and Control Unit),flags, state transition diagrams,
T-states (clock cycles), machine cycles, instruction cycles, basic interfacing devices (buffers,
tristate devices, decoders, encoders, latches),

UNIT III
8085 assembly language programming, Different addressing modes, instruction set,
arithmetic and logic operations, timing diagrams, basic interfacing concepts, interfacing
input devices, interfacing output devices, memory mapped I/O.

UNIT IV
Interrupts, Stack and Subroutines, counters and time delays, serial input/output and data
communication.

UNIT V
Interfacing peripheral devices, Programmable peripheral interface (8255), Programmable
keyboard display interface (8279), DMA controller (8237), Multi-purpose programmable
device (8155). Introduction to 8086 microprocessor and microcontrollers (Architecture and
pinout diagram).

Recommended books

1. Ramesh S Gaonkar, Microprocessor Architecture, Programming and Applications

with 8085. PRI Publishing (India) Pvt. Ltd.
2. Gilmore, Microprocessors, TMH India.
3. K.L. Short, Microprocessors and Programming Logic
4. M. Rafiquzzaman, Microprocessors: Theory and Applications (Intel and
Motorola)

Algorithm Analysis and Design

CSE-504T
 L T P
3 1 0
UNIT-I

Fundamentals- Time-space complexity and trade-off; Review of growth of functions,

Recurrences: The substitution method; the iteration method, The master method, Data
Structures for Disjoint Sets.
Divide and Conquer Approach: Merge Sort, Quick sort, Medians and Order statistics,
Strassen’s algorithm for Matrix Multiplications.

UNIT – II

Dynamic Programming: Elements of Dynamic Programming, Matrix Chain Multiplication,

Longest common subsequence and optimal binary search trees problems.
Greedy Algorithms: Elements of Greedy strategy, An activity selection problem, Huffman
Codes, A task scheduling problem.

UNIT – III

Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First Search,
Topological Sort, Strongly Connected Components, Algorithm for Kruskal’s and Prim’s for
finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort Algorithm for finding
Single source shortest paths. All pair shortest paths and matrix multiplication, Floyd –
Warshall algorithm for all pair shortest paths.

UNIT – IV

String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, String
Matching with finite automata, The Knuth-Morris Pratt algorithm.

UNIT V

NP-Complete Problem: Polynomial-time verification, NP-Completeness and Reducibility,

NP-Completeness Proof, NP-Complete problems.

Books Recommended:

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to

Algorithms”, 2nd Ed., PHI, 2004.

REFERENCES BOOKS:
1. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer
Algorithms”, Addition Wesley, 1998.
2. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications,
1999.
3. D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley, 1998
 Mathematics-V (Numerical Methods)
CSE 505T

L T P
3 1 0
Unit-I:

1. Finite Difference: Difference Table and its usage. The difference operators Δ , and
the operator E.
2. Interpolation: Interpolation with equal intervals, Newton’s advancing difference
formula. Newtons’s backward difference formula. Interpolation with unequal
intervals. Newton’s divided difference formula. Lagrange’s interpolation formula.
3. Central Differences: The central difference operator δ and the overraging operator
μ. Relations between the operators.Gauss forward and backward interpolation
formula, Sterlings, Bessel’s, Laplace and Everetts formulae.

Unit-II
1. Inverse interpolation: Inverse interpolation by (i) Langrange’s (ii) Methods of
successive e approximation & (iii) Methods of elimination of third differences
2. Numerical solution of algebraic and Transcendental Equations: Graphic Method,
Regular-Fast method, Balzano’s Process of bisection of intervals, Newton-Raphson
Method and its geometrical significance.

Unit-III:
1. Numerical Integration: Numerical Integration, General Quadrature Formula,
Simpson’s one-third and three-eight rules, Weddles’ rule, Hardy’s rule, Trapezoidal
rule.
2. Numerical differentiation : Numerical differentiation of a friction. Differential
coefficient of a friction in terms of its differences. Applications

Unit-IV
1. Difference Equations: Linear-homogeneous and non-homogenoeus difference
equations of order n with constant coefficient, and their solution, methods of
undetermined coefficient.
2. Numerical Solution of ordinary differential equations: Numerical solution of
ordinary differential equations, Picard’s method. Taylors series method, Euler’s
method, Runge-Kutta Method.

Unit-V
Laboratory: Writing computer programmes for numerical methods like Simpson’s rule,
Newton- Raphson method & Runga-Kutta method etc. Running of programme exercises in
C++.
Books Recommended:

1. Numerical Methods for Scientists and Engineering by M.K.Jain, S.R.Iyengar & R.K.
Jain, Wiley Eastern Ltd.
2. Mathematical Numerical Analysis by S.C. Scarborough, Oxford and IBH publishing
Company.
3. Introductory methods in Numerical Analysis by S.S.Sastry, Prentice Hall of India.
4. Numerical Solution of Differential equations by M.K.Jain.
5. Numerical Methods for Science & Engineering by R.G.Stanton.

Environmental Science & Non-Conventional Energy

CSE-506T
L T P
2
0 0

Unit- I
Introduction: Environmental Dilemmas; Agriculture, industrial and electronic revolution &
its effects; Resource conservation, Photosynthesis, solar energy and eco-system; Food chains;
carbon cycle; nitrogen and sulphur cycle

Unit-II
Major world eco-systems; environmental health hazards; the weather engine; human-caused
global climate change; greenhouse gases and effect, global warming; cutting emissions; air
pollution; water pollution; pollution control
Unit-III
Solar, biogas, wind, tidal, Geo thermal energy, Wind and tidal energy generation, Ocean
thermal energy conversion (OTEC): Geo thermal energy –hot springs and stream injection,
Unit-IV
Energy from the sun (solar energy), Techniques of collection, storage and utilization of solar
energy, types of solar collectors, selective surfaces, heating cooling, drying, power
generation,
Unit-V
Solar cells, I-V characteristics, Form-Fill Factor, Efficiency of photo-voltaic cells,
Fabrication of Photo-voltaic cells and arrays, sizing of arrays. Fission energy, Reactors,
controlled fission of hydrogen,
Recommended Books:
1. Environmental Science, WP Cunningham and Saigo BW, WC Brown
communications Publications, IIIrd Edition, 1995 USA.
2. Davis, GR, Energy for planet Earth, Scientific American, (WH Freeman) 1991.
3. Lester RK, Rethinking Nuclear Power, Scientific American, March 1986.
4. Cavallo AJ, Wind Energy: Technology and Economics, 1993 Wash. DC.
5. Yamakawa Y, Photovoltaic Power, Scientific American, April 1986.

Computer Organization & Architecture

CSE-507T
L T P
3 1 0
UNIT-I:

Basic Computer Organization and Design

Instruction Codes, Computer Registers, Computer Instructions, Timing and Control,
Instruction Cycle, Memory-Reference Instructions, Input-Output and Interrupt, Complete
Computer Description. Control Memory, Address Sequencing, Micro program Example.

UNIT-II:

Register Transfer and Micro-operations

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Mic
ro-operations, Logic Micro-operations, Shift Micro-
operations,Arithmetic Logic Shift Unit.

UNIT-III:

Central Processing Unit

Introduction, General Register Organization, Stack Organization, Instruction Formats, Addr
essing Modes, Data Transfer and Manipulation, Program Control. Computer Arithmetic:
Addition and Subtraction, Decimal Arithmetic Unit.

UNIT-IV:

Input-Output Organization
Peripheral Devices, Input-Output Interface, Asynchronous Data Transfer, Modes of Tra
nsfer, Priority Interrupt, Direct Memory Access.
UNIT-V:

Memory Organization
Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory, Cache Mem
ory, Virtual Memory.

Recommended Books:

1) M Mano, “Computer System and Architecture”, PHI.

2) W. Stallings, “Computer Organization & Architecture”, PHI.
3) J. P. Hayes, “Computer Architecture and Organization”, McGraw Hill
4) J. L Hennessy and D. A. Patterson, “Computer Architecture: A quantitative
approach”, Morgon Kauffman, 1992.
5) Computer Systems Organization and Architecture, John D. Carpinelli,
Pearson Education Inc.

Object Oriented Programming and System Design Lab

CSE-508P
L T P
0 0 2

1. Program illustrating function overloading feature.

2. Programs illustrating the overloading of various operators
Ex: Binary operators, Unary operators, New and delete operators etc.
3. Programs illustrating the use of following functions:
a) Friend functions. b) Inline functions c) Static Member functions
d) Functions with default arguments.
4. Programs to create singly and doubly linked lists and perform insertion and deletion
Operations.
Using self referential classes, new and delete operators.
5. Programs illustrating the use of destructor and the various types of constructors (no
arguments, constructor, constructor with arguments, copy constructor etc).
6. Programs illustrating the various forms of inheritance:
Ex. Single, Multiple, multilevel, hierarchical inheritance etc.
7. Write a program having student as on abstract class and create many derived classes such
as
Engineering, Science, Medical, etc. from student class. Create their objects and process
them.
8. Write a program illustrating the use of virtual functions.
9. Write a program which illustrates the use of virtual base class.
10. Write a program which use the following sorting methods for sorting elements in
Ascending order. Note: use function templates
a) Bubble sort b) selection sort c) quick sort.
11. Write program which illustrates the use of class templates.
 Ex. a) Stack class b) Queue class.
12. Write programs illustrating file handling operations:
Ex. a) Copying a text file b) Displaying the contents of the file etc.
13. Write programs illustrating the console I/O operations.
14. Write programs illustrating how exceptions are handled (ex: division-by-zero,
overflow and underflow in stacks etc.).

Microprocessors Laboratory
CSE-509P
L T P
0 0 2

LIST OF EXPERIMENTS

1. To write a program to add two single byte numbers.

2. To write a program to subtract one 8-bit number from another 8-bit number.
3. To write a program to multiply two single byte numbers.
4. To write a program to divide one number by another.
5. Write a program to introduce a time delay using subroutine.
6. Write a program to find the greatest of three numbers
7. To write a program to read data from an input device and send its complement to
output.
8. To write a program to rotate a stepper motor both in clockwise and anti-clockwise
direction
9. To design and interface a circuit to read data from analog to digital converter, using
8255A in the memory-mapped I/O.
10. To design and interface a circuit to convert digital data into analog signal, using
8255A in the memory-mapped I/O.

Algorithm Analysis Lab

CSE-510P
L T P
0 0 2
The following problems are to be solved in C++
1):- Simple Experiments on time and space complexity of a program
Graphical representation of time and space complexity.
2):-Implementation of Sorting and Searching algorithms (analysis of
time complexity)
3):- Implementation of the following methods on the given problems
and determination of time complexity: Divide and Conquer method
,Greedy method ,Dynamic Programming – Traversal techniques
Backtracking – Branch and Bound.
4):- Game Simulation.

Love Cricket? Check out live scores, photos, video highlights and more. Click here.