Documente Academic
Documente Profesional
Documente Cultură
2012-13
UNIVERSITY INSTITUTE OF
ENGINEERING(UIE)
www.cuchd.in
2012-13
Cr.
Physics Group
(ME, CSE, CCE)
Subject
Subject
L T
code
Applied
AMT4
2
Mathematics - I
101
APTApplied Physics
3
1
109
Cr.
3.5
Professional
Communication
Skills
PCT111
EET113
Basics of
Computer and
Programming in
C
CST105
4.5
Basics Electrical
and Electronics
Engineering
Basics of
Mechanical
Engineering
MET107
3.5
Engineering
Drawing
MET115
2.5
Applied
Chemistry Lab
ACP103
Applied Physics
Lab
APP110
Basics of
Computer and
Programming in
C Lab
CSP106
Professional
Communication
Skill Lab
PCP112
1.5
Workshop
Practice
MEP108
1.5
Basics Electrical
and Electronics
Engineering Lab
EEP114
Computer
Graphic Lab
MEP116
1.5
Class counseling
Total
14
13
22
Class counseling
Total
17
23.5
2012-13
Physics Group
(ECE, EEE, EE, CIVIL )
Subject
Subject
L T
code
APTApplied Physics
3
1
109
Cr.
3.5
Professional
Communication
Skills
PCT111
EET113
Cr.
Basics of
Computer and
Programming in
C
CST105
4.5
Basics Electrical
and Electronics
Engineering
Basics of
Mechanical
Engineering
MET107
3.5
Engineering
Drawing
MET115
2.5
Applied
Mathematics - II
AMT121
Applied
Mathematics - II
AMT121
Applied
Chemistry Lab
ACP103
Applied Physics
Lab
APP110
Basics of
Computer and
Programming in
C Lab
CSP106
Professional
Communication
Skill Lab
PCP112
1.5
Workshop
Practice
MEP108
EEP114
MEP116
1.5
Class counseling
Total
14
13
22
Class counseling
Total
1.5
Basics Electrical
and Electronics
Engineering Lab
Computer
Graphic Lab
17
23.5
2012-13
SUBJECT NAME
CST-201
S.NO
Hours Per
Week
Marks
Credits
40
60
100
3.5
CST-202
COMPUTER
ORGANIZATION &
ARCHITECTURE
40
60
100
CST-203
DATA STRUCTURES
40
60
100
CST-204
DISCRETE
MATHEMATICS
40
60
100
3.5
CST-205
OBJECT ORIENTED
PROGRAMMING
40
60
100
CSP-206
60
40
100
CSP-207
DATA STRUCTURES
LAB
60
40
100
CSP-208
OBJECT ORIENTED
PROGRAMMING LAB
60
40
100
CSP-209
SEMINAR
100
100
10
HUP-201
PROFESSIONAL
COMMUNICATION
SKILLS LAB
60
40
100
11
CSP-210
INSTITUTIONAL
PRACTICAL TRAINING
60
40
100
TOTAL
15
18
600
500
1100
27
2012-13
SUBJECT NAME
S.NO
Hours Per
Week
Marks
Credits
CST-221
NUMERICAL &
STATISTICAL
TECHNIQUES
40
60
100
3.5
CST-222
40
60
100
3.5
CST-223
DIGITAL
COMMUNICATION &
COMPUTER NETWORK
40
60
100
CST-224
OPERATING SYSTEM
40
60
100
CST-225
WEB TECHNOLOGIES
40
60
100
CSP-226
60
40
100
CSP-227
NETWORK &
OPERATING SYSTEM
LAB
60
40
100
CSP-228
WEB TECHNOLOGIES
LAB
60
40
100
CSP-229
SEMINAR
100
100
10
HUP- 221
PROGRAMMING
APPTITUDE
TOTAL
15
14
480
420
900
23
Note: Students will undergo 6 weeks vocational training after 4th semester. Students are required
to submit one minor project.
2012-13
SUBJECT NAME
S.NO
Hours Per
Week
Marks
Credits
CST-301
DESIGN AND
ANALYSIS OF
ALGORITHMS
40
60
100
3.5
CST-302
SOFTWARE
ENGINEERING
40
60
100
3.5
CST-303
SIMULATION AND
MODELING
40
60
100
CST-304
RELATIONAL
DATABASE
MANAGEMENT
SYSTEMS
40
60
100
3.5
CST-305
WIRELESS NETWORKS
40
60
100
CSP-306
SIMULATION AND
MODELING LAB
60
40
100
CSP-307
SOFTWARE
ENGINEERING LAB
60
40
100
CSP-308
RELATIONAL
DATABASE
MANAGEMENT
SYSTEMS LAB
60
40
100
CSP-309
INDUSTRIAL
TRAINING I
60
40
100
10
CSP-310
SEMINAR
100
100
11
HUP- 301
SOFT SKILLS
60
40
100
TOTAL
15
18
600
500
1100
27.5
2012-13
SUBJECT NAME
Hours Per
Week
L
Marks
Credits
CST-321
THEORY OF
COMPUTATION
40
60
100
3.5
CST-322
SOFTWARE PROJECT
MANAGEMENT
40
60
100
CST-323
COMPUTER GRAPHICS
40
60
100
3.5
HUT-324
ENGINEERING
ECONOMICS &
PRINCIPLES OF
MANAGEMENT
40
60
100
CSTXXX
ELECTIVE I
40
60
100
3.5
CSP-325
COMPUTER GRAPHICS
LAB
60
40
100
CSP-326
SOFTWARE PROJECT
MANAGEMENT LAB
60
40
100
CSPXXX
ELECTIVE- I LAB
60
40
100
CSP-327
SEMINAR
100
100
10
HUP-322
APTITUDE SKILLS
60
40
100
TOTAL
15
12
540
460
1000
22.5
Note: Students will undergo 6 weeks vocational training after 6th semester. Students are required
to submit one project.
2012-13
SUBJECT
CODE
SUBJECT NAME
CST-331 and
CSP-334
CST-332 and
CSP-335
CST-333 and
CSP-336
CST-334 and
CSP-337
CST-335 and
CSP-338
2012-13
S.NO
SUBJECT NAME
Hours Per
Week
L
Marks
Credits
CST-401
SYSTEM SOFTWARE
40
60
100
CST-403
ARTIFICIAL
INTELLIGENCE
40
60
100
CST-404
SECURITY &
CRYPTOGRAPHY
40
60
100
3.5
XXXXXX
OPEN ELECTIVE
40
60
100
3.5
CST-405
COMPILER DESIGN
40
60
100
3.5
CSP-405
ARTIFICIAL
INTELLIGENCE LAB
60
40
100
CSP-406
60
40
100
CSP-408
SEMINAR
100
100
CSP-409
INDUSTRIAL TRAINING II
60
40
100
TOTAL
15
16
480
420
900
28.5
S.NO.
CSO-441
CSO-442
CSO-443
CSO-444
2012-13
SUBJECT NAME
CST-421
S.NO
Hours Per
Week
Marks
Credits
DIGITAL IMAGE
PROCESSING
40
60
100
3.5
CST-422
BUSINESS
INTELLIGENCE &
ANALYSIS
40
60
100
CST-423
SOFT COMPUTING
40
60
100
3.5
CST-XXX
ELECTIVE-II
40
60
100
CSP-424
DIGITAL IMAGE
PROCESSING LAB
60
40
100
CSP-425
SOFT COMPUTING
LAB
60
40
100
CSP-426
60
40
100
CSP-427
SEMINAR
100
100
TOTAL
12
14
440
360
800
22
SUBJECT CODE
SUBJECT NAME
CST-431
EMBEDDED SYSTEMS
CST-432
ADVANCED DBMS
CST-433
CST-434
BIOINFORMATICS
CST-435
CLOUD COMPUTING
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
T P
2 0
Credits
5
(20 Hrs.)
(20 Hrs.)
(20 Hrs.)
2012-13
Time: 3 Hrs
The syllabus has been divided into three equal units. The paper setter is required to set ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Credits
3
(15 Hrs.)
Water: Types of impurities in water, Hard water and Soft water, Types of Hardness and units of
measuring hardness, Softening Methods:- Lime Soda Process, Zeolite Process, Ion-exchange
resin method and EDTA method, Scale and Sludge formation , Caustic embrittlement and Boiler
Corrosion, Desalination of sea water
Spectroscopy and its application: Definition, EM Spectrum, Absorption and Emission Spectra,
UV Visible Spectroscopy: Principle and Instrumentation, Electronic Transitions, Franck Condon
Principle,Applications, IR Spectroscopy: Principle, Fundamental modes of Vibrations and
Types, Factors affecting vibrational frequency, Applications
Unit-III
2012-13
(15 Hrs.)
2012-13
(15 Hrs.)
Social Issues and the Environment: From Unsustainable to Sustainable development, Urban
problems related to energy, Water conservation, rain water harvesting, watershed management.
Resettlement and rehabilitation of people, its problems and concerns. Case studies,
Environmental ethics: Issues and possible solutions, Climate change, global warming, acid rain,
ozone layer depletion, Nuclear accidents and holocaust, Case studies, Wasteland reclamation,
Consumerism and waste products, Environment Protection Act, Air (Prevention and Control of
Pollution) Act, Water (Prevention and control of pollution) Act, Wildlife Protection Act, Forest
Conservation Act, Issues involved in enforcement of environmental legislation, Public
awareness.
Natural Resources: Natural Resources and associated problems, Over exploitation , Case
Studies of forest resources and water resources
Version 1.1, Page 16 of 155
Unit-III
2012-13
(15 Hrs.)
Human Population and the Environment: Population growth, variation among nations.
Population explosion Family Welfare Programme, Environment and human health, Human
Rights, Value Education, HIV/AIDS, Women and child Welfare, Role of Information
Technology in Environment and human health, Case studies.
Disaster management: Definition, types of disasters, Floods, Earthquakes, Cyclones and
landslides, preventive measures, case studies.
Text books:
1. Joseph Benny ,Environmental studies , Tata Mc Graw Hill Education Private Limited , New
Delhi, (2006)
2. Ahluwalia V.K &Malhotra Sunita ,Environmental Science, Ane Books India, (2009).
Reference books :
1. Bhasin, S.K &KaurVerinder, Introductory environmental studies, Ajay Publications, (2012).
2. Ahluwalia, V.K ,Environmental chemistry , Ane Books India, (2010).
3. Chhatwal Johar Rajni ,Environmental Sciences ,UDH Publishers & Distributors (P) Ltd,
(2009).
4. Rana, S.V.S , Essentials Of Ecology and Environment science ,PHI Learning Private
Limited, (2009).
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60
Time: 3 Hrs
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
T P Credits
1 0
4.5
(20 Hrs.)
(20 Hrs.)
2012-13
Functions: Basic concepts, structure of a function, Function types, Declaring and defining
functions, Returning values from functions, Arguments: formal and actual arguments, Concept of
pointer, Passing arguments to functions: call by value and call by reference, Library functions,
recursion, need of recursion, inline functions, Storage classes.
Unit III
(20 Hrs.)
Arrays and strings: Declaring an array, Initializing arrays, Accessing the array elements,
Passing arrays as arguments to functions, Working with multidimensional arrays, Strings:
declaration and initialization, String handling functions, Passing strings to a function.
Structures and Union: Declaring and initializing a structure, Accessing the members of a
structure, Nested structures, Array of structures, Using structures in functions, Declaring and
initializing a union, Difference between a structure and a union.
File Handling: File Streams, Opening /Closing of File, Read/Write operations on file.
Text Books:
1.
2.
3.
Reference Books:
1. KanetkarYashwant, let us C , BPB Publications
2. Sinha P.K., SinhaPriti, Computer Fundamentals BPB Publications
Instruction for paper setter:
The Syllabus has been divided into three equal units. The paper setter is required to set the ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will required to attempt six questions
including the compulsory question no.1 and not more than two questions from each unit.
2012-13
Unit I
(15 Hrs.)
(15 Hrs.)
Second Law of Thermodynamics: Limitation of 1st Law, Heat Engine; Refrigerator; Heat
Pump; Efficiency & COP; Statements of Second law, Kelvin plank and clausius statement and
their equivalence; PMM2; Carnot Cycle; Carnot Theorem; Entropy; Entropy as Property of
system; Clausius Inequality
I. C. Engines: Introduction of IC engine as a power developing device; Working principle of
Version 1.1, Page 20 of 155
2012-13
two and four stroke engines, difference between petrol and diesel engines, brief introduction to
MPFI and CRDI systems;
Unit III
(15 Hrs.)
Please go through these instructions thoroughly and follow the same pattern while setting
the paper as the students have been prepared according to this format.
Maximum Marks = 60
Time: 3 Hrs
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
(10 Hrs.)
5. Determination of the hardness of given hard water sample by EDTA method. Provided
standard hard water.
6. Determination of the amount of residual chlorine present in the given water sample.
7. To determine the acid number and Base number of given water sample
Unit-III
(10 Hrs.)
2012-13
0 4
Credit
Unit-1
(20 Hrs.)
(20 Hrs.)
2012-13
17. Wap to print the table of a given number using while/ do while loop.
18. Wap to print the factorial of a no.
19. Wap to check whether a given number is palindrome or not.
20. Wap to list the prime numbers upto n no.
21. Wap to find the nature of the roots as well as value of the roots .however, in case of
imaginary roots, find the real part separately.
22. Wap to print the Fibonacci series a) by using function b) by using recursion.
23. Wap to find the greatest common divisor from given 2 numbers by using recursion.
24. To find the area of a triangle using function.
25. Wap to swap two numbers using call by value & call by reference.
26. Wap to find the area of a circle using call by value & call by reference.
Unit III
(20 Hrs.)
Note: Students are required to exercise all the experiments in lab but prepare the file of Part-B
i.e. C Programs only.
2012-13
Workshop Practices
Students are required to prepare the jobs in each shop individually. The student must learn to
handle the different tools and equipments. He must also learn all the safety precautions and
follow them while making jobs in the shop.
1. Carpentry Shop
Study of tools & operations and carpentry joints; Simple exercise using jack plane; To
prepare half-lap corner joint, mortise & tennon joints.
2. Fitting Shop
Students will learn the use of fitting hand tools, marking tools, marking tools and gauges.
Exercises: Jobs made out of MS Flats, making saw cut filling V-cut taper at the corners,
circular cut, fitting square in square, triangle in square.
3. Sheet Metal Shop
Learning use of sheet-metal tools, Exercises: Making jobs out of GI sheet metal.
Cylindrical, Conical and Prismatic shapes.
4. Welding Shop
Version 1.1, Page 25 of 155
2012-13
2012-13
(15 Hrs.)
(15 Hrs.)
Fibre Optics: Introduction to optical fibre, Refractive index, Propagation of light through optical
fibre, Acceptance angle, Acceptance cone, Numerical aperture, Types of optical fibre,
Normalized frequency, Optical -couplers, Connectors, Splicers, Fibre losses, Applications.
Electrostatics: Charge distribution, Gauss law and its applications, Faradays law of
electromagnetic induction, Amperes circuital law, Polarisation , Displacement current, Maxwell
equations, speed of EM waves.
Unit-III
2012-13
(15 Hrs.)
Time: 3 Hrs
2012-13
T
0
P
0
Credit
2
(10 Hrs.)
(10 Hrs.)
Writing Skills: Paragraph writing (250 words), Leave application, Permission letter and
Business letters-Sales and Inquiry, Job Application, email etiquette, Memorandum, Notice
writing, Resume writing
Report Writing: Introduction to proposals, Types of reports, Steps in Report Writing,
English Grammar: Preposition, articles, conjunction, tenses, punctuation
Unit III
(10 Hrs.)
Reading: Ten Mighty Pens- Reference to Context, word meanings of Short Stories-The Model
Millionaire, The gift of the Magi, The Judgement-seat of Vikramaditya, Fur, Play-Chandalika,
Essay-A Bachelors Complaint of the Behaviour of Married People.
English Grammar:, Antonyms, Homonyms, Homophones, Active & Passive voice, Reported
Speech, Idioms, Abbreviations, Technical Terms, Analogy, Correction of spellings and sentences,
Version 1.1, Page 29 of 155
2012-13
2012-13
(20 Hrs.)
DC Circuits: Basic concepts; concepts of linear, nonlinear, active, passive, unilateral and
bilateral elements; ideal and practical voltage & current sources conversion from one from the
other. Kirchhoffs Laws Statement and Illustration, Method of solving Circuits by Kirchhoffs
Laws, Star-Delta conversion, DC Transients for RL and RC series circuits.
Single Phase AC Circuits: Generation of single phase A.C. voltage and determination of
average (mean) and RMS (effective) values of voltage and current with special reference to
sinusoidal waveforms; Form factor and peak factor for various waves, Introduction of Resistive,
Inductive and Capacitive circuits and their series and parallel combinations, Concept of
admittance, susceptance in parallel circuits; calculation of branch currents in parallel circuits.
Concept of resonance in series and parallel circuits.
Unit-II
(20 Hrs.)
Magnetic Circuits: Magnetic circuit & its similarity with electric circuits; solution of series,
parallel & series parallel magnetic circuits, Energy stored in a magnetic field, Law of
Electromagnetic Induction and its law, Self Inductance, Mutual Inductance, Coupling Coefficient
between two magnetically coupled Circuits. Principle of operation; efficiency, voltage regulation
and applications of transformer.
Transducers: Introduction, working and application of LVDT, Strain Gauge and Thermistor.
Introduction and application of Digital Multimeter, CRO, Data Acquisition Systems.
Unit-III
2012-13
(20 Hrs.)
Semiconductor Devices: Introduction to p-n junction diode, Rectifiers, Zener Diode, Concept of
amplifiers and its characteristics, Operational amplifiers and its application, Regulated Power
Supply.
Digital Electronics: Digitization and its advantages, Binary number system, Octal and
hexadecimal, logic gates. Introduction and truth table, flip flops: R-S, J-K, D and T, Counter,
Shift register, MUX-DEMUX, Introduction to D/A, A/D Converters.
Text Books:
1. Sahdev S.K., Fundamentals of Electrical and Electronics Engineering, Dhanpat Rai & Co.
2. Theraja B.L., Fundamentals of Electrical and Electronics, S.Chand & Co.
3. Gupta J.B., Basic Electrical and Electronics Engineering, S.K.Kataria& Sons.
Reference Books:
1. Katre J.S., Basic Electrical and Electronics Engineering, Tech Max Publications
2. Bhargava N.N., Basic Electronics and Linear Circuits, Tata McGraw Hill
2012-13
(30 Hrs.)
Unit II
2012-13
(30 Hrs.)
(30 Hrs.)
Student will be able to know the fundamental of Computer Aided Drafting & 3D
Modeling.
2012-13
T P
0 2
Credit
1
(10 Hrs.)
(10 Hrs.)
(10 Hrs.)
2012-13
T
0
P
3
Credit
1.5
(15 Hrs.)
Art of Public Speaking: Newspaper Reading, Extempore, Just a Minute, Group Discussion
Presentation Skills: Principles of Oral presentations, Strategies for improving oral
presentations, Presentation on a technical topic by the student
Unit III
(15 Hrs.)
English Grammar: Workbook-Noun, pronoun, verb, adjective, adverb, preposition, article and
conjunction.
Vocabulary Building- Synonyms, Antonyms, Homonyms, Homophones, Analogy,
Version 1.1, Page 36 of 155
2012-13
2012-13
P Credits
(10 Hrs.)
(10 Hrs.)
(10 Hrs.)
2012-13
2012-13
Credit
1.5
2012-13
Credits
5
(20 Hrs.)
(20 Hrs.)
Vector calculus : Scalar and vector fields. differentiation of vectors , Vector differential
operators: Del ,Gradient, Divergence, Curl and their physical interpretations. Formulae involving
del applied to point functions and their products (without proofs), Line integrals, surface
integrals and volume integrals.
2012-13
Application of Vector Calculus : Flux , Solenoidal and Irrotational vectors, Gauss Divergence
theorem, Greens theorem in plane, Stokes theorem (without proofs) and Applications .
.
Text books:
1. Kreyszig , E., Advanced Engineering Mathematics, John Wiley,10th Ed. (2011).
2. Thomas,B. and Finney ,R.L.,Calculus and Analytic Geometry, Pearson Education.
Reference books:
1. Ray Wylie, C., Advanced Engineering Mathematics, 6th ed., McGraw Hill.
2. Jain, R.K. and lyengar, S.R.K., Advanced Engineering Mathematics, Narosa Publishing
House, New
Delhi, (2004).
3. Ramana , B.V Advanced Engineering Mathematics, McGraw Hill, July (2006).
Instructions for the Paper-Setter:
Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
Maximum Marks = 60
Time: 3 Hrs
The syllabus has been divided into three equal units. The paper setter is required to set ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
To understand the operational basics and design of electronics devices & circuits.
To gain knowledge about various digital circuits and systems.
To develop an applied base for your field of practice knowledge.
UNIT-I
Electronic Devices: p-n junction diode and its characteristics, diode as a circuit element, zener
diode, pnp & npn transistor and characteristics in CB, CE and CC modes.
[4]
Amplifiers: Concept of an amplifier, Class A direct coupled with resistive load, Transformer
coupled with resistive load, characteristics of amplifiers.
[4]
Oscillators: Concept of feedback and its merits and demerits, block diagram of Oscillators,
Conditions of oscillations.
[3]
Number Systems: Introduction, Binary, decimal, Octal and hexadecimal number systems
(including fractions), Conversion from one number system to another.
[4]
UNIT-II
Computer Arithmetic: Signed and unsigned numbers, Binary operations-addition; Subtraction,
Multiplication and division, Floating Point addition & subtraction, Subtractions using 1's and 2's
compliment; codes : ASCII code; Excess 3 code Gray code
[6]
Logic gates and functions: Introduction to digitization. Basic gates: AND, OR, NOT. Universal
gates: NAND, NOR. Basic idea of XOR and XNOR gates, Basic theorems of Boolean Algebra,
principle of duality. Sum of products (SOP) and Product of sums (POS), canonical form,
Simplification using K-map.
[8]
UNIT-III
Combinational circuits: Multiplexers, de-multiplexer, encoders, decoders, adders, subtracters
and code converters, BCD to 7 segment display. A/D and D/A convertors.[8]
Version 1.1, Page 44 of 155
2012-13
[5]
Text Books:
1.
2.
3.
Reference Books:
1. Halkias, Millman , Electronic Devices and Circuit, Tata McGraw Hill.
2. Mano Morris, Digital Design, Prentice Hall of India.
3. Fletcher, An Engg. Approach to digital design, Prentice Hall of India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
3
Total Hours: 48
Course Objectives:
Basic concepts-Digital computer with its block diagram, computer hardware components-ALU,
registers, memory, system bus structure-data, address and control bus.
[4]
Instruction Set Architectures-Levels of programming Languages, Assembly Language
Instructions: instruction cycle, instruction types, addressing modes, RISC vs CISC.
[6]
Computer Organization- CPU organization, Memory Subsystem Organization: Types of
memory, Internal Chip Organization, memory subsystem configuration.
[6]
UNIT-II
Design of control unit - Hardwired control unit, Micro-Programmed control unit and
comparative study.
[4]
Memory organization-Memory hierarchy, Cache Memory Associative Memory, Cache memory
with associative memory, Virtual Memory: Paging, Segmentation. [6]
Input output organization Asynchronous Data transfer: Source Initiated, Destination Initiated,
Handshaking, Programmed I/O, Interrupts DMA, IOP
[7]
UNIT-III
Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynns Classification,
Handlers Classification, concept of pipelining, Instruction Pipeline, Arithmetic Pipeline.
[8]
2012-13
2012-13
Course Objectives:
Unit I
Introduction: Concept of data and information, Introduction to Data Structures, Types of data
structure: Linear and non-linear data structures, operations on Data Structures, Algorithm
complexity, Time-space trade off, asymptotic notations.
[4]
Arrays: Basic terminology, Linear arrays and their representation, Traversing Linear Array,
Insertion & Deletion in arrays, searching linear search, binary search, sorting insertion sort ,
selection sort , bubble sort , merging arrays & merge sort , complexity analysis of each
algorithm, Multi-dimensional arrays and their representation, Pointers; Pointer Arrays, Records;
Record structure, representation of records in Memory, Parallel Arrays, sparse matrices and their
storage.
[12]
Unit II
Linked List: Linear linked list, Representation of Linked Lists in Memory, Traversing a
linked list, searching a linked list, insertion in & deletion from linked list, Header Linked List,
doubly linked list, Operations on doubly linked list, complexity analysis of each algorithm,
Application of linked lists.
[6]
Stacks: Basic terminology, Sequential and linked representations, Operations on stacks: PUSH
& POP, Application of stacks: Parenthesis matching, evaluation of postfix expressions,
conversion from infix to postfix representation, Quick Sort and its complexity analysis. Meaning
and importance of recursion, principles of recursion & implementation of recursive procedure.[6]
2012-13
Queues: Linear queue, Sequential and linked representation of Linear queue, Circular queue,
Operations on queue, Deques, Priority queue.
[4]
Unit III
Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix, Path
Matrix), traversing a graph, Operations on Graph.
[4]
Trees: Basic terminology, Binary Trees, Representation of Binary Trees in Memory, traversing
Binary Trees, Traversal Algorithms using stacks, Header Nodes; Threads, Binary Search trees,
Searching, Inserting & Deleting in Binary Search Trees, AVL Search trees, B Trees, Heap &
Heap Sort.
[8]
Hashing& File Organization: Hash Table, Hash Functions, Collision Resolution Strategies,
Hash Table Implementation. Concepts of files, Organization of records into Blocks, File
organization: Sequential, Relative, Index Sequential, Inverted File.
[4]
Text Books:
1. Lipschutz, Seymour, Data Structures, Schaum's Outline Series, Tata McGraw Hill.
2. Gilberg/Forouzan, Data Structure with C , Cengage Learning.
3. Augenstein,Moshe J , Tanenbaum, Aaron M, Data Structures using C and C++,
Prentice Hall of India.
Reference books:
1. Goodrich, Michael T., Tamassia, Roberto, and Mount, David M., Data Structures and
Algorithms in C++, Wiley Student Edition.
2. Aho, Alfred V., Ullman, Jeffrey D., Hopcroft , John E. Data Structures and
Algorithms, Addison Wesley.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets,
Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product. [4]
Relations and Functions : Representation of relations, Types of relation, Binary Relations,
Equivalence relations and partitions, Partial ordering relations and lattices, Mathematics
Induction, Principle of Inclusion & Exclusion. Function and its types, Composition of function
and relations, Cardinality and inverse relations. Functions & Pigeonhole principle.
[8]
Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth value of a
compound statement, propositions, tautologies, contradictions.
[4]
Unit-II
Recursion And Recurrence Relation: Sequences, Introduction to AP and GP series, partial
fractions, linear recurrence relation with constant coefficients, Homogeneous solutions,
Particular solutions, Total solution of a recurrence relation using generating functions.
[8]
Algebraic Structures: Definition, elementary properties of algebraic structures, Basic algebraic
structures: Semigroup, monoid, group, subsemigoup, submonoid, subsemigroup. Congruence
relations. Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups,
Cosets, Lagranges theorem, Cyclic groups. Rings, Types of rings, division rings, Integral
domains and fields
[8]
2012-13
Unit-III
Combinatorial Mathematics: Techniques of counting: Rule of sum, Rule of product.
Permutations and combinations, Generating Functions.
[4]
Graph Theory: Introduction to graphs , Directed and undirected graphs, Homomorphic and
Isomorphic graphs, Subgraphs, Multigraph and Weighted graph, Paths and circuits, Shortest path
in weighted graphs, Eulerian paths and circuits, Hamiltonian paths and circuits. Planar graphs,
Eulers formula.
[6]
Trees: Introduction to trees, Difference between a graph and a tree, Rooted Trees, Path length in
trees, Spanning Trees & cut-sets, Minimum cost spanning trees, Binary trees and its traversal.[6]
Text Books:
1. Liu C.L, Elements of Discrete Mathematics, McGraw Hill.
2. Santha, Discrete Mathematics with Graph Theory, Cengage Learning.
3. Ronald G, Knuth, Donald and Patashik, Oren, Concrete Mathematics: A Foundation for
Computer Science, Addison-Wesley.
Reference Books:
1. Kolman , B. and Busby ,R.C, Discrete Mathematical Structures, PHI.
2. Gersting, Judith L. Mathematical Structures for Computer Science, Computer Science
Press.
3. Doerr and Levasseur , Applied Discrete Structures for Computer Science.
4. Tembley&Manohar , Discrete Mathematical Structures with Applications to
Computers, McGraw Hill.
5. Rosen K. H, Discrete Mathematics and its applications, Mc-Graw hill.
6. Lyengar, N Ch SN, Chandrasekaran, VM, Discrete Mathematics.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Course Objectives:
2012-13
Operator Overloading and Type Conversions: Defining operator overloading, rules for
overloading operators, overloading of unary & binary operators, type conversion - basic type to
class type & vice versa.
[4]
Inheritance: Defining derived class, modes of inheritance, types of inheritance, ambiguity in
inheritance, virtual base class, Function overriding, order of execution of constructors, Member
Classes: Nesting of Classes
[6]
UNIT-III
Pointers, Virtual Functions& Polymorphism: Introduction &types of polymorphism: static
and dynamic binding, Introduction to pointers, need for pointers, declaring & initializing
pointers, Array of pointers, pointer to objects, this pointer, pointer to derived classes, Dynamic
memory allocation: new and delete operator, virtual functions and pure virtual functions, abstract
class.
[7]
Templates & Exception Handling: Concept of Templates & Generic Programming, Class
Templates, Function Templates, Overloading of Template Functions, Basics of C++ Exception
Handling: Try, Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwing an
Exception.
[5]
Files: Introduction to File streams, Hierarchy of file stream classes, File operations, File I/O, File
opening Modes, Reading/Writing of files, Error handling in files, Random-access to files. [4]
Text books:
1. Balagurusami, E., Object Oriented Programming in C++, Tata McGraw-Hill.
2. Lafore Robert, Object Oriented Programming in C++, Waite Group.
Reference Books:
1. Scildt, Herbert, C++- The Complete Reference, Tata McGraw-Hill.
2. Stroustrup, Bjarne, The C++ Programming Language, Pearson Education.
3. Ravichandran D., Programming with C++, Tata McGraw-Hill.
4. Farrell, Object Oriented Programming Using C++,Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Course Objectives:
UNIT I
1. Study Zener regulator as voltage regulator.
2. Plot the input and output characteristics of CE configuration.
3. Study the characteristics of a Class- A amplifier.
4. Study the response of RC phase shift oscillator and determine frequency of oscillation.
UNIT II
5. Study the response of Hartley oscillator and determine frequency of oscillation.
6. Truth-table verification of OR, AND, NOT, XOR, NAND and NOR gates.
7. Realization of OR, AND, NOT and XOR functions using universal gates.
UNIT III
8. Realization Half Adder / Full Adder using Logic gates.
9. Design 4-Bit magnitude comparator using logic gates. Multiplexer: Truth-table verification
and realization of Half adder and Full adder using MUX.
10. Flip Flops: Truth-table verification of RS, JK, D, JK Master Slave Flip Flops.
2012-13
Course Objectives:
1. Write a menu driven program that implement following operations (using separate functions)
on a linear array:
a) Insert a new element at end as well as at a given position
b) Delete an element from a given whose value is given or whose position is given
c) To find the location of a given element
d) To display the elements of the linear array
2. Program to demonstrate the use of linear search to search a given element in an array.
3. Program to demonstrate the use of binary search to search a given element in a sorted array in
ascending order.
4. Program to sort an array of integers in ascending order using bubble sort.
5. Program to sort an array of integers in ascending order using selection sort.
6. Program to sort an array of integers in ascending order using insertion sort.
7. Program to sort an array of integers in ascending order using merge sort.
UNIT-II
8. Write a menu driven program that maintains a linear linked list whose elements are stored in
on ascending order and implements the following operations (using separate functions):
a) Insert a new element
Version 1.1, Page 55 of 155
2012-13
2012-13
UNIT-II
9. Write a program to demonstrate constructor overloading in a class.
10. Write a program to define a static data member which has the initial value of 55 and to
find the sum of the following series. Sum=1+2+3+4+10.
Version 1.1, Page 57 of 155
2012-13
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
Numerical Integration: Trapezoidal Rule, Simpsons one third Rule, Simpsons three
eighth Rule.
[5]
Statistics: - Measure of central tendency: Mean, Median and Mode, Measures of dispersion
coefficient of variations, Relations between measures of dispersion, Standard deviation of the
combination of two groups, Skewness, Kurtosis.
[8]
Probability: Basic concepts and axioms in probability, conditional probability, Bayes theorem,
Bernoulli trials.
[7]
UNIT-III
Random Variables: Discrete and continuous random variables. Basic discrete distributions:
Binomial, geometric and Poisson distribution. Basic continuous distributions: Exponential and
normal distributions.
[8]
Version 1.1, Page 60 of 155
2012-13
Sampling and Testing of Hypothesis: Sampling methods, student t-test, Chi-square , F-test
and curve fitting. Correlation and regression analysis.
[8]
Text Books:
1.
2.
3.
4.
Reference Books:
1. Ott. R. Lyman, Longnecker T. Micheal, An Introduction to Statistical Methods and Data
Analysis, Cenage Learning.
2. Ray Whlie, C., Advanced Engineering Mathematics, McGraw Hill.
3. Schilling, Numerical Methods Using C, Cengage Learning.
4. Freund, Mohr, Wilson, Statistical Methods, Academic Press.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
To understand the architecture, components, flags and instruction set of 8085 and 8086.
To design interfacing circuits using 8085 and 8086.
To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259(PIC),
8237(DMA) and advanced microprocessor chips.
Unit-I
Introduction: Review of Hardwired Logic v/s Flexible Logic, Tri State Logic. Introduction to
microprocessor, Difference between microprocessor and microcomputer, Basic components of a
microprocessor, system bus: address, data and control buses.
[6]
8085 microprocessor: Architecture, pin diagram, flags, addressing modes, instruction set and
assembly language programming, timing diagrams, interrupt structure of 8085.
[8]
Memory Interfacing: Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.
[3]
Unit-II
Interfacing devices:
Architecture, Block Diagram, Control words, Modes and working of 8255
[4]
[3]
[3]
[3]
[3]
2012-13
Unit-III
8086 Microprocessor: Architecture, block diagram and pin diagram of 8086, operating modes
of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address
computations, program relocation, addressing modes.
[9]
Advanced Microprocessors: Introduction to
microprocessors.
Text Books:
1. Gaonkar, Ramesh S., Microprocessor Architecture, Programming & Applications with
8085, Wiley Eastern Ltd.
2. Ayala, The 8086 Microprocessor: Programming& Interfacing the PC, Cengage
Learning.
3. Bhurchandi, K.M , Ray, A.K , Advanced microprocessors and peripherals, TMH.
Reference Books:
1. Brey, The Intel Microprocessors 8086- Pentium processor, PHI.
2. Triebel and Singh, Avtar , The 8088 & 8086 Microprocessors-Programming,
interfacing, Hardware & Applications ,PHI .
3. Liu,Yu-Chang &Gibson, Glenn A, Microcomputer systems: The 8086/8088 Family:
architecture, Programming & Design, PHI.
4. Antonakos, James L., The Pentium processor, Pearson.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
2012-13
UNIT III
Transport Layer: Services provided to upper layers, Elements of Transport protocols.
Addressing, Flow Control & buffering; Example Transport protocols: TCP, SCTCP & UDP
[8]
Application Layer: Network security, Domain Name System, Simple Network Management
Protocol, Electronic Mail, World Wide Web.
[8]
Text Books:
1. Forouzan, Behrouz A.: Data Communications & networking, 4th edition Tata Mcgraw
Hill.
2. Tanenbaum, Andrew S: Computer networks, 4th Edition, Pearson education.
Reference Books:
1. Stallings, William: Data and computer communications, 8th edition, Pearson
Education.
2. Ross, Kurose, Computer Networking: A top down Approach, 2nd edition, Pearson
Education.
3. Coomer, Douglas E.: Internet working with TCP/IP , 2 nd edition, Pearson Education
4. Dave, Computer Networks, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Course Objectives:
2012-13
File Management: File Concepts, Access Methods, Directory Structure, Allocation Methods,
Free Space Management.
[5]
UNIT III
System Protection and Security: Goals, principles and domain of protection, Access matrix,
implementation of access matrix, the security problem, program threats, system and network
threats.
[8]
Distributed and Network Operating Systems: Overview: Topology, connection strategy,
network operating system types: Peer to Peer & Client server, Distributed message passing. [7]
Text Books:
1. Galvin, Peter B., Silberchatz, A., Operating System Concepts, Addison Wesley, 8th
Edition.
2. Flynn, Operating Systems, Cengage Learning.
3. Dhamdhere,
D.M.,
"Operating
System:A
Concept
Based
Approach",
Tata Mc-Graw- Hill.
Reference Books:
1. Mad nick, Stuart E., Donovan, John J. Operating System, McGraw Hill.
2. Stalling, William, Operating Systems, Pearson Education, Fifth Edition.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Introduction: Web Standards, Web browsers, Variety of displays, Server & server software,
HTTP and FTP , WCAG 1.0, 2.0, Character sets & encoding.
[5]
Document structure: Minimal document structure, type declaration, switching, route and
header elements, text and formatting tags, links, images and objects, table, Frames and Frame
sets, Forms
[5]
Web Publishing using CSS: CSS Basics: benefits of CSS, selectors and its types, adding styles,
introduction to box model, browser support, Creating an overall look: font and text properties,
basic box properties, colors and backgrounds, floating and positioning.
[6]
UNIT II
Formatting: Table formatting, list and generated content, two, three column layouts, Box
formatting, image replacement, rollovers, Navigation bars.
[6]
Introduction to java script: Dos and Donts, implementation method, Java script syntax:
Statements, variables, data types, arrays, Operators, Control statements, Objects, Event handling,
Browser object, DOM Scripting, Functions, Dialogs: performing I/O.
[9]
2012-13
UNIT III
Objects in java script: Such as Array, date, math, string, Accessing page elements using DOM
(Document object model)
[4]
Web Graphics Overview: Web graphic file formats, image resolution, web graphic production
tips, Gif format, jpeg format, PNG format, Animated GIFs.
[4]
Media: Basic digital audio concepts, Creating and optimizing audio for the web, Streaming
audio, Audio formats, Basic digital video concepts, Compression, Video File formats, Adding
video to HTML document.
[4]
Introduction to XML: XML basics, XML document syntax, Well-Formed and Valid XML,
XML Document type definition, XML on the web, XML application.
[5]
Text Books:
1. Niederst , Jennifer , Web design in a nutshell, O'Reilly Media.
2. Moseley Ralph, Savaliya M. T., Developing Web Applications, Wiley India.
Reference Books:
1. Powers S., Dynamic Web Publishing, Tech Media.
2. Thomas A. Powell, The Complete Reference HTML & XHTML, Tata McGraw-hill.
3. Sklar, Web Design Principles, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
-- 2 1
Course Objectives:
1.
2.
3.
4.
5.
2012-13
Course Objectives:
1. Familiarization with Computer Hardware & write specifications of latest desktops and laptops.
2. Installation Process of various operating systems.
3. Study of LAN Components.
4. Introduction of Shell programming using
- Command syntax
- simple functions
- basic tests
5. preparing straight and cross cables.
UNIT II
6. (a)Write programs using the I/O system calls of UNIX operating system (open, read, write
etc.)
(b)Write C programs to simulate UNIX commands like ls, grep, etc.
7. Familiarization with transmission media viz. coaxial cable, twisted pairs, optical fibre
networking, wireless networking, connectors etc.
8. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir.
9. Creation of different topologies.
2012-13
UNIT III
10. Simulate the Bankers algorithm for deadlock avoidance and deadlock prevention.
11. Sharing of resources with two connected nodes.
12. Configuration of TCP/IP Protocols.
13. Network troubleshooting.
2012-13
Course Objectives:
1. Design Simple Web Pages using standard HTML tags like, HEAD, TITLE, BODY
2. Design HTML web pages, which make use of INPUT, META, SCRIPT, FORM,
BGSOUND,
3. Working with various attributes of standard HTML elements.
4. Design an image library of your department activities using HTML and CSS.
5. Design a web template using HTML and CSS.
Unit II
6. Using Java Script's Window and document objects and their properties and various
methods like alert (), evaI (), Parselnt (), input() etc. methods to give the dynamic
functionality to HTML web pages.
7. Writing Java Script snippet which make use of Java Script's inbulit as well as user
defined objects like navigator, Date Array, Event, Number etc.
8. Create a web page of user records. These records should be entered using form elements
on the same page and page should be updated dynamically using JavaScript.
9. Write code which does the form validation in various INPUT elements like TextFiled,
Text Area, Password, Selection list etc.
Unit III
10. Writing XML web Documents which make use of XML Declaration, Element
Declaration, Attribute Declaration.
11. Write a Java script code to read the data from XML and embed in HTML document.
12. Write a java script code to read the data from the HTML form elements and store it in
XML file.
Version 1.1, Page 73 of 155
2012-13
13. Create a web page using HTML and JavaScript to search the records with different search
criteria from XML file and display the result in tabular form on the page.
14. Modify above page by adding an option to edit the searched record and update it in XML
file.
Note: Students are also required to make one small project by using different concepts of web
technologies.
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
3.5
Total Hours: 48
Course Objective:
Algorithm and its characteristics: - Algorithms and its characteristics, Growth of functions:
asymptotic notations, Analyzing and design of algorithms, Performance analysis and
measurement of algorithms, Time and space complexity.
[6]
Elementary Data Strictures: - Stacks, Queues, Trees, Graphs, Sets and Disjoint Set, Union [4].
Divide and Conquer: - General method, Binary Search, Merge sort, Quick sort, Finding
maximum and minimum.
[6]
UNIT-II
Greedy Algorithms: - General method, Elements of greedy strategy, An Activity Selection
Problem, Knapsack problem. Huffman codes, Minimum cost spanning trees.
[6]
Dynamic Programming:- General method, Elements of dynamic programming, Matrix-chain
multiplication problem, Longest common Subsequence Problem, Multistage Graph, 0/1
Knapsack, Travelling salesperson problem (TSP).
[6]
Back Tracking: - General method, 8 queen's problem, Graph coloring.
[4]
UNIT-III
Elementary Graph Algorithms: - Basic terminology, Representation of Graphs, Depth First
Search, Breath First search, topological sort, Single source shortest path: Bellman- Ford
Version 1.1, Page 76 of 155
2012-13
algorithm, Dijkstras Algorithm, All Pair shortest paths: Floyd Warshall algorithm.
[8]
Branch and Bound: - Branch and Bound method, 0/1 Knapsack problem, Travelling
salesperson problem.
[4]
NP Hard and NP Complete Problems: - Basic concepts, The classes P and NP, NP Hard and
NP Complete problems, NP-completeness & reducibility.
[4]
Text Books:
1. Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, Prentice Hall of India, 3rd
edition 2012.
2. Horowitz, Sahni and Rajasekaran, Fundamentals of Computer Algorithms, University
Press (India), 2nd edition.
Reference Books:
1. Tanenbaum, Augenstein, &Langsam, Data Structures using C and C++, Prentice Hall of
India.
2. Brassard, Bratley, Fundamentals of Algorithms, Prentice Hall of India.
3. Knuth The Art of Computer Programming, Volume 1: Fundamental Algorithms (AddisonWesley, Third Edition).
4. Lipschutz, S., Data Structures, Schaum's Outline Series, Tata McGraw Hill.
5. Kruse, Data Structures & Program Design, Prentice Hall of India.
6. Aho, Haperoft and Ullman, The Design and analysis of Computer Algorithms, Pearson
Education India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
3.5
Total Hours: 48
Course Objectives:
2012-13
UNIT-III
Software Testing: Testing levels, Activities, Verification and Validation, Unit testing, System
testing Integration testing, Validation testing, Black box and white box testing.
[4]
Text Books:
4. Pressman Rogers, Software Engineering: A Practitioner's Approach, Sixth edition.
5. Somerville Ian, Software Engineering, Addison Wesley, 8th Edition.
Reference Books:
3. James FPeters and Pedryez Witold, Software Engineering An Engineering Approach,
Wiley Student Edition.
4. Kassem , Software Engineering, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
[8]
Random Numbers: Pseudo random numbers, methods of generating random variables, discrete
and continuous distributions, testing of random numbers.
[8]
UNIT II
Design Of Simulation Experiments: Problem formulation, data collection and reduction, time
flow mechanism, key variables, logic flow chart, starting condition, run size, experimental
design consideration, output analysis and interpretation validation.
[10]
Simulation Languages: Comparison and selection of simulation languages, study of anyone
simulation language.
[7]
2012-13
UNIT III
Case Studies: Development of simulation models using simulation language studied for systems
like queuing systems, Production systems, Inventory systems, maintenance and replacement
systems and Investment analysis.
[15]
Text Books:
1.Seila Andrew F."Applied Simulation Modeling, Cengage Learning.
2. Geoffrey Gordon, System Simulation, 2nd Edition, Prentice Hall, India.
3. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall, India.
Reference Books:
1. Jerry Banks and John S.Carson, Barry L. Nelson, David M.Nicol, Discrete Event System
Simulation, 3rd Edition, Prentice Hall, India.
2. Shannon, R.E. Systems simulation, The art and science, Prentice Hall.
3. Thomas J. Schriber, Simulation using GPSS, John Wiley.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
3.5
Total Hours: 48
Course Objectives:
To have good understanding of database system concepts and design databases for
different applications.
To learn how to use a DBMS and RDBMS.
To implement and understand different types of DDL, DML and DCL statements.
To understand transaction concepts related to databases and recovery/backup techniques
required for the proper storage of data.
UNIT-I
Overview of Databases: Database concepts, DBMS, Data Base System Architecture (Three
Level ANSI-SPARC Architecture), Advantages and Disadvantages of DBMS, Data
Independence, DBA and Responsibilities of DBA, Relational Data Structure, Keys, Relations,
Attributes, Schema and Instances, Referential integrity, Entity integrity.
[6]
Data Models: Relational Model, Network Model, Hierarchical Model, ER Model: Design,
issues, Mapping constraints, ER diagram, Comparison of Models.
[4]
Relational Algebra & Relational Calculus: Introduction, Syntax, Semantics, Additional
operators, Grouping and Ungrouping, Relational comparisons, Tuple Calculus, Domain
Calculus, Calculus Vs Algebra, Computational capabilities.
[6]
UNIT-II
Functional dependencies and Normalization: Functional dependencies, Decomposition, Full
Functional Dependency (FFD), Transitive Dependency (TD), Join Dependency (JD), Multivalued Dependency (MVD), Normal Forms (1NF, 2NF, 3NF, BCNF), De-normalization. [8]
Database Security: Introduction, Threats, Counter Measures.
[2]
Control Structures: Introduction to conditional control, Iterative control and sequential control
statements, Cursors, Views.
[6]
2012-13
UNIT-III
Package, Procedures and Triggers: Parts of procedures, Parameter modes, Advantages of
procedures, Syntax for creating triggers, Types of triggers, package specification and package
body, developing a package, Bodiless package, Advantages of packages.
[6]
Transaction Management and Concurrency Control: Introduction to Transaction Processing,
Properties of Transactions, Serializability and Recoverability, Need for Concurrency Control,
Locking Techniques, Time Stamping Methods, Optimistic Techniques and Granularity of Data
items.
[7]
Database Recovery of database: Introduction, Need for Recovery, Types of errors, Recovery
Techniques.
[3]
Text Books:
1. RamezElmasri and Shamkant B. Navathe, Fundamentals of Database System, The
Benjamin / Cummings Publishing Co.
2. Korth and Silberschatz Abraham, Database System Concepts, McGraw Hall.
3. Pratt, DBMS, Cengage Learning.
Reference Books:
1. C.J.Date, An Introduction to Database Systems, Addison Wesley.
2. Thomas M. Connolly, Carolyn & E. Begg, Database Systems: A Practical Approach to
Design, Implementation and Management, 5/E, University of Paisley, Addison-Wesley.
3. Rob, Database Principal Fundamental Design, Cengage Learning.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
2012-13
GSM and CDMA Technology: Introduction to GSM, TDMA and CDMA, GSM Network and
System Architecture, GSM Channel
[4]
Wireless Modulation Techniques And Hardware: Transmission Characteristics of Wireline
and Fiber Systems, Air Interface, Wireless Coding Techniques, Digital Modulation Techniques,
Ultra-Wide Band Radio Technology, GSM System Hardware, CDMA System Hardware
[6]
UNIT-III
Wireless LAN/IEEE 802.11x: Introduction to WLAN, Evolution, Design Issues, Layer
Operation, wireless LAN security, Competing wireless technologies, typical WLAN hardware
[5]
Wireless PANs : WPAN IEEE 802.15x Technologies, Wireless PAN Application and
Architecture, Bluetooth Link Controller Basics, Operational States, IEEE 802.15.1 Protocols,
Evolution of IEEE 802.15 Standards.
[6]
Broadband Wireless MANs: Introduction, IEEE 802.16 Wireless MANs, MAC Layers
Physical Layer, Common System Operations, Introduction to Emerging Wireless Technologies
[5]
Text Books:
1. Mullet, Wireless Telecommunication Systems & Networks, Cengage learning.
2. Theodre S. Rappaport, Wireless communication: Principles & Practices, Pearson.
Reference Books:
1. Behrouz A Forouzan , Data Communications & Networking , TMH.
2. Stallings William, Wireless Communication and Networks, Pearson Education Ltd.
2012-13
Course Objectives:
2012-13
- 4 2
Course Objectives:
UNIT I
1. To draw a different level DFD.
2. To draw a ER diagram.
3. To draw a case diagrams.
UNIT II
4. To draw a sequence diagrams.
5. To draw a class diagrams.
6. To draw collaboration diagrams.
UNIT III
7. To draw Gantt chart and network diagram.
8. To draw a structured chat.
2012-13
Course Objectives:
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
3.5
Total Hours: 48
Course Objectives:
To understand the concept of formal languages and their relation with finite automata.
To study and design different finite automata.
To study context free grammars and ambiguity related issues.
To gain familiarization with Push- Down Automata and Turing Machines.
To explore relationship between different classes of formal languages.
UNIT -I
2012-13
Context Free Grammars: Examples and Definitions, Derivation trees and ambiguity, An
Unambiguous CFG for Algebraic Expressions. Regular Grammar, Simplified forms and Normal
forms: Removal of useless symbols and unit production, Removal of -moves, Chomsky
Normal Form (CNF), Griebach Normal Form (GNF).
[7]
UNIT-III
Pushdown Automata: Introduction and Definition of Push-Down Automaton, Applications of
Push Down Automata.
[4]
Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Non-recursive Language and an Unsolvable Problem, PCP
Problem and MPCP Problem.
[6]
More General Languages and Grammars: Recursively Enumerable and Recursive Languages,
Unrestricted grammars, Context sensitive Language and grammar. Relation between languages
of classes, Chomsky hierarchies of grammars.
[5]
Text Books:
1.
Martin J.C., Introduction to Languages and Theory of Computation, Tata McGrawHill Publising Company Limited, 3rd Edition.
2. Hopcroft J.E. and Ullman J.D., Introduction to Automata Theory Languages and
Computation, Narosa Publications.
Reference Books:
1. Sipser, Theory Of Computation, Cengage Learning.
2. Daniel I.A. Cohen, Introduction to computer Theory, John Wiley.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Total Hours: 48
Course Objectives:
2012-13
UNIT-II
Time Management: Project time management, activities sequencing, network diagrams, activity
recourse estimation, activity duration estimation, schedule development, Gantt Charts, Critical
path method, Programme evaluation & review technique (PERT) and CPM, concept of slack
time, schedule control.
[4]
Project Cost management: Basis principles of cost management, Cost estimating, type of cost
estimate, cost estimate tools & techniques, COCOMO, Putnam/ SLIM model Estimating by
Analogy, cost budgeting, cost control, earned value management, project portfolio management.
[5]
Project Quality Management: Quality Planning, quality Assurance, Quality control, Tool &
techniques for quality control, Pareto Analysis, Six Sigma, CMM, ISO
Standards, Juran Methodology.
[3]
Project
Human
Resource
Management:
Human
resource
planning,
project organizational charts, responsibility assignment metrics, acquiring project team, resource
assignment, resource loading, resource leveling, Different team structures developing project
teams.
[4]
UNIT-III
Project Communication Management: Communication Planning, Performance reporting,
managing stakeholders, improving project communication.
[3]
Project risk management: Risk Management planning, common sources of risk, risk
identification, risk register, qualitative risk analysis, using probability impact matrixes,
expert judgement, qualitative risk analysis, decision trees & expected monetary value,
simulation, sensitivity analysis, risk response planning, risk monitoring & control.
[6]
Project procurement management: Procurement management plans, contract statement of
work, planning contracts, requesting seller responses, selecting sellers, administrating the
contract, closing the contract.
[3]
2012-13
Software Configuration Management: Why versions exist, why retain versions, SCI, Releases
vs. version. Change Control and Management.
[3]
Text Books:
1. Mohapatra, Software Project Management, Cengage Learning.
2. SchwalbeKathy ; Information Technology Project Management fourth edition,
Thomson Course Technology.
3. Hughes Bob and Cotterell Mike , Software Project Management, Third Edition, Tata
McGraw-Hill.
References:
1.Jalote Pankaj , Software Project Management in Practice, Pearson Education.
2. S.A. Kelkar, Software Project Management, A Concise Study, Revised Edition, PrenticeHall India.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
0 3.5
Total Hours: 48
Course Objectives:
2012-13
techniques, Pointing and Selection, Inking and Painting, On-line character recognition.
[6]
UNIT-III
Solid Area Scan Conversion: Geometric representation of areas, Scan converting polygons,
Priority, The Y-X algorithm, Properties of scan conversion algorithms.
[4]
3-D Graphics: Curves and Surfaces: Parametric functions, Bezier methods and B-Spline
methods. Three dimensional transformations, Perspective transformations, Perspective depth.
[6]
Hidden Surface Elimination: Basic approaches, Depth Buffer algorithm, Scan line coherence
algorithms, Area coherence algorithms, Priority algorithms.
[6]
Text Books:
1. Newman, William M., Sproull, Robert F., Principles of Interactive Computer
Graphics, Tata McGraw Hill Company, 2nd Edition.
2. Hearn, D., Baker M. P. ,Computer Graphics, Pearson education.
3. Xiang Z., Plastock R., Computer Graphics, Schaums outlines, Tata Mcgraw Hill
Companies.
Reference Books:
1. Harrington, S., Computer Graphics: A Programming Approach, Tata McGraw Hill.
2. Roggers, D.F., Procedural Elements for Computer Graphics, Tata McGraw Hill.
2012-13
2012-13
2012-13
- 4 2
Course Objectives:
1. To draw a line using Simple DDA, Symmetrical DDA and Bresenhams Algorithm for
positive line slope.
2. To draw a line using Simple DDA, Symmetrical DDA and Bresenhams Algorithm for
negative line slope.
3. To draw a line, triangle and circle using functions of graphics.h header file.
4. To display simple shapes (Like hut, star, car etc.) using graphics primitives
5. To perform translation, scaling and rotation transformations on a given triangle.
6. To rotate a given triangle clockwise and anticlockwise about a given point.
UNIT-II
7. To perform reflection of a point about a line y= mx+c.
8. To draw a circle with a given center and radius using midpoint circle algorithm.
9. To draw a circle with a given center and radius using circle generator algorithm.
10. To display 4-bit region code for end points of a line and check whether line is completely
on the screen or off the screen.
11. To clip a line intersecting at one point with given window using Cohen Sutherland Line
Clipping algorithm.
12. To clip a line intersecting at Two or more points with given window using Cohen
Sutherland Line Clipping algorithm.
UNIT-III
13. To display the result of window to viewport transformation.
14. To calculate and display blending functions for Bezier Curves.
15. To draw a Bezier curve passing through four control points.
Version 1.1, Page 99 of 155
2012-13
2012-13
P Credits
2 1
Course Objectives:
Note: Students are required to design and develop a Project / CASE STUDY following all the
Phases of Software Development Life Cycle.
2012-13
3.5
Total Hours: 48
Course Objectives:
To understand the different methods and techniques of software testing and quality
assurance
To learn tracking of bugs in the software
To plan and design various test cases and to use different test tools
To develop error free and quality software.
UNIT I
Fundamentals and Testing types: First, second and later cycles of testing. Objectives and
limits of testing, Overview of S/W development stages, Planning and Design stages and testing
during these stages. Glass box code, Regression and Black box testing, Software errors,
Categories of software error.
[7]
Reporting and analyzing bugs: Problem reports, Content and Characteristics of Problem
Report, analysis and Tactics for analyzing a reproducible bug. Making a bug reproducible [5]
Problem Tracking System: Objective of Problem Tracking System, tasks of the system,
Problem trackingoverview, users of the tracking system, mechanics of the database
[4]
UNIT II
Test Case Design: Characteristics of a good test, equivalence classes and boundary values,
visible state transitions, Race conditions and other time dependencies, load testing. Error
guessing, Function equivalence testing, Regression Testing, General issues in configuration
testing, printer testing.
[8]
Version 1.1, Page 102 of 155
2012-13
Testing Tools and Test Planning: Fundamental tools, Automated acceptance and regression
tests, standards, Translucent box testing Overall objective of the test plan: product or tool?
Detailed objective, type of test, strategy for developing components of test planning documents,
components of test planning documents, documenting test materials
[7]
UNIT III
Software Quality Assurance Concepts and Standards : Concepts of software quality, quality
attributes, software quality control and software quality assurance, Quality Concepts, Quality
Control, Quality Assurance, SQA Activities, Software Reviews, Formal Technical Reviews,
Review Guidelines, Software Reliability, Software Safety, Quality Assurance Standards, ISO
9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six Sigma, SPICE, Software
Quality Assurance Metrics.
[8]
Quality related issues: S/W Development tradeoffs and models, Quality-related costs, The
development time line, Product design, alpha, Pre-beta, Beta, User Interface freeze, Pre-final,
Final integrity testing, Project post-mortems, Legal consequences of defective software,
Managing and role of a testing group, independent test agencies
[9]
Text Books:
1. CemKaner, Jack Falk, HungQuoc Nguyen, Testing Computer Software, Wiley, (Second
Edition).
2. William E. Perry, Effective Methods for Software Testing, John Wiley & Sons.
3. Boris Beizer,Software Testing Techniques, Second Edition, Dreamtech.
Reference Books:
1. Rex Black, Managing the Testing Process: Practical Tools and Techniques for
Managing Hardware and Software Testing .
2. Daniel Galin, Software Quality Assurance from Theory to Implementation, Pearson
Education.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
3.5
Total Lectures: 48
Course Objectives:
2012-13
UNIT III
Introduction to Shell and editors: Definition, Types of Shell, Feature and benefits of Shell. I/O
redirection and Piping, pipes, filters, Introduction to various text editor, various Vi editing
modes, scrolling, yank and paste, put and delete, set commands, Comparison of Emacs Editor, vi
Editor, Pico Editor.
[8]
Shell programming: Environmental & user defined variables, Argument Processing, Shells
interpretation at prompt, Arithmetic expression evaluation, Control Structure Redirection,
Background process & priorities of process, Conditional Execution, Parameter & quote
substitution.
[8]
Text Books:
1. Ellen Siever, Robert Love and Arnold Robbins, Linux in Nutshell, Fifth Edition, Oreilly
Media.
2. Kurt Wall, Mark Watson, Mark Whitis, Linux Programming, Third Edition, SAMS
Techmedia.
3. Mark Sobell, Practical Guide to Linux Programming, Pearson Education. Unix Shell
Programming, Kochan and Wood, Sams.
Reference Books:
1. Understanding Unix/Linux Programming, Molay, Prentice Hall.
2. MachteltGarrels, Introduction to Linux-A Hands on Guide, Addison Wisley.
3. J.Purcell, Linux Complete Command Reference, Red Hat Software, McGraw-Hill.
4. Haviland and Salama,Unix System Programming, Addison Wesley.
5.Gray, Interprocess Communications in Unix, Prentice Hall.
Instructions for paper setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
UNIT-III
Construction: Introduction, the design model, block design, working with construction.
[8]
2012-13
Testing: Introduction, on testing, unit testing, integration testing, system testing, the testing
process.
[8]
Text Books:
1. BoochGrady , Object-Oriented Analysis and Design with Applications, Addison-Wesley.
2. JacabsonIvar , The Unified Software Development Process, Prentice Hall.
Reference Books:
1. Martin, Object-oriented analysis and design, Prentice Hall.
2. Booch Grady, Object oriented design with applications, Benjamin/Cummings.
3. Richard C. Lee, William M. Tepfenhard, UML and C++, A Practical guide to objectoriented Development, Pearson Education.
4. Stephen R. Scach, Classical & Object Oriented Software Engineering with UML and Java,
McGraw Hill.
.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
Unit-I
J2EE: Introduction to J2EE, Building J2EE Applications, JDBC, Servlets and WebApplications,
Java Server Pages and Model/View/Controller, J2EE Web Services Overview, Introduction to
EJB, Session EJBs, Entity EJBs, JMS and message drivenBeans, Transactions and Security,
Application Servers (Case Study of any one of IBMWebsphere, BEA Weblogic, JBoss).
[16]
Unit-II
Hibernate: Principles of Object Relational Mapping, Hibernate configuration, HQLmaking
objects persistent, Hibernate semantics, Session management, flushing, concurrency and
Hibernate, Optimistic and Pessimistic Locking, Object mapping Mapping simple properties,
Single and multi valued associations, Bi-directional associations, Indexed collections, Using
Hibernate Template, Querying, Session management, Transaction integration and demarcation.
[16]
Unit-III
Spring: Introduction of Spring Framework: Spring Architecture, Spring Framework definition,
Spring & MVC, Factory Pattern, BeanFactory, Spring Context definition, Inversion of Control
(IoC), Spring AOP, Application Context and BeanFactory, SpringORM, Mapping API for JDO,
Hibernate, Hibernate Mapping, JDO Mapping, iBATIS,Spring Abstract Transaction layer,
Employing Spring transaction, Using EJB declarative transactions, Integration process,
integrating Spring MVC in web application, MVC inweb application, MVC Framework. [11]
2012-13
Text Books:
1. Jim Farley, William Crawford, Java Enterprise in a Nutshell,OReilly and Associates.
2. Brett McLaughlin, Java and XML, OReilly, 2nd Edition.
3. PradhanAnubhav, NanjappaSatheesha B., Nallasamy Senthil K, Esakimuthu Veerakumar
Raising Enterprise Applications: A Software Engineering Perspective, Willey India.
Reference Books:
1. Elliott Rusty Harold and W. Scott Means, XML in a Nutshell,OReilly.
2. James Cooper, Java Design Patterson: A Tutorial, Addison Wesley.
3. GovindSesadri, Enterprise java Computing: Application and Architectures,Cambridge
University Publications.
2012-13
2012-13
Sequence Control: Implicit and explicit sequence control, sequence control within expression,
sequence control between statements, subprogram sequence control, recursive subprogram,
exceptions and exception handlers, Co-routines, scheduled subprograms, tasks and concurrent
execution, Concurrency subprogram level concurrency, synchronization through semaphores,
monitors & message passing
[6]
Unit-III
Data Control: Names & referencing environment, static & dynamic scope, block structure,
Local data & local referencing environment, Shared data: dynamic & static scope. Parameter &
parameter transmission schemes.
[5]
Storage Management: Major run time elements requiring storage, programmer and system
controlled storage management & phases, Static storage management, Stack based storage
management, Heap storage management: variable & fixed size elements.
[6]
Programming Languages: Introduction to procedural, non-procedural, structured, logical,
functional and object oriented programming languages Java/C++, Concepts of Thread,
Comparison of C & C++ programming languages.
[5]
Text Books:
1. Pratt T.W., Programming languages Design & implementation, Prentice Hall Pub, New
Delhi, 1996.
2. Sabesta R.W., Concepts of Programming Languages, Addision Wesley, 9th edition.
3. Horowitz E., Fundamentals of Programming languages Galgotia publications (Springer
Verlag).
Reference Books:
1. Ghezzi C., Programming languages concepts, 1989, Wiley Publications.
2. Tucker A. and Noonan R., Programming Languages Principles and Paradigms, 2002,
T.M.H.
3. Meyers Scott,Effective C++ , e-book.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
Version 1.1, Page 111 of 155
2012-13
1. To implement test cases on classics application to become familiar with the sample application.
2. To record a simple script using the sample application for getting started with IBM rational
functional tester.
3. To set up regular expressions for dynamic values (pattern based recognition technique).
4. To play back scripts, call another script from an existing one and view results setting up the
preferences.
UNIT II
5.To select the type of Test Log Output (HTML, TXT, Test log in Test Manager) and insert delays
in the script.
6.To insert Timers in the script and user defined log entries.
7.To create custom classes and functions (Helper classes).
8.To import user defined packages and classes.
9.To create, use, display and modify a test object map.
UNIT III
10. To control Object-matching sensitivity and set up pattern based object recognition.
11. To run the Regression tests and import data from CSV files.
12. To create data pools and connect them to scripts.
13. To record troubleshooting and tips.
14. To record scripts to test HTML applications.
2012-13
UNIT III
11. Create regular expressions and know when and how to use them.
12. Change owner, group and permissions at the command line
13. Create a shell script and execute it.
14. Create system variables and know how and when to use them in a shell script.
15. Use of command arguments in a shell script.
16. Use looping and decision statements in a shell script
17. Allow a shell script to prompt the user and get information from the command line.
2012-13
Course Objectives:
UNIT-III
2012-13
To study the concepts, techniques, and system standards relevant to system-level and
data-level integration
To explore the pragmatics of enterprise integration using Rational Software Architect,
Rational Team Concert, Rational Application Developer
To develop the art of preparing and delivering fluid, concise, and effective talks and
presentations
UNIT I
2012-13
2012-13
Unit-III
8. Read a string from the standard input into a dynamically allocated character array that handles
varying size inputs. Test the program by giving it a string of data that is longer than the array size
allocated by the user.
9. Define an employee class that contains an employee name and a unique employee ID. Give
the class a default constructor and a constructor that takes a string representing the employees
name. Each constructor should generate a unique ID by incrementing a static data member. Also
define copy control members that are needed by employee class.
10. Design a generic class which checks the bounds of an array. The class should dynamically
allocate memory but generally does not de-allocates it. Fix this memory leak by writing a
destructor.
11. Design a class in which the copy constructor will make a deep copy of the copy constructor.
Shallow copies are also made by the assignment operator by default. Overload the assignment
operator to make a deep copy.
Note: Students are required to develop a Project using design patterns as well as the advanced
programming concepts learned during the course.
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
Total Hours: 48
Course Objectives:
UNIT-II
Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A Simple
Bootstrap Loader, Machine- Dependent Loader Features Relocation, Program Linking,
Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features
Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic
Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.
[10]
Editors And Debugging Systems: Text Editors - Overview of Editing Process, User Interface,
Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities,
Relationship With Other Parts Of The System, User-Interface Criteria.
[6]
Version 1.1, Page 119 of 155
2012-13
UNIT-III
Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro
Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features
Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro
Expansion, Keyword Macro Parameters, Macro Processor Design Options Recursive Macro
Expansion, General- Purpose Macro Processors, Macro Processing Within Language Translators,
Implementation Examples - MASM Macro Processor, ANSI C Macro Processor.
[10]
Compilers: Basic Compilers Functions- Grammars, Lexical Analysis, Syntactic Analysis, Code
Generation. Machine Dependent Compiler Features- Intermediate Form of the Program, Machine
dependent code Optimization. Machine Independent Compiler Features- Structured variables,
Machine Independent code Optimization. Compiler Design Options- Division into passes,
Interpreters, P-code Compilers, Compiler-Compilers.
[10]
Text Books:
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
Reference Books:
1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition,
Tata McGraw - Hill, 1999.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
2012-13
Languages for AI Problem Solving: Introduction to Prolog- syntax and data structures,
representing objects and relationships, built in predicates. Introduction to LISP- basic and
intermediate LISP programming.
[8]
Machine Learning: Strategic explanations Why, Why not and how explanations. Learning
Machine learning, adaptive learning. - Typical expert systems MYCIN, PIP, INTERNIST,
DART, XOON, Expert systems shells.
[8]
TEXT BOOKS:
1. Rich E., Artificial Intelligence, Tata McGraw Hills.
2. George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem
Solving, Pearson Education Asia.
REFERENCE BOOKS:
1.
2.
3.
4.
2012-13
2012-13
2012-13
3.5
Total Hours: 48
COURSE OBJECTIVES:
Understand the key concepts and tasks of compiler designing and phases of
compilation.
Understand the relation of various phases of compiler with formal languges and
implementation with basic examples.
UNIT-I
Introduction: Assemblers, linkers, loaders, compilers and translators, the structure of compiler,
different states in the construction of a compiler, Finite state machines and regular expressions.
[6]
Lexical analyzer: Design of Lexical analyzer, lexical-analyzer generator, LEX-compiler,
Formal grammars and their application to syntax analysis, BNF, notation, ambiguity. Context
free grammars, derivation and parse trees, capabilities of CFG. [8]
UNIT-II
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down
parsing, predictive parsers ,LR parsers, the canonical Collection of LR(0) items, constructing
SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR parsing
tables, implementation of LR parsing tables. [10]
Syntax-directed Translation: Syntax-directed Translation schemes, Intermediate code, postfix
notation, Parse trees & syntax trees, three address code, quadruple & triples, translation of
assignment statements. Data structure for symbols tables. [8]
2012-13
UNIT-III
Run time storage Administration: Implementation of a simple stack allocation scheme,
implementation of block structured languages, storage allocation in block structured
languages.[4]
Error Detection and Recovery : Error, Lexical-phase errors, syntactic-phase errors, semantic
errors. [4]
Code Optimization: The Principle sources of optimization, loop optimization, the DAG
representation of basic blocks. [4]
Code Generation: Object programs, problems in code generation, code generation from DAGs,
peephole optimization. [4]
Text Books:
1. Aho A.V. and ullaman J.D.Principles of Compiler Design, Pearson Publication
2. Aho A.V. and ullaman J.D.Principles of Compiler Design, Narosa Publishing House
3. Donovan, j, System Programming, TMH
Reference Books:
1. D.M. Dhamdhere: Compiler Construction- Principles and practice Mc Milan India
2. David Grics : Compiler Construction for digital computer
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
2012-13
P Credits
- 3
Total Hours: 48
Course Objectives:
2012-13
[10]
Text Books:
1. Godbole, Information Systems Security, Willey.
2. Farrera, Cyber Law, Cengage Learning.
3. Merkov, Breithaupt, Information Security, Pearson Education.
Reference Books:
1. Yadav, Foundations of Information Technology, New Age, Delhi.
2. Sood, Cyber Laws Simplified, McGraw Hill.
3. Furnell, Computer Insecurity, Springer.
Instructions for Paper Setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
P Credits
- 3
Total Hours: 48
Course Objectives:
2012-13
2012-13
2012-13
Unit-III
Fundamentals of E-commerce- definition, features, need & essential requirements, Parties to Ecommerce transactions, environment, E-commerce & trade Cycle, Internet concepts- Private
network, Public network (VPN), Intranet & its applications, Extranet
[6]
Business Strategy in an Electronic Age -Value Chain-Competitive Advantage-Business
strategies
[5]
E-commerce Types- Inter-organizational transaction, Purchasing online, After sales onlineinternet trading relationship-B2B, EDI & its impact on Business- B2C, Intra-organizational Ecommerce, Supply chain management.
[5]
Text Books:
1. Efrain Turbans, Jar Lee, David King and Michael H. Chung, E-Commerce: A Managerial
Perspective, Pearson Education, Delhi, 2003.
2. Whiteley David E-commerce: Strategy- Technologies and Applications- Tata McGraw
Hill- New Delhi- New York.
Reference Books:
1. C.S. Rayudu, E-Business, Himalaya Publishing House.
2. Chhabra, T.N., Suri, R.K. and Verma, Sanjiv, E-Commerce: New Vistas for Business,
Dhanpat Rai & Co. (P) Ltd. Delhi, 2004-05.
Instructions for Paper Setter:
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
P Credits
- 3
Total Hours: 48
Course Objectives:
To understand the importance of Enterprise-wide systems to business operations
To understand basic concepts, tools and techniques of Enterprise Resource Planning
To understand the business model and implementing ERP
To learn to use commercial ERP packages
UNIT - I
ERP Introduction- Benefits, Origin, Evolution and Structure: Conceptual Model of ERP,
Evolution of ERP, Structure of ERP, ERP and Functional Areas. Model: Dynamic and process.
[6]
ERP and Technology- Business Process Reengineering, Data ware Housing, Data Mining,
Online Analytic Processing(OLAP), Product Life Cycle Management(PLM),LAP, Supply chain
Management.
[5]
ERP Implementation: Implementation Challenges , Strategies , Life Cycle , Pre
implementation Tasks ,Requirements Definition , Methodologies , Package selection , Project
Teams ,Process Definitions , Vendors and Consultants , Data Migration , Project management
, Post Implementation Activities.
[6]
UNIT - II
ERP Marketplace and Marketplace Dynamics- Market Overview, Marketplace Dynamics,
Changing ERP Market.
[7]
ERP Functional Modules- Introduction, Functional Modules of ERP Software, Integration of
ERP, Inventory Control Supply Chain Management and Customer Relationship Applications
.
[8]
2012-13
UNIT III
ERP & E-Commerce, Future Directives- in ERP, ERP and Internet, Critical success and
failure factors, Integrating ERP into organizational culture.
[8]
Using ERP Tool- ERP System Package SAP, People Soft, BAAN and Oracle as a case study
[8]
Text Books:
1. Vinod Kumar Garg and N.K.Venkita Krishnan, Enterprise Resource Planning-Concepts
and Practice, Prentice Hall of India.
2. Antonio Fernandz, The SAP R/3 Handbook, Tata McGraw Hill.
Reference Books:
1.
2.
3.
2012-13
CHANDIGARH UNIVERSITY
GHARUAN
2012-13
- 1
3.5
Total Hours: 48
Course objectives:
Introduction: - Basic concept and origin, Examples of fields that use Digital Image Processing,
Fundamental steps in Digital Image Processing, Components of Image Processing System. [6]
Digital Image Fundamentals:- Image Sensing and acquisition, digital image representation,
Image Sampling and Quantization, Some basic relationships between pixels.
[7]
Image Enhancement: - Introduction, Enhancement in spatial domain: Some basic gray level
transformations, Histogram processing, Basics of spatial filtering, Smoothing and sharpening
spatial filters. Enhancement in frequency domain: Fourier transform and filtering in frequency
domain, smoothing and sharpening frequency domain filters.
[6]
UNIT-II
Image Restoration:- Introduction, a model of the image degradation/ Restoration process.
[5]
2012-13
UNIT-III
Morphological Image Processing: - Introduction, Dilation and erosion, Opening and closing,
Some basic morphological algorithms.
[5]
Image Segmentation and Representation:- Introduction, Detection of discontinuities: point
detection, Line detection, edge detection. Edge linking and boundary detection, Thresholding,
region based segmentation. Boundary representation, Boundary and Regional Descriptors,
Relational Descriptors.
[8]
Text Books:
1. Gonzalez,R. C., Woods R. E. Digital Image Processing, Pearson Prentice Hall.
2. Jain, Kasturi and Schunk, Machine Vision, Tata McGraw Hill.
3. Gonzalez, R. C., Woods R. E., Eddins, S. L., Digital Image Processing using
MATLAB, Pearson Prentice Hall.
Reference Books:
1. Sonka, Hlavac and Boyle, Image-processing, Analysis and Machine Vision, Cengage
Learning.
2. Low,Introductory Computer Vision and Image Processing,Tata McGraw Hill.
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
- - 3
Total Hours: 48
COURSE OBJECTIVES:
Understand the key concepts, theories, and tasks of data mining and knowledge discovery
in databases (KDD).
Understand the main strengths and limitations of commonly used data mining algorithms
and how to apply them to (Engineering) applications.
UNIT-I
Data warehousing: introduction , operational data stores , ETL , Data warehouses, design
guideleines for data warehouse implementation ,data warehouse metadata; OLAP,introduction
,characteristics , multidimensional view and data cube , data cube operations.[10]
Data mining , introduction , association rules mining , basics , nave algorithm , apriori
algorithm , direct hashing and pruning(DHP) , Dynamic Itemset counting(DIC) , Mining
frequent pattern without candidate generation(FP,growth), performance evaluation of algorithms
, software for association rule mining.
[16]
UNIT-II
Classification introduction , decision tree , tree induction algorithm split algorithm based on
information theory , split algorithm based on Gini index; nave bayes method; estimating
predictive accuracy of classification method; classification software.
[10]
UNIT-III
Cluster analysis , introduction , partitional methods , hierrarchical methods , density,based
methods , dealing with large databases ,cluster software.
[8]
Introduction to Web data mining and search engines.
[4]
2012-13
Text Books:
1. G.K.Gupta, Introduction to Data Mining with case studies, PHI publication.
2. VikramPudi, P.Radhakrishana, Data Mining, Oxford University press
Reference Books:
1. Pieter adriaans, dolfzantinge, Data mining, Pearson education press.
2. Paulrajpooniah, Data Warehousing Fundamentals, A,willeyinterscience Publication.
Instructions for paper setter
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
3.5
Total Hours: 48
Course Objectives:
To familiarize with soft computing concepts.
To introduce the ideas of Neural networks, fuzzy logic and use of heuristics based on
human experience.
To introduce the concepts of Genetic algorithm and its applications to soft computing
using some applications.
Unit I
Artificial Neural Network Introduction Fundamental concept Evolution of Neural Networks
Basic Models of Artificial Neural Networks Important Terminologies of ANNs
McCulloch-Pitts Neuron Linear Separability Hebb Network. Supervised Learning Network:
Perceptron Networks Adaline Multiple Adaptive Linear Neurons Back-Propagation
Network Radial Basis Function Network.
[10]
Associative Memory Networks: Training Algorithms for Pattern Association Autoassociative
Memory Network Heteroassociative Memory Network Bidirectional Associative Memory
Hopfield Networks Iterative Autoassociative Memory Networks Temporal
AssociativeMemory Network. Unsupervised Learning Networks: Fixed weight Competitive Nets
Kohonen Self-Organizing Feature Maps Learning Vector Quantization Counter propagation
Networks Adaptive Resonance Theory Networks Special Networks.
[10]
Unit II
Fuzzy Set Theory: Introduction to Classical Sets and Fuzzy sets Classical Relations and
Fuzzy Relations Tolerance and Equivalence Relations Non interactive Fuzzy sets
Membership Functions: Fuzzification Methods of Membership Value Assignments
Defuzzification Lambda-Cutsfor Fuzzy sets and Fuzzy Relations Defuzzification Methods.
2012-13
[6]
Fuzzy Arithmetic and Fuzzy Measures: Fuzzy Rule Base and Approximate Reasoning: Truth
values and Tables in Fuzzy logic Fuzzy Propositions Formation of Rules Decomposition
and Aggregation of rules Fuzzy Reasoning Fuzzy Inference Systems (FIS) Fuzzy Decision
Making Fuzzy Logic Control Systems.
[8]
Unit III
Genetic Algorithm: Introduction Basic Operators and Terminologies in GAs Traditional
Algorithm vs. Genetic Algorithm Simple GA General Genetic Algorithm The Scheme
Theorem Classification of Genetic Algorithm Holland Classifier Systems Genetic
Programming.
[8]
Applications of Soft Computing: A Fusion Approach of Multispectral Images with SAR Image
for Flood Area Analysis Optimization of Travelling Salesman Problem using Genetic
Algorithm Approach.
[6]
Text Books:
2012-13
2012-13
2012-13
0.5
0.8
0.4
S=
0.9
0.6
0.2
0.1
0.7
0.5
0.7
0.8
0.9
0.5
0.1
0.8
0.6
0.
0.4
0.3
2012-13
2012-13
UNIT-III
Programming languages for embedded systems: Desirable characteristics of programming
languages for embedded systems, low-level versus high-level languages, main language
implementation issues: control, typing, exception handling, modularity and multi-threading.
Major programming languages for embedded systems: Assembly, C/C++, Ada and Java,
Overview of PMC, Effiel, Forth.and overview of Real time databases.
[8]
Compilation Techniques For Embedded Software: code generation, re-target ability, code
optimization.
[4]
Examples of Embedded And Real-Time Software Systems.
[4]
TEXT BOOKS:
1.
2.
Gomaa, Software Design Methods for Concurrent and Real-Time systems, AddisonWesley, 1993.
Raj Kamal, Embedded Systems Architecture, Programming and Design, Tata Mcgraw
Hill, New Delhi.
REFERENCE BOOKS:
1.
2.
2012-13
2012-13
UNIT-III
Data Warehousing Concepts, OLAP and Data mining: Evolution of data warehousing, data
warehousing concepts, ETL, Data Warehouse Design benefits and problems of data
warehousing, comparison of OLTP systems and data warehousing, On-Line Analytical
Processing, Introduction to data mining.
[8]
Physical Database Design and Performance: Physical database design process, designing field,
designing physical record and de-normalization, designing physical files -file organizations,
clustering files, using and selecting indexes.
[7]
TEXT BOOKS:
1. Thomas Connolly, Carolyn Begg, Database systems, 3rd edition, Pearson Education.
2. G.K Gupta, Introduction to Data Mining with Case Studies, PHI.
REFERENCE BOOKS:
1.
2.
3.
4.
2012-13
2012-13
UNIT-III
Graphics: Performance and Multithreading, Graphics and UI Performance, Android Graphics
and Multimedia: Mobile Agents and Peer-to-Peer Architecture, Android Multimedia.
[6]
Location: Mobility and Location Based Services, Android.
[3]
Security and Hacking: Active Transactions, More on Security, Hacking Android.
[3]
Platforms and Additional Issues: Development Process, Architecture, Design, Technology
Selection, Mobile App Development Hurdles, Testing.
[6]
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, Printice Hall.
2. Alfred J. Meneze, Handbook of Applied Cryptography, CRC Press.
REFERENCE BOOKS:
1. Roberta Bragg, Network Security - The Complete Reference, McGraw Hill.
2012-13
2012-13
UNIT-III
PROTEIN CLASSIFICATION & STRUCTURE PREDICTION: Structure of amino acids
primary structure secondary structure folds and motifs alpha and beta helix structure
based protein classification protein structure Data bases folding problem PROPSEARCH
primary structure analysis and prediction secondary structure analysis and prediction motifs
profiles patterns and fingerprints.
[10]
TEXT BOOKS:
1. S.C Rostogi ,Mendiratta, P.Rasogi, BioInformatics: methods and applications,second
edition, PHI 2006.
2. Jean Mickel Clavere & Cadrienotredom Bio Informatics A beginners guide Wiley
DreamTech, 2003.
REFERENCE BOOKS:
1. T.K. Attwood and D.J Perry Smith, Introduction to Bio Informatics, Pearson Education, 1st
Edition, 2001.
2. Dan E.Krane, Michael L.Raymer, fundamental concepts of BioInformatics, Pearson
Education,
2004.
Instructions for paper setter.
The syllabus has been divided into three equal units. The paper setter is required to set Ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
2012-13
2012-13