Draft Submission to Board of Studies, IITE, Indus University from

Department of Computer Engineering

SEMESTER
VIII

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
VIII
Subject: Major Project - II
410801
Teaching Scheme

Theory

Practic
al

Tutori
al

Credi
ts

--

---

--

16

Semester:
Subject

Examination Scheme
Continuo
University
us
Mid Sem
Examinati
Evaluatio
Evaluation
on
n
(Practical)
(Practical)
(Practica
l)
200 Marks

100 Marks

code:

Total
Marks
------500

200 Marks

Aim: To implement a real world scenario or client requirement in e-world.

Learning Objectives: The primary objective of the Project work is to
transform students into an engineer who understands and can do all that is
required to do an excellent job: meeting deadlines, overcoming obstacles,
communicating effectively, and producing a high quality project result and
report.
Course Outcome:

An opportunity to improve teamwork and communication skills

An opportunity to be involved in multidisciplinary research

It allows specializing further in a topic of interest

It is the work that prospective employers will most likely ask about
during a job interview

It is an opportunity to closely work with and receive career advice from

a faculty member

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
VIII
Subject:
Statistical
And
Subject code: 410802
Teaching Scheme
Theory

Practic
al

Tutori
al

Semester:
Numerical

Methods

Examination Scheme
Credi
ts

03
----03
Hrs
Learning Objectives:

University
Examinati
on
(Theory)

Mid Sem
Examinati
on
(Theory)

Continuo
us
Evalution
(Theory)

University
Examinati
on
(Practical)

Mid Sem
Examinati
on
(Practical)

Continuo
us
Evalution
(Practical
)

Total
Marks

60
Marks

30
Marks

10
Marks

---

---

---

100

1) To develop a thorough understanding of the methods of probability and

statistics which are used to model engineering problems.
2) To gain knowledge in measures of central tendency and dispersion
3) To appropriately choose, define and/or derive probability distributions such as
the Binomial, Poisson and normal distribution to solve engineering problems.
4) To learn how to formulate and test the hypotheses about means, proportions
and standard deviation to draw conclusions based on the results of statistical
tests in large sample.
5) To get exposed to finite differences and interpolation
6) To be thorough with the numerical Differentiation and integration
UNIT I - TESTING OF HYPOTHESIS (12 hours)
Introduction - Large sample tests based on normal distribution - Test for single
mean, difference between means - proportion, difference between proportions standard deviation, difference between standard deviation -Chi-square test for
goodness of fit - Independence of attributes.
UNIT II - ANALYSIS OF VARIANCE (12 hours)
Small sample tests based on t and F distribution - Test for, single mean, difference
between means, Paired t-test, test for equality of variances. ANOVA one -way
classification, Two-way classification.
UNIT III - SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS (12 hours)
Newton-Raphson method- Gauss Elimination method Pivoting Gauss Jordan
methods Iterative methods of Gauss-Jacobi and Gauss-Seidel - Matrix Inversion by
Gauss Elimination and Gauss Jordan method - Eigenvalues of a matrix by Power
method .
4

CE Syllabus
27-4-2015
UNIT IV - FINITE DIFFERENCES AND INTERPOLATION (12 hours)
First and Higher order differences Forward differences and backward differences
and Central Differences Differences of a polynomial Properties of operators
Factorial polynomials Shifting operator E Relations between the operators.
Interpolation Newton-Gregory Forward and Backward Interpolation formulae Divided differences Newtons Divided difference formula Lagranges Interpolation
formula Inverse interpolation.
UNIT V - NUMERICAL DIFFERENTIATION AND INTEGRATION (12 hours)
Numerical Differentiation and Integration: Newtons forward and backward
differences formulae to compute first and higher order derivatives The Trapezoidal
rule Simpsons one third rule and three eighth rule.
TEXT BOOKS
1) S.C.Gupta & V.K.Kapoor, Fundamentals of Mathematical Statistics, Sultan
Chand and Sons, New Delhi, 11th edition, 2007.
2) B.S. Grewal, Numerical Methods, Khanna Publishers, 42nd edition, 2012.
REFERENCES
1) P. Sivarama Krishna Das & C.Vijayakumari, A text book of statistics and
Numerical methods, Vijis academy, 2010.
2) Dr. M.K. Venkataraman, Numerical Methods in Science and Engineering,
National Publishing Co., 2005.
3) S.S. Sastry, Introductory Methods of Numerical Analysis, 4th edition, 2005.
4) E. Balagurusamy, Computer Oriented Statistical and Numerical Methods,
Tata McGraw Hill., 2000.
5) P.Kandasamy etal., Numerical Methods, S. Chand & Co., New Delhi, 2003.

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
VIII
Subject:
Simulation
Subject code: 410803
(Department Elective-III)
Teaching Scheme
Theory

Practic
al

Tutori
al

Semester:
And

Modeling

Examination Scheme
Credi
ts

University
Examinati
on
(Theory)

Mid Sem
Examinati
on
(Theory)

Continuo
us
Evalution
(Theory)

University
Examinati
on
(Practical)

Mid Sem
Examinati
on
(Practical)

Continuo
us
Evalution
(Practical
)

Total
Marks

---

100

03
60
30
10
----03
----Hrs
Marks
Marks
Marks
Objective: To acquaint the student to modeling and simulation techniques for
discrete, dynamic
and stochastic systems.
UNIT I - INTRODUCTION (12 hours)
Introduction: Systems, models, deterministic and stochastic systems, static and
dynamic systems, discrete event simulation, continuous simulation, Monte Carlo
simulation.
Discrete Event Simulation: Time-advance mechanisms, event modeling of
discrete dynamic systems, event graphs, process oriented and event oriented
approaches, single-server single queue model.
UNIT II GPSS (12 hours)
GPSS: Program model, entities and transactions, blocks in GPSS, user defined
functions, SNA, logic switches, save locations, user chains, tabulation of result,
programming examples.
UNIT III - RANDOM NUMBER GENERATION (12 hours)
Random Number Generation: Congruence generators, long period generators,
statistical quality measures of generators, uniformity and independence testing, chisquare and other hypotheses testing, runs testing.
UNIT IV - RANDOM VARIATE GENERATION (12 hours)
Random Variate Generation: random variable, probability density and
distribution functions, Location, scale and shape parameters, discrete and
continuous probability distributions; Inverse transform method, composition and
acceptance-rejection methods, efficiency and quality measures of generators; Input
6

CE Syllabus
27-4-2015
Modelling, selection of distribution for a random source, fitting distributions to data,
constructing empirical distributions from data.

UNIT V - RANDOM PROCESSES AND QUEUING MODELS (12 hours)

Random Processes and Queuing Models: random process, discrete/continuous
time processes, Markovian property, Markov chain, state transition diagrams, birthdeath process, Littles theorem, steady state analysis of M/M/1 model; multi-server
models, M/G/1 and other queuing models, Burkes theorem, network of queues,
Jackson theorem.
Network Simulation: SimEvent tool box in MATLAB, general features of network
simulation packages, case study of OMNET++/ns2/ns3/NetSim.
TEXT BOOKS
1. Karian, Z.A. and Dudewicz, E.J., Modern Statistical Systems and GPSS
Simulation, 2nd Ed., CRC Press. 1999
2. Banks, J., Carson, L.S., Nelson, B.L. and Nicol, D.M., Discrete Event System
Simulation, 4th Ed., Pearson Education. 2007
REFERENCES
1. Law, A.M. and Kelton, W.D., Simulation, Modeling and Analysis, 3rd Ed., Tata
McGraw-Hill. 2003
2. Alberto Leon-Garcia, Probability and Random Processes for Electrical
Engineers, 2nd Ed., Pearson Education 2011

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
Semester: VI
Subject:
Soft
Subject code: CE 410804

Computing

Teaching Scheme

[Elective-III]

Examination Scheme

Theory

Practic
al

Tutori
al

Credi
ts

University
Examinati
on
(Theory)

03
Hrs

---

---

03

60
Marks

Mid Sem
Examinati
on
(Theory)

Continuo
us
Evalution
(Theory)

University
Examinati
on
(Practical)

Mid Sem
Examinati
on
(Practical)

Continuo
us
Evalution
(Practical
)

Total
Marks

30
Marks

10
Marks

---

---

---

100

Learning Objectives:

Soft computing refers to principle components like fuzzy logic, neural

networks and genetic algorithm, which have their roots in Artificial
Intelligence.
Healthy integration of all these techniques has resulted in extending the
capabilities of the technologies to more effective and efficient problem
solving methodologies

Learning Outcomes:
Upon completion of the course, you should be able to:

Identify and describe soft computing techniques and their roles in building
intelligent machines
Recognize the feasibility of applying a soft computing methodology for a
particular problem
Apply fuzzy logic and reasoning to handle uncertainty and solve engineering
problems
Apply genetic algorithms to combinatorial optimization problems
Apply neural networks to pattern classification and regression problems
Effectively use existing software tools to solve real problems using a soft
computing approach
Evaluate and compare solutions by various soft computing approaches for a
given problem.

UNIT I - Neural Networks-1(Introduction & Architecture)

Neuron, Nerve structure and synapse, Artificial Neuron and its model, activation
functions, Neural network architecture: single layer and multilayer feed forward
networks, recurrent networks. Various learning techniques; perception and
convergence rule, Auto-associative and hetro-associative memory.
8

CE Syllabus
27-4-2015
UNIT II Neural Networks-II (Back propagation networks) Architecture:
perceptron model, solution, single layer artificial neural network, multilayer
perception model; back propogation learning methods, effect of learning rule coefficient ;back propagation algorithm, factors affecting backpropagation training,
applications.

UNIT III - (12 hours) Fuzzy Logic:Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory and
operations, Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp
conversion. Fuzzy Logic II (Fuzzy Membership, Rules) Membership functions,
interference in fuzzy logic, fuzzy if-then rules, Fuzzy implications and Fuzzy
algorithms, Fuzzyfications & Defuzzificataions, Fuzzy Controller, Industrial
applications.
UNIT IV Genetic Algorithm(GA)
Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic
representations, (encoding) Initialization and selection, Genetic operators, Mutation,
Generational Cycle, applications.
TEXT BOOKS
1. S. Rajsekaran & G.A. Vijayalakshmi Pai, Neural Networks,Fuzzy Logic and
Genetic Algorithm:Synthesis and Applications Prentice Hall of India.
2. N.P.Padhy,Artificial Intelligence and Intelligent Systems Oxford University
Press.
REFERENCES
3. Siman Haykin,Neural NetowrksPrentice Hall of India
4. Timothy J. Ross, Fuzzy Logic with Engineering Applications Wiley India.
5. Kumar Satish, Neural Networks Tata Mc Graw Hill

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
Semester: VI
Subject:
Digital
Signal
Subject code: CE 410805

Processing

Teaching Scheme

[Elective-III]

Examination Scheme

Theory

Practic
al

Tutori
al

Credi
ts

University
Examinati
on
(Theory)

03
Hrs

---

---

03

60
Marks

Mid Sem
Examinati
on
(Theory)

Continuo
us
Evalution
(Theory)

University
Examinati
on
(Practical)

Mid Sem
Examinati
on
(Practical)

Continuo
us
Evalution
(Practical
)

Total
Marks

30
Marks

10
Marks

---

---

---

100

Learning Objectives:

To get thorough understanding of generation and procession of signals.

To understand insertion and extraction of information from digital signals.

Learning Outcomes:
Upon completion of the course, you should be able to:

Apply algorithms to put effective use of current technologies.

Effectively use existing software tools to solve real problems.
Evaluate and compare solutions by various approaches for a given problem.

UNIT I -(12 hours) - Introduction to signals and systems

Discrete time signals and systems, Z-transforms, structures for digital filters,
design procedures for FIR and IIR filters. Frequency transformations: linear
phase design; DFT. Methods for computing FFT. Noise analysis of digital
filters, power spectrum estimation. Signals and signal Processing:
characterization & classification of signals, typical Signal Processing
operations, example of typical Signals, typical Signal Processing applications.
UNIT II (08 hours) - Time Domain Representation of Signals & SystemsDiscrete Time Signals, Operations on Sequences, the sampling process,
Discrete-Time systems, Time-Domain characterization of LTI Discrete-Time
systems, state-space representation of LTI Discrete- Time systems, random
signals.
UNIT III - (14 hours) TransformDomain Representation of Signals-The Discrete-Time Fourier Transform,
Discrete Fourier Transform, DFT properties, computation of the DFT of real
10

CE Syllabus
27-4-2015

sequences, Linear Convolution using the DFT. Z-transforms, Inverse ztransform, properties of z-transform, transform domain representations of
random signals. Transform-Domain Representation of LTI Systems: the
frequency response, the transfer function, types of transfer function,
minimum-phase and maximum-Phase transfer functions, complementary
transfer functions, Discrete-Time processing of random signals.
Digital Processing of Continuous-Time Signals - sampling of Continuous
Signals, Analog Filter Design, Anti-aliasing Filter Design, Sample-and Hold
circuits, A/D & D/A converter, Reconstruction Filter Design.
.
UNIT IV (14 hours) - Digital Filter Structure and DesignBlock Diagram representation, Signal Flow, Graph Representation,
Equivalent Structures, bone FIR Digital Filter Structures, IIR Filter Structures,
State-space structure, all pass filters, tunable IIR Digital filters. cascaded
Lattice realization of IIR and FIR filters, Parallel all pass realization of IIR
transfer function, Digital Sine-Cosine generator. Digital Filter Design: Impulse
invariance method of IIR filter design, Bilinear Transform method of IIR Filter
Design, Design of Digital IIR notch filters, FIR filter Design based on
truncated fonner sens, FIR filter design based on Frequency Sampling
approach.
TEXT BOOKS
1. Proakis J.G., and Manolakis, Introduction to DSP, PHI, 2007
2. Sanjit K. Mitra, Applications DSP a Computer based approach, TMH, 2006
REFERENCES
1. Allan Y. Oppenhein & Ronald W. Schater , "Applications DSP,.
2. C.Sydney Burrus (Eds), DSP and Digital Filter Design

11

CE Syllabus
27-4-2015

Syllabus
Program: Computer Engineering
VIII
Subject: Research Methods, Data
Subject code: 410806
(Department Elective-III)
Teaching Scheme
Theory

Practic
al

Tutori
al

Analysis

And

Reporting

Examination Scheme
Credi
ts

03
----03
Hrs
Learning Objectives:

Semester:

University
Examinati
on
(Theory)

Mid Sem
Examinati
on
(Theory)

Continuo
us
Evalution
(Theory)

University
Examinati
on
(Practical)

Mid Sem
Examinati
on
(Practical)

Continuo
us
Evalution
(Practical
)

Total
Marks

60
Marks

30
Marks

10
Marks

---

---

---

100

Act as an educated consumer of data

Prepare a preliminary research design for projects in their subject matter
areas
Accurately collect, analyze and report data
Present complex data or situations clearly
Review and analyze research findings that affect their agency
Developing a hypothesis, a research problem and related questions
Framing the problem with the correct research methodology
Collecting data that accurately addresses the research problem
Measuring the effectiveness of a program
Using data to make decisions
Providing technical guidance to contractors for inclusion in contract
documents related to research projects
Evaluating feasibility of research proposals
Presenting data to support programs to decision makers and other consumers

UNIT I - Introduction (12 hours)

Introduction to The Process of Conducting Research, Research Design Introduction,
Steps in the Process of Research, Identifying a hypothesis and/or research problem,
specifying a purpose, creating research questions, Reviewing literature, Ethics of
research and informed consent
UNIT II Quantitative Reseach and Sampling (12 hours)
Introduction to Qualitative Research, Essence of Qualitative Data, Sampling,
Collection Techniques, Interpreting Qualitative Data, Essence of Quantitative Data,
Collection and Analysis Techniques, Sampling Concepts, Defining the Target
Population, Representative Sample, Potential Consequences of Unrepresentative
12

CE Syllabus
27-4-2015
Sampling (Gaming the System), Over Representative Subgroups / Weighting, Design
Effect, Sampling Methods (Cluster, Stratified, Simple Random), Quantitative Data
Collection Instruments
UNIT III - (12 hours) Statistics
Identifying the dependent and independent variables, Confidence levels, Math that
manipulates data, Summarizing and describing a collection of data, Univariate and
bivariate analysis, Mean, mode and standard deviation, Percentages and Ratios,
Histograms, Identifying randomness and uncertainty in data
UNIT IV Statistics and Data Mining (12 hours)
Finding the Patterns and Problems in the World of Data, Inferential Statistics, Drawing
inference from data, Modeling assumptions, Identifying Patterns, Regression analysis, T-test,
Analysis of Variance, Correlations, Chi-square

TEXT BOOKS
1) Research Design: Qualitative, Quantitative, and Mixed Methods Approaches
by John Creswell,
Publisher: SAGE Publications, Inc; Fourth Edition (March 14, 2013)
REFERENCES
1) Design Research - Methods and Perspectives,Hardcover,by Brenda Laurel

13