Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech - Ist Branch: Common to all Branches

Subject: Physics-I Course Code: A000111(015)
Total Marks in End Semester Exam: 100 L:3 T:1 P:0 Credits: 4
Minimum number of Class Tests: 02

Course Objective:
Basic concepts of Mechanics, Optics and its applications, Electromagnetism, Quantum & Semiconductor Physics.

Note:
5 Units / Semester - Total 50 hrs. (L + T)
Branch wise:
 Civil/Metallurgy/Mining - Units 1/2/3/8/10
 Mechanical/Mechatronics/Production/Automobile - Units 1/4/5/6/10
 Electrical/Electrical & Electronics/Chemical - Units 1/3/7/8/9
 Computer Science/IT/Electronics/EI/AEI/Biotech - Units 1/7/8/9/10

Unit-1: Physical Quantities, Motion in Two or Three dimensions (10hrs.)

Standards and Units, Unit consistency and conversions, Uncertainty and Significant figures, Estimates and
orders of magnitude, Position and velocity vectors, The Acceleration vector, Projectile motion, Motion in a
circle, Relative velocity, Free body diagrams, Conservative and Non-conservative Forces; Central forces,
Noninertial frames of reference.

Unit-2: Mechanics of Solids (10hrs.)

Angular velocity and acceleration, Rotation with constant angular acceleration, Relating linear and angular
kinematics, Energy in rotational motion, Parallel axis theorem, Moment of Inertia calculations, Conditions
for equilibrium, Bending Stress, Shear stress, Concept of strain energy, Elastic Module, Concepts of
elasticity and plasticity.

Unit-3: Wave Optics (10hrs.)

Superposition of waves and interference of light by wave front splitting and amplitude splitting, Fresnel bi-
prism; wedge shaped film, Newton’s rings, Farunhofer diffraction from a single slit, The Rayleigh criterion
for limit of resolution and its application to vision, Diffraction gratings and their resolving power.

Unit-4: Electrostatics in vacuum and dielectric medium (10hrs.)

Calculation of electric field and electrostatic potential for a charge distribution,Divergence and curl of
electrostatic field, Laplace’s and Poisson’s equations for electrostatic potential,Laws of electrostatics,
Polarisation, Permeability and dielectric constant, Polar and non-polar dielectrics, Solving simple
electrostatics problem in presence of dielectrics like Point charge at the centre of a dielectric sphere.

Unit-5: Magneto static in a linear magnetic medium (10hrs.)

Bio-Savart law, Divergence and curl of static magnetic field,vector potential and calculating it for a given
magnetic field using Stokes’ theorem, Magnetisation, Solving for magnetic field due to simple magnets like
a bar magnet, Permeability and Susceptibility, Classification of magnetic materials, Ferromagnetism,
Paramagnetic and diamagnetic materials, Magnetic domains and hysteresis.

2
Unit-6: Faraday’s law and Electromagnetic waves (10hrs.)

Faraday’s law of electromagnetic induction, Continuity equation for current densities, displace current and
magnetic field arising from time dependent electric field, Maxwell’s equation in vacuum, Energy in an
electromagnetic field, Flow of energy and Pointing vector, Plane electromagnetic waves in vacuum, Their
transverse nature and polarization, Relation between electric and magnetic fields of an electromagnetic wave.

Unit-7: Introduction to Quantum Mechanics (10hrs.)

Wave nature of Particles, Time-dependent and time-independent Schrodinger equation for wave function,
Born interpretation, Expectation values (only basic), Free-particle wave function and wave-packets,
Uncertainty principle, Solution of stationary-state Schrodinger equation for one dimensional problem like
particle in a box.

Unit -8: Solid electronic materials (10hrs.)

Electron in periodic potential, Kronig-Penny model (only basic to introduce origin of band gap), E-k
diagram, Electron conduction, Conductivity, Drift velocity, Energy bands in solids, Direct and indirect band
gaps, Types of electronic materials: metals, semiconductors, and insulators, Occupation probability, Fermi
level, Effective mass, Density of states and energy band diagrams.

Unit -9: Semiconductors (10hrs.)

Intrinsic and extrinsic semiconductors, Electron and hole concentration, Concept of Fermi Level,
Dependence of Fermi level on carrier-concentration and temperature, Doping, impurity states, n and p type
semiconductors, Carrier generation and recombination, Law of mass action, Charge neutrality condition
,Carrier transport: diffusion and drift, p-n junction, Depletion region and potential barrier, Energy band
structure of PN junction in forward and reverse biasing ,Metal semiconductor junction (Ohmic and
Schottky).

Unit-10: Lasers & Fibre Optics (10hrs.)

Einstein’s theory of matter radiation interaction and A and B coefficients, amplification of light by
population inversion in optical resonator, different types of lasers: gas lasers (He-Ne,), solid-state lasers
(ruby, Neodymium), semiconductor laser, Properties of laser beams.

Fibre Optics: Introduction, Optical fibre as a dielectric wave guide, Total internal reflection, Numerical
aperture and various fibre parameters, Losses associated with optical fibres, Step and graded index fibres,
Application of optical fibres.

Course Outcomes:
Students will be familiar with:
 Mechanics of solids, Wave optics & its engineering applications.
 Some of the basic laws related to electromagnetic.
 Introduced to the principle of Semiconductor physics.
 Simple quantum mechanics calculations.

Text Books:
1. Introduction to Mechanics-Mahendra K. Verma,Universities Press, Hyderabad
2. David Griffiths, Introduction to Electrodynamics, Addison-Wesley Professional
3. H. J. Pain, The Physics of Oscillations and Waves, Wiley
4. J. Singh, Semiconductor Optoelectronics: Physics and Technology McGraw-Hill Inc
5. Quantum Mechanics, Ajay Ghatak S. Lokanathan, Trinity
6. Engineering Physics by Gaur & Gupta,DhanpatRai Publications

3
Reference Books:

1. Engineering Physics by PG Kshirsagar& M N Avadhanulu, S. Chand Publications

2. Modern Physics for Engineers, S.P. Taneja, R. Chand
3. Engineering Physics, Malik and Singh, Tata McGraw Hill
4. Sears and Zemansky’s University Physics, Volume-1 Mechanics, Pearson
5. Mechanics, Mathur, S.Chand Publishing
6. Electromagnetic Theory, Prabir K. Basu&HrishikeshDhasmana, AneBooks
7. David Griffiths, Quantum Mechanics, Pearson Education
8. Quantum Mechanics: A Text Book for undergraduates, Mahesh C Jain, TMH
9. A. Ghatak , Optics, McGraw Hill Education
10. O. Svelto, Principles of Lasers, Springer Science & Business Media
11. The Physics of waves and Oscillations, N.K. Bajaj, TMH
12. H. C. Verma, Concepts of Physics Vol – 1&2, Bharti Bhawan Publication
13. Halliday and Resnick, Physics.

4
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to all Branches
Subject: Mathematics - I Course Code: A000112(014)
Total Marks in End Semester Exam: 100 L: 3 T: 1 P: 0 Credits: 4
Minimum number of Class Tests: 02

Course Objective:
The objective of this course is to familiarize the prospective engineers with techniques in calculus, multivariate
analysis and linear algebra. It aims to equip the students with standard concepts and tools at an intermediate to
advanced level that will serve them well towards tackling more advanced level of mathematics and applications
that they would find useful in their disciplines. More precisely, the objectives are:
 To introduce the idea of applying differential and integral calculus to notions of curvature and to improper
integrals. Apart from some applications it gives a basic introduction on Beta and Gamma functions.
 To introduce the fallouts of Rolle’s Theorem that is fundamental to application of analysis to Engineering
problems.
 To develop the tool of power series and Fourier series for learning advanced Engineering Mathematics.
 To familiarize the student with functions of several variables that is essential in most branches of
engineering.
 To develop the essential tool of matrices and linear algebra in a comprehensive manner.

UNIT I: Calculus (8 hours)

Evaluation of definite and improper integrals, reduction formulae, Beta and Gamma functions and
their properties; Applications of definite integrals to evaluate surface areas and volumes of
revolutions.

UNIT II : Calculus (8 hours)

Rolle’s Theorem, Mean value theorems, Taylor’s and Maclaurin theorems with remainders;
indeterminate forms and L'Hospital's rule; Maxima and minima.

UNIT III : Sequences and series: (8 hours)

Convergence of sequence and series, tests for convergence; Power series, Taylor's series, series for
exponential, trigonometric and logarithm functions; Fourier series: Half range sine and cosine
series, Parseval’s theorem.

UNIT IV : Multivariable Calculus (Differentiation) (8 hours)

Limit, continuity and partial derivatives, total derivative; Tangent plane and normal line; Maxima,
minima and saddle points; Method of Lagrange multipliers; Gradient, curl and divergence
directional derivatives.

UNIT V : Matrices (8 hours)

Rank of a matrix by elementary transformation, normal form of a matrix, System of linear
equations; Symmetric, skewsymmetric and orthogonal matrices; Eigen values and eigenvectors;
Diagonalization of matrices; Cayley-Hamilton Theorem and Orthogonal transformation.

5
Text/Reference Books
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson,
Reprint, 2002.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,
2006.
3. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
4. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
5. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11thReprint,
2010.
6. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2010.
7. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
8. V. Krishnamurthy, V.P. Mainra and J.L. Arora, An introduction to Linear Algebra,Affiliated
East–West press, Reprint 2005.

Course Outcomes:
The objective of this course is to familiarize the prospective engineers with techniques in basic calculus and
linear algebra. It aims to equip the students with standard concepts and tools at an intermediate to advanced
level that will serve them well towards tackling more advanced level of mathematics and applications that
they would find useful in their disciplines.
The students will learn:
 To apply differential and integral calculus to notions of curvature and to improper integrals. Apart
from various applications, they will have a basic understanding of Beta and Gamma functions.
 The essential tools of matrices and linear algebra including linear transformations, eigen values,
diagonalization and orthogonalization.

6
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to All Branches
Subject: Basic Electrical and Electronics Engineering Course Code: A000113(024)
Total Marks in End Semester Exam: 100 L: 2 T:1 P:0 Credits: 3
Minimum number of class tests to be conducted: 02

Course Objective:
 Understand the basic concepts of DC and AC circuits.
 Analyse the series, parallel and series, parallel ac circuits.
 Acquire knowledge about working principle, construction and losses of a transformer.
 Understand the working, characteristics and applications of diodes.
 Understand the construction, working, characteristics and applications of a transistor.

Unit – I: D.C. Networks:

Introduction, Ohm’s law, Kirchhoff’s laws, Mesh and Nodal analysis, Superposition theorem,
(only independent sources). Definitions of MMF, Magnetic field strength, Reluctance, Leakage flux
and fringing, Core losses, Comparison of the Electric and Magnetic Circuits, Problems on Series
Magnetic Circuits.

Unit – II: A.C. Circuits:

Production of AC voltage, Basic Definitions of root mean square and average values, form factor
and peak factor, the j operator and Phasor Algebra, Analysis of ac series and Parallel Circuits,
Series- Parallel Circuits.

Unit – III: Single phase Transformers:

Introduction, Principles of operation, Constructional details, Ideal Transformer and Practical
Transformer, EMF equation, Rating, Phasor diagram at no load, Losses in Transformers.

Unit-IV: Diode:
Brief Review of Semiconductors, N-Type & P-Type Semiconductors, Formation of Depletion
Layer in a PN Junction, Forward & Reverse Biased, V-I Characteristic, Diode Current
Equation,Diode Applications.LED, Advantages & applications of LEDs., Seven-segment Displays,

Unit-V: Transistor:
BJT Construction, Junction Biasing of BJT, Operation of NPN & PNP BJT, Input and Output
Characteristics of Transistor in CE configuration; Transistor as an Amplifier& as a Switch.
Advantages of ICs & Scale of Integration.

Course Outcomes:
 Apply the knowledge of basic laws to electric and magnetic circuits.
 Distinguish between various types of representation of ac quantities.
 Draw the phasor diagrams of an ideal and a practical transformer at no load.
 Analyse and design basic circuits which include diode, LED and seven segment display.
 Analyse and design circuits consisting of transistors.

7
Text Books:

1. Fundamentals of Electrical Engineering & Electronics, B.L. Theraja,S. Chand Publication.

2. Principles of Electronics by V. K. Mehta, 3rd Edition, S. Chand and Co.Ltd.(Unit-IV & V)
3. D.P. Kothari and I.J. Nagrath, “Theory and Problems of Basic Electrical Engineering”, PHI.

Reference Books:

1. Fitzrald and Higgonbothom, “Basic Electrical Engineering”, Fifth Edition, McGraw Hill.
2. V.N. Mittal and Arvind Mittal, “Basic Electrical Engineering”, Second Edition, Tata
McGraw Hill.
3. Electrical and Electronic Technology By Hughes 10th Edition , Pearson Education.
4. A textbook of Electronic Circuits. By R. S. Sedha, S. Chand Publication.
5. H. Cotton, ”Advance Electrical Technology,” ISSAC Pitman, London.
6. Parker Smith S. (Ed. Parker Smith N.N.), “Problems in Electrical Engineering”, Tenth
edition, Asia publication.
7. Del Torro, Vincent “Electrical Engineering Fundamentals”, Second Edition Prentice Hall of
India Pvt. Ltd.
8. Basic Electrical & Electronics Engineering 1stEdition by D. P. Kothari and I. J.
Nagrath,
9. Electronics Devices and Circuits by Jacob Millman and Christos C. Halkias, 3rd Edition Mc.
Grah Hill Pub.

8
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to All Branches
Subject: Engineering Graphics and Design Course Code: A000114(037)
Total Marks in End Semester Exam: 100 L: 1 T: 0 P: 0 Credits: 1
Minimum number of class tests to be conducted: 02

Course Objective:
1. To introduce the students to the “universal language of Engineers” for effective communication through
drafting exercises of geometrical solids.
2. Understanding of technical drawings
3. Learn basic CAD software skills.
4. Learn basic engineering drawing formats.
5. Make basic engineering drawings using graphics software.
6. Develop the graphical skills for communication of concepts, ideas and design of engineering

Unit I: Introduction to Engineering Drawing

Principles of Engineering drawing and their significance, Lines, Lettering, Dimensioning, Scales,

Unit II: Projection

Principles of projection, Method of projection, First and third angle projections, Orthographic
projections, Isometric projection.

Unit III: Basic concept of drafting software

Introduction to CAD software, merits and demerits of CAD, Application of CAD, GUI, limits and
units, Basic co-ordinate system, setting of status bar option-snap, grid, O-snap, Dynamic input,
ortho, polar, and etc. concept of block, viewports and layer.

Unit IV: Drafting using CAD software

Drawing Tools: Circle, Arcs, Rectangle, Polygon, Ellipse, Spline, Poly-Line, and Multi-Line.
Editing Tools: Trim, Move, Copy, Rotate. Geometry Modifying Tools: Fillet, Chamfer, Scale,
Stretch. Copying Tools: Array, Mirror, and Offset. Dimensioning and Annotations.

Unit V: 3-D modeling using CAD software

Types of three dimensional model, basic primitives’ tools: extrude, revolve, sweep, loft, wedge.
Solid editing Tools: shell, round, taper faces, copy faces, chamfer edges, modifying tools: 3D-
move, 3D- copy, rotate, scale, align. Copying tools: array and its type,

Text Books:

1. Bhatt, N.D., "Elementary Engineering Drawing", Charotar Book Stall, Anand

2. George Omura, " Mastering AutoCAD" B.P.B. Publication, New Delhi

9
Reference Books:

1. Engineering Graphics – Laxminarayanan & V. and Vaish Wanar, R.S. Jain Brothers, New
Delhi
2. Engineering Graphics – Chandra, AM & Chandra Satish 1998.
3. Engineering Graphics – K.L. Narayan and P. Kannaih, Tata McGraw Hill
4. AutoCAD: A problem solving approach- Tickoo, S. Delmar Cengage Learning 2015.
5. Mastering AutoCAD and AutoCAD LT-George Omura, Brian C. Benton, Wiley publisher,
2018.

Course Outcomes:
After learning the course the students should be able to
 To know and understand the conventions and the method of engineering drawing.
 To improve their visualization skills through interpretation of Orthographic, Isometric
views of objects so that they can apply this skill in developing new products.
 To improve their technical communication skill in the form of communicative drawings.
 To create 2-D Computer geometry and it’s dimensioning.
 To create 3-D Computer geometry and able to visualize it for presentation graphics.

10
 Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech - Ist Branch: Common to All Branches

Subject: Fundamentals of Computer Course Code: A000115(022)
Total Marks in End Semester Exam: 100 L: 2 T: 0 P: 0 Credits: 2
Minimum number of Class tests: 02

Course Objective:
1. To learn the Computer Fundamental concepts
2. To aware students about Software and Hardware
3. To make them to use basic components of MS Office
4. To give the foundations for different Applications

Unit I: Fundamentals of Computers

Generations of computer, block diagram of a computer, computer hardware and software

components: Central Processing Unit (CPU), VDU, Keyboard and Mouse, Other input/output
Devices, Computer Memory, Memory Hierarchy: Primary and Secondary Storage (Auxiliary
Storage), Secondary storage; magnetic disks vs optical disks (CD, CD-RW and DVD Memory),
data – numeric data, alpha numeric data, concept of data and information: storage, seeking,
processing and transmission.
Unit II: Hardware and Software

Computer Peripherals: Cables, Buses, Device drivers, installation of devices: keyboard, mouse,
scanner, printer, web-camera, speakers and many more; plug-and-play devices; expansion
slots……..System software, Program Language Translators, application software, Programming
Language Paradigms: Imperative, Object-Oriented and Logic languages, Basics of Popular
Operating Systems (Windows and Linux); The User Interface, Using Mouse and Organizing
Desktop components, Running an Application, File, Folders and Directory management features,
Using Help; Creating Short cuts, Configuring Operating System: Windows and Ubuntu, BIOS,
System Utilities and Antivirus software.
Unit III: Basic Computer Literacy

Word Processing Basics (MS Word / LibreOffice Writer): Opening and Closing of documents; Text
creation and Manipulation; Formatting of text; Table handling; Spell check, language setting and
thesaurus; Printing of word document; Using Spread Sheets (MS Excel / LibreOffice Calc) Basic
operations of Spreadsheets; Manipulation of cells; Formulas and Functions; Editing of Spread
Sheet, printing of Spread Sheet; Basics of presentation software (MS PowerPoint / LibreOffice
Impress) Preparation and Presentation of Slides; Slide Show; How to make an effective
presentation: Working with Presentation Tools (Create, Edit, Move, Delete, Resize, Format text
object), Working with Graphics tools (Creating Tables, Organization Charts, Hyperlinks), Saving,
editing and closing presentation; Taking printouts of presentation / handouts.

Unit IV: Computers and Communication

WWW and Web Browsers: Basic of Computer networks; LAN, WAN; Networking Devices,
Topologies, Cables and connectors, Connecting to internet; ISP; Basics of internet connectivity
related troubleshooting, Web Browsing software, Search Engines; URL; Domain Names; IP

11
Addressing, Wi-Fi and Bluetooth technology overview, Internet and Intranet: architecture, various
file formats, Applications of INTERNET: Electronic mailing systems (Google Mail features):
Creating and Managing mailing accounts, folders, Document collaboration, Instant Messaging,
Netiquettes; Skype calling and Messenger services;functioning and features of smart gadgets: Smart
phones, 4K smart television gadgets, kindle, gaming-gadgets, fitness gadgets and alike.

Unit V: Application Domains

Impact of computers in society: Computer applications in office automation, book publishing, data
analysis, accounting, investment, inventory control, graphics and multimedia, air and railway ticket
reservation sites, robotics, cyber security, Audio andVideo-conferencing, social networking,
surveillance, Case Studies: Computer Literacy for banking, KYC, Insurance and financial
transactions, operating mobile banking, Nine Pillars of Mission Digital India (DI-Initiatives) and
their scheme highlights.

Text Books:

1. Computer Basics by IGNOU.

2. Suresh K Basendrea: Computers Today
3. Pradeep K. Sinha, Priti Sinha, “Computer Fundamentals”. BPB Publications.
4. Rajaraman, V., “Fundamental of Computers”. Prentice Hall India, New Delhi
5. Sanders Donald H Computers Today

Course Outcomes:
The student will learn
 To familiar with Computer Fundamental
 To know about MS Office.
 To use different text, spreadsheet and presentation skill.
 To apply different applications.

12
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to all branches
Subject: Physics (Lab) Course Code: A000121(015)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 2 Credits: 1

Course Objective:
Physics lab provides students the first-hand experience of verifying various theoretical concepts learnt in theory
courses.

Total 36 labs. Hrs. About 10 – 12 experiments to illustrate the concepts learnt in Physics (Hrs. 3/ week).
Suitable number of experiments from the following categories:
 Mechanics
 Optics and its applications
 Electromagnetic
 Semiconductor Physics
 Laser & Optical fiber

Text book:

1. A textbook of Engineering Physics Practical 2nd edition, University Science Press

Laboratory Objective:
Students should be able to
 State various laws which they have studied through experiments.
 Describe principles of LASER & Optical fibre.

13
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to All Branches
Subject: Basic Electrical and Electronics Engineering (Lab) Code: A000122(024)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 2 Credits: 1

Lab Objective:
 Verify the basic laws and theorems of DC circuits.
 Analysis the RLC series, parallel and series, parallel ac circuits.
 Understand the construction and perform ratio test on a single phase transformer.
 To plot and find out the characteristics of a diode in forward and reverse bias.
 Top plot and find out the input and output characteristics of a transistor

List of Experiments (To perform minimum 10 experiments):

1. To verify Superposition theorem.

2. To verify Kirchhoff’s Current Law and Kirchhoff’s Voltage Law.
3. To determine V– I characteristics of Incandescent lamp.
4. To study B-H curve.
5. To measure current, power, voltage and power factor of series RLC circuit.
6. To measure current, power, voltage of parallel RLC circuit.
7. To measure current, power, voltage of series parallel RLC circuit.
8. To measure R and L of choke coil.
9. To study construction of a single phase transformer.
10. To perform ratio test and polarity test of a single phase transformer.
11. To calculate efficiency of a single phase transformer by direct loading.
12. To verify Thevenin’s theorem and Norton’s theorem.
13. To study construction of Single Phase A.C. machines.
14. To study construction of Three Phases Induction motors.
15. To study charging and discharging of a capacitor.
16. To study types of meters in the lab.
17. To study construction of D.C. machine.
18. To plot V-I characteristics of PN Junction Diode.
19. To plot V-I characteristics of Light Emitting Diode.
20. To plot Static Characteristics of Transistor in CE configuration
21. To study the operation of transistor as a switch.
22. To study the operation of transistor as an amplifier.

Lab Outcomes:
Students will be able to
 Relate the Basic laws and theorems with the practical applications.
 Apply the knowledge in their daily life with electrical circuits.
 Visualize the magnetic and electric circuits in a transformer.
 Analyze diode circuits and to design and implement diode applications.
 Analysis and design circuits using bipolar transistors.

14
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to All Branches
Subject: Fundamental of Computer (Lab) Course Code: A000123(022)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 2 Credits: 1

The laboratory should be preceded or followed by a Practical Lecture to explain the approach or
algorithm to be implemented for the problem given. Open Source software can be used.
Practical Lecture (L T P) – 0 0 1 Lab. Work (L T P) – 0 0 3
Practical Lecture 1:Introduction and working Lab1: Identifying the computer hardware like
of Hardware Components input output devices, CPU, mother board,
Buses etc.
Practical Lecture 2: Introduction and working Lab 2: Making Algorithm, DFD, ER diagram.
of Software. Working of software’s like system, Utility,
Application software.
Practical Lecture 3: Introduction and Lab 3: Basic operations of Operating System:
working of Operating System creating file, Directory, Removing file,
directory, date time setting, renaming etc. use
internal and external connabds.

Practical Lecture 4: Introduction and Lab 4: use the basic features of MS Office
working of MS Office
Practical Lecture 5: Introduction of MS Lab5: Create the document with all
Word alignment. Use the different properties of MS
Word
Practical Lecture 6: Introduction of MS Lab 6: Make the use of Spreadsheet for data
Excel representations, Calculation and graphical
presentations. Use properties of Excel

Practical Lecture 7: Introduction of Power Lab 7: MS-PowerPoint

presentation Make the presentation with Multimedia
features. Use the animation tools
Practical Lecture 8 &9: Introduction of Lab 8 and 9: Computer communication
computer communication related practical

1. Connect the Internet; open any website of

your choice and save the WebPages.
2. Search any topic related to your syllabi
using any search engine and download the
relevant material.
3. Send any greeting card to your friend.
4. Create your E-Mail ID on any free E-Mail
Server.
5. Login through your E-Mail ID and do the
following:
a. Read your mail
b. Compose a new Mail
c. Send the Mail to one person
d. Send the same Mail to various
persons
e. Forward the Mail
f. Delete the Mail

15
 g. Send file as attachment
6. Surf Internet using Google to find
information about your state
7. Surf Internet using Google to find
Tourism information about your state
8. Surf Internet using Yahoo to find
Hotels around your state
9. Surf Internet using Google to find
information about educational institutes
for teaching M.S in comp science in
India
Surf Internet using Google to find information
about Indian Compare the cost, overheads and
Practical Lecture 10: installing Computer Lab 10: Installing the working computer
System system
Practical Lecture 11: Different ICT use of Lab 11: Filling online AAADHAR, Voter id,
Government Schemes PAN etc form
Practical Lecture 12: Applications of Lab 12: online filling of different digital India
Computer in Digital India applications

Laboratory Outcomes:

 To give idea about fundamentals of Computer

 To make familiar with MS Office
 To be able to write, document, present their work when developing project
 To be able to better foundations in Computer Field.
 To be able to know online applications of Digital India.

Text & Reference books:

1. Pradeep K. Sinha, Priti Sinha, “Computer Fundamentals”. BPB Publications.

2. Rajaraman, V., “Fundamental of Computers”. Prentice Hall India, New Delhi
3. Suresh K Basendrea: Computers Today
4. Sanders Donald H Computers Today

16
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Semester: B.Tech - Ist Branch: Common to All Branches
Subject: Engineering Graphics and Design (Lab) Course Code: A000124(037)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 4 Credits: 2

List of Practical:

1. Study of any drafting software- GUI, limits and units, drawing tools, editing tools,
annotations, etc.
2. Study of co-ordinates systems- Cartesian and polar (absolute and relative system of
measurement) and Practice drawing by using following tools: Grid, snap, O-snap, Lines,
Erase, Zoom.
3. Study and create drawing by using Drawing tools: Circle, arcs, rectangle, polygon, ellipse,
Editing tools: trim, move, copy, rotate and practice of drawing using these commands.
4. Study and create drawing by using Geometry modifying tools: fillet, chamfer, scale, stretch
5. Study and create drawing by using copying tools like array, mirror, block and offset.
6. Study and detailing of drawing by using dimensioning and annotations tools.
7. Study and create drawing with different types of line by using Layer command
8. Create geometry by modify it by using Scales- plane and diagonal scale and create conics
sections- ellipse, parabola, hyperbola, rectangular hyperbola, involutes.
9. Draw regular solids: Cube, Prism, Pyramid, Cylinder, Cones
10. Draw sectional views of solids- Cube, Prism, Pyramid, Cylinder, Cones.

17
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech – 2nd Branch: Common to all Branches
Subject: Chemistry-I Course Code: A000211(011)
Total Marks in End Semester Exam: 100 L: 3 T: 1 P: 0 Credits: 4
Minimum number of Class Tests: 02

Unit I – V is common for all braches except Chemical Engineering

Unit VI – X are specific to Chemical Engineering

Unit – I
Atomic & molecular structure 10 hours
Molecular orbital Theory: Equations for atomic and molecular orbitals (LCAO), Energy level diagram
of homo (H2, N2, O2, Li2, F2) & hetero molecules (CO, NO, HF), Concept of bond order. Pi‐molecular
orbitals of butadiene, benzene and aromaticity.
CrystalFieldTheory:Splitting ofd-orbitalof octahedralandtetrahedral complexes,Energy leveldiagram
oftransitionmetal ion&magneticproperty, numerical based on Crystal field stabilization energy.

Unit – II
Spectroscopic techniques and applications 10 hours
Principle of spectroscopy. Electromagnetic radiation, Spectrophotometer (line diagram)
Electronic Spectroscopy (Ultraviolet–visible spectroscopy): Theory, Types of electronic transition,
Chromophore, auxochromes , Electronic excitation in conjugated dienes , Absorption Laws, applications on
quantitative analysis , Simple numerical based on absorption laws and uses or application of
Electronic Spectroscopy
Vibrational spectroscopy (Infrared spectroscopy): Molecular vibration, Selection rule, functional group
region, fingerprint region and uses or application of Vibrational spectroscopy.
Nuclear magnetic resonance spectroscopy: Introduction, number of signal, chemical shift, Spin‐spin
coupling and uses or application of Nuclear magnetic resonance spectroscopy.

Unit – III 8 hours

Use of free energy in Chemical Equilibria
Thermodynamic Functions: Energy, Entropy, Free energy, Cell potential & related numericals,Estimationsof
entropy and free energies, Nernst Equation & its application to voltaic cell, Relation of free energy with
EMF.
Corrosion: Electrochemical theory of corrosion, galvanic series, Galvanic corrosion, Differential aeration
corrosion, Pitting, and Water line corrosion, Caustic embrittlement, factors affecting corrosion , Cathodic
Protection.

Unit –IV
Periodic properties 8 hours
Periodic table, atomic and ionic radii, ionisation energies, electron affinity, electronegativity.
Effective nuclear charge, penetration of orbitals, variations of s, p, d and f orbital energies of atoms.
Polarizability,Oxidation states, coordination numbers and geometries, Hard, soft acids and bases
(Classification, Pearsons HSAB principle , its applications & limitations) Molecular Geometry (Valence shell
electron pair repulsion theory to NH3, H3O+, SF4, CIF3, ICl2 and H2O), Numerical based on effective nuclear
charge.

2
Unit -V 8 hours
Organic reactions and synthesis of drug molecule
Introduction to reactions involving substitution (free radical-Chlorination of molecule, Gomberg reaction,
Wurtz reaction, Electrophilic, Nucliophilic-SN1 SN2), Addition (Electrophilic–Morkownihoff
rule,Nuclophilic)Elimination ( α elimination , β elimination , unimolecular E1, biomolecular E2), oxidation
(Baeyer villiger oxidation), reduction (Clemmensen reduction, Wolff‐Kishner reduction) cyclization
(Bergman Cyclization) and ring openings and rearrangement reaction ( Beckamann, Reimer-
Tiemann reaction, Canannizaro, crossed cannizzaro reaction)
Synthesis of a commonly used drug molecule: General guidelines of drug making, synthesis of Aspirin,
Ibuprofen, Paracetamol.
Unit -VI
Introduction to quantum theory 8 hours
Schrodinger equation & its importance, Applications to hydrogen atom, Wave mechanical model for
manyelectronatoms‐ radial distributioncurves.
Unit -VII 10 hours
Chemical bonding in molecules:
MO theory, Structure, bonding and energy levels of bonding and shapes of many atom molecules,
CoordinationChemistry, Electronic spectra and magnetic properties of complexes with relevance to bio-
inorganic chemistry, organometallic chemistry.
Unit -VIII 8 hours
Stereochemistry:
Introduction to Stereochemistry: Representations of 3 dimensional structures, Chirality, Optical
activity. Isomerism‐ structural isomerism, stereoisomers, enantiomers, diastereomers, Configurations
(D, L &R, S), Geometrical isomerism (cis and trans & E and Z). Racemic modification & their resolution,
Isomerism in transitional metalcompounds.
Conformational analysis: Conformations of cyclic ( cyclohexane) and acyclic compounds (ethane
& butane).
Unit -IX
Reactivity of organic molecules: 8 hours
Organic acids and bases: factors influencing acidity, basicity, and nucleophilicity of molecules, kinetic
vs. thermodynamic control of reactions.
Unit -X 10 hours
Strategies for synthesis of organic compounds:
Reactive intermediates substitution, elimination, rearrangement, kinetic and thermodynamic
aspects, role of solvents.

Course Outcomes:
The concepts developed in this course will aid in the quantification of several concepts in chemistry that have been
introduced at the 10+2 levels in schools. Technology is being increasingly based on the electronic, atomic and
molecular level modifications. Quantum theory is more than 100 years old and to understand phenomena at
nanometer levels, one has to base the description of all chemical processes at molecular levels. The course will
enable the student to:
 Analyse microscopic chemistry in terms of atomic and molecular orbital’s and intermolecular forces.
 Distinguish the ranges of the electromagnetic spectrum used for exciting different molecular energy levels
in various spectroscopic techniques.
 Rationalise bulk properties and processes using thermodynamic considerations.
 Rationalise periodic properties such as ionisation potential, electro negativity, Oxidation states.
 List major to significant chemical reactions that are used in the synthesis of molecules.
 Use the knowledge of quantum theory in various chemical systems.
 Appreciate aliphatic chemistry and stereochemistry
 Write simple mechanisms

3
Text Books:
1. A.TextBookofEngg.Chemistry,ShashiChawala,DhanpatRai&Co.(P)Ltd.
2. EngineeringChemistry byP. C.Jain(Dhanpat RaiPublishing Company.
3. Engineering Chemistry,Concept in engineering Chemistry by Satyaprakash and Manisha
Agrawal by Khanna Publication.

Books for Chemical Engineering:

1. Advanced Inorganic Chemistry Vol 1 & II by Gurdeep Raj,Goel Publishing House.
2. OrganicReaction and Their Mechanism,P.S.Kalsi ,NewAgeInternational Publishers.

Reference Books:
1. University chemistry, by B. H. Mahan
2. Chemistry:Principles and Applications, by M. J. Sienko and A. Plane
3. Fundamentals of Molecular Spectroscopy, by C. N. Banwell
4. Engineering Chemistry (NPTEL Web‐book), by B. L. Tembe,Kamaluddin and M. S. Krishnan
5. Physical Chemistry, by P. W. Atkins
6. OrganicChemistry:StructureandFunctionbyK.P.C. VolhardtandN.E. Schore, 5thEdition
7. Essentials of PhysicalChemistry,Bahi & Tuli, S. Chand Publishing
8. Introduction to Nanoscience by S. M. Lindsay

4
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech – 2nd Branch: Common to all Branches
Subject: Mathematics - II Course Code: A000212(014)
Total Marks in End Semester Exam: 100 L: 3 T: 1 P: 0 Credits 4
Minimum number of Class Tests: 02

Course Objective:
The objective of this course is to familiarize the prospective engineers with techniques in multivariate
integration, ordinary and partial differential equations and complex variables. It aims to equip the students to
deal with advanced level of mathematics and applications that would be essential for their disciplines. More
precisely, the objectives are:
 To acquaint the student with mathematical tools needed in evaluating multiple integrals and
their usage.
 To introduce effective mathematical tools for the solutions of differential equations that
model physical processes.
 To introduce the tools of differentiation and integration of functions of complex variable that
are used in various techniques dealing engineering problems.

UNIT I
Multivariable Calculus (Integration) (8 hours)
Double and triple integrals (Cartesian), change of order of integration in double integrals, Change of
variables (Cartesian to polar), Applications: areas and volumes, Center of mass and Gravity
(constant and variable densities); Triple integrals (Cartesian),
Orthogonal curvilinear coordinates, Simple applications involving cubes, sphere and rectangular
parallelepipeds; Scalar line integrals, vector line integrals, scalar surface integrals, vector surface
integrals, Theorems of Green, Gauss and Stokes (without proof) & its applications.

UNIT II
First order ordinary differential equations (8 hours)
Exact, linear and Bernoulli’s equations, Euler’s equations, Equations of first order and higher
degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s
type.

UNIT III
Ordinary differential equations of higher orders (8 hours)
Higher order linear differential equations with constant coefficients & variable coefficients, method
of variation of parameters, Cauchy-Euler equation.
Power series solutions; Legendre polynomials and their properties, Bessel functions of the first kind
and their properties.

UNIT IV
Complex Variable – Differentiation (8 hours)
Differentiation, Cauchy-Riemann equations, analytic functions, harmonic functions, finding
harmonic conjugate; elementary analytic functions (exponential, trigonometric, logarithm) and their
properties; Conformal mappings, Mobius transformations and their properties.

5
UNIT V
Complex Variable – Integration (8 hours)
Contour integrals, Cauchy-Goursat theorem (without proof), Cauchy Integral formula (without
proof), Liouville’s theorem and Maximum-Modulus theorem (without proof); Taylor’s series, zeros
of analytic functions, singularities, Laurent’s series. Residues, Cauchy Residue theorem (without
proof), Evaluation of definite integral involving sine and cosine, Evaluation of certain improper
integrals using the Bromwich contour.

Textbooks/References:

1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson,Reprint,
2002.
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006
3. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value
Problems,9th Edn., Wiley India, 2009.
4. S. L. Ross, Differential Equations, 3rd Ed., Wiley India, 1984.
5. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice HallIndia, 1995.
6. E. L. Ince, Ordinary Differential Equations, Dover Publications, 1958.
7. J. W. Brown and R. V. Churchill, Complex Variables and Applications, 7th Ed., Mc-Graw Hill,
2004.
8. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2008.
9. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.

6
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech – 2nd Branch: Common to all Branches
Subject: Programming for Problem Solving Course Code: A000213(022)
Total Marks in End Semester Exam: 100 L: 3 T: 0 P: 0 Credits: 3
Minimum number of Class tests: 02

Course Objectives:
 To learn the Computer Fundamental concepts
 To aware students about Problem Solving approach
 To make them to use basic components of Programming

Unit I: Introduction (4 lectures)

Introduction to Programming, Introduction to components of a computer system (disks, memory,
processor, where a program is stored and executed, operating system, compilers etc.), Idea of
Algorithm: steps to solve logical and numerical problems. Representation of Algorithm: Flowchart,
Pseudo code and Source code with examples.

Unit II: Programming Concepts (9 lectures)

Variables, data types, memory locations, Syntax and Logical Errors in compilation, object and
executable code, Arithmetic expressions and precedence, Conditional Branching and Loops:
Writing and evaluation of conditionals and consequent branching, Iteration and loops.

Unit III: Arrays (9 lectures)

Introduction to Arrays (1-D, 2-D), Character arrays and Strings, Basic Algorithms: Searching, Basic
Sorting Algorithms (Bubble, Insertion and Selection), Finding roots of equations, notion of order of
complexity through example programs (no formal definition required).

Unit IV: Function (9 lectures)

Definition, prototyping, built in libraries, Parameter passing in functions, call by value, Passing
arrays to functions: idea of call by reference, Recursion: Example programs, such as Finding
Factorial, Fibonacci series, Ackerman function etc. Quick sort or Merge sort.

Unit V: Structure (9 lectures)

Defining structures and Array of Structures, Pointers: Idea of pointers, Defining pointers, Use of
Pointers in self-referential structures, notion of linked list (no implementation), bit-fields.
File handling: concept of a file, text files and binary files, Formatted I/O, file I/O operations,
example programs

Course Outcomes:
The student will learn-
 To formulate simple algorithms for arithmetic and logical problems.
 To decompose a problem into functions and synthesize a complete program using divide and
conquer approach.
 To use arrays, pointers and structures to formulate algorithms and programs.
 To apply programming to solve matrix addition and multiplication problems and searching and
sorting problems.

7
Text Books:

1. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill.

2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill

Reference Books:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall
of India

8
 Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech – 2nd Branch: Common to all Branches

Subject: English Course Code: A000214(046)
Total Marks in End Semester Exam: 100 L:2 T:0 P:0 Credits: 2
Minimum number of Class Tests: 02

UNIT – I
Vocabulary Building
1.1 Root words from foreign languages and their use in English
1.2 Acquaintance with prefixes and suffixes from foreign languages in English to form derivatives.
1.3 Synonyms, antonyms, Homonyms and Homophones.
1.4 One Word Substitution
1.5 Basics of Phonetics: Definitions, Phonetic Symbols, Transcription of one and two syllable
words
1.6 Communication: Definition, Cycle, Elements, 7Cs & Barriers

UNIT – II
Basic Writing Skills
2.1 Types of Sentences and Tenses, Voices and narration
2.2 Use of phrases and clauses in sentences
2.3 Importance of proper punctuation
2.4 Creating coherence
2.5 Techniques for writing precisely

UNIT – III
Identifying Common Errors in Writing
3.1 Parts of speech, Subject-verb agreement
3.2 Noun-pronoun agreement
3.3 Misplaced modifiers
3.4 Articles
3.5 Prepositions
3.6 Redundancies
3.7 Clichés
3.8 Errors in Spelling/ Misspelled words

UNIT – IV
Writing Practices
4.1 Comprehension
4.2 Précis Writing
4.3 Essay Writing
4.4 Business Letters & Job Application
4.5 Formal Reports: Components & Characteristics
4.6 Writing e-mails

UNIT – V
Listening
5.1 Listening: Definition, purposes, types, and strategies to improve listening.
5.2 Characteristics of effective listening.
5.3 Barriers to Listening and measures to overcome barriers
5.4 Note making: types and conversion of notes into texts.

9
UNIT – VI
Oral Communication (This unit involves interactive practice sessions in Language Lab)
6.1 Listening Comprehension
6.2 Pronunciation, Intonation, Stress and Rhythm
6.3 Common Everyday Situations: Conversations and Dialogues
6.4 Communication at Workplace
6.5 Interviews
6.6 Formal Presentations

Course Outcomes:
The student will acquire basic proficiency in English including reading and listening comprehension, writing
and speaking skills.

Suggested Books:
1. Practical English Usage. Michael Swan. OUP. 1995.
2. Remedial English Grammar. F.T. Wood. Macmillan.2007
3. On Writing Well. William Zinsser. Harper Resource Book. 2001
4. Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.
5. Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press. 2011.
6. Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press
7. English and Communication Skills for Students of Science and Engineering. S.P. Dhanavel.
Orient Blackswan Ltd.2009.
8. Scientific English: A Guide for Scientists and Other Professionals. R A Day. Universities
Press. 2000.
9. Word Power Made Easy. Norman Lewis. W R Goyal Publishers and Distributors.
Publishers. 2009
10. Textbook of English Phonetics for Indian Students. T Balasubramaniam. Macmillan
Publishers.2012
11. Technical Communication: Principles and Practice. Meenakshi Raman and Sangeeta
Sharma. Oxford University Press. 2015.

10
 Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech – 2nd Branch: Common to all Branches

Subject: Basic Civil Engineering & Mechanics Course Code: A000215(020)
Total Marks in End Semester Exam: 100 L: 3 T: 0 P: 0 Credits: 3
Minimum number of Class Tests: 02

Course Objectives:
 To introduce about the properties of common building materials to the students.
 To introduce the basic concepts of concrete and foundation to the students.
 To introduce the basic concepts of surveying & levelling to the students.
 To introduce the basic concepts of general system of forces to the students.
 To introduce the simple methods of analyzing truss to the students.

UNIT - I
Building Material
Qualities of good brick, Water absorption and Compressive Strength test for bricks. Types of
Cement, Ingredients of Portland cement and their functions, Fineness, Setting Times and
Compressive Strength of Cement, Functions of Sand in mortar, Mortar Mix proportions for various
uses.

UNIT – II
Building Construction
Ingredients of Cement Concrete, Grades of Concrete, proportions for Nominal mix concrete,
Workability & Compressive Strength of Concrete, Curing of Concrete.
Necessity of foundations, Definitions of Safe bearing capacity, Ultimate bearing capacity and factor
of safety, Difference between Load Bearing & Framed Construction.

UNIT - III
Surveying & Levelling
Principles of Surveying, Technical terms, Calculation of reduced level by Height of instrument and
Rise & Fall method, Simple problems in levelling.

UNIT – IV
General System of Forces
Equations of equilibrium for a system of concurrent forces in a plane.Constraint, Action and
Reaction.Types of support and support reactions. Free Body Diagram – Body subjected to two
forces & Body subjected to three forces. Moment of a force. Theorem of Varignon, Equations of
Equilibrium.

UNIT –V
Analysis of Plane Trusses
Engineering Structures, Rigid or perfect Truss, Determination of Axial forces in the members of
truss, Method of Joints, Method of Sections.

11
Course Outcomes:
After completing the course students should be able to
 Identify the properties of common building materials.
 Understand basic concepts of concrete and foundation.
 Understand the basic concepts of Surveying & levelling.
 Understand the basic concepts of general system of forces.
 Analyze truss by simple methods.

Text books:
1. Comprehensive Basic Civil Engineering B.C. Punmia
2. Building construction by Ahuja and Birdi
3. Engineering Mechanics by A. K. Tayal

Reference books:
1. Basic Civil Engineering by Ramamurutham
2. Engineering Mechanics by R. K. Bansal

12
 Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech – 2nd Branch: Common to all Branches

Subject: Chemistry-I (Lab) Course Code: A000221(011)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 2 Credits: 1

List of Experiments:

Choice of 8 – 10 experiments from the following:

1. Determination of surface tension and viscosity.

2. Thin layer chromatography.
3. Ion exchange column for removal of hardness of water.
4. Determination of chloride content of water.
5. Colligative properties using freezing point depression.
6. Determination of the rate constant of a reaction.
7. Determination of cell constant and conductance of solutions.
8. Potentiometry - determination of redox potentials and emfs.
9. Synthesis of a polymer/drug/ organic compounds.
10. Saponification/acid value of oil.
11. Chemical analysis of salt / organic compounds.
12. Lattice structures and packing of spheres.
13. Models of potential energy surfaces.
14. Chemical oscillations- Iodine clock reaction.
15. Determination of the partition coefficient of a substance between two immiscible liquids.
16. Adsorption of acetic acid by charcoal.
17. Use of the capillary viscosimeters to the demonstrate of the isoelectric point as the Ph of
minimum viscosity for gelatin sols and/or coagulation of the white part of egg .
18. Spectrophotometric determination.

Course Outcomes:
The chemistry laboratory course will consist of experiments illustrating the principles of chemistry relevant to
the study of science and engineering. The students will learn to:

 Estimate rate constants of reactions from concentration of reactants/products as a function of time

 Measure molecular/system properties such as surface tension, viscosity, conductance of
solutions, redox potentials, chloride content of water, etc
 Synthesize a small drug molecule and analyse a salt sample

Text Books:

1. Laboratory Manual Engg. Chemistry, Anupama Rajput, Dhanpat Rai & Co. (P) Ltd.
2. Laboratory Manual on Engg. Chemistry, S. K. Bhasin& Sudha Rani, Dhanpat Rai & Co. (P)
Ltd.

13
 Chhattisgarh Swami Vivekananda Technical University, Bhilai
Semester: B.Tech – 2nd Branch: Common to all Branches
Subject: Programming for Problem Solving (Lab) Course Code: A000222(022)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 4 Credits: 2

The laboratory should be preceded or followed by a Practical Lecture to explain the approach or
algorithm to be implemented for the problem given.
Practical Lecture (L T P) – 0 0 1 Lab. work (L T P) – 0 0 3
Practical Lecture 1: Problem solving using Lab1: Familiarization with programming
computers environment
Practical Lecture 2: Variable types and type Lab 2: Simple computational problems using
conversions arithmetic expressions
Practical Lecture 3: Branching and logical Lab 3: Problems involving if-then-else
expressions structures:
Practical Lecture 4: Loops, while and for Lab 4: Iterative problems e.g., sum of series
loops
Practical Lecture 5: 1D Arrays: searching, Lab 5: 1D Array manipulation
sorting
Practical Lecture 6: 2D arrays and Strings Lab 6: Matrix problems, String operation
Practical Lecture 7: Functions, call by value Lab 7: Simple functions
Practical Lecture 8 & 9: Numerical methods Lab 8 & 9: Programming for solving
(Root finding, numerical differentiation, Numerical methods problems
numerical integration):
Practical Lecture 10: Recursion, structure of Lab 10: Recursive functions
recursive calls
Practical Lecture 11: Pointers, structures and Lab 11: Pointers and structures
dynamic memory allocation
Practical Lecture 12: File handling Lab 12: File operations

Laboratory Outcomes
 To formulate the algorithms for simple problems
 To translate given algorithms to a working and correct program To be able to correct
syntax errors as reported by the compilers
 To be able to identify and correct logical errors encountered at run
 To be able to write iterative as well as recursive programs
 To be able to represent data in arrays, strings and structures and manipulate them
 through a program
 To be able to declare pointers of different types and use them in defining self referential
structures.
 To be able to create, read and write to and from simple text files.
Text Books:

1. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill.

2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill.
Reference Books :
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice
Hall of India

14
 Chhattisgarh Swami Vivekananda Technical University, Bhilai

Semester: B.Tech – 2nd Branch: Common to all Branches

Subject: Basic Civil Engineering & Mechanics (Lab) Course Code: A000223(020)
Total Marks in End Semester Exam: 40 L: 0 T: 0 P: 2 Credits: 1

List of Experiments:

1. Water Absorption test on bricks.

2. Compressive strength test on bricks.
3. Fineness of cement by sieve analysis.
4. Initial setting time of cement.
5. Compressive Strength test of Cement.
6. Sieve analysis and F.M. of fine aggregate.
7. Sieve analysis and F.M. of coarse aggregate.
8. Compressive strength test of Concrete.
9. Difference in level between two given stations by Height of Instrument
method.
10. Difference in level between two given stations by Rise & Fall method.

15
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Semester: B.Tech – 2nd Branch: Common to all Branches
Subject: Workshop Practice/Manufacturing Process (Lab) Course Code: A000224(037)
Total Marks in End Semester Exam: 40 L:0 T:1 P:4 Credits: 3

Course Objective:
The course is designed to meet the following objectives.
 Acquire skills in engineering practice.
 To identify tools, work materials and measuring instruments for different trades.

Unit I:
Forging: Introduction to manufacturing process, and its classification, use of various forging tools,
forging operations, forging defects.
Suggested Jobs: Forging of chisel, forging of screw driver.

Unit II:
Carpentry: Different types of wood, carpentry tools, different joints, polishing, wood working
Lathe.
Suggested Jobs: Making of name plate, stools and a small job on wood working lathe.
Unit III:
Fitting Shop: Introduction to bench working. Work holding devices, measuring instruments, fitting
tools and their specification, types of joints fitting operations.
Suggested Jobs : Preparation of job by use of filling, sawing, chipping, drilling and tapping
operations.
Unit IV: Moulding: Pattern materials, allowances, moulding terminology.
Suggested Jobs : Prepare moulds of patterns, casting small household objects like paper-
weight etc.
Unit V: Welding: Study and use of gas, Arc, soldering, brazing methods. Safety precaution.
Suggested Jobs : Preparing Lap and Butt joints by gas and arc welding method.
Unit VI: Metal Cutting: Common machining operations, different machine tools, cutting tools
materials, different type of Lathes, Lathe operations, shaper and its specification. Quick return
mechanism of shaper.
Suggested Jobs : Making small shaft, cutting screw thread on Lathe.

Course Outcomes:-
Upon completion of this course, the students will gain knowledge of the different manufacturing processes
which are commonly employed in the industry, to fabricate components using different materials.

Text Books:
1. Hajra Choudhury S.K., Hajra Choudhury A.K. and Nirjhar Roy S.K., “Elements of Workshop
Technology”, Vol. I 2008 and Vol. II 2010, Media promoters and publishers private limited,
Mumbai.
2. Rao P.N., “Manufacturing Technology”, Vol. I and Vol. II, Tata McGrawHill House, 2017.
3. B.S. Raghuvanshi, Workshop Technology, Vol I&II, Dhanpat Rai & Sons.

16
Reference Books:

1. Kalpakjian S. And Steven S. Schmid, “Manufacturing Engineering and Technology”, 4th edition,
Pearson Education India Edition, 2002.
2. Gowri P. Hariharan and A. Suresh Babu,”Manufacturing Technology – I” Pearson Education, 2008.
3. Roy A. Lindberg, “Processes and Materials of Manufacture”, 4th edition, Prentice Hall
India, 1998.
4. M.L.Begeman and B.H.Amstead, Manufacturing Process, Wiley
5. W.A.J.Chapman and E. Arnold, Workshop Technology, Vol I, II, & III, CRC Press, Prentice Hall
6. V. Narula, Workshop Technology, S.K. Kataria and sons.

17
 ChhattisgarhSwamiVivekanand Technical University, Bhilai
SCHEME OF TEACHING & EXAMINATION
BE (Computer Science & Engineering) III Semester

Sl.N Subject Periods per week Scheme of Exam Total Credit

Board of Study Subject Name
o. Code L T P ESE CT TA Marks L+(T+P)/2

Appl. 322351(14)
1 Mathematics-III 4 1 - 80 20 20 120 5
Mathematics

Electronics & 322352(28)

2 Basic Electronics 3 1 - 80 20 20 120 4
Telecom.

Comp. Science 322353(22)

3 Computational Science 3 1 - 80 20 20 120 4
&Engg.

Comp. Science 322354(22) Problem Solving & Logic

4 3 1 - 80 20 20 120 4
&Engg. Building using C

Comp. Science 322355(22) Computer Concepts & Web

5 3 1 - 80 20 20 120 4
&Engg. Technology

Electronics & 322356(28) Digital Electronics & Logic

6 3 1 - 80 20 20 120 4
Telecom. Design

Electronics & 322361(28)

7 Basic Electronics Lab - - 3 40 20 60 2
Telecom.

Comp. Science 322362(22) Problem Solving & Logic

8 - - 3 40 20 60 2
&Engg. Building using C Lab

Electronics & 322363(28) Digital Electronic and Logic

9 - - 3 40 20 60 2
Telecom. Design Lab

Comp. Science 322364(22) Web Technology Lab(HTML

10 - - 3 40 20 60 2
&Engg. / DHTML/CSS/XML)
322365(46)
11 Humanities Value Education - - 2 40 40 1
12 Library - - 1

TOTAL 19 6 15 640 120 240 1000 34

L: Lecture, T: Tutorial, P: Practical, ESE: End Semester Exam, CT: Class Test, TA: Teachers Assessment
Note: Duration of all theory papers will be of Three Hours.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Mathematics – III Code: 322351(14)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To make the students understand the Fourier series analysis is a powerful method where the formulas are
integrals and to have knowledge of expanding periodic functions that explore variety of applications of
Fourier series.
2. To provide knowledge of Laplace transform of elementary functions including its properties and applications
to solve ordinary differential equations.
3. To provide a sound background of complex analysis to perform a thorough investigation of major theorems of
complex analysis and to apply these ideas to a wide range of problems that includes the evaluation of both
complex line integrals and real integrals.
4. To have a thorough knowledge of PDE which arise in mathematical descriptions of situations in engineering.
5. To study about a quantity that may take any of a given range of values that can’t be predicted as it is but can
be described in terms of their probability.

UNIT- I Fourier series: Expansion of function as Fourier series, Change of interval, Even and odd functions, Half-range
Fourier series, Practical harmonic analysis.

UNIT-II Laplace Transformation: Laplace transform of elementary functions, Properties of Laplace transform, Laplace
transform of derivatives and integrals, multiplication by tn and division by t, Laplace transform of periodic
functions. Inverse Laplace transform, Convolution theorem, Application of Laplace transform to solutions of
ordinary differential equations.

UNIT- III Theory of Complex Variables: Limit, Derivative and Analytic functions; Cauchy-Riemann equations and its
applications to flow problems; Complex Integration: Line and Contour integral, Cauchy integral theorem and
Integral formula; Taylor series, Laurent series; singularities; Poles and their orders and residues; Evaluation of real
definite integrals.

UNIT-IV Partial Differential Equation: Formation of partial differential equations, Equations solvable by direct integration,
Lagrange’s linear equations, Homogeneous linear differential equations with constant coefficients, Non-
homogeneous linear equations, Solution of partial differential equations by the method of separation of variables.

UNIT-V Random variable: Discrete and continuous probability distributions, Mathematical expectation, Mean and
Variance, Moments, Moment generating function, probability distribution, Binomial, Poisson and Normal
distributions.

Text Books:
1. Higher Engg. Mathematics by Dr. B.S. Grewal– Khanna Publishers.
2. Advanced Engg. Mathematics by Erwin Kreyszig – John Wiley & Sons.

Reference Books:
1. Advanced Engg.Mathematics by R.K. Jain and S.R.K. Iyengar – Narosa Publishing House.
2. Applied Mathematics by P.N.Wartikar& J.N. Wartikar. Vol- II– Pune VidyarthiGriha Prakashan, Pune.
3. Applied Mathematics for Engineers & Physicists by Louis A. Pipes- TMH.

COURSE OUTCOME:
After completion of this course the students will be able to apply Fourier series, Laplace transformation, Theory of complex
variable, Partial differential equations and Random variable to Computer Science problems and solve them. Hands on these
Mathematical topics will make them equipped to prepare for higher studies through competitive examinations.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Basic Electronics Code: 322352(28)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To learn basic concepts of semiconductors
2. To understand working principle of Diode, Transistor and FET
3. To gain knowledge of applications of Diode and Transistor
4. To learn concepts of transport phenomenon and amplifications through numerical

UNIT- I Introduction, Transport Phenomena in semiconductor, Formation of P-N Junction, Properties of P-N Junction, P-N
Junction Diodes; Semiconductor Diodes, V-I Characteristics, Effect of Temperature on V-I Characteristics, Ideal
Diode, Diode equation, Diode Resistance, Diode Capacitance: Transition and Diffusion Capacitance.

UNIT-II Rectifying circuits and DC Power Supplies: Load line analysis of diode circuit, Half wave rectifier: Voltage
regulation, Ripple factor, Ratio of rectification, Transformer Utilization factor. Full wave rectifier, Bridge rectifier,
Filter circuits for power supply: Inductor filter, Capacitor filter, LC filter, Multiple LC filter, CLC or filter. Zener
diode: Break down mechanism, Characteristics, Specifications, Voltage regulator circuit using zener diode.

UNIT- III Transistor: Introduction, Construction, Types: npn and pnp, Current components. Transistor as an amplifier,
Transistor Characteristics, Transistor Circuit Configuration: Common Base (CB) Configuration, Common Emitter
(CE) Configuration, Common Collector Configuration (CC), Early Effect, Ebers-Moll Model, Maximum Voltage
Ratings.

UNIT-IV Transistor Biasing and Thermal stabilization: The operating point, Bias stability, Stability factor, Emitter bias,
Collector – to – base bias, Voltage divider bias with emitter bias, Emitter bypass capacitor, Bias compensation.

UNIT-V Field Effect Transistor (FET): Introduction, Construction, Operation, V-I Characteristics, Transfer Characteristics,
Drain Characteristics, Small-Signal Model.
Metal Oxide Semiconductor Field Effect Transistor (MOSFET): Introduction, Construction, Operation and
characteristics, Depletion MOSFET, Enhancement MOSFET.

TEXT BOOKS:
1. Integrated Electronics: Analog & Digital Circuit Systems – Jacob Millman&Halkias, TMH.
2. Electronic Devices & Circuits – Allen Mottershead, PHI.
REFERENCE BOOKS:
1. Electronic Devices and Circuit Theory – Boylestad&Nashelsky, 8th Ed. PHI.
2. Electronic Devices & Circuit Analysis – K. Lal Kishore, BS Publications

COURSE OUTCOME:
After completion of this course the students will be able to -
1. Gain the knowledge of basics of semiconductor devices and their applications
2. Apply concepts of Junction theory in designing and solving basic circuits
3. Develop basic knowledge of PN junction diode, BJT and FET
4. Implement transistor based circuits that are used in IC technology
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Computational Science Code: 322353(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To understand fundamental design concepts, flowchart
2. To get idea of programming language processors & data types
3. To study basics of functional programming languages
4. To familiarize with neuron and neural networks
5. To study basics fuzzy logic & genetic algorithms

UNIT- I Program Design: Introduction- fundamental design concepts - Modules and modularization criteria - Design
notation: Procedure template, Pseudo code - Structured flow chart decision. Tables - Design techniques: Stepwise
refinement, Levels of abstraction, Top down- Test plans-Design guidelines. Characteristics of programming
languages, Factors influencing the evolution of programming language, Development in programming
methodologies, desirable features and design issues.

UNIT-II Programming language processors: Structure and operations of translators, software simulated computer, syntax,
semantics, structure, virtual computers, binding and binding time. Data types: Properties of types and objects –
elementary data types – structured data types. Abstraction: Abstract data types – encapsulation by subprograms –
type definition – storage Management.

UNIT- III Functional programming languages: Introduction, fundamentals of FPL, LISP, ML, Haskell, application of
Functional programming languages and comparison of functional and imperative languages.

UNIT-IV Neural Networks (Introduction & Architecture): Neuron, Nerve structure and synapse, Artificial neuron and its
model, activation functions, Neural network architecture: single layer and multilayer feed forward networks,
recurrent networks. Various learning techniques; perception and convergence rule, Auto-associative and hetro-
associative memory.

UNIT-V Fuzzy Logic (Introduction): Basic concepts of fuzzy logic, fuzzy sets and crisp sets, fuzzy set theory and
operations, Properties of fuzzy sets, fuzzy and crisp relations, fuzzy to crisp conversion. Genetic Algorithm
(Introduction): Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic representations
(encoding), Initialization and selection, Genetic operators, Mutation, Generational Cycle, applications.

Text Books:
1. “ Software Engineering Concepts” by Richard Fairley, Tata Macgraw Hill,
2. “Programming Languages, Design and implementation” by Terrance W. Pratt, and Marvin V. Zelkowitz, Prentice-Hall of
India, Fourth edition, 2002

Reference Books:
1. “Programming Languages – Concepts and Constructs” by Ravi Sethi, Addison-Wesley, 2nd Ed. 1996.
2. “Programming Languages: Principles and Paradigms” by Allen B. Tucker, Robert Noonan, TMH, 2006.
3. “Fundamentals of Programming Languages” by E. Horowitz, Galgotia Publishers, 1984.
4. “Programming Languages” by A.B. Tucker, Robert, Noonan, McGraw-Hill, 2002.
5. “Concepts of Programming Languages” by Robert W. Sebesta, Addison Wesley, Sixth edition, 2003.
6. “Computer Concepts and C Programming “ byVikas Gupta, Wiley India.

Course Outcomes:
1. Demonstrate a broad understanding of the role of computer science and computational methods
2. Demonstrate understanding of the theoretical basis of computer science
3. Demonstrate knowledge of computational problem solving strategies
4. Design and implement substantial pieces of software
5. Demonstrate understanding of the importance of theoretical scientific underpinnings for practical work and methodology
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Problem Solving & Logic Code: 322354(22)
Building using C
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28
Course Objectives:
1. To differentiate and understand low-level and high-level programming languages
2. To understand modular programming concepts
3. To understand the use of rich set of data types in C appropriate to specific programming problems.
4. Demonstrate the use of various operators
5. Demonstrate the use of the various control flow constructs.
6. Use arrays & pointers to efficiently to design C program to solve problems.
7. Demonstrate creation and use of own data types.

UNIT- I Introduction: Computer systems, Hardware & software concepts.

Problem Solving: Algorithm / pseudo code, flowchart, program development steps, Computer Languages: machine,
symbolic, and high -level languages, Creating and running programs: Writing, editing, compiling, linking, and
executing.
Basics of C: Structure of a C program, identifiers, basic data types and sizes. Constants, variables, arithmetic,
relational and logical operators, increment and decrement operators, conditional operator, assignment operators,
expressions, type conversions, conditional expressions, precedence and order of evaluation, Sample programs.
UNIT-II Bit-wise Operators: logical, shift, rotation, masks.
Selection – Making Decisions: Two - way selection: if - else, null else, nested-if, examples, Multi- way selection:
switch, else-if, examples.
Strings: concepts, C strings.
Iterative: Loops -while, do-while and for statements, break, continue, initialization and updating, event and counter
controlled loops, looping applications: Summation, powers, smallest and largest.
UNIT- III Arrays: Arrays-concepts, declaration, definition, accessing elements, storing elements, Strings and string
manipulations, 1-D arrays, 2-D arrays and character arrays, string manipulations, multidimensional arrays, array
applications: Matrix Operations, checking the symmetricity of a Matrix.
Functions -Modular programming: Function basics, parameter passing, storage classes (extern, auto, register, static),
scope rules, block structure, user defined functions, standard library functions, recursive functions. Recursive
solutions for Fibonacci series and Towers of Hanoi. Header files, C pre-processor. Examples C programs on
Passing 1-D arrays and 2-D arrays to functions.
UNIT-IV Pointers: Pointers concepts, initialization of pointer variables, pointers and function arguments, passing by address –
dangling memory, address arithmetic, Character pointers and functions, pointers to pointers, pointers and
multidimensional arrays, dynamic memory management functions, command line arguments.
UNIT-V Enumerated, Structure and Union: Derived types – structures, structure declaration, definition and initialization of
structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to
structures, self referential structures, unions, typedef, bit-fields, program applications.
File Handling: Input and output – concept of a file, text files and binary files, Formatted I/O, file I/O operations,
example programs.

Text Books:
1. “The C –Programming Language” by B.W. Kernighan, Dennis M. Ritchie, PHI “
2. “Programming in C” by E. Balagurusamy (TMH)
Reference Books:
1. “C Programming: A Problem - Solving Approach” by Forouzan, E. V. Prasad, Giliberg, Cengage, 2010.
2. “Programming in C” by Stephen G. Kochan, 3/e Pearson, 2000
3. “C Programming Laboratory Handbook For Beginners” by Sidnal, Wiley India.
Course Outcomes:
After completion of the course study, students will be able to-
1. Use and differentiate between basic concepts of computer hardware and software.
2. Use data representation for the fundamental data types in C and perform conversions between binary-hexadecimal-
decimal date representations.
3. Read, understand and trace the execution of programs written in C language
4. Analyze problems and design algorithms in pseudo code.
5. Write C program for a given algorithm using modular approach
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Computer Concepts & Web Code: 322355(22)
Technology
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To understand the basics of a Computer.
2. To learn basics of network and internet.
3. Write a valid standards-conformant -including hyperlinks, images, lists, tables, and forms
4. Use CSS to implement a variety of presentation effects in HTML and XML documents.
5. Demonstrate techniques for improving the accessibility of an HTML document

UNIT- I Computer Basics:ASICS,Computer Generations and Classification, Algorithms, Characteristics of computers,

Input/output Units, Description of a processor, Computer Languages (Machine, Assembly, High Level),
Introduction of operating system, Functions of operating system, Single User and Multi-user operating systems,
Introduction to systems software. Different storage media-CDROM, DVD, BD(Blue Ray Disk ), HDD.
UNIT-II Network:Introduction of computer networks - LAN, MAN, WAN, Internet & Intranet, Asynchronous, Synchronous
and Isochronous, Transmission Mode
Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an ISP, Introduction to
Internet services, E-Mail concepts, Sending and Receiving secure E-Mail, Voice and Video Conferencing. Protocols
governing the web, web development strategies, Web applications.

UNIT- III WWW: Understanding the WWW and the Internet, Emergence of Web, Web Servers, Web Browsers, Protocols,
Building Web Sites
HTML:Planning for designing Web pages, Model and structure for a Website, Developing Websites, Basic HTML
using images links, Lists, Tables and Forms, Frames for designing a good interactive website CSS; XML:
Document Type Definition (DTD), Namespaces, XML schemes, presenting and using XML, Entities, XSL,
XLINK, XPATH, XPOINTER, XML Parser, Applications, Integrating XML with other applications.

UNIT-IV JAVA SCRIPT:Programming Fundamentals, Statements, Expressions, Operators, Popup Boxes, Control
Statements, Try…. Catch Statement, Throw Statement, and Objects of JavaScript: Date object, array object,
Boolean object, math object
CSS:External Style Sheets, Internal Style Sheets, Inline Style, The class selector, div & span tag, introduction to
AJAX.

UNIT-V DOM: HTML DOM, inner HTML, Dynamic HTML (DHTML), DHTML form, XML DOM.
CGI/PERL: Introduction to CGI, Testing &debugging Perl CGI script, Using scalar variables and operators in Perl.
Java Applet:Introduction to Java, Writing Java applets, Life cycle of applet.

Text Books:
1. Fundamentals of Computer, V. Rajaraman, Prentice-Hall of India
2. Web Warrior Guide to Web Design Technologies, Don Gosselin, Joel Sklar& others, Cengage Learning

Reference Books:
1. Web Technology and Design by Xavier, C, New Age International
2. HTML, DHTML, Java Script, Perl & CGI by Ivan Bayross, BPB Publication.
3. Internet and Web Design by Ramesh Bangia, New Age International
4. Web Technology: A developer perspective, Gopalan&Akilandeswari, PHI
Course Outcomes:
After completion of the course students will be able
1. To design web sites utilizing multiple tools and techniques
2. To demonstrate the ability to create dynamic pages that are easy to navigate and easy to update
3. To utilize entry - level system analysis and design principles to solve business problems.
4. To demonstrate the ability to apply testing, debugging, and troubleshooting skills
5. To exhibit the ability to design and implement an internet database.
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science Semester: III
&Engineering
Subject: Digital Electronics & Logic Code: 322356(28)
Design
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To study various number systems, knowledge of these number systems is essential in core computer science
subjects.
2. To explore brief idea about the different digital circuits which are used to develop the digital devices.
3. Understand the concepts of Memories, Programmable Logic Devices & Digital ICs.
4. To motivate the students to develop their logic to design new digital circuits usable for hardware design.
5. To motivate our students to use these digital circuits in integrated circuit design using VLSI.

UNIT- I Overview of Boolean algebra and Logic gates: Codes: Binary codes: Weighted & Non-weighted codes,
Sequential codes, self complementing codes, Cyclic codes, 8-4-2-1 BCD code, Excess-3 code, Gray code: Binary
to Gray and Gray to binary code conversion, Error detecting code, Error correcting code, 7-bit Hamming code,
ASCII code, EBCDIC code. Binary Arithmetic, Boolean Algebra, Minimization of Switching Function ,
Demorgan’s Theorem, Karnaugh’s Map Method, Quine-McCluskey’s Method (Tabular Method). Basic and
Universal logic Gates, Realization of switching functions using gates.

UNIT-II Digital Logic Families: Transistor Inverter: Basic Concepts of RTL and DTL; TTL: Open collector gates, TTL
subfamilies, IIL, ECL; MOS Logic: CMOS Logic, Dynamic MOS Logic, Interfacing: TTL to ECL, ECL to TTL,
TTL to CMOS, CMOS to TTL, and Comparison among various logic families.

UNIT- III Combinational Circuits: Adder &Subtractor: Half adder, Full adder, Half-subtractor, Full- subtractor, Parallel
Binary adder, Look Ahead carry adder, Serial adder, BCD adder. Code converter, Parity bit generator/Checker,
Comparator. Decoder: 3-line to 8-line decoder, 8-4-2-1 BCD to Decimal decoder, BCD to Seven segment decoder.
Encoder: Octal to binary and Decimal to BCD encoder. Multiplexer: 2- input multiplexer, 4-input multiplexer. De-
multiplexer: 1-line to 4-line, study of Multiplexer as Universal Logic Function Generator.

UNIT-IV Sequential Circuits: Flip-Flops and their conversion, Excitation Tables. Introduction to registers and
counters:Synchronous and Asynchronous counters and Designing of sequential circuits: code converter and
counters. Mode-k and divide by K counters, Counter applications.

UNIT-V Memories and Machines: Finite State Machine, Meelay Machine, Moore Machine, Introduction to various
semiconductor memories and designing of ROM and PLA & PAL.

Text Books:
1. R. P. Jain: “Modern Digital electronics”, TMH
2. B. Somanathan Nair, “Digital Electronics & Logic Design”, Prentice-Hall of India

Reference Books:
1. R J Tocci, “Digital System principles and Applications”
2. “Digital Electronics “ byA.K.Maini, Wiley India.
3. M.M. Mano:” Digital design”, PHI.
4. MillmanTaub, “Pulse, Digital and Switching Waveforms “TMH
5. M.M. Mano: “Digital logic and computer design”, PHI.
6. Floyd: “Digital fundamentals”, UBS.

Course Outcomes:
After completion of this course, students will be able to -
1. Acknowledge about the fundamentals of digital circuit design.
2. Understand the operation of Latch circuits & Flip flops.
3. Take interest to designing & develop ICs in VLSI industries.
4. Learn operation of different Semiconductor Memories.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: III
Subject: Basic Electronics Laboratory Code: 322361(28)
Total Lab Periods: 48 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. To draw the characteristics of a semi conductor diode and to find cut-in voltage, reverse resistance, static resistance
and dynamic resistance.
2. To draw the characteristics of a zener diode
3. To design a half wave rectifier and to determine its efficiency and ripple factor.
4. To design a- full wave rectifier and determine the ripple factor and efficiency with filter.
5. To design a- full wave rectifier and determine the ripple factor and efficiency without filter.
6. To draw the characteristics of FET using BFW – 10
7. To draw the characteristics of CE configuration of a transistor amplifier.
8. To draw the characteristics of CB configuration of a transistor amplifier.
9. To draw the characteristics of CC configuration of a transistor amplifier.
10. To design a Zener regulator circuit and to find the regulation characteristics.
11. To draw the load line of a transistor amplifier under CE configuration.
12. To design and verify the self bias circuit operation.
13. To design and verify the voltage divider biasing circuit.
14. To verify the effect of emitter bypass capacitor.

List of Equipments/Machine Required:

Circuit components, Breadboard, Hook-up wire, Power supply, CRO, Function generator

Recommended Books:
1. Laboratory Manual for Electronic Devices and Circuits, 4th Ed., David A. Bell, PHI
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: III
Subject: Problem solving & Logic building using C Code: 322362(22)
Laboratory
Total Lab Periods: 48 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. Write a C program to take the radius of a sphere as input and print the volume and surface area of that sphere.
2. Write a C program to take a 5-digit number as input and calculate the sum of its digits.
3. Write a C program to take three sides of a triangle as input and verify whether the triangle is an isosceles, scalene or an
equilateral triangle.
4. Write a C program that will take 3 positive integers as input and verify whether they form a Pythagorean triplet or not.
5. Write a C program to print all prime numbers between a given range of numbers.
6. Write a C program to define a function that will take an integer as argument and return the sum of digits of that integer
7. Write a C program to define a macro that can calculate the greater of two of its arguments. Use this macro to calculate the
greatest of 4 integers.
8. Write a C program to define a recursive function that will print the reverse of its integer argument.
9. Write a C program to print the sum of first N even numbers using recursive function.
10. Write a C program to sort an array using Bubble sort technique.
11. Write a C program that will take the elements of two integer arrays of 5 element each, and insert the common elements of
both the array into a third array (Set intersection)
12. Write a C program to take 5 names as input and print the longest name.
13. Write a C program to define a structure Student that will contain the roll number, name and total marks of a student The
program will ask the user to input the details of 5 students and print the details of all the students whose total marks is
greater than a given value.
14. Write a C program to define a union Contact that will contain the members Mobile no and E-mail id. Now define a
structure Employee that will contain name, UID,PhNo, emailId and a variable of type Contact as members. The program
will ask the user to give the details of five Employees including contact details. Print the details of all the Employees.
15. Write a C program that will ask the user to input a file name and copy the contents of that file into another file.
16. Write a C program that will take any number of integers from the command line as argument and print the sum of all those
integers.
17. Write a C program to process sequential file for payroll data.
18. Write a C program to process random file of library data.

REQUIRED SOFTWARE/ SOFTWARE TOOL:

 Linux Operating System and/ or Windows Operating System
 Turbo C/C++ IDE.

Recommended Book:
1) C Programming Laboratory by Dr. Nandini S. Sidnal, Wiley India, 2012
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: III
Subject: Digital Electronics and Logic Design Code: 322363(28)
Laboratory
Total Lab Periods: 48 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. To study the characteristics and operations of TTL Inverters, OR, AND, NOR and NAND gate using ICs.
2. To study NAND and NOR gates as a universal logic.
3. To study and prove Demorgan’sTheorem .
4. To design Half and Full adder circuits using logic gates.
5. To design Half and full subtractor circuits using logic gates.
6. To study the binary parallel adder.
7. To design 4 bit magnitude comparator circuits.
8. To study the 7 segment decoder .
9. To design 4:16 decoder using two 3:8 decoder and four 2:4 decoder
10. To design 16: 1 Multiplexer using 4:1 Multiplexer.
11. To study various types of flip flops using logic gates and ICs.
12. To design Mode-N and divide by K counter.
13. To construct a 4 bit binary to gray converter and vice versa using IC 7486 .
14. To study Up-Down counter.
15. To study programmable shift registers.

List of Equipments /Machine Required:

 Logic gate trainer
 Digital ICs Trainer
 Various ICs 7400,7402,7404,7408,7432,7486,74138,74151,74155 etc.

Recommended Books:
M.M. Mano : “Digital Logic and Computer Design”
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: III
Subject: Web Technology Laboratory Code: 322364(22)
Total Lab Periods: 48 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. To Develop and demonstrate a XHTML document that illustrates the use external style sheet, ordered list, table, borders,
padding, color, and the <span> tag.
2. To Develop and demonstrate a XHTML file that includes JavaScript script for the following problems:
a) Input: A number n obtained using prompt, Output: The first n Fibonacci numbers
b) Input: A number n obtained using prompt, Output: A table of numbers from 1 to n and their squares using alert
3. To Develop and demonstrate a XHTML file that includes Javascript script that uses functions for the following problems:
a) Parameter: A string, Output: The position in the string of the left-most vowel
b) Parameter: A number, Output: The number with its digits in the reverse order
4. To Develop and demonstrate, using Javascript script, a XHTML document that collects the RollNo ( the valid format is: A
digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters
followed by three digits; no embedded spaces allowed- e.g. 1AB23CD356, 1GC13CS345) of the user. Event handler must
be included for the form element that collects this information to validate the input. Messages in the alert windows must be
produced when errors are detected.
5. To Modify the above program to get the current semester also (restricted to be a number from 1 to 8)
6. To Develop and demonstrate, using JavaScript script, a XHTML document that contains three short paragraphs of text,
stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over some part of
them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to become completely
visible.
7. To Modify the above document so that when a paragraph is moved from the top stacking position, it returns to its original
position rather than to the bottom
8. To Design an XML document to store information about a student in an engineering college affiliated to CSVTU. The
information must include RollNo, Name, Name of the College, Branch, Year of Joining, and e-mail id. Make up sample
data for 5 students. Create a CSS style sheet and use it to display the document.
9. To Create an XSLT style sheet for one student element of the above document and use it to create a display of that element.
10. To Write a Perl program to display various Server Information like Server Name, Server Software, Server protocol, CGI
Revision etc.
11. To Write a Perl program to accept UNIX command from a HTML form and to display the output of the command
executed.
12. To Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of 4 greeting
messages.
13. To Write a Perl program to keep track of the number of visitors visiting the web page and to display this count of visitors,
with proper headings.
14. To Write a Perl program to display a digital clock which displays the current time of the server.
15. To Write a Perl program to insert name and age information entered by the user into a table created using MySQL and to
display the current contents of this table.
16. To Write a PHP program to store current date-time in a COOKIE and display the “Last visited on” date-time on the web
page upon reopening of the same page.
17. To Write a PHP program to store page views count in SESSION, to increment the count on each refresh, and to show the
count on web page.
18. To Create a XHTML form with Name, Address Line 1, Address Line 2, and E-mail text fields. On submitting, store the
values in MySQL table. Retrieve and display the data based on Name.
19. To Using PHP and MySQL, develop a program to accept book information viz. Accession number, title, authors, edition
and publisher from a web page and store the information in a database and to search for a book with the title specified by
the user and to display the search results with proper headings.

List of equipments/Machine/Software required:

Dual Core/Core I3 PC, Ubuntu/Fedora/Debian or any Open Source operating System, Mozilla Firefox/Netscape Navigator Web
Browser.
Recommended Books:
1. HTML Complete Reference- Tata McGraw hill
2. HTML and XML: An Introduction NIIT, Prentice-Hall of India
3. Building Enhanced HTML Help with DHTML and CSS by Jeannine M.E.Klien. Pearson Education
4. HTML for the World Wide Web, Fifth Edition, with XHTML and CSS
5. Visual QuickStart Guide 5th Edition Elizabeth Castro, Pearson EducationSams Teach Yourself HTML &XHTML in
24 Hours 6th Edition Dick Oliver, Michael Morrison, Pearson Education
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: III
Engineering
Subject: Value Education Code: 322365(46)
No. Of Periods: 2 Periods/Week Total Tutorial Periods: NIL
Maximum Marks: 40 Minimum Marks: 24
Course Objectives:

1. This course is designed to provide the importance of education with why, what & how.
2. To impart students with an understanding of fundamental humanitarian viewpoint and its outcomes.
3. To provide the knowledge about whole existence and its impact on values.
4. To bring the awareness about life long exercise so that they can fulfill their responsibility towards themselves, the family,
the society, the planet.

UNIT- I Aim of Education and Necessity for Value Education: Education in values/wisdom/etc and education in
traits/technologies/etc as the two fundamental strands of education; Answer to the frequently asked questions such
as “Why to do studies”, “What studies to do in overall”, “How to do studies in a proper way”, “How to think
systematically and talk systematically”

UNIT-II Humanitarian Viewpoint and Basic Human Objective: Meaning and concept of happiness, Need for a
fundamental viewpoint to judge things in all cases of human concerns, Proposal of the natural path of humanitarian
coexistentialism; Consciousness development and its expression; Fundamental want of sustainable happiness in
human being; Understanding the distinct activities and needs of self (I) and body in human being; Fundamental goal
of human being; Sustainable-solution in individual (At the place of delusion); Sustainable-prosperity in family (At
the place of poverty); Sustainable-cooperation in society (At the place of competition); Sustainable-coexistence in
planet (At the place of struggle)

UNIT- III Elements of Holistic and Systematic Perspective: Need for study of fundamental information categories to
develop holistic perspective; Particular-time actions and general-time laws; Need for fundamental information
sequence to develop systematic perspective, Some examples for systematic study sequence

UNIT-IV Elements of Society-friendly and Environment-friendly Goals: Elements of Knowledge of whole existence;
Elements of Knowledge of human being; Elements of fundamental Values and Wisdom; Value spectrum with
reference to general relationships and particular relationships of the objects in nature; Elements of History and
Contemporarity used to set current goals; Elements of Sciences and Techniques to formulate methods to achieve
goals; Elements of Motoricity and Mattericity to make actions to execute the methods

UNIT-V Lifelong Exercise for All-round Sustainability: Collecting information for sustainability issues; Motivating
people towards sustainable life-style; Ability to identify and develop appropriate technologies and management
patterns for society-friendly and environment-friendly systems for production /protection/ utilization/
experimentation ; Ability to establish and execute the fundamental five-fold system in order to ensure sustainable
peace-and-prosperity worldwide.

Text Books:
Value Education for Consciousness Development by Dr P B Deshmukh, Radha K Iyer, and Deepak K Kaushik
(2nd Edition, 2012, ISBN: 978-81-924034-0-3)

Reference Books:
1. International Research Handbook on Values Education and Student Wellbeing by Terence Lovat, Ron Toomey,
Neville Clement (Eds.), Springer 2010, ISBN: 978-90481-86747
2. Values Education and Lifelong Learning: Principles, Policies, Programmes by David N Aspin and Judith D
Chapman (Eds.); Springer 2007, ISBN: 978-1-4020-6183-7
3. Fundamentals of Ethics for Scientists and Engineers by E G Seebaur and Robert L Berry, 2000, Oxford University
Press
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Scheme of Teaching & Examination
BE (Computer Science & Engineering) IV Semester

Periods per
Scheme of Exam Credit
Sr Board of Subject week Total
Subject Name Theory/Practical L+(T+
No. Study Code Marks
L T P P)/2
ESE CT TA
Appl. 322451(14) Computational
1 4 1 80 20 20 120 5
Mathematics Mathematics

Appl. 322452(14)
2 Discrete Structures 3 1 80 20 20 120 4
Mathematics
Comp.
322453(22)
3 Science Data Structures 3 1 80 20 20 120 4
&Engg.
Comp.
322454(22) Computer Systems
4 Science 3 1 80 20 20 120 4
Architecture
&Engg.
Comp.
322455(22) Object Oriented Concepts &
5 Science 3 1 80 20 20 120 4
Programming using C++
&Engg.
Comp.
322456(22)
6 Science Operating System 3 1 80 20 20 120 4
&Engg.
Comp.
322461(22)
7 Science Data Structures Lab 3 40 20 60 2
&Engg.
Comp.
322462(22) Computer Hardware
8 Science 3 40 20 60 2
Maintenance Lab
&Engg.
Comp. Object Oriented Concepts
322463(22)
9 Science Programming using C++ 3 40 20 60 2
&Engg. Lab
Comp.
322464(22) GUI programming
10 Science 3 40 20 60 2
(VB/Gambus/ Other tools)
&Engg.
322465(46)
11 Humanities Health , Hygiene and Yoga 2 40 40 1

12 Library 1

TOTAL 19 6 15 640 120 240 1000 34

L: Lecture, T: Tutorial, P: Practical, ESE: End Semester Exam, CT: Class Test, TA: Teachers Assessment

Note (1): Duration of all theory papers will be of Three Hours.

Note (2): Industrial Training of six weeks is mandatory for B.E. students. It is to be completed in two parts. The first part will be
in summer after IV sem. after which students have to submit a training report which will be evaluated by the college teachers
during B.E. V SEM.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Computational Mathematics Code: 322451(14)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To provide knowledge of various methods for numerical solutions of algebraic and transcendental equations,
simultaneous equation and ordinary differential equations.
2. To provide a thorough understanding of interpolation and numerical differentiation and integration.

UNIT- I NUMERICAL SOLUTIONS OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS:

Bisection Method, Regula-Falsi Method, Newton-Raphson Method, Secant Method, Birge-Vieta Method, Bairstow’s
Method.

UNIT-II NUMERICAL SOLUTIONS OF SIMULTANEOUS LINEAR EQUATIONS: Direct Methods - Gauss

Elimination, Gauss-Jordan &Crout’sTriangularisation Method. Iterative Methods - Jacobi’s, Gauss- Siedal&
Successive over Relaxation Method.

UNIT- III INTERPOLATION WITH EQUAL AND UNEQUAL INTERVALS: Finite differences, Newton’s Forward &
Backward Difference Formulae, Central Difference Formula, Stirling’s Formula, Bessel’s Formula, Lagrange’s
Formula and Newton’s Divided Difference Formula,

UNIT-IV NUMERICAL DIFFERENTIATION AND INTEGRATION: Derivatives using Forward, Backward and Central
Difference Formulae. Newton-Cote’s Quadrature Formula, Trapezoidal rule, Simpson’s rules, Weddle’s rule.

UNIT-V NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS: Picard’s Method, Taylor’s Series
Method, Euler’s Method, Euler’s Modified Method, Runge-Kutta Methods, Predictor-corrector Methods- Milne’s
Method, Adams-Bashforth Method.

Text Books:
1. Numerical Methods in Engineering and Science by Dr. B.S. Grewal, Khanna Publishers.
2. Numerical Methods for Scientific and Engineering Computation by M .K. Jain, S. R. K.

Reference Books:
1. Numerical Methods for Scientists and Engineers by K. Shankar Rao, Prentice Hall of India.
2. Numerical Methods with C++ Programming, by Somasundaram&Chandrasekaran, Prentice Hall of India.
3. Numerical Methods, by S. S. Shastry, Prentice Hall Inc. India 1998.
4. Iyengar& R. K. Jain, Wiley Eastern Limited.

Course Outcome:
After completion of this course students will be able to find Numerical solution of various equations, which may be arising due to
mathematical modelling based on engineering problems.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Discrete Structures Code: 322452(14)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. To introduce a number of discrete mathematical structures found to be serving as tools in the development of
theoretical computer science.
2. Course focuses on how discrete structures actually helped computer engineers to solve problems occurred in
the development of programming languages.
3. Course highlights the importance of discrete structures towards simulation of a problem in computer science
engineering.

UNIT- I MATHEMATICAL LOGIC & BOOLEAN ALGEBRA: Basic concept of mathematical logic, Statements,
Connectives, Conditional and biconditional statements, Logical equivalence, Logical implication & quantifiers, Basic
concept of Boolean Algebra, Properties of Boolean Algebra, Boolean functions, Disjunctive & conjunctive normal
forms of Boolean functions, Applications of Boolean Algebra in switching circuits & logic circuits.

UNIT-II SET THEORY, RELATIONS, FUNCTIONS: Basic concept of set theory, Relations, Properties of relation in a set,
Equivalence relation, Composition of relations, Partial order & total order relations, Lattices &Hasse diagram,
Introduction to function, Inverse, Identity, Injective, Surjective&Bijective functions,
Composition of functions and some special functions.

UNIT- III ALGEBRAIC STRUCTURES: Groups, Subgroups, Cosets, Lagrange’s theorem, Isomorphism, Automorphism,
Homomorphism, Codes & group codes, Rings, Integral domains and Fields.

UNIT-IV GRAPH THEORY: Introduction to graph theory, Walks, Paths & Circuits, Types of graphs, Shortest path problems,
Eulerian and Hamiltonian graphs, Basic concept of tree: spanning tree, minimum spanning tree, search tree, rooted
binary tree, Cut sets, Network flow, Matrix representation of graphs.

UNIT-V COMBINATORICS: Permutation and combination, Pigeon-hole principle, Mathematical induction, Principle of
Inclusion and Exclusion, Generating function, Recurrence relation.

Text Books:
1. Elements of discrete mathematics by C.L. Liu, Tata McGraw-Hill, publications.
2. Discrete Mathematical structures, by Bernard Kolman, Robert C. Busby and Sharon Cutler Ross, Pearson Education.

Reference Books:
1. A Text Book of Discrete Mathematics, Swapan Kumar Sarkar, S. Chand &Compeny Ltd.
2. Graph theory with applications to engineering and computer science, by NarsinghDeo, Prentice Hall of India.
3. Discrete mathematics for computer scientists and mathematicians, by J.L. Mott, A. Kandel and T.P. Baker, Prentice Hall of
India.
4. Discrete Mathematical Structures with applications to computer science, by J.P. Tremblay and R. Manohar, Tata McGraw-
Hill.

Course Outcomes:
After completion of this course students will be -
1. Able to apply mathematical logic and Boolean algebra in switching circuits & logic circuits.
2. Familiar with set theory, relation and functions.
3. Familiar with algebraic structures, graph theory and combinatorics.
4. Able to solve problems in various fields in computer science, specially networking.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Data Structures Code: 322453(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
1. Understand the data organization
2. Define the term ‘data structure’;
3. Know the classifications of data structures, i.e., linear and non-linear understand the basic operations on
linear and non- linear data structures;
4. Explain the memory representation of all types of data structures
5. Explain how to implement the all kinds of data structures.

UNIT- I Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time and
Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-off. Abstract Data Types (ADT) Arrays:
Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major
Order, Application of arrays, Sparse Matrices and their representations. Linked lists: Array Implementation and
Dynamic Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked
List. Insertion, Deletion, Traversal, Polynomial Representation and Addition, Generalized Linked List.
UNIT-II Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C,
Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of Hanoi
Problem, Simulating Recursion, Principles of recursion, Tail recursion, Removal of recursion Queues, Operations on
Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C,
Dequeue and Priority Queue.
UNIT- III Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dynamic
Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked
Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded Binary trees,
Traversing Threaded Binary trees, Huffman algorithm.
UNIT-IV Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency List,
Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search, Connected Component,
Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transistive Closure and Shortest Path
algorithm: Warshal Algorithm and Dijikstra Algorithm, Introduction to Activity Networks
UNIT-V Searching : Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion Sort, Selection,
Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical consideration for Internal Sorting. (7)
Search Trees: Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of Search Algorithm, AVL
trees, Introduction to m-way Search Trees, B Trees & B+ Trees, Hashing: Hash Function, Collision Resolution
Strategies ,Storage Management: Garbage Collection and Compaction.

Text books:
1. Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein “Data Structures Using C and C/C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publication

References books:
1. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”, McGraw Hill
2. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education
3. Lipschutz, “Data Structures” Schaum’s Outline Series, TMH
4. G A V Pai, “Data Structures and Algorithms”, TMH

Course Outcomes:
1. Have a comprehensive knowledge of the data structures and algorithms on which file structures and data bases are based.
2. Understand the importance of data and be able to identify the data requirements for an application.
3. Have in depth understanding and practical experience of algorithmic design and implementation.
4. Have practical experience of developing applications that utilize databases.
5. Understand the issues involved in algorithm complexity and performance
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Computer Systems Architecture Code: 322454(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
The overall objective with the course is to understand basic working principles of computer hardware units and give
knowledge and insights into the design of modern computers, in particular the processor design including parallel
computational pipelines and memory hierarchies.

UNIT- I BASIC STRUCTURE OF COMPUTERS: Functional units, Basic operational concepts, Bus structures Addressing
modes, subroutines: parameter passing, Instruction formats, expanding Opcodes method. BASIC PROCESSING
UNIT: bus architecture, Execution of a Complete Instruction, sequencing of control signals, Hardwired control,
Microprogrammed Control, microinstruction format, Bit slice concept.

UNIT-II ARITHMETIC: Number representations and their operations, Design of Fast Adders, Signed multiplication, Booth’s
Algorithm, bit-pair recoding, Integer Division, Floating point numbers and operations, guard bits and rounding.

UNIT- III THE MEMORY SYSTEM: various technologies used in memory design, higher order memory design, multi-
module memories and interleaving, Associative Memory, Cache memory, Virtual Memory.

UNIT-IV INPUT/OUTPUT ORGANIZATION: I/O-mapped I/O and memory-mapped I/O, interrupts and interrupt handling
mechanisms, vectored interrupts, synchronous vs. asynchronous data transfer, Direct Memory Access COMPUTER
PERIPHERALS: I/O devices such as magnetic disk, magnetic tape, CDROM systems.

UNIT-V RISC philosophy: pipelining, basic concepts in pipelining, delayed branch, branch prediction, data dependency,
influence of pipelining on instruction set design, multiple execution units, performance considerations, Basic
concepts in parallel processing:& classification of parallel architectures, Vector Processing, Array Processors.

Text Books:
1. Computer Organization, V.C.Hamacher,Z.G.Vranesic and S.G.Zaky, McGraw Hill,5th Edition,2002.
2. Computer Architecture & Organization, 3rdEdition, J.P. Hayes, McGraw-Hill.
3. Structured Computer Organization, A.S.Tanenbaum, 4th Edition, Pearson Education India

Reference Books:
1. Computer System Architecture &Organisation, Dr. Usha, Wiley India
2. Computer System and Architecture,M. Mano, Pearson Education India.
3. Computer Organization & Architecture, W. Stallings, Pearson Education India

Course Outcomes:
1. To be able to describe the basic hardware components of a computer system.
2. To be familiar with the binary and hexadecimal number systems including computer arithmetic.
3. To be familiar with the functional units of the processor such as the register file and arithmetic‐logical unit.
4. Be familiar with the basics of systems topics: parallel, pipelined, superscalar, and RISC/CISC architectures.
5. To be familiar with the representation of data, addressing modes, an instruction sets.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Object Oriented Concepts & Code: 322455(22)
Programming using C++
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28
Course Objectives:
1. Understand object-oriented programming features in C++,
2. Apply these features to program design and implementation,
3. Understand object-oriented concepts and how they are supported by C++,
4. Understand implementation issues related to object-oriented techniques,
5. Build good quality software using object-oriented programming technique

UNIT- I Object-Oriented Programming Concepts: Introduction, comparison between procedural programming paradigm
and object-oriented programming paradigm, basic concepts of object-oriented programming — concepts of an object
and a class, interface and implementation of a class, operations on objects, relationship among objects, abstraction,
encapsulation, data hiding, inheritance, overloading, polymorphism, messaging.

UNIT-II Standard Input/Output: Concept of streams, hierarchy of console stream classes, input/output using overloaded
operators >> and << and member functions of i/o stream classes, formatting output, formatting using ios class
functions and flags, formatting using manipulators. Classes and Objects: Specifying a class, creating class objects,
accessing class members, access specifiers, static members, use of constkeyword, friends of a class, empty classes,
nested classes, local classes, abstract classes, container classes, bit fields and classes.

UNIT- III Pointers and Dynamic Memory Management: Declaring and initializing pointers, accessing data through pointers,
pointer arithmetic, memory allocation (static and dynamic), dynamic memory management using new and delete
operators, pointer to an object, this pointer, pointer related problems - dangling/wild pointers, null pointer assignment,
memory leak and allocation failures. Constructors and Destructors: Need for constructors and destructors, copy
constructor, dynamic constructors, explicit constructors, destructors, constructors and destructors with static members,
initializer lists.

UNIT-IV Operator Overloading and Type Conversion: Overloading operators, rules for overloading operators, overloading
of various operators, type conversion - basic type to class type, class type to basic type, class type to another class
type. Inheritance: Introduction, defining derived classes, forms of inheritance, ambiguity in multiple and multipath
inheritance, virtual base class, object slicing, overriding member functions, object composition and delegation, order
of execution of constructors and destructors.

UNIT-V Virtual functions & Polymorphism: Concept of binding - early binding and late binding, virtual functions, pure
virtual functions, abstract clasess, virtual destructors. Exception Handling: Review of traditional error handling,
basics of exception handling, exception handling mechanism, throwing mechanism, catching mechanism, rethrowing
an exception, specifying exceptions. Templates and Generic Programming: Template concepts, Function templates,
class templates, illustrative examples. Files: File streams, hierarchy of file stream classes, error handling during file
operations, reading/writing of files, accessing records randomly, updating files.
Text Books:
1. Lafore R., Object Oriented Programming in C++, Waite Group.
2. E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw Hill.
Reference Books:
1. R. S. Salaria, Mastering Object-Oriented Programming with C++, Salaria Publishing House.
2. BjarneStroustrup, The C++ Programming Language, Addison Wesley.
3. Herbert Schildt, The Complete Reference to C++ Language, McGraw Hill-Osborne.
4. Lippman F. B, C++ Primer, Addison Wesley.
5. R. S. Salaria, Test Your Skills in Object-Oriented Programming With C++, Salaria Publishing House.
Course Outcomes:
1. Knowledge and Understanding- At the end of a course the student will understand the concepts of:
a) Variables, data Types (including strings and arrays) and Expressions
b) Flow of Control
c) Functional and procedural abstraction and its importance in good program design
d) Pointers and memory allocation (static and dynamic)
e) Iteration and Recursion
2. Skills - At the end of the course, a student will be able to:
a) Analyse a simple programming problem specification
b) Design a high-level (programming language independent) solution to the problem using functional abstraction and general
imperative programming language constructs.
Write, compile, execute and debug a C++ program which maps the high-level design onto concrete C++ programming constructs
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Operating System Code: 322456(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
Class Tests: Two (Minimum) Assignments: Two (Minimum)
ESE Duration: Three Hours Maximum Marks: 80 Minimum Marks: 28

Course Objectives:
To study and apply concepts relating to operating systems, such as concurrency and control of asynchronous
processes, deadlocks, memory management, processor and disk scheduling, parallel processing, and file system
organization.

UNIT- I INTRODUCTION: Operation System objective and function, The Evolution of operating Systems, Batch,
interactive, time sharing and real time systems, Protection. Operating System Structure,System Components,
operating system service, System structure. Distributed Computing,The Key Architecture Trend; Parallel
Computation, Input-Output Trends.

UNIT-II CONCURRENT PROCESSES:Process concept: Introduction, Definitions of “Process”, Process States, Process
StateTransitions, The process Control Block, Operations on Processes, Suspend and Resume,Interrupt Processing.
Mutual Exclusion, the Producer / Consumer problem, the critical section problem, Semaphores, Classical problems in
concurrency, inter process communication.Asynchronous Concurrent Process: introduction, parallel Processing, A
Control Structure for indicating parallelism. CPU scheduling: concepts, performance criteria, and scheduling
Algorithms. Algorithm evaluation, Multiprocessor scheduling.

UNIT- III DEAD LOCKS: System model, Deadlock characterization. Prevention, Avoidance and Detection, Recovery from
deadlock, combined approach.

UNIT-IV MEMORY MANAGEMENT: Base machine, resident Monitor, multiprogramming with fixed partition,
Multiprogramming with variable partitions, Paging, Segmentation, paged - segmentation, virtual Memory concepts,
Demand paging, performance, page Replacement algorithms, Allocation of frames, Thrashing, cache memory
organization impact on performance.

UNIT-V I/O MANAGEMENT &DISK SCHEDULING: I/O device and the organization of the I/O function, I/O Buffering,
Disk I/O, Operating system Design issues. File system: File Concepts – File organization and Access mechanism, File
Directories, File sharing, Implementation issues. Case studies: UNIX system, a virtual machine OS.

Text Books:
1. Operating System concepts by Silberscatz A and Peterson, J.L, PE- LPE.
2. Operating System Design & Implementation by Tanenbaum, A.S., PHI.
3. Operating system concepts Galvin by Silberscatz, John Weiley& Sons
4. Operating systems by H.M.Deital, Pearson Education

Reference Books :
1. Operating System in Depth Design and Programming by Thomas Doeppner, Wiley India
2. Operating System Concept & Design, Milenkovic M, McGraw Hill.
3. Operation System, Stalling William, Maxwell MCMillan International Editions

Course Outcomes:
After completion of this course the students will be able to -
1. To learn what is operating system and how it makes computers work
2. To know how operating system manages complexity through appropriate abstraction of CPU, memory, files, semaphores etc.
3. To get knowledge about different components of operating system like Process Management, Concurrency mechanisms,
Deadlock handling, Memory Management techniques, Virtual Memory, File System and Secondary Storage Management,
Security & protection etc.
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Data Structures Lab Code: 322461(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. Write a program to perform following operations in one dimensional array, Insertion, Deletion and Searching (Linear &
Binary).
2. Write a program to implement stack and perform push and pop operations.
3. Write a program to convert infix to postfix expressions using stack.
4. Write a program to perform following operations on a linear queue - addition, deletion, traversing.
5. Write a program to perform following operations on a circular queue - addition, deletion, traversing.
6. Write a program to perform following operations on a double ended queue - addition, deletion, traversing.
7. Write a program to perform following operations on a single link list-creation, inversion, deletion.
8. Write a program to perform following operations on a double link list – creation, insertion, deletion.
9. Write a program to implement polynomial in link list and perform.
a) Polynomial arithmetic b) Evaluation of polynomial
10. Write a program to implement a linked stack and linked queue.
11. Write programs to perform Insertion, selection and bubble sort.
12. Write a program to perform quick sort.
13. Write a program to perform merge sort.
14. Write a program to perform heap sort.
15. Write a program to create a Binary search tree and perform –insertion, deletion & traversal.
16. Write a program to traversal of graph (B.F.S, D.F.S)

Recommended Books:
1. “Data structure using C” by Samir kumarBandyopadhyay, KashiNathDey
2. “C and Data structures” by Ashok K Kamthane Pearson Education.
3. “An Introduction to Data Structures with Application” by Tremblay & Sorenson ( TMH)
4. “Fundamentals of Data Structure” by Horowitz &Sahni (Golgotia)
5. “Data Structures using C/C++” by Rajesh Shukla, Wiley India
6. “Data Structures using C” by ISRD Group (TMH)
7. “Data Structures using C/C++” by Langsam, Augenstein&Tananbaum (PHI)
8. “Data Structures & Program Design” by Robert L Kruse (PHI)
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Computer H/W Maintenance Lab Code: 322462(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1) Assembling of a Personal Computer:
a. Identifying parts of mother board, power connections and locating other connectors.
b. Interconnection of disk drive units, keyboard, mouse and monitor.
2) Hard disk partitioning and OS installation:
a. Partitioning the hard disk using FDISK/ Partition Magic/ Disk Manager
b. Installation of Windows XP/2000/Pro
c. Installation of Linux kernel (possibly with dual boot option).
3) Circuit Tracing: Using Multimeter and continuity test mode, to trace a given circuit board and draw the schematic.
4) Load testing of SMPS: Testing the given SMPS of a PC using a multimeter
Task 1 :Identify the peripherals of a computer, components in a CPU and its functions. Draw the block diagram of the CPU along
with the configuration of each peripheral and submit to your instructor.
Task 2: Every student should disassemble and assemble the PC back to working condition. Lab instructors should verify the work
and follow it up with a Viva. Also students need to go through the video which shows the process of assembling a PC. A video
would be given as part of the course content.
Task 3: Every student should individually install Windows/Ubuntu/Fedora in dual boot and virtual OS on the personal computer.
Lab instructor should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have windows installed. The system should be
configured as dual boot with both windows and Linux. Lab instructors should verify the installation and follow it up with a Viva
Task 5: Several mini tasks would be that covers Basic commands in Linux and Basic system administration in Linux which
includes: Basic Linux commands in bash, Create hard and symbolic links, Text processing, Using wildcards
Task 6: Hardware Troubleshooting: Students have to be given a PC which does not boot due to improper assembly or defective
peripherals. They should identify the problem and fix it to get the computer back to working condition. The work done should be
verified by the instructor and followed up with a Viva
Task 7: Software Troubleshooting: Students have to be given a malfunctioning CPU due to System software problems. They
should identify the problem and fix it to get the computer back to working condition. The work done should be verified by the
instructor and followed up with a Viva.
Task 8: The test consists of various systems with Hardware / Software related troubles,Formatted disks without operating systems.
Internet & World Wide Web
Task 9: Orientation& Connectivity Boot Camp: Students should get connected to their Local Area Network and access the
Internet. In the process they configure the TCP/IP setting. Finally Students should demonstrate, to the instructor, how to access the
websites and email. If there is no Internet connectivity preparations need to be made by the instructors to simulate the WWW on the
LAN.
Task 10: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy settings, bookmarks,
search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for applets should be configured.
Task 11: Search Engines & Netiquette: Students should know what search engines are and how to use the search engines. A few
topics would be given to the students for which they need to search on Google. This should be demonstrated to the instructors.

List of Equipment / Machine Required:

1. Computer Hardware trainer
2. Old computing system – should be used for training
3. Prepare museum of antique computer components for display in laboratory

Recommended Books:
1. Computer Repair with Diagnostic Flowcharts Third Edition: Troubleshooting PC Hardware Problems from Boot Failure to
Poor Performance - Morris Rosenthal
2. A+ Guide to Hardware: Managing, Maintaining, and Troubleshooting: by Jean Andrews
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: Object Oriented Concepts & Code: 322463(22)
Programming using C++ Lab
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20
List of Experiments: (At leastTen experiments are to be performed by each student)
1. Write a Program to check whether number is prime or not.
2. Write a Program to read number and to display the largest value between: (a) Two number, (b)Three Numbers, (c) Four
numbers by using switch-case statements.
3. Write a Program to find sum of first natural numbers: sum= 1+2+3+4+……. 100 by using(a) for loop, (b)while loop, (c) do-
while loop
4. Write a Program to find sum of the following series using function declaration: Sum= x-(x)3/3!+(x)5/5!-………..(x)n/n!
5. Write a Program to read the element of the given two matrixes & to perform the matrix multiplication.
6. Write a Program to exchange the contents of two variables by using (a)Call by value, (b)Call by reference.
7. Write a Program to perform the following arithmetic operations of a complex number using astructure: (a) Addition of two
complex numbers, (b) Subtraction of two complex numbers, (c) Multiplication of two complex numbers, (d) Division of two
complex numbers.
8. Write an object oriented program (OOP) using C++ to exchange the private data members of two different functions using friend
functions.
9. Write an OOP using C++ to count how many times a particular member function of a class is called by: (a) A particular object,
(b) Any objects
10. Write an OOP using C++ to define a constructor for a “Date” class that initializes the Date objects with initial values. In case
initial values are not provided, it should initialize the objects with default values.
11. Write an OOP using C++ to overload = = operator to compare two strings.
12. Write an OOP using C++ to perform simple arithmetic operations of two complex numbers using operator overloading.
13. Write a C++ program to demonstrate how ambiguity is avoided using scope resolution operator in thefollowing inheritance: (a)
Single inheritance, (b) Multiple inheritance
14. Write a C++ Program to perform the swapping of two data items of integer, floating point number and character type with the
help of function overloading.
15. Write a C++ program to generate a Fibonacci series by overloading: (a) Prefix Operator, (b) Postfix Operator.
16. Write a C++ program to access the private data of a class by non-member function through friend function where the friend
function is declared: (a) in the location of public category, (b) in the location of private category, (c) within the scope of a class
definition itself, (d) defined with inline code subtraction.
17. Write a C++ program to demonstrate how a pure virtual function is defined, declared and invoked from the object of derived
class through the pointer of the base class.
18. Write a C++ program to open a file and count the number of characters, number of vowels and number of newline characters
present in the file.
19. Write a program to copy the contents of one text file to another and display both the files using a text Menu.
20. Create a database of 10 students. The database should contain the Name, Marks of 5 subjects, Aggregate Marks, Aggregate
percentage and Division according to the following conditions: (a) Percentage above or equal to 60 – First division,
(b) Percentage between 50 and less than 60 – Second division, (c) Percentage between 40 and less than 50 – Third division,
(d) Percentage below 40 – Improvement required
Display the above database of every student in a tabulated form. Implement the above program using Structures, Text-Menu and
File I/O operations.
21. Write an OOP using a class template to read any five parameterized data type such as float and integer, and print the average.
22. Write a C++ program to Bubble Sort using template function.
23. Write a C++ program to read two numbers and find the division of these two numbers using exception handling.
24. Write a C++ program to create a function which take a parameter, if the value of parameter is > 0 then throw integer type, if
parameter is = 0, then throw character type, if parameter is < 0 then throws float type exception but for all design use only one
catch block.
25. Write a C++ program for invoking, for that generate & handle exception.

List of Equipment/Machine Required

Pentium IV machine, Turbo C++ compiler / gcc, windows / Linux environment

Recommended Books :
1. Programming with C++ : D Ravichandran
2. OOP’s with C++ : E. Balaguruswamy .
3. Programming with C++ :Venugopal .
4. Object Oriented Programming in C++ :StroutStrups.
5. OOP with C++ : Robert Lafore
6. Let us C++ :YaswantKanetkar.
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Engineering Semester: IV
Subject: GUI Programming (VB/Gambus/other Code: 322464(22)
tools)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiments: (At leastTen experiments are to be performed by each student)

1. Gambas/.NET /Other- an Integrated Development Environment (IDE): An introduction, Explain New project window,
Property window, Project Explorer window, Watch window etc.
Design and identity card containing information regarding students such as Name, Roll No., Address, Class studying, Date
of Birth, Blood Group, Phone No., etc. Add a Exit Button.
2. Develop an application to calculate Interest. It should accept rate of interest, period for calculation of interest (years),
amount on which interest is to be calculated (Rs.). After clicking Compute Investment amount (Principal + Interest) should
be displayed in separate text box. Add Exit button, Proper text box controls and labels to be used. Provide 2 options-
Simple, Compound interest. Provide Picture and Radio Button control.
3. Design a Simple Calculator to implement addition, subtraction, multiplication, division, remainder operations of two digits
(include validation of input & proper message).
4. Create a form using check box & option box to give effect for fonts such as bold, italic, underline, strike through
respectively for the text entered in the Rich Text Box (add status bar control).
5. Create a form to access drive list, directory list, and files within a directory of the computer you are using (use Tree
structure, menus & toolbars).
6. Design a form for demonstration of print method (Error code, Error message display). Use print control box. Log the status
of each message in a log file.
7. Demonstrate use of Date Environment, add tables and queries, place fields on form, report etc. Generate single table report
& two table grouped report outputs.
8. Design a program to display regional languages of different states in India. Take many names of status of India in one list
box control and other text box control should display their languages e. g. Maharashtra _ Marathi etc.
9. CASE STUDY (Design and develop one of the following three case studies):
a. Create a Scientific Calculator (add minimum 15 functions).
b. Develop a program for Online Examination system, which includes database and recordkeeping facility.
c. Develop a program for Payroll System, which can handle database as well as can print the pay slips of employees.
In this system provide a Login Window, which will accept the User Name and Password. After verifying the user
information, the user should get the access to Payroll System.
10. Create a Simple Notepad application, which contains Menus, Rich Text Box, Common Dialog box, formatted text using
Toolbar, and Replace text, Windows (Tile / Cascade), Status bar and scroll bar.
11. Modify the practical No. 7 to add following buttons: FIND, ADD, DELETE, UPDATE, and CANCEL. Give proper code
to perform the activity described by these buttons.
12. Display the Table Data using Data Control/ADODC. Add Find, Delete, Update, Cancel Buttons on the form.
13. Display the data from two different tables having common keys using Visual data manager. Use Flex Gride control to
display data.
14. Use Active –X control in the form which is created in previous practical.

List of Equipments / Machine Required:

 Dual Core of Core –I3 Computing System.
 Gambas/Visual Studio
 Database (PostgreSQL/ MySQL/others …)

Recommended Books:
1. A Beginners Guide to Gambas – John W Rittinghouse
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of program: Bachelor of Engineering
Branch: Computer Science & Semester: IV
Engineering
Subject: Health, Hygiene & Yoga Code: 322465(46)
No. Of Periods: 2 Periods/Week Total Tutorial Periods: NIL
Maximum Marks: 40 Minimum Marks: 24
Course Objectives:
1 To provide understanding the importance of health.
2 To provide insight into the hygiene aspect & quality of life.
3 To study the concepts of various medical therapy.
4 To practice the various yogasans.
5 To provide knowledge about common diseases and its cure through yagasans and pranayam.
6 To develop concentration through various methods.

UNIT- I HEALTH & HYGIENE: Concept of health, Physical health and mentall health and wellbeing and how to
achieve these, longevity and how to achieve it, concept and common rules of hygiene, cleanliness and its
relation with hygiene; Overeating and underrating, amount of food intake required, intermittent fasting;
adequate physical labour, sleep; consumption of junk fast food vs nutritious food; fruits, vegetables cereals
and qualities of each of these.

UNIT-II INTRODUCTORY KNOWLEDGE OF COMMON STREAMS OF MEDICINAL CURE: History,

development, basic concepts, modes of operation of Alopathy, Ayurved, Homoeopathy, Biochemic, Unani,
Siddha, Accurpressure, Accupunture, Naturopathy, Yogic and Herbal system of medicines, Introduction of
Anatomy and Physiology concerned.

UNIT- III YOGASANS: Meaning and concept of Yoga, Yogasans and its mode of operation, How to perform
Yogasans, Common Yogasans with their benefits, such as, Padahastasan, Sarvangasan, Dhanurasan,
Chakrasan, Bhujangasan, Paschimottasan, Gomukhasan, Mayurasan, Matsyasan, Matsyendrasan,
Pawanmuktasan, Vajrasan, Shalabhasan, Sinhasan, Shashankasan, Surya Namaskar, Halasan, Janushirasan,
Utshep Mudra.

UNIT-IV YOGASANS FOR COMMON DISEASES: From Yogic MateriaMedica with symptoms, causes, asans
and herbal treatment.
 Modern silent killers: High blood pressure, diabetes and cancer, causes and cure; Common
health problems due to stomache disorders, such as, indigestion, acidity, dycentry, piles and fissures,
artheritis, its causes, prevention and cure.
 Asans for relaxation:Shavasan, Makarasan, Matsyakridasan, Shashankasan.
 Asans to increase memory and blood supply to brain:Shirshpadasan, Shashankasan.
 Asans for eye sight:Tratak, NetiKriya .
 Pranayam: Definition and types: NadiShodhan, Bhastrik, Shitakari, Bhramari useful for students.

Text Books:
Health, Hygiene & Yoga,Dr P B Deshmukh, Gyan Book Pvt Ltd. New Delhi.

Reference Books:
(1) Yogic MateriaMedica
(2) Asan, Pranayam and Bandh.
 Chhattisgarh Swami Vivekanand Technical University
Bhilai (C.G.)
Scheme of Teaching and Examination
B.E. V Semester (Computer Science &Engineering)
Periods per
S. Board of Subject week Scheme of Exam Total Credit
Subject Name
No Study Code Theory/Practical Marks L+(T+P)/2
L T P ESE CT TA
Computer
Microprocessor and
1 Science & 322551(22) 4 1 - 80 20 20 120 5
Interfaces
Engg
Computer
Analysis and Design of
2 Science & 322552(22) 3 1 - 80 20 20 120 4
Algorithms
Engg
Computer
3 Science & 322553(22) Programming in Java 3 1 - 80 20 20 120 4
Engg
Computer
4 Science & 322554(22) Theory of Computation 3 1 - 80 20 20 120 4
Engg
Computer
Unix & Shell
5 Science & 322555(22) 3 1 - 80 20 20 120 4
Programming
Engg
Computer
Database Management
6 Science & 322556(22) 3 1 - 80 20 20 120 4
System
Engg
Computer
Microprocessor and
7 Science & 322561(22) - - 3 40 20 60 2
Interfaces Lab
Engg
Computer
Programming in Java
8 Science & 322562(22) - - 3 40 20 60 2
Lab
Engg
Computer
Unix & Shell
9 Science & 322563(22) - - 3 40 20 60 2
Programming Lab
Engg
Computer
10 Science & 322564(22) DBMS Lab - - 3 40 20 60 2
Engg
Personality
11 Humanities 300565(46) - - 2 20 20 1
Development
Computer
* Practical Training
12 Science & 322566(22) - - 1 20 20 1
Evaluation & Library
Engg
TOTAL 19 6 15 640 120 240 1000 35

L: Lecture T: Tutorial P: Practical

ESE: End Semester Examination CT: Class Test TA: Teachers Assessment

*To be completed after IV Semester and before the commencement of V Semester

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Microprocessor & Interfaces Code: 322551 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be conducted: 2 (Minimum) No. of assignments to be submitted: One per Unit
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE: To introduce the basic concepts of microprocessor & assembly language
programming.

COURSE OUTCOME:
1. The student will be able to analyse, specify, design, write and test assembly language programs of moderate
complexity.
2. The student will be able to select an appropriate ‘architecture’ or program design to apply to a particular
situation; e.g. an interrupt-driven I/O handler for a responsive real-time machine. Following on from this,
the student will be able to design and build the necessary programs.

UNIT I: Introduction to Basic Microprocessors: Historical Background, the Harvard and Princeton
architecture, The Microprocessor-Based Personal Computer Systems. The Microprocessor 8085,
8088 basics and comparison (Block & Pin diagram only).
UNIT II: Microprocessor Architecture 8086: 8086 basic block diagram, Internal Microprocessor
Architecture, Real Mode Memory Addressing, Registers, pin configuration, segmentation.
Data Movement Instructions: MOV, PUSH/POP, Load-Effective Address, String Data
Transfers, Miscellaneous Data Transfer Instructions, Segment Override Prefix, Assembler Details.
Arithmetic and Logic Instructions: Addition, Subtraction and Comparison, Multiplication and
Division, BCD and ASCII Arithmetic, Basic Logic Instructions, Shift and Rotate, String
Comparisons. Program Control Instructions: The Jump Group, Controlling the Flow of the
Program, Procedures, and Introduction to Interrupts, Machine Control and Miscellaneous
Instructions. Assembler directives, assembler instructions, Assembly Language Programming.
UNIT III: Assembly Language programming with C/C++, Interrupt and Timing diagrams: Using
Assembly Language with C/C++ for linking C/C++ into assembly language, Basic Programs - Use
of BIOS and DOS Interrupts in assembly & C/C++, Interrupts of 8086 microprocessors, Timing
diagram of 8086 microprocessor.
UNIT IV: Memory and I/O Interfacing: Minimum and Maximum mode configuration of 8086, Memory
Interface with 8086 microprocessor, Address Decoding. Basic I/O Interface: Introduction to I/O
Interface, I/O Port Address Decoding. I/O Interface using peripheral devices: The Programmable
Peripheral Interface 8255, Programmable Interval Timer 8254. Direct Memory Access: Basic
DMA Operation and Definition.
UNIT V: Advanced Microprocessors: 80386- Features, block diagram, data types, supported registers,
memory system, real mode and protected mode operation, descriptors, cache register, control
register, paging mechanism, virtual mode, and protection mechanism for operating system..
Comparative Study of Modern Microprocessor (Web based Reference for study): Pentium
Pro (Pentium II, Pentium III, Pentium IV), Core i3,i5,i7 and Atom processors.

Text Book:
1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2009. (Listed topics only from the Chapters 1 to 13)
2. Ramesh S. Gaonkar : Microprocessor Architecture, programming and Application with 8085, 4th Edition, Wiley,2012
Reference Books:
1. Douglas V. Hall: Microprocessors and Interfacing, Revised 2nd Edition, TMH, 2006.
2. James L. Antonakos: The Intel Microprocessor Family: Hardware and Software Principles and Applications, Cengage Learning, 2007.
3. Nilesh B. Bahadure: Microprocessors: The 8086/8088, 80186/80286, 80386/80486 and the Pentium family, 2nd edition (2014), Prentice
Hall of India (PHI).
4. K. Udaya Kumar & B.S. Uma Shankar: Advanced Microprocessors & IBM-PC Assembly Language Programming, TMH 2003.
5. Microprocessor: Theory and Applications- Intel and Motorolla, Rafiquuzzaman, PHI.

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Analysis & Design of Algorithms Code: 322552 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 This course aims to introduce the classic algorithms in various domains, and techniques for designing efficient algorithms.
 Introducing students to the general tools and techniques for analysing computer algorithms.
 Equip the students with mathematical preliminaries required to analyse and design computer algorithms.

COURSE OUTCOME:
After successful completion of this course, students should be able to:
 Prove the correctness and analyze the running time of the basic algorithms for those classic problems in various
domains.
 Apply the algorithms and design techniques to solve problems.
 Analyze the complexities of various problems in different domains.

UNIT I Algorithms: Definitions and notations: standard notations - asymptotic notations – worst case, best case and
average case analysis; big oh, small oh, omega and theta notations; Recursive algorithms, analysis of non-
recursive and recursive algorithms, solving recurrence equations, analysing control structures. Analysis of Sorting
and Searching: Heap, shell, radix, insertion, selection and bubble sort; sequential, binary and Fibonacci search.
UNIT II Divide and Conquer Method: General Method – binary search – finding maximum and minimum – merge sort
and quick sort – Stassen’s Matrix multiplication. Greedy Method: General method – knapsack problem –
minimum spanning tree algorithms – single source shortest path algorithm – scheduling, optimal storage on tapes,
optimal merge patterns.
UNIT III Dynamic Programming: General method – multi-stage graphs – all pair shortest path algorithm – 0/1 Knapsack
and Travelling salesman problem – chained matrix multiplication – approaches using recursion – memory
functions. Basic Search and Traversal technique: Techniques for binary trees and graphs – AND/OR graphs –
biconnected components – topological sorting.
UNIT IV Backtracking: Back tracking and Recursive back tracking, applications of Back tracking paradigm, The general
method – 8-queens problem – sum of subsets – graph coloring – Hamiltonian cycle – Knapsack problem.
UNIT V Branch and Bound Method: Least Cost (LC) search – the 15-puzzle problem – control abstractions for LC-
Search – Bounding – FIFO Branch-and-Bound - 0/1 Knapsack problem – travelling salesman problem.
Introduction to NP-Hard and NP-Completeness, Cook’s theorem.

TEXTBOOK
1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, Galgotia
Publications Pvt. Ltd., 2008.
2. Cormen, Lelserson, Rivert, “Introduction to Algorithms”, Second Edition, PHI.

REFERENCES
1. Paneerselvam, “Design and Analysis of Algorithms”, Prentice-Hall of India, 2006
3. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Pearson Education, 2005.
4. Gilles Brassard and Paul Bratley, “Fundamentals of Algorithms”, Prentice-Hall of India, 1997. (UNIT I)
5. Thomas H. Corman, Charles E. Leiserson, Ronald and L. Rivest, “Introduction to Algorithms”, Prentice-Hall of India,
Second edition, 2003.
6. Richard Johnsonbaugh and Marcus Schaefer, “Algorithms”, Pearson Education, 2004. (UNIT V)

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Programming in Java Code: 322553 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 Make them learn about Java programming concepts, graphical user interfaces, basic data structures.

COURSE OUTCOME:
 Can develop solutions for a range of problems using object-oriented programming.
 Be able to implement, compile, test and run Java programs comprising more than one class, to address a particular software
problem.
 Demonstrate the ability to use simple data structures like arrays in a Java program.

UNIT I Introduction: Introduction to Java and Java programming Environment. Object Oriented Programming.
Fundamental Programming Structure: Data Types, variable, Typecasting Arrays, Operators and their precedence.
Control Flow: Java’s Selection statements (if, switch, iteration, statement, while, do-while, for, Nested loop)
Concept of Objects and Classes, Using Exiting Classes building your own classes, constructor overloading,
static , final, this keyword
UNIT II Inheritance: Using Super to Call Super class constructor, Method overriding, dynamic method Dispatch, Using
Abstract Classes, Using final with inheritance. The Object Class. Packages & Interfaces: Packages, Access
Protection, Importing package, Interface, Implementing Interfaces, variables in Interfaces, Interfaces can be
extended. Exception Handling: Fundamentals, Types Checked , Unchecked exceptions, Using try & catch,
Multiple catch, throw , throws, finally, Java’s Built in exceptions, user defined exception.
UNIT III Multi-Threading: Java Thread Model, Thread Priorities, Synchronization, Creating a thread, Creating Multiple
threads, Using isAlive ( ) and join ( ), wait () & notify ( ). String Handling: String constructors, String length,
Character Extraction, String Comparison, Modifying a string. Java I/O: Classes & Interfaces, Stream classes,
Byte streams, Character streams, Serialization.
UNIT IV Applets: Basics, Architecture, Skeleton, The HTML APPLET Tag, Passing Parameters to Applets, Applet
context and show documents (). Event Handing: Delegation Event model, Event Classes, Event Listener
Interfaces, Adapter classes. JDBC: Fundamentals, Type I, Type II, Type III, Type IV drivers. Networking:
Basics, Socket overview, Networking classes, & interfaces, TCP/IP client sockets, whois, URL format, URL
connection, TCP/IP Server Sockets.
UNIT V AWT: AWT Classes window fundamentals, component, container, panel, Window, Frame , Canvas, Creating a
frame window in an Applet , working with Graphics , Control Fundamentals , Layout managers, Handling
Events by Extending AWT components. Core java API package, reflection, Remote method Invocation (RMI)
Swing: J applet, Icons & Labels, Text fields, Buttons, Combo boxes, Tabbed panes, Scroll panes, Trees, Tables.
Exploring Java-lang: Simple type wrappers, Runtime memory management, object (using clone () and the
cloneable Interface), Thread, Thread Group, Runnable.

TEXT BOOKS:
1. Introduction to Java Programming: Liang, Pearson Education, 7th Edition.
th
2. Java The complete reference: Herbert Schildt, TMH, 5 Edition.

REFERENCE BOOKS:
1. Balguruswamy, Programming with JAVA, TMH.
2. Programming with Java: Bhave &. Patekar, Pearson Education.
nd
3. Big Java: Horstman, Willey India, 2 Edition.
4. Java Programming Advanced Topics: Wigglesworth, Cengage Learning.
5. Java How to Program: H.M. Deitel & Paul J. Deitel, PHI, 8th Edition

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Theory of Computation Code: 322554 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 Students will learn about a variety of issues in the mathematical development of computer science theory, particularly
finite representations for languages and machines.
 Students will gain a more formal understanding of algorithms and procedures.

COURSE OUTCOME:
At the end of this course students will:
 Be able to construct finite state machines and the equivalent regular expressions.
 Be able to prove the equivalence of languages described by finite state machines and regular expressions.
 Be able to construct pushdown automata and the equivalent context free grammars.
 Be able to prove the equivalence of languages described by pushdown automata and context free grammars.
 Be able to construct Turing machines and Post machines.

UNIT I THE THEORY OF AUTOMATA : Introduction to automata theory, Examples of automata machine, Finite
automata as a language acceptor and translator. Deterministic finite automata. Non deterministic finite automata,
finite automata with output (Mealy Machine. Moore machine). Finite automata with ? moves, Conversion of
NFA to DFA by Arden’s method, Minimizing number of states of a DFA. My hill Nerode theorem, Properties
and limitation of FSM. Two way finite automata. Application of finite automata.
UNIT II REGULAR EXPRESSIONS : Regular expression, Properties of Regular Expression. Finite automata and
Regular expressions. Regular Expression to DFA conversion & vice versa. Pumping lemma for regular sets.
Application of pumping lemma, Regular sets and Regular grammar. Closure properties of regular sets. Decision
algorithm for regular sets and regular grammar.

UNIT III GRAMMARS: Definition and types of grammar. Chomsky hierarchy of grammar. Relation between types of
grammars. Role and application areas of grammars. Context free grammar. Left most linear & right most
derivation trees. Ambiguity in grammar. Simplification of context free grammar. Chomsky normal from.
Greibach normal form, properties of context free language. Pumping lemma from context free language.
Decision algorithm for context tree language.
UNIT IV PUSH DOWN AUTOMATA AND TURING MACHINE: Basic definitions. Deterministic push down
automata and non deterministic push down automata. Acceptance of push down automata. Push down automata
and context free language. Turing machine model. Representation of Turing Machine Construction of
Turing Machine for simple problem’s. Universal Turing machine and other modifications. Church’s Hypothesis.
Post correspondence problem. Halting problem of Turing Machine

UNIT V COMPUTABILITY: Introduction and Basic concepts. Recursive function. Partial recursive function. Partial
recursive function. Initial functions, computability, A Turing model for computation. Turing computable
functions, Construction of Turing machine for computation. Space and time complexity. Recursive enumerable
language and sets.
Text Books :
1. Theory of Computer Science (Automata Language & Computation), K.L.P. Mishra and N. Chandrasekran, PHI.
2. Introduction to Automata theory. Language and Computation, John E. Hopcropt & Jeffery D. Ullman, Narosa
Publishing House.
Reference Books :
1. Finite Automata and Formal Languages: A Simple Approach, A.M. Padma Reddy, Pearson Education, India.
2. Theory of Automata and Formal Language, R.B. Patel & P. Nath, Umesh Publication.
3. An Introduction and finite automata theory, Adesh K. Pandey, TMH.
4. Theory of Computation, AM Natrajan. Tamilarasi, Bilasubramani, New Age International Publishers.

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: UNIX & Shell Programming Code: 322555 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 To familiarize students with the Linux environment.
 To learn the fundamentals of shell scripting/programming
 To familiarize students with basic Linux shell script programming.

COURSE OUTCOME:
At the end of this course students will be able to Work confidently in Unix/Linux environment

UNIT I INTRODUCTION TO UNIX: Architecture of Unix, Features of Unix , Unix Commands – PATH, man, echo,
printf, script, passwd, uname, who, date, stty, pwd, cd, mkdir, rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar,
gzip UNIX UTILITIES: Introduction to unix file system, vi editor, file handling utilities, security by file
permissions, process utilities, disk utilities, networking commands, unlink, du, df, mount, umount, find, unmask,
ulimit, ps, w, finger, arp, ftp, telnet, rlogin.Text processing utilities and backup utilities , detailed commands to
be covered are tail, head, sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg, comm, cmp, diff, tr, awk, cpio
UNIT II INTRODUCTION TO SHELLS: Unix Session, Standard Streams, Redirection, Pipes, Tee Command,
Command Execution, -Line Editing, Quotes, Command Substitution, Job Control, Aliases, Variables, Predefined
Variables, Options, Shell/Environment Customization. FILTERS: Filters and Pipes, Concatenating files, Display
Beginning and End of files, Cut and Paste, Sorting, Translating Characters, Files with Duplicate Lines, Count
Characters, Words or Lines, Comparing Files.
UNIT III GREP: Operation, grep Family, Searching for File Content. SED: Scripts, Operation, Addresses, commands,
Applications, grep and sed. AWK: Execution, Fields and Records, Scripts, Operations, Patterns, Actions,
Associative Arrays, String Functions, String Functions, Mathematical Functions, User – Defined Functions,
Using System commands in awk, Applications, awk and grep, sed and awk.
UNIT IV INTERACTIVE KORN SHELL: Korn Shell Features, Two Special Files, Variables, Output, Input, Exit Status
of a Command, eval Command, Environmental Variables, Options, Startup Scripts, Command History,
Command Execution Process. KORN SHELL PROGRAMMING: Basic Script concepts, Expressions,
Decisions: Making Selections, Repetition, special Parameters and Variables, changing Positional Parameters,
Argument Validation, Debugging Scripts, Script Examples.
UNIT V INTERACTIVE C SHELL: C shell features, Two Special Files, Variables, Output, Input, Exit Status of a
Command, eval Command, Environmental Variables, On-Off Variables, Startup and Shutdown Scripts,
Command History, Command Execution Scripts. C SHELL PROGRAMMING: Basic Script concepts,
Expressions, Decisions: Making Selections, Repetition, special Parameters and Variables, changing Positional
Parameters, Argument Validation, Debugging Scripts, Script Examples. FILE MANAGEMENT: File
Structures, System Calls for File Management system, INODES, Structure of Regular File,
Directories,Conversions of a Path, name to an INODE, Super Block, INODE Assignment to a New File create,
open, close, read, write, lseek, link, symlink unlink, stat, fstat, lstat, chmod, chown, Directory API – opendir,
readdir, closedir, mkdir, rmdir, umask.

Text Books:
1. Unix and shell Programming, Behrouz A. Forouzan, Richard F. Gilberg.Thomson
2. Your Unix the ultimate guide, Sumitabha Das, TMH. 2nd Edition.
References:
1. Unix for programmers and users, 3rd edition, Graham Glass, King Ables, Pearson education.
2. Unix programming environment, Kernighan and Pike, PHI. / Pearson Education
3. The Complete Reference Unix, Rosen, Host, Klee, Farber, Rosinski, Second Edition, TMH.
4. Unix Shell programming, Yashwanth Kanitkar, 1st Edition, BPB Publisher

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Data Base Management System Code: 322556 (22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 To understand the role of a database management system and its users in an organization.
 To understand database concepts, including the structure and operation of the relational data model.
 Can successfully apply logical database design principles, including E-R diagrams and database normalization.
 Construct simple and moderately advanced database queries using Structured Query Language (SQL).
 To understand the concept of transaction, its properties and how to persist the data in complex concurrent users
environment.

COURSE OUTCOME:
 Will be able to describe the basic concepts of RDMBS and relational data model
 Be familiar with the relational database theory & be able to write relational algebra expressions for queries
 Understand DML, DDL and will be able to construct queries using SQL by knowing the importance of data &its requirements in
any applications.
 Be familiar with the basic issues of transaction, its processing and concurrency control.
 Be familiar with basic database storage structures and access techniques: file and page organizations, indexing methods including
B-tree, and hashing.

UNIT I Data base System Applications, data base System VS file System – View of Data – Data Abstraction – Instances
and Schemas – data Models – the ER Model – Relational Model – Other Models – Database Languages – DDL –
DML – database Access for applications Programs – data base Users and Administrator – Transaction
Management – data base System Structure – Storage Manager – the Query Processor. History of Data base
Systems. Data base design and ER diagrams – Beyond ER Design Entities, Attributes and Entity sets –
Relationships and Relationship sets – Additional features of ER Model – Concept Design with the ER Model –
Conceptual Design for Large enterprises.
UNIT II Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing Integrity constraints –
Querying relational data – Logical data base Design – Introduction to Views – Destroying altering Tables and
Views. Relational Algebra – Selection and projection set operations – renaming – Joins – Division – Examples
of Algebra overviews – Relational calculus – Tuple relational Calculus – Domain relational calculus –
Expressive Power of Algebra and Calculus
UNIT III Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries – Correlated
Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values – Comparison using Null
values – Logical connectivity’s – AND, OR and NOT – Impact on SQL Constructs – Outer Joins – Disallowing
NULL values – Complex Integrity Constraints in SQL Triggers and Active Data bases.
UNIT IV Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to decomposition –
reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join Decomposition –
Dependency preserving Decomposition – Schema refinement in Data base Design – Multi valued
Dependencies – FORTH Normal Form
Transaction Concept- Transaction State- Implementation of Atomicity and Durability – Concurrent –
Executions – Serializability Recoverability – Implementation of Isolation – Testing for serializability- Lock –
Based Protocols – Timestamp Based Protocols Validation- Based Protocols – Multiple Granularity

UNIT V Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions – Buffer
Management – Failure with loss of nonvolatile storage-Advance Recovery systems- Remote Backup systems
Data on External Storage – File Organization and Indexing – Cluster Indexes, Primary and Secondary Indexes –
Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations –
Indexes and Performance Tuning- Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) –
B+ Trees: A Dynamic Index Structure.

TEXT BOOKS:
1. Data base System Concepts, Silberschatz, Korth, McGraw Hill, 5th edition.
2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGraw Hill 3rd Edition
REFERENCES:
1. Data base Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition.
2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education
3. Introduction to Database Systems, C.J. Date Pearson Education

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Microprocessor & Interfaces Laboratory Code: 322561(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiment to be performed

1. To perform addition & subtraction of two 8 – bit hexadecimal numbers.

2. To perform addition & subtraction 16 – bit hexadecimal numbers.
3. To perform addition & subtraction 32 – bit hexadecimal numbers.
4. To perform addition & subtraction of two 8 – bit decimal numbers and store the result in DX register.
To perform addition & subtraction of two decimal digits 9 and 7 using ASCII code store the result in ASCII
5.
format.
To perform addition & subtraction of two decimal digits 97 and 25 using ASCII code store the result in ASCII
6.
format in CX-BX register.
7. To perform multiplication of 4 and 5 .
8. To perform division of 16 – bit number with 8-bit number.
9. To perform multiplication of two 8-bit numbers using ASCII code store the result in ASCII form in DX.
register.
10. To perform division of two 8-bit numbers using ASCII code store the result in ASCII form in DX register.
11. To solve Arithmetic equation 3AX+5DX+BP and store the result in CX register.
12. To solve Arithmetic equation (P*Q)+(R*S).
13 To add only positive number from 100 data bytes.
14 To write a program to add series of 20 bytes.
15 To find positive & negative byte from 100 data bytes.
16 To find largest & smallest byte from block of data.

 List of Equipment’s/Machine Required: 8086 based microprocessor kit, MASM assembler, 8086 simulator, PCs.

Reference Books:

1. IBM PC Assembly Language and Programming, P. Abel, 5th Edition, PHI/Pearson Education.
2. Introduction To Assembly Language Programming, SivaramaP.Dandamudi, Springer Int. Edition,2003.
3. The 8088 and 8086 Microprocessors: Programming , Interfacing,Software,Hardware and Application,4th
edition,W.A.Triebel,A.Singh,N.K.Srinath,Pearson Education

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Programming in Java Laboratory Code: 322562(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Experiment to be performed

1. Write a program to check whether a number is an Armstrong number or not.
2. Write a program to sort a stream of Strings.
3. Write a program to perform multiplication of two matrices.
4. Write a program to find the volume of a box having its side w, h, d means width, height and depth. Its volume is
v=w*h*d and also find the surface area given by the formula s=2(wh+hd+dw), use appropriate constructors for the
above.
5. Develop a program to illustrate a copy constructor so that a string may be duplicated into another variable either by
assignment or copying.
6. Create a base class called shape. It contains two methods getxyvalue() and showxyvalue() for accepting co-ordinates
and to display the same. Create the subclass called Rectangle which contains a method to display the length and
breadth of the rectangle called showxyvalue().Use overriding concept.
7. Write a program that creates an abstract class called dimension, creates two subclasses, rectangle and triangle. Include
appropriate methods for both the subclass that calculate and display the area of the rectangle and triangle.
8. Write a program which throws Arithmetic Exception. Note the output; write another class (in a different file) that
handles the Exception.
9. Create a user defined Exception class which throws Exception when the user inputs the marks greater than 100.
10. Write a program in which a Mythread class is created by extending the Thread class. In another class, create objects of
the Mythread class and run them. In the run method print “CSVTU” 10 times. Identify each thread by setting the name.
11. Write a program using InetAddress class and also show the utility of URL and URL Connection classes.
12. Write a program which illustrates capturing of Mouse Events. Use Applet class for this.
13. Write a program using RMI in which a simple remote method is implemented.
14. Write a servlet program using HttpServlet class. Also give the appropriate HTML file which posts data to the servlet.
15. Write a JDBC program for Student Mark List Processing.
16. Design a text editor which is having some of the features of notepad.

Reference Books:
1. Java complete reference - Naughton schildt (TMH)
2. Java programming – E Balagurusamy
3. Java 2 Black book – Steven Holzner
4. Java Examples in a nutshell – O’ Reilly

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: UNIX & Shell Programming Laboratory Code: 322563(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

Note: Use Bash for Shell scripts.

List of Experiment to be performed
1. a) Write a shell script that accepts a file name, starting and ending line numbers as arguments and displays all the lines between the
given line numbers.
b) Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to it.
2. a) Write a shell script that displays a list of all the files in the current directory to which the user has read, write and execute permissions.
b) Write a shell script that receives any number of file names as arguments checks if every argument supplied is a file or a directory and
reports accordingly. Whenever the argument is a file, the number of lines on it is also reported.
3. a) Write a shell script to list all of the directory files in a directory.
b) Write a shell script to find factorial of a given integer.
4. a) Write an awk script to count the number of lines in a file that do not contain vowels.
b) Write an awk script to find the number of characters, words and lines in a file.
5. a) Write a shell script that accepts a list of file names as its arguments, counts and reports the occurrence of each word that is present in
the first argument file on other argument files.
b) Write a c program that makes a copy of a file using standard I/O and system calls.
6. a) Implement in C the following Unix commands using System calls
o cat , ls, mv
b) Write a C program to emulate the Unix ls –l command.
7. Write a program that takes one or more file/directory names as command line input and reports the following information on the file.
a) File type.
b) Number of links.
c) Time of last access.
d) Read, Write and Execute permissions.
8. a) Write a C program to list for every file in a directory, its inode number and file name.
b) Write a C program that demonstrates redirection of standard output to a file. Ex: ls > f1.
9. a) Write a C program to create a child process and allow the parent to display “parent” and the child to display “child” on the screen.
b) Write a C program that illustrates how to execute two commands concurrently with a command pipe. Ex:- ls –l | sort
10. a) Write a C program to create a Zombie process.
b) Write a C program that illustrates how an orphan is created.
11. a) Write C programs that illustrate communication between two unrelated processes using named pipe.
b) Write a C program (sender.c) to create a message queue with read and write permissions to write 3 messages to it with different
priority numbers.
c) Write a C program (receiver.c) that receives the messages (from the above message queue as specified in (21)) and displays them.
12. a) Write a shell script to accept three numbers and display the largest.
b) Write a shell script to find the number of files in a directory.
c) Write a shell script to display first ten positive numbers using until loop.
13. a) Write a shell script to check if a particular user has logged in or not. If not, continue the loop till he/she logins. Once the required user
logins, display a message.
b) Write a shell script to accept the name, grade, and basic salary from the user. Write the details into a file called employee, separating
the fields with a colon (,) continue the process till the user wants.
14. a) Write a shell script to check whether a file is existing or not.
b) Write a shell script to find the mode of a file in a directory.
c) Write a shell script which will accept different numbers and find their sum.

15. a) Write a menu driven program to display a menu of options and depending upon the user’s choice execute the associated command.
b) Write a shell script to calculate the total salary payable to all the employees from the employee file. The salary should be taken from
the 8th field of the employee file.
16. a) Write a shell script to copy the source file to the target file.
b) Write a shell script to print the first 10 odd numbers using the while loop.
c) Write a shell script to reverse the digits of a given number.
References:
1. Unix Shell programming, Yashwanth Kanitkar, 1st Edition, BPB Publisher
2. Unix for programmers and users, 3rd edition, Graham Glass, King Ables, Pearson education.
3. Unix programming environment, Kernighan and Pike, PHI. / Pearson Education
4. The Complete Reference Unix, Rosen, Host, Klee, Farber, Rosinski, Second Edition, TMH.

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: V
Subject: Data Base Management System Laboratory Code: 322564(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

H/W Requirement:
 At least Dual Core or Core-I3 Pro Computing System, 2GB RAM, 80GB HDD

Software
 All systems are configured in DUAL BOOT mode i.e., Students can boot from Windows 7/8 or Linux as per
their lab requirement.
 MySQL/PgSQL/Oracle May be used as Database Management System
 Systems are provided for students in the 1:1 ratio.

LIST OF EXPERIMENTS
1 Database Schema for a customer-sale scenario
Customer(Cust id : integer, cust_name: string)
Item(item_id: integer, item_name: string, price: integer)
Sale(bill_no: integer, bill_data: date, cust_id: integer, item_id: integer, qty_sold: integer)
For the above schema, perform the following—
a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the bills for the current date with the customer names and item numbers
d) List the total Bill details with the quantity sold, price of the item and the final amount
e) List the details of the customer who have bought a product which has a price>200
f) Give a count of how many products have been bought by each customer
g) Give a list of products bought by a customer having cust_id as 5
h) List the item details which are sold as of today
i) Create a view which lists out the bill_no, bill_date, cust_id, item_id, price, qty_sold, amount
j) Create a view which lists the daily sales date wise for the last one week
2 Database Schema for a Student Library scenario
Student(Stud_no : integer, Stud_name: string)
Membership(Mem_no: integer, Stud_no: integer)
Book(book_no: integer, book_name:string, author: string)
Iss_rec(iss_no:integer, iss_date: date, Mem_no: integer, book_no: integer)
For the above schema, perform the following—
a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the student names with their membership numbers
d) List all the issues for the current date with student and Book names
e) List the details of students who borrowed book whose author is CJDATE
f) Give a count of how many books have been bought by each student
g) Give a list of books taken by student with stud_no as 5
h) List the book details which are issued as of today
i) Create a view which lists out the iss_no, iss _date, stud_name, book name
j) Create a view which lists the daily issues-date wise for the last one week
3 Database Schema for a Employee-pay scenario
employee(emp_id : integer, emp_name: string)
department(dept_id: integer,dept_name:string)
paydetails(emp_id : integer, dept_id: integer, basic: integer, deductions: integer, additions: integer, DOJ: date)
payroll(emp_id : integer, pay_date: date)
For the above schema, perform the following—
a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List the employee details department wise
d) List all the employee names who joined after particular date
e) List the details of employees whose basic salary is between 10,000 and 20,000
f) Give a count of how many employees are working in each department
g) Give a names of the employees whose netsalary>10,000
h) List the details for an employee_id=5
i) Create a view which lists out the emp_name, department, basic, dedeuctions, netsalary
j) Create a view which lists the emp_name and his netsalary
4 Database Schema for a Video Library scenario
Customer(cust_no: integer,cust_name: string)
Membership(Mem_no: integer, cust_no: integer)
Cassette(cass_no:integer, cass_name:string, Language: String)

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Iss_rec(iss_no: integer, iss_date: date, mem_no: integer, cass_no: integer)
For the above schema, perform the following—
a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the customer names with their membership numbers
d) List all the issues for the current date with the customer names and cassette names
e) List the details of the customer who has borrowed the cassette whose title is “ The Legend”
f) Give a count of how many cassettes have been borrowed by each customer
g) Give a list of book which has been taken by the student with mem_no as 5
h) List the cassettes issues for today
i) Create a view which lists outs the iss_no, iss_date, cust_name, cass_name
j) Create a view which lists issues-date wise for the last one week
5 Database Schema for a student-Lab scenario
Student(stud_no: integer, stud_name: string, class: string)
Class(class: string,descrip: string)
Lab(mach_no: integer, Lab_no: integer, description: String)
Allotment(Stud_no: Integer, mach_no: integer, dayof week: string)
For the above schema, perform the following—
a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the machine allotments with the student names, lab and machine numbers
d) List the total number of lab allotments day wise
e) Give a count of how many machines have been allocated to the ‘CSIT’ class
f) Give a machine allotment details of the stud_no 5 with his personal and class details
g) Count for how many machines have been allocated in Lab_no 1 for the day of the week as “Monday”
h) How many students class wise have allocated machines in the labs
i) Create a view which lists out the stud_no, stud_name, mach_no, lab_no, dayofweek
j) Create a view which lists the machine allotment details for “Thursday”.
6 a) Write and execute subprogram to find largest number from the given three numbers.
b) Write and execute subprogram using loop, while and for iterative control statement.
7. a) Write and execute subprogram to check whether the given number is Armstrong or not
b) Write and execute subprogram to generate all prime numbers below 100.
a) Write and execute subprogram to demonstrate the GOTO statement.
8 b) Write a subprogram to demonstrate %type and %rowtype attributes
9 a) Write and execute subprogram to demonstrate predefined exceptions
b) Write and execute subprogram to demonstrate user defined exceptions
10 a) Create a cursor, which displays all employee numbers and names from the EMP table.
b) Create a cursor, which update the salaries of all employees as per the given data.
11 a) Create a cursor, which displays names of employees having salary > 50000.
b) Create a procedure to find reverse of a given number
12 a) Create a procedure to update the salaries of all employees as per the given data
b) Create a procedure to demonstrate IN, OUT and INOUT parameters
13 a) Create a function to check whether given string is palindrome or not.
b) Create a function to find sum of salaries of all employees working in depart number 10.
14 a) Create a trigger before/after update on employee table for each row/statement.
b) Create a trigger before/after delete on employee table for each row/statement.
c) Create a trigger before/after insert on employee table for each row/statement.
16 a) Create a Form to display employee details using SQL
b) Create a Report to generate all employee annual salaries….
Additional Programs
1 Create a form using Forms 6i to display Employee table data.
2 Create a Master/details relationship form which perform Add New, Search, Delete, Save and Update on the
records

3 Generate a report to calculate employee’s salaries department wise from employee table.

4 Create a Report to generate the details of employee table including sum and average salaries department wise.
Course Outcome:Upon successful completion of this Lab the student will be able to:

 Creating , Modify database Tables and manipulate data in the Tables

 Performing database operations in a procedural manner using pl/sql
 Performing database operations (create, update, modify, retrieve, etc.,) using front-end tools like
D2K/Gambas/PhP/Servlet/JSP.
 Design and Develop applications like banking, reservation system, etc.
 Design and implement a small database project using RDBMS to understand the concept of a database
transaction and related database facilities.

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of Program: Bachelor of Engineering
Branch: Common to All Branches Semester: V
Subject: Personality Development Code: 300565 (46)
No. of Lectures: 2/Week Tutorial Period: NIL
Total Marks in ESE: NIL Marks in TA: 20
Minimum number of Class Tests to be conducted: Two
Objective: The course is introduced to develop one's outer and inner personality tremendously and enrich the abilities to enable one to
meet the challenges associated with different job levels. Personality Development is essential for overall development of an individual
apart from gaining technical knowledge in the subject.
Course Objectives
Upon completion of this course, the student shall be able
 To understand the concept of personality and image;
 To develop leadership, listening and interacting skills;
 To develop attitudinal changes;
 To develop decision-making qualities; and
 To communication skill.
UNIT I Personality concepts: What is Personality – its physical and psychic aspects. How to develop a positive self-
image. How to aim at Excellence. How to apply the cosmic laws that govern life and personality. How to
improve Memory – How to develop successful learning skills. How to develop and effectively use one’s
creative power. How to apply the individual MOTIVATORS that make you a self-power personality.
UNIT II Interpersonal Skills: Leadership: Leaders who make a difference, Leadership: your idea, What do we know
about leadership? If you are serious about Excellence. Concepts of leadership, Two important keys to
effective leadership, Principles of leadership, Factors of leadership, Attributes. Listening: Listening skills,
How to listen, Saying a lot- just by listening, The words and the music, How to talk to a disturbed person,
Listening and sometimes challenging. How to win friends and influence people, How to get along with
others. How to develop art of convincing others. How can one make the difference. How to deal with others
particularly elders. Conflicts and cooperation.
UNIT III Attitudinal Changes: Meaning of attitude, benefits of positive attitudes, How to develop the habit of
positive thinking.
Negative attitude and wining: What is FEAR and how to win it. How to win loneliness. How to win over
FAILURE. How to win over PAIN. How to win over one’s ANGER and others anger. What is stress and
how to cope up with it? The art of self-motivation. How to acquire mental well-being. How to acquire
physical well-being.
UNIT IV Decision Making: How to make your own LUCK. How to plan goals/objectives and action plan to achieve
them. How to make RIGHT DECISION and overcome problems. How to make a Decision. Decision
making: A question of style. Which style, when? People decisions: The key decisions. What do we know
about group decision making? General aids towards improving group decision making.
UNIT V Communication Skills: Public Speaking: Importance of Public speaking for professionals. The art of
Speaking - Forget the fear of presentation, Symptoms of stage fear, Main reason for speech failure, Stop
failures by acquiring Information; Preparation & designing of speech, Skills to impress in public speaking &
Conversation, Use of presentation aids & media.
Study & Examination: How to tackle examination, How to develop successful study skills.
Group discussions: Purpose of GD, What factors contribute to group worthiness, Roles to be played in GD.
Course Outcomes:
 The students will be able to develop inner and outer personality exposure;
 The students will be able to develop effective leadership qualities and interacting skills;
 The students will be able to develop positive attitude, motivating skills and develop winning philosophies;
 The students will be able to develop decision-making tools; and
 The students will be able to develop group presentation, public speaking and impressive conversation.
Text Books:
1. Basic Managerial Skills for all by E. H. McGrawth, prentice Hall India Pvt. Ltd., 2006
2. Basic Employability Skills by P. B. Deshmukh, BSP Books Pvt. Ltd., Hyderabad, 2014
Reference Books:
1. How to Develop a Pleasing Personality by Atul John Rego, Better Yourself Books, Mumbai, 2000
2. How to Succeed by Brain Adams, Better Yourself Books, Mumbai, 1969
3. Personality: Classic Theories & Modern Research; Friedman ; Pearson Education, 2006
4. How to Win Friends and Influence People by Dale Carnigie, A. H. Wheeler 2006

Name of the Programme: Bachelor of Engineering :::::: Duration of the Programme: Four years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Scheme of Teaching and Examination
B.E. VI Semester Computer Science &Engineering
Period Per
Scheme of Exam
Sl. Week Total Credit
Board of Code No. Subjects
No. Theory/Practical Marks L+(T+P)/2
Study L T P
ESE CT TA
Computer Sc. 322651(22) Computer Networks
1 & Engg. 4 1 - 80 20 20 120 5

2 Computer Sc. 322652(22) Compiler Design 3 1 - 80 20 20 120 4

& Engg.
3 Computer Sc. 322653(22) Enterprise Resource 3 1 - 80 20 20 120 4
& Engg. Planning
4 Computer Sc. 322654(22) Software Engineering & 3 1 - 80 20 20 120 4
& Engg. Project Management
5 Computer Sc. 322655(22)
Computer Graphics 3 1 - 80 20 20 120 4
& Engg.
6 Refer Table -1 Professional Elective -I 3 1 - 80 20 20 120 4
7 Computer Sc. 322661(22) - - 3 40 - 20 60 2
& Engg. Computer Networks Lab

Computer Sc. 322662(22) Software Engineering & 2

8 - - 3 40 - 20 60
& Engg. Project Management Lab –
With Minor Project
9 Computer Sc. 322663(22)
Computer Graphics Lab - - 3 40 - 20 60 2
& Engg.
10 Computer Sc. 322664(22) Advanced Java - - 3 40 - 20 60 2
& Engg. Programming Lab
11 Management 300665(76) Managerial Skills - - 2 - - 40 40 1
12 Computer Sc. --------------- Library - - 1 - - - - -
& Engg.

TOTAL 19 6 15 640 120 240 1000 34

L: Lecture T: Tutorial P: Practical

ESE: End Semester Examination CT: Class Test TA: Teachers’ Assessment

Note: Industrial Training of eight weeks is mandatory for B.E. students. It is to be completed in two equal parts. The first part must
have been completed in summer after IV semester. The second part to be completed during summer after VI semester after which
students have to submit a training report which will be evaluated by college teachers during B.E. VII semester.
Table 1: Professional Elective–I
S.
Board of Studies Subject Code Subject Name
No.
1 Computer Science &Engg 322671(22) Digital Signal Processing
2 Computer Science & Engg 322672(22) Advanced Microprocessors & Micro Controllers
3 Information Technology 322673(33) Multimedia & Virtual Reality
4 Computer Science & Engg 322674(22) Inter-Networking with TCP/IP
5 Computer Science & Engg 322675(22) Management Information Systems
6 Computer Science & Engg 322676(22) Advanced Operating System
7 Computer Science & Engg 322677(22) Advanced Data Base Systems.
8 Computer Science & Engg 322678(22) Object Oriented Modelling & Design
Note:1/4thof total strength of students to minimum of twenty students is required to offer an elective in the college in a particular
academic session.
1. Choice of elective course once made for an examination cannot be changed in future examinations.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Computer Networks Code: 322651(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 Provide students with an enhanced base of knowledge in current and reflective practice necessary to support a career in
Computer Networking at advanced professional level.
 Understanding concept of local area networks, their topologies, protocols and applications
 Understanding the different protocols, software, and network architectures.

COURSE OUTCOME: On completion of this unit the student should be able to:
 describe the basis and structure of an abstract layered Network protocol model
 identify and apply basic theorems and formulae for the information-theoretic basis of communication and the performance
of TCP/IP network protocols

UNIT I Introduction: OSI, TCP/IP and other networks models, Examples of Networks: Novell Networks, Arpanet, Internet,
Network Topologies WAN, LAN, MAN.
Physical Layer: Transmission media copper, twisted pair wireless, switching and encoding asynchronous
communications; Narrow band, broad band ISDN and ATM.

UNIT II Data link layer : Design issues, framing, error detection and correction, CRC, Elementary Protocol-stop and wait,
Sliding Window, Slip, Data link layer in HDLC, Internet, ATM. Multiple Access Protocols – Link Layer Addressing –
ARP – DHCP – Ethernet – Hubs, Bridges, and Switches. Ring Topology - Physical Ring – Logical Ring.
Medium Access sub layer: ALOHA, MAC addresses, Carrier sense multiple accesses. IEEE 802.X Standard Ethernet,
wireless LANS. Bridges

UNIT III Network Layer : Forwarding and Routing – Network Service Models – Virtual Circuit and Datagram Networks –
Router – Internet Protocol (IP) – IPv4 and IPv6 – ICMP – Link State Routing – Distance Vector Routing – Hierarchical
Routing – RIP – OSPF – BGP – Broadcast and Multicast Routing – MPLS - Mobile IP – IPsec.
UNIT IV Transport Layer: Transport Layer Services – Multiplexing and Demultiplexing – UDP – Reliable Data Transfer – Go-
Back-N and Selective Repeat. Connection-Oriented Transport: TCP – Segment Structure – RTT estimation – Flow
Control – Connection Management – Congestion Control – TCP Delay Modeling – SSL and TLS. Integrated and
Differentiated Services: Intserv – Diffserv.
UNIT V Application Layer: Principles of Network Applications – The Web and HTTP – FTP – Electronic Mail – SMTP –
Mail Message Formats and MIME – DNS – Socket Programming with TCP and UDP. Multimedia Networking:
Internet Telephony – RTP – RTCP – RTSP. Network Security: Principles of Cryptography – Firewalls – Application
Gateway – Attacks and Countermeasures.

TEXT BOOKS :
1. Data Communications and Networking – Behrouz A. Forouzan.Third Edition TMH.
2. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson
Education, Third edition, 2006

REFERENCE BOOKS :
1. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson Education/PHI
2. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, Pearson Education
3. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Compiler Design Code: 322652(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVE:
 to understanding the fundamental principles in compiler design
 To provide the skills needed for building compilers for various situations that one may encounter in a career in Computer
Science.

COURSE OUTCOME:
 After the course a student should have an understanding, based on knowledge of the underlying machine architecture, the
limitations and efficiency of various design techniques of compilers implementation

UNIT I INTRODUCTION: Introduction to Compiler, single and multi-pass compilers, Translators, Phases of Compilers,
Compiler writing tools, Bootstrapping, Backpatching. Finite Automata and Lexical Analyzer: Role of Lexical
Analyzer, Specification of tokens, Recognition of tokens, Regular expression, Finite automata, from regular expression
to finite automata transition diagrams, Implementation of lexical analyzer Tool for lexical analyzer LEX, Error
reporting.
UNIT II SYNTAX ANALYSIS AND PARSING TECHNIQUES: Context free grammars, Bottom-up parsing and top down
parsing. Top down Parsing : elimination of left recursion, recursive descent parsing, Predicative Parsing ,Bottom Up
Parsing : Operator precedence parsing, LR parsers, Construction of SLR, canonical LR and LALR parsing tables,
Construction of SLR parse tables for Ambiguous grammar, the parser generator – YACC, error recovery in top down
and bottom up parsing.
UNIT III SYNTAX DIRECTED TRANSLATION & INTERMEDIATE CODE GENERATION : Synthesized and inherited
attributes, dependency graph, Construction of syntax trees, bottom up and top down evaluation of attributes, S-
attributed and L-attributed definitions ,Postfix notation; Three address codes, quadruples, triples and indirect triples,
Translation of assignment statements, control flow, Boolean expression and Procedure Calls.
UNIT IV RUNTIME ENVIRONMENT: Storage organization, activation trees, activation records, allocation strategies,
Parameter passing symbol table, dynamic storage allocation.
UNIT V CODE OPTIMIZATION & CODE GENERATION: Basic blocks and flow graphs, Optimization of basic blocks,
Loop optimization, Global data flow analysis, Loop invariant computations. Issue in the design of Code generator,
register allocation, the target machine, and simple Code generator.

Text Books:
1. Compilers-Principles, Techniques and Tools, Alfred V. Aho, Ravi Sethi and Ullman J.D., Addison Wesley, 2nd Ed.
2. Principle of Compiler Design, Alfred V. Aho, and J.D. Ullman, Narosa Publication.
Reference Books:
1. Compiler design in C, A.C. Holub, PHI.
2. Compiler construction (Theory and Practice), A.Barret William and R.M. Bates, Galgotia Publication.
3. Compiler Design, Kakde.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Enterprise Resource Planning Code: 322653(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

COURSE OBJECTIVES:
 To know the basics of ERP and business modules of ERP
 To understand the key implementation issues of ERP
 To be aware of some popular products in the area of ERP
 To appreciate the current and future trends in ERP

COURSE OUTCOME: Students will know the strategic importance of Enterprise Resource Planning.

UNIT I INTRODUCTION: ERP: An Overview, Enterprise – An Overview, Origin, Evolution and Structure: Conceptual Model
of ERP, The Benefits of ERP, ERP and Related Technologies, Business Process Reengineering (BPR), Data
Warehousing, Data Mining, OLAP, Product Life Cycle Management(PLM), Supply chain Management(SCM)

UNIT II ERP IMPLEMENTATION: ERP Implementation Lifecycle, Implementation Methodology, Hidden Costs, Organizing
the Implementation, Role of SDLC/SSAD, Object Oriented Architecture Vendors, Consultants and Users, Contracts
with Vendors, Consultants and Employees, Project Management and Monitoring

UNIT III THE BUSINESS MODULES: Business modules in an ERP Package, Finance, Manufacturing, Human Resources,
Plant Maintenance, Materials Management, Quality Management, Sales and Distribution

UNIT IV THE ERP MARKET: ERP Marketplace and Marketplace Dynamics: Market Overview, Marketplace Dynamics, The
Changing ERP Market. ERP- Functional Modules: Introduction, Functional Modules of ERP Software, Integration of
ERP, Supply chain and Customer Relationship Applications

UNIT V ERP – PRESENT AND FUTURE:ERP, ERP and Internet, Critical success and failure factors, Integrating ERP into
organizational culture Using ERP tool: ERP Market Place, SAP AG, PeopleSoft, Baan, JD Edwards, Oracle, QAD, SSA.
Turbo Charge the ERP System, EIA, ERP and e-Commerce, ERP and Internet, Future Directions

TEXT BOOK:
1. Alexis Leon, “ERP Demystified”, Tata McGraw Hill, New Delhi, 2000
REFERENCE BOOKS:
1. Joseph A Brady, Ellen F Monk, Bret Wagner, “Concepts in Enterprise Resource Planning”, Thompson Course Technology,
USA, 2001.
2. Vinod Kumar Garg and Venkitakrishnan N K, “Enterprise Resource Planning – Concepts and Practice”, PHI, New Delhi,
2003

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Software Engineering & Project Management Code: 322654(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28
COURSE OBJECTIVE:
 To introduce software project and to understand about the different software processes & their uses.
 Understanding good coding practices, including documentation, contracts, regression tests and daily builds.
 To introduce ethical and professional issues and to explain why they are concern to software engineers.
To understand how Software engineering & Project Management is concerned with theories, methods and tools for professional software
development.

COURSE OUTCOME:
After completion of this course, the students would be able to
 Select and implement different software development process models
 Extracting and analyzing software requirements specifications for different projects
 Developing some basic level of software architecture/design
 Applying standard coding practices, Identification and implementation of the software metrics
 Defining the basic concepts and importance of Software project management concepts like cost estimation, scheduling and reviewing the
progress.
 Applying different testing and debugging techniques and analyzing their effectiveness.
 Analyzing software risks and risk management strategies
 Defining the concepts of software quality and reliability on the basis of International quality standards.

UNIT I Introduction to Software Engineering: The evolving role of software, Changing Nature of Software, legacy software, Software
myths. A Generic view of process: Software engineering- A layered technology, a process framework, The Capability Maturity Model
Integration (CMMI), Process patterns, process assessment, personal and team process models. Process models: The waterfall model,
Incremental process models, Evolutionary process models, specialized process models, The Unified process.
UNIT II Software Requirements Specification (SRS): Functional and non-functional requirements, User requirements, System requirements,
Interface specification, the software requirements document. Requirements engineering process: Feasibility studies, Requirements
elicitation and analysis, Requirements validation, Requirements management. System models: Context Models, behavioural models,
Data models, Object models, structured methods.
UNIT III Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, Design Structure
Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function Oriented Design, Object Oriented
Design, Top-Down and Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures: Hallstead’s
Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity Measures: Control Flow Graphs.
UNIT IV Testing Strategies: A strategic approach to software testing, test strategies for conventional software, Black-Box and White-Box
testing, Validation testing, System testing, the art of Debugging. Product metrics: Software Quality, Frame work for Product metrics,
Metrics for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for maintenance. Metrics
for Process and Products: Software Measurement, Metrics for software quality.
UNIT V Software Project Management: People – Product-Process-Project. Project scheduling and tracking: Basic concepts-relation between
people and effort-defining task set for the software project-selecting software engineering task. Computer aided software engineering
tools - CASE building blocks, taxonomy of CASE tools, integrated CASE environment.Software Risk management: Reactive vs
Proactive Risk strategies, software risks, Risk identification, Risk projection, Risk refinement, RMMM, RMMM Plan. Quality
Management: Quality concepts, Software quality assurance, Software Reviews, Formal technical reviews, Statistical Software quality
Assurance, Software reliability, The ISO 9000 quality standards.

TEXT BOOKS:
1. Software Engineering: A practitioner’s Approach, Roger S Pressman, sixth edition. McGrawHill International Edition, 2005
2. Software Engineering, Ian Sommerville, seventh edition, Pearson education,2004
REFERENCE BOOKS:
1. Software Engineering,A Precise Approach,Pankaj Jalote,Wiley India,2010.
2. Software Engineering : A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008
3. Fundamentals of Software Engineering,Rajib Mall,PHI, 2005
4. Software Engineering, Principles and Practices,Deepak Jain,Oxford University Press.
5. Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer International edition, 2006.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Computer Graphics Code: 322655(22)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28
COURSE OBJECTIVE: The primary objective of this course is to learn the basic principles of computer graphics. These topics will
include the following:
 Transformational geometry -- utilizing transforms to positioning and manipulate objects in 3-dimensional space. This includes
the positioning of virtual cameras and light sources.
 Rendering of complex models -- accurately drawing illustrations of complex objects with arbitrary camera and light source.
Curves and surfaces -- methods for rendering and shading curved objects

COURSE OUTCOME:
 Know and be able to describe the general software architecture of programs that use 3D computer graphics.
 Know and be able to discuss hardware system architecture for computer graphics. This includes, but is not limited to:
graphics pipeline, frame buffers, and graphic accelerators/co-processors.
 Know and be able to use a current 3D graphics API (e.g., OpenGL or DirectX).
 Must be able to use the underlying algorithms, mathematical concepts, supporting computer graphics.

UNIT I Introduction, Application areas of Computer Graphics, overview of graphics systems, video-display devices, raster-scan
systems, random scan systems, graphics monitors and work stations and input devices
UNIT II Output primitives : Points and lines, line drawing algorithms, mid-point circle and ellipse algorithms. Filled area
primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms
UNIT III 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix representations
and homogeneous coordinates, composite transforms, transformations between coordinate systems. 2-D viewing : The
viewing pipeline, viewing coordinate reference frame, window to view-port coordinate transformation, viewing
functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland –Hodgeman polygon clipping
algorithm.
UNIT IV 3-D object representation : Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and
B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods. 3-D Geometric
transformations: Translation, rotation, scaling, reflection and shear transformations, composite transformations. 3-D
viewing: Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping.
UNIT V Visible surface detection methods : Classification, back-face detection, depth-buffer, scan-line, depth sorting, BSP-tree
methods, area sub-division and octree methods. Computer animation: Design of animation sequence, general computer
animation functions, raster animation, computer animation languages, key frame systems, motion specifications.

TEXT BOOKS:
1. “Computer Graphics C version”, Donald Hearn and M.Pauline Baker, Pearson Education.
2. “Computer Graphics Principles & practice”, second edition in C, Foley, Van Dam, Feiner and Hughes, Pearson Education.

REFERENCE BOOKS:
1. “Computer Graphics”, second Edition, Donald Hearn and M.Pauline Baker, PHI/Pearson Education.
2. “Computer Graphics Second edition”, Zhig and Xiang, Roy Plastock, Schaum’s outlines, Tata Mc- Graw hill edition.
3. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition.
4. “Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
5. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Computer Networks Laboratory Code: 322661(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of experiments to be conducted in Computer Network Lab.

1. Introduction to Local Area Network with its cables, connectors and topologies.
2. Installation of Switch. Hub their cascading and network mapping.
3. Installation of UTP, Co-axial cable, Cross cable, parallel cable NIC and LAN card.
4. Case Study of Ethernet (10 base 5,10 base 2,10 base T)
5. Installation and working of Net meeting and Remote Desktop.
6. Installation and working with Telnet (Terminal Network).
7. Installation and working with FTP (File Transfer Protocol).
8. Installation and Computers via serial or Parallel ports and enable the computers to share disk and printer port.
9. To connect two Personal Computer with Telephone line.
10. Installation of Modem and Proxy Server.
11. Working with Null Modem.
12. Installation of Windows 2003 server/ Windows 200 server.
13. Configuration of DHCP.
14. Introduction to Server administration.
Recommended Books.
1. Computer Network and internet by Dougles E. Comer (Pearson Education)
2. List of Software required :-
3. Windows 2003 server/Windows 2000 server.
4. List of Hardware required :-
5. LAN Trainer Kit LAN Card Cable, Connectors, HUB, Switch, Crimping Tools.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Software Engineering & Project Management Code: 322662(22)
Laboratory with Minor Project
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

INSTRUCTIONS TO BE STRICTLY FOLLOWED BY STUDENTS

1) A group of two to three students should develop software that could be developed during session.
2) Technology/Tool like (C/C++/VB/Gambas/PhP/Core Java/Servlet/ JSP …. Any other relevant tool) can be selected for Developing their
project
3) Phase wise documentation of the project should be submitted (soft and hard copy).
4) All group members must have a copy of the documentation, which are to be checked by faculty Lab Incharge, phase wise.
5) Before the Final Practical examinations, every individual student should submit his own hardcopy of the documentation in a Punched
Cardboard File Only, with a CD containing the softcopy of the same.
6) During Final Submissions, every copy of the documentation should be accompanied by a Submission Certificate duly signed by the Teacher
In-charge and Head of Department

Note:
Initial 4 – 6 Weeks Instructor is supposed to teach/Cover PHP/MySQL or students are supposed to go through the spoken Tutorial Course on PhP

SAMPLE EXPERIMENT

AIM: To perform the user’s view analysis: Use case diagram for the coffee-maker.

The CSE Dep’t has a new building in CSVTU Campus. We all know that Computer Engineers love caffeine, so the CSE department is planning on
installing a Coffeemaker in a lounge across the hall from the 24-hour computer lab. Our job is to test and model the functionality of the
Coffeemaker. We are only working with the logic code behind the hardware, so only a command line interface is used for manual testing. Here is a
partial listing of requirements for the Coffeemaker system.

2 TOOLS/APPARATUS: Net beans 6.0, Microsoft Visio.

3 STANDARD PROCEDURES:
3.1 Analyzing the Problem:
According to the analysis of nouns and verbs we can have the following actors and use cases for the given system:

Actors ( based on the nouns) Use-cases(based on the verbs)

User(The person who makes coffee) Waiting State
Add a Recipe
Edit a Recipe
Delete a Recipe
Check Inventory
Add Inventory
Purchase Beverage

The use-cases based on the requirements stated in the problem are given in the designing part of the solution.

3.2 Designing the Solution:

Requirements - User Stories
Title : Waiting State

AccTest: checkOptions0 Priority: 1 Story Points: 2

When the Coffee Maker is not in use it waits for user input. There are six different options of user input
1) Add a Recipe
2) Edit a Recipe

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 3) Delete a Recipe
4) Check Inventory
5) Add Inventory
6) Purchase Beverage

Title : Add a Recipe

AccTest: addRecipe1 Priority: 1 Story Points: 2

 Only three recipes may be added to the Coffeemaker. A recipe consists of a name. price and units of coffee, units
of milk, units of sugar and units of chocolate.
 Each recipe name must be unique in the recipe list. Price must be handled as an integer.
 A status message is printed to specify if the recipe was successfully added or not. Upon completion the
Coffeemaker is returned to the waiting state

Title : Delete a Recipe

AccTest: Delete Recipe1 Priority: 2 Story Points: 1

 A recipe may be deleted from the Coffeemaker if it exist in the list of recipes in the coffeemaker
 The recipes are listed by their name
 Upon completion a status message is printed and the Coffee Maker is returned to the waiting state

Title : Edit a Recipe

AccTest: editRecipe1 Priority: 2 Story Points: 1

 A recipe may be edited in the Coffeemaker if it exist in the list of recipes in the coffeemaker
 The recipes are listed by their name. After selecting a recipe to edit , the user will then enter the new recipe
information
 A recipe name may not be changed
 Upon completion a status message is printed and the Coffee Maker is returned to the waiting state

Title : Add Inventory

AccTest: addInventory1 Priority: 2 Story Points: 2

 Inventory may be added to the machine at any time from the main menu and is added to the current
 Inventory in the Coffeemaker
 The type of Inventory in Coffeemaker are Coffee, milk,sugar and chocolate
 The Inventory is measured in Integer Units
 Inventory may be removed from the coffeemaker by purchasing a beverage
 Upon completion a status message is printed and the Coffeemaker is returned to the waiting state

Title : Check Inventory

AccTest: checkInventory Priority: 2 Story Points: 1

 Inventory may be checked at any time from the main menu
 The units of each item in the inventory are displayed
 Upon completion the Coffeemaker is returned to the waiting state
Title : Purchase Beverage

AccTest: pruchaseBeverage1 Priority: 1 Story Points: 2

 The user selects a beverage and inserts an amount of money.
 The money must be an integer
 If the beverage is in the RecipeBook and the user paid enough money the beverage will be dispensed and any
change will be returned.
 The user will not be able to purchase a beverage if they do not deposit enough money into the coffeemaker
 A users money will be returned if there is not enough inventories to make the beverage
 Upon completion, the Coffee maker displays a message about the purchase status and is returned to the main menu

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
3.3 Implementing the Solution

The use-case diagram can be drawn using the netbeans version 6.0 or higher

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Requirements – Use Cases

3.4 Testing the Solution

Here the problem statement is: CSE department is planning on installing a Coffeemaker in a lounge across the hall from the 24-hour computer lab
so we have prepared the use-case accordingly:

The use-cases are tested to match up with the requirements stated in the above table and they are complying with the problem statement
requirements.
Requirements given in the problem statement(based on the verbs) Use-cases(based on the verbs)
When the coffee Maker is not in use it waits for user input. There are six different options of Waiting state
user input
Only three recipes may be added to the Coffeemaker. A Recipe consists of a name. Price, Add a Recipe
and units of coffee, units of milk , units of sugar and units of chocolate
A recipe may be edited in the coffeemaker if it exist in the list of recipes in the Coffeemaker Edit a Recipe
A recipe may be deleted from the Coffeemaker if it exists in the list of recipes in the Delete Recipe
Coffeemaker
Inventory may be checked at any time from the main menu Check Inventory
Inventory may be added to the machine at any time from the main menu, and is added to the Add Inventory
current inventory in the Coffeemaker
The user selects a beverage and inserts an amount of money. The money must be an integer Purchase Beverage

4 Conclusions
The use-case diagram can provide the user’s view for designing of the software product. And it can also be tested by matching up the requirements
with the use-cases.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
LIST OF EXPERIMENTS:

Expt: 1 - Aim: Phases in software development project, overview, need, coverage of topics
Tools/ Apparatus: None.
Procedure:
1) Open an appropriate software engineering guide and study the software development life cycle and related topics.
2) Study the need of the software engineering.
3) Study the coverage of topics such as life cycle models and their comparisons.

Expt: 2 - Aim: To assign the requirement engineering tasks.

Tools/ Apparatus: None.
Procedure:
1) Identify the different requirement engineering tasks.
2) Assign these tasks to various students to set the ball rolling.
3) Ask the students to start working on the given tasks.

Expt: 3- Aim: To perform the system analysis: Requirement analysis, SRS (Allotted Project)
Tools/ Apparatus: None.
Procedure:
1) Assign the group of the students different tasks of system analysis.
2) Ask students to meet different users and start analysis the requirements.
3) Ask students to give presentations group-wise of their system requirements analysis.

Expt: 4- Aim: To perform the function oriented diagram: DFD and Structured chart
Tools/Apparatus: Netbeans 6.0. or IBM Rational Tools
Procedure:
1. Iidentify various processes, data store, input, output etc. of the system and ask students to analyse
2. Use processes at various levels to draw the DFDs.
3. Identify various modules, input, output etc. of the system and ask students to analyse.
4. Use various modules to draw Structured charts.

Expt: 5- Aim: To perform the user’s view analysis: Use case diagram
Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various processes, use-cases, actors etc. of the system and ask students to analyse.
2) Use processes at various levels to draw the use-case diagram.

Expt: 6- Aim: To draw the structural view diagram : Class diagram, object diagram
Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various elements such as classes, member variables, member functions etc. of the class diagram
2) Draw the class diagram as per the norms.
3) Identify various elements such as various objects of the object diagram
4) Draw the object diagram as per the norms.

Expt: 7- Aim: To draw the behavioral view diagram : Sequence diagram, Collaboration diagram
Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various elements such as controller class, objects, boundaries, messages etc.of the sequence diagram
2) Draw the sequence diagram as per the norms.
3) Identify various elements such as for the sequence diagram of the collaboration diagram
4) Draw the collaboration diagram as per the norms.

Expt: 8- Aim: To draw the behavioral view diagram : State-chart diagram, Activity diagram
Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various elements states and their different transition of the state-chart diagram

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 2) Draw the state-chart diagram as per the norms.
3) Identify various elements such as different activity their boundaries etc. of the activity diagram
4) Draw the activity diagram as per the norms.

Expt: 9- Aim: To draw the implementation view diagram: Component diagram.

Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various elements of the componant diagram such as the various componants like client, server, network elements
etc.
2) Draw the componant diagram as per the norms.

Expt: 10- Aim: To draw the implementation view diagram: deployment diagram
Tools/Apparatus: Netbeans 6.0.
Procedure:
1) Identify various elements such as the hardware components of the deployment diagram
2) Draw the deployment diagram as per the norms.

Expt:11- Aim: To perform various techniques for testing using the testing tool : unit testing, integration testing
Tools/Apparatus: Winrunner.
Procedure:
1) Identify various modules of the system so that they can be tested stand alone.
2) Identify the groups of the module that can be tested together in integration.
3) Perform the testing of the modules as a unit and in integration by using the testing tool.

Expt: 12- Aim: Aim: To draw UML diagrams using Rational rose software.
Tools/Apparatus: Rational rose software.
Procedure:
1) Identify various elements of the system to be drawn using the IDE.
2) Use the UML options of the rational rose to draw the diagrams from experiment 4 to 10.

Expt: 13- Aim: To draw UML diagrams using MS Visio software.

Tools/Apparatus: MS Visio software.
Procedure:
1) Identify various elements of the system to be drawn using the IDE.
2) Use the UML options of the MS Visio software to draw the diagram from experiment 4 to 10.

REFERENCE BOOKS:
 Fundamentals of Software engineering - Rajib Mall.
 Software design – From programming to architecture - Eric Braude
 Object-oriented software engineering – A use case driven approach – Ivar Jacobson(Computer language productivity award
winner)

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Computer Graphics Laboratory Code: 322663(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

List of Programs:

1. Write a program to draw the line using DDA algorithm.

2. Write a program to draw the line using Bresenham’s algorithm.
3. Write a program to draw circle using Bresenham’s algorithm.
4. Write a program to draw circle using mid-point algorithm.
5. Write a program to demonstrate draw ellipse using midpoint algorithm.
6. Write a program Rotation of Triangle.
7. Write a program Translation of Line.
8. Write a program to perform scaling of line.
9. Write a program shearing of Rectangle.
10. Write a program to implement boundary –fill algorithm.
11. Write a program to implement flood –fill algorithm.
12. Write a program to implement Bezier curve using four control points.
13. Write a program to implement Cohen Sutherland line clipping algorithm.
14. Write a program to implement Liang Barsky line clipping algorithm.
15. Write a program to implement face of a cartoon.
Reference Book:

1. Computer Graphics & Multimedia- G. S. Baluja -Dhanpat Rai & CO.

2. Computer Graphics Donald Hearn & M Pauline Baker-Pearson Pvt. Ltd.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
Chhattisgarh Swami Vivekanand Technical University, Bhilai

Branch: Computer Science & Engineering Semester: VI

Subject: Advanced Java Programming Laboratory Code: 322664(22)
Total Lab Periods: 36 Batch Size: 30
Maximum Marks: 40 Minimum Marks: 20

Examples are compiled and tested in Eclipse/Net Beans IDE 6.0 or higher version with its integrated tomcat/glassfish server. Minimum 12 programs
have to be executed.

EXPERIMENT LIST:
1. a) Program for printing Hello World
b) Program for Printing System Date & Time JSP/SERVLET:
2. Program: For Telephone Directory
In this example we will use getParameter() method of the request object for processing the telephone number , Here we would accept telephone
no. from front end request is get done processed in server side and corresponding telephone no of entered user is displayed on screen as output
3. Write a server side program for Finding Factorial of number.
4. Write a Server side program in JSP/SERVLET for performing Addition of two no accept numbers from client side by using HTML form

5. Write a Server side program in JSP/SERVLET for calculating the simple interest accept the necessary parameters from client side by using
HTML form

6. Write a Server side program in JSP/SERVLET for solving Quadratic Equation accept necessary parameters from HTML form

7. Write a Server side program in JSP/SERVLET for Income Tax Calculation

8. Write a Server side program in JSP/SERVLET for Calculation of Sales Commission

9. Program:Write a server side JSP/SERVLET program for checking prime number, accept number from html file handover the no to
JSP/Servlet file process it and return the result

10. Install a database (MySQL or Oracle). Create a table which should contain at least the following fields: name, password, email-id, phone
number (these should hold the data from the registration form). Practice 'JDBC' connectivity. Write a java program/servlet/JSP/SERVLET to
connect to that database and extract data from the tables and display them. Experiment with various SQL queries. Insert the details of the users
who register with the web site, whenever a new user clicks the submit button in the registration page

11. Write a JSP/SERVLET which does the following job: Insert the details of the 3 or 4 users who register with the web site (Experiment -11) by
using registration form. Authenticate the user when he submits the login form using the user name and password from the database

12. Create tables in the database which contain the details of items (books in our case like Book name, Price, Quantity, Amount)) of each category.
Modify your catalogue page in such a way that you should connect to the database and extract data from the tables and display them in the
catalogue page using JDBC.

13. Telephone Directory Example: With Database Connectivity with searching and sorting facility
14. Sessional and test results of CSVTU students are to be displayed on the web access to the web pages is given only to restricted users/students .
Define MS Access database with user profile, accept name and password from web page and match it from database if it matches display the
result page, otherwise show the message the permission is denied. Make the provision for changing password too
15. HTTP is a stateless protocol. Session is required to maintain the state. The user may add some items to cart from the catalog page. He can
check the cart page for the selected items. He may visit the catalogue again and select some more items. Here our interest is the selected items
should be added to the old cart rather than a new cart. Multiple users can do the same thing at a time(i.e., from different systems in the LAN
using the ip-address instead of localhost). This can be achieved through the use of sessions. Every user will have his own session which will be
created after his successful login to the website. When the user logs out his session should get invalidated (by using the method
session.invalidate() ). Modify your catalogue and cart JSP/SERVLET pages to achieve the above mentioned functionality using sessions.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Name of Program: Bachelor of Engineering
Branch: Common to All Branches Semester: VI
Subject: Managerial Skills Code: 300665 (76)
No. of Lectures: 2/Week Tutorial Period: NIL
Total Marks in ESE: NIL Marks in TA: 40
Minimum number of Class Tests to be conducted: Two

Objective:
The course is introduced to develop managerial skills tremendously and enrich the abilities to enable one to meet the
challenges associated with different job levels. Managerial skills are essential for overall professional development of
an individual apart from gaining technical knowledge in the subject.

Course Objectives
Upon completion of this course, the student shall be able
 To define and explain the concept of managerial, written and oral communication skill;
 To understand the leadership skill;
 To develop self-appraisal and understand distinction between leader and manager;
 To develop positive attitude and thinking; and
 To understand managerial functions and develop creativity.

UNIT I Managerial Communication Skills: Importance of Business Writing: writing business letters,
memorandum, minutes, and reports- informal and formal, legal aspects of business communication, oral
communication- presentation, conversation skills, negotiations, and listening skills, how to structure
speech and presentation, body language.
UNIT II Managerial skills - Leadership: Characteristics of leader, how to develop leadership; ethics and values
of leadership, leaders who make difference, conduct of meetings, small group communications and Brain
storming, Decision making, How to make right decision, Conflicts and cooperation, Dissatisfaction:
Making them productive.
UNIT III Proactive Manager: How to become the real you: The journey of self-discovery, the path of self-
discovery, Assertiveness: A skill to develop, Hero or developer, Difference between manager and leader,
Managerial skill check list, team development, How to teach and train, time management, Stress
management, Self-assessment.
UNIT IV Attitudinal Change: Concept of attitude through example, benefits of right attitude, how to develop habit
of positive thinking, what is fear? How to win it? How to win over failure? How to overcome criticism?
How to become real you? How to Motivate? How to build up self confidence?
UNIT V Creativity: Creativity as a managerial skill, Trying to get a grip on creativity. Overview of Management
Concepts: Function of Management: Planning, organizing, staffing, controlling.

Course Outcome
 The students will be able to develop formal and informal, negotiation, written and oral communication skill;
 The students will be able to develop manage groups, resolve conflicts and leadership skill and decision making
qualities;
 The students will be able to develop self-appraisal, teaching, training and managing stress and time;
 The students will be able develop positive thinking, motivating team members and winning race; and
 The students will be able to develop creativity and fundamental management functions.
Text Books:
1. Basic Managerial Skills for all by E.H. Mc Grawth, Prentice Hall India Pvt Ltd,2006
2. Basic Employability Skills by P. B. Deshmukh, BSP Books Pvt. Ltd., Hyderabad, 2014
Reference Books:
1. How to develop a pleasing personality by Atul John Rego, Better yourself bools, Mumbai,2006
2. The powerful Personality by Dr. Ujjawal Patni & Dr. Pratap Deshmukh, Fusion Books, 2006
3. How to Success by Brian Adams, Better Yourself books, Mumbai, 1969

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Digital Signal Processing Code: 322671(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objective:
 This course introduces students to the fundamental techniques and applications of digital signal processing
 To develop skills for analyzing and synthesizing algorithms and systems that process discrete time signals,
with emphasis on realization and implementation.

Course Outcome:
Upon completion of this course, students will be able to:
 Describe and analyze discrete time signals in the time domain and frequency domain.
 Apply digital signal processing techniques to analyze & design discrete time signals and systems
 Design and apply digital filters
UNIT I DISCRETE-TIME SIGNALS: Signal classifications, frequency domain representation, time domain representation,
representation of sequences by Fourier transform, properties of Fourier transform, discrete time random signals, and
energy and power theorems.

UNIT II SAMPLING OF TIME SIGNALS: Sampling theorem, application, frequency domain representation of sampling,
and reconstruction of band limited signal from its samples. Discrete time processing of continuous time signals,
changing the sampling rate using discrete time processing.

UNIT III Z-TRANSFORM: Introduction, properties of the region of convergence, properties of the Z-transform, inversion of
the Z-transform, applications of Z-transform.

UNIT IV BASICS OF DIGITAL FILTERS: Classification, properties, time invariant system, finite impulse Response (FIR)
system, infinite Impulse response (IIR) system. Fundamentals of digital filtering, various types of digital filters, design
techniques of digital filters: window technique for FIR, bi-linear transformation and backward difference methods for
IIR filter design, analysis of finite word length effects in DSP, DSP algorithm implementation consideration.
Applications of DSP.

UNIT V DISCRETE AND FAST FOURIER TRANSFORM DFT and FFT: Discrete Fourier transforms properties of DFT,
circular convolution, linear convolution using DFT, fast Fourier transform: Radix 2 FFT algorithm, decimation in time,
decimation in frequency, bit reversal.

TEXT BOOKS:
1. Digital Signal Processing: Proakis and Manolakis; PHI
2. Digital Signal Processing: Salivahanan, Vallavaraj and Gnanapriya; TMH

REFERENCE BOOKS:
1. Digital Signal Processing: Alon V. Oppenhelm; PHI
2. Digital Signal processing (II-Edition): Mitra, TMH

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VI Branch: Computer Sc. & Engg.

Subject: Advanced Microprocessors & Micro-Controllers Code: 322672(22)
Total Theory Periods: 40 Total Tutorial Periods: Nil
Total Marks in End Semester Exam: 80 Class Tests to be conducted: 02
ESE Duration: Three Hours

Course Objective:
 To understand the architecture 80286, 80386 and 80486 microprocessors.
 To study the architecture of microcontroller 8051.
 To study the instruction set and programming of 8051.
 To understand various interfacing concepts.
Course Outcome:
 After successful completion of this course students will be able to explain
 The architecture, programming and addressing modes of Intel 86 family processors.
 Various interfacing concepts circuits necessary for various applications.
 Concepts of microcontroller 8051

UNIT-I Intel 80286,80386 and 80486 microprocessors- System architecture, Modes- Real mode- Protected
mode - Virtual 8086 mode, Segmentation and Paging, Protection schemes, Management of task,
Enhanced instructions
UNIT-II Intel Pentium processor –System architecture-Branch prediction-Pentium memory management,
Pentium Pro –Architecture and Special features, Pentium 4- Architecture-memory system-Hyper
Threading Technology.
UNIT-III Reduced Instruction Set Computers (RISC)- Instruction execution characteristics, The use of a
large register file, Compiler based Register optimization, Reduced Instruction Set Architecture,
RISC Pipelining, MIPS R4000, SPARC.
UNIT-IV The ARM processors- ARM registers- ARM instructions- Memory access instructions and
addressing modes, register move instructions, arithmetic and logic instructions and branch
instructions (Programming not required) , CISC vs RISC.
UNIT-V 8051 Micro controller hardware- I/O pins, ports and circuits- External memory- Counters and
Timers- Serial Data I/O- Interrupts. 8051 instruction set- Addressing modes- Assembly language
programming- I/O port programming- Timer and counter programming- Serial communication-
Interrupt programming- 8051 Interfacing to LCD, Sensors and Keyboard.

Text Books:
1. Advanced Microprocessors and Peripherals, 2nd Edn – A.K. Ray, K.M. Bhurchandi, Tat McGraw Hill
2. The 8051 Microcontroller Archetecture Programming and Application, 2nd Edn – Kennath J Ayala, Penram International
Publishers (India)
Reference Books:
1. The 8051 Microcontroller and Embedded Systems – Mohammed Ali Mazidi and Jancie Gillispie Mazidi, Pearson Education
Asia
2. Computer Organization and Architecture designing for performance, 7th Ed – William Stalling, Pearson Education
3. Computer Organization, 5th Edn – C.Hamacher, Z. Vranesic, S. Zaky, Mc Graw Hill
4. Microprocessors and Interfacing – Douglas V Hal, McGraw Hill.
5. The Intel Microprocessors 8086/88, 80286,80386,80486,Pentium ,Pentium Pro, PentiumII, PentiumIII, Pentium 4
6. Archetecture,Programming and interfacing – Barry.B.Brey, PHI.
7. Microprocessors and Microcontrollers : Architecture, Programming and System Design 8085, 8086, 8051, 8096 K. Kant, PHI.
8. Microprocessor, Microcomputer and Applications, 3rd Edn – A. K. Mukopadhyaya, Narosa.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Multimedia and Virtual Reality Code: 322673(33)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course objective:
 To understand the fundamental issues and problems in the representation, manipulation, and delivery of multimedia
content particularly in a networked environment.
 To understand the concepts of multimedia components.
 To understand the concepts and application of Virtual Reality System,


Course Outcomes: Upon the completion of the course, the student should be able to:
 Know the fundamental video, audio, image, text processing techniques
 Acquire the basic skill of designing video compression, audio compression, image compression, text compression.
 Know the basic techniques in designing video transmission systems: error control and rate control
 Know the technologies related to virtual reality and application of virtual reality system.
 Familiar with VRML programming.

UNIT I INTRODUCTION: Concept of Multimedia, media & data stream, Main properties of multimedia system, Data
stream characteristics of continuous media, multimedia Applications, Hardware and software requirements,
Multimedia Products & its evolution.

UNIT II COMPONENTS OF MULTIMEDIA: Text, Basic sound concepts, MIDI, Speech, Basic concept of Images,
Graphics format, Overview of image processing, Basic concepts of Video & animation, Conventional
system, Transmission, Enhanced system, High Definition system, Computer based animation, Design &
authoring Tools, Categories of Authority Tools, Types of products

UNIT III DATA COMPRESSION: Coding requirement, Source, entropy, hybrid coding, JPEG, MPEG, Text
compression using static Huffmann technique, Dynamic Huffmann Technique, Statistical coding techniques.

UNIT IV OPTICAL STORAGE MEDIA: Videodisk and other WORMS, Compact Disk digital audio, Advantage of
CD-DA Frames tracks blocks of CD-DA, CD-ROM, and Further CD-Rom based developments, Principles of
CDWO, Prospects of CD technologies.

UNIT V VIRTUAL REALITY: Introduction to Virtual reality & Virtual reality Systems, Related Technologies: Tele-
operation & augmented reality system VRML Programming, Domain Dependent Application like Medical,
Visualisation Visibility computation Time Critical rendering.

TEXT BOOKS:
1. Multimedia System Design, Andleigh and Thakarar , PHI, 2003.
2. Multimedia Technology & Application, David Hillman, Galgotia Publications.
REFERENCE BOOKS:
1. Multimedia Computing Communication and Application, Steinmetz, Pearson Edn.
2. Virtual Reality Systems, John Vince, Pearson Education.
3. Fundamentals of Computer Graphics and Multimedia, D.P. Mukherjee, PHI

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Inter-Networking with TCP/IP Code: 322674(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objectives:
 Understand the architecture of the Internet protocols as a layered model.
 Describe the functions implemented by each protocol, the design of the protocol and the characteristics of
typical implementations.
 Analyze the relationships and dependencies between the protocols.

Course Outcomes: At the end of this course student will be able to:
 Describe the architecture, design and behaviours of the internet and of the TCP/IP suite of protocols.
 Describe the concepts and techniques that have been used to design and implement the TCP/IP Internet
technology
 Describe the issues that are driving the development of new protocols to broaden and enhance the
operation of the Internet.

UNIT I INTRODUCTION: Introduction to internetworking, Overview of OSI Model TCP/IP protocol suite, Basics of
switching technologies and switches, Comparisons of different models, Gateways.

UNIT II INTERNET PROTOCOL: Purpose of Internet Protocol, Internet datagram, Options, Checksum, ARP and RARP,
Routing Methods: Routing Table and Routing module, ICMP, IGMP. IP Addresses: Introduction, Address
Classification, A sample internet with classful addressing, Subnetting, Supernetting, Classless addressing, Security at
the IP Layer, IPSec, IPv4 and IPv6 packet formats.

UNIT III ROUTING PROTOCOLS: UNICAST ROUTING PROTOCOLS Interior and Exterior routing, RIP, OSPF, BGP,
Multicasting: Introduction, Multicast Routing, Multicast Routing Protocols, Multicast Trees, DVMRP, MOSPF,
CBT,PIM, MBONE.

UNIT IV TRANSPORT CONTROL PROTOCOL: TCP TCP operation, Segment, Sliding window, Silly window, Options,
TCP state machine, Karn’s Algorithm, Congestion control- Leaky bucket and Token bucket algorithms. UDP: User
Datagram, UDP operations, Checksum calculation.

UNIT V TCP/IP OVER ATM NETWORKS: ISDN and B-ISDN, ATM reference model, ATM Switch, Interconnection
Network, Virtual circuit in ATM, Paths, Circuits and identifiers, ATM cell transport and adaptation layers, packet type
and multiplexing, IP Address binding in an ATM Network, Logical Subnet Concept and Connection Management.

Text Books:
1. Internetworking with TCP/IP by Comer (Vol. 1)(PHI Pub.)
2. TCP/IP Protocol suite by Behrouz A. Forouzan.(TMH Pub.)

Reference Books:
1. Computer Networking by James F. Kurose, Keith W. Ross (Pearson Education)
2. TCP/IP Illustrated By Wright and Stevens (Vol.2) (Pearson Education)
3. An Introduction to Computer Networks by Kenneth C. Mansfield Jr. James L. Antonakes (PHI)

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai

Branch: Computer Science & Engineering Semester: VI

Subject: Management Information Systems Code: 322675(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objective:
 Understand the importance of determining information system requirements for all management levels by
describing the differences between various types of information systems
 Understand how information systems are developed
 Apply critical-thinking skills in identifying information systems problems and investigate existing literature
about hardware and software solutions to problems.
Course Outcome: At the completion of the course student will be able to -
 Describe the advances in networking, data communications and the Internet and how they affect the way
business is conducted.
 Identify which information technology tools are used to solve various business problems.
 Display proficiency solving business problems using modern productivity tools (e.g., spreadsheet, database) or
creating custom programs.

UNIT I MANAGEMENT & ORGANIZATIONAL SUPPORT SYSTEMS FOR DIGITAL FIRM: Definition of MIS;
Systems approach to MIS: Report writing s/w, MIS and Human factor considerations, concept of organizational
information sub-system, MIS & problem solving. Case Studies.
UNIT II INFORMATION SYSTEMS & BUSINESS STRATEGY: Information Management. Who are the users? Manager
& Systems, Evolution of Computer based information system (CBIS), Model of CBIS. Information services
organization : Trend to End-User computing, justifying the CBIS, Achieving the CBIS, Managing the CBIS, Benefits
& Challenges of CBIS implementation. Strategic Information System, Business level & Firm level Strategy, Case
Studies.
UNIT III INFORMATION SYSTEMS IN THE ENTERPRISE: Systems from Management & Functional perspective &
their relationship: Executive Information System, Decision Support System Sales & Marketing Information System,
Manufacturing Information System, Human-Resource Information System. Finance & Account Information System.
Case Studies.
UNIT IV INFORMATION TECHNOLOGY FOR COMPETITIVE ADVANTAGE: Firm in its environment, What are the
information resources ? Who manages the information resources ? Strategic planning for information resources. End-
User Computing as a strategic issue, Information resource management concept. Case Studies.
UNIT V E-COMMERCE & INTERNATIONAL INFORMATION SYSTEM: Introduction to E-Commerce, Business
Intelligence. E-Commerce strategy, Electronic Data Interchange, E-commerce methodology, E-commerce technology,
Business application of the Internet. Electronic Business success strategies. Managing International Information
Systems: IIS architecture, Global business drivers , challenges, strategy: divide, conquer, appease, cooptation, business
organization, problems in implementing global information systems, Computer crime, ethics & social issues.

Text Books:
1. MIS A Concise Study, S.A. Kelkar, PHI, 2nd Ed.
2. MIS managing the digital firm, Kenneth C. Laudon & Jane P. Laudon (Pearson Education).
Reference Books :
1. MIS, Suresh K. Basandra (Wheelers)
2. Introduction to computer Information System for Business, Mark G. Simkin, S. Chand & Co., 1996.
3. Analysis & Design of Information Systems, James A. Senn. MCGraw-Hill International.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Advanced Operating System Code: 322676(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objectives:
To understand the main concepts of advanced operating systems (parallel processing systems, distributed systems, real
time systems, network operating systems, and open source operating systems); Hardware and software features that
support these systems.

Course Outcomes: At the end of this course student will be able to:
 Outline the potential benefits of distributed systems.
 Describe the internal architecture of Unix operating system.
 Summarize the major security issues associated with distributed systems along with the range of techniques
available for increasing system Security.
 Operate different operating system with ease.

UNIT I INTRODUCTION TO DISTRIBUTED OPERATING SYSTEM: What are distributed OS? Examples of
distributed OS, Resource sharing, challenges in designing distributed OS. Distributed OS architectures, software
layers, Architectural Model. The Operating System Layer, Protection, Processes and Threads, Communication and
invocation, Operating System Architecture. Distributed File System : File Service Architecture, Sun Network File
System, the Andrew File System, Recent Advances, Name Services : Name services and domain name systems,
Directory and discovery services, The Global name service, X .500 directory service.
UNIT II SECURITY AND DISTRIBUTED ALGORITHM : Overview of security techniques, Cryptographic algorithms,
digital signatures, Cryptographic pragmatics. Distributed Algorithms: Distributed algorithm design principles and
issues such as coordination, agreement. Examine source of difficulties such as timing, interaction models, and failures.
UNIT III STRUCTURE OF UNIX OPERATING SYSTEM : Overview of UNIX, Internal architecture of UNIX,
Classification of UNIX command Handling files, Handling directories, File – Memory – I/O – Process management in
UNIX, Administration of UNIX system, Shell Programming environment.
UNIT IV STRUCTURE OF WINDOWS OPERATING SYSTEM : Overview of WINDOWS OS, Internal architecture of
WINDOWS OS, Classification of WINDOWS OS command, Handling files, Handling directories, File – Memory –
I/O – Process management in WINDOWS OS, Administration of WINDOWS OS system, WINDOWS programming
environment.
UNIT V CASE STUDY OF OPERATING SYSTEMS: Case Study of Process Management, Memory Management, File
Management, I/O Management, System calls for WINDOWS, UNIX, LINUX etc.

Text Books:
1. Distributed OS, A.S Tanenbaum, PHI.
2. Distributed Operating System By P. K. Singha , IEEE Press
3. Understanding UNIX, K. Srirengan, PHI.

Reference Books:
1. Handbook of WINDOWS OS, IEEE press.
2. Operating System , Milan, TMH.
3. LINUX OS, BPB publication.

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Advanced Data Base Systems Code: 322677(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objective
 Introduce basic concepts and major techniques in DBMS implementations. These include concepts and techniques for data
storage, query processing, and transaction management.
 Introduce research development ability in databases.

Course Outcome: Upon completion of this course, students should be able to:
 Explain in detail DBMS architecture.
 Explain in detail query processing and techniques involved in query optimization.
 Explain the principles of concurrency control and recovery management.
 Explain the Security management in Databases

UNIT I DISTRIBUTED DATABASE DESIGN: Design strategies, Distribution design issues, Fragmentation, Allocation,
Oracle DDB design, Distributed database system architecture, Date’s rule for DDBS.

UNIT II DATA REPLICATION & QUERY PROCESSING IN DDBS : Classification of replica control strategies,
Consistency & Request ordering, The Gossip Architecture, Process groups & ISIS, Replication in Oracle, Query
optimization in Centralized system, Objective of query processing, Query decomposition, Distributed query
optimization algorithms, Query optimization in Oracle.

UNIT III TRANSACTION PROCESSING & RECOVERY: Centralized & client server architecture, server systems
architectures, parallel & distributed systems, distributed data storage, Transaction property, distributed transactions,
commit protocols, concurrency control in distributed database, availability ,heterogeneous distributed databases,
Distributed deadlock management, recovery concepts, recovery techniques based on deferred update & on immediate
update shadow paging, The ARIES Recovery Algorithm, Recovery in multi-database systems, database backup and
recovery from catastrophic failures, Reliability concept & measure, Site failure & network portioning, directory
systems, Database recovery in Oracle.

UNIT IV SECURITY MANAGEMENT & PL/SQL: Various aspect of database security, Basic model of database access
control, TCSEC Policy identification, Security models, Identification-Authentication- Authorization, Statistical
databases, Data encryption, Security in Oracle, JDBC, Purpose of PL/SQL, PL/SQL block, structure & type, PL/SQL
syntax & programming.

UNIT V DIFFERENT DATABASES: Parallel databases: Introduction, I/O parallelism. Interquery-intraquery-

intraoperationinteroperation parallelism design of parallel systems.Client/Server DBS, Oracle DBMS, Distributed
processing in Oracle, Oracle network protocols, Network administration in Oracle. Theory of OO databases,
Multimedia databases, Real time databases.

Text book:
1. Database system concepts , 4th edition, Silberschatz-Korth-Sudarshan, TMH
2. Fundamentals of database systems 3rd edition, Elmasri & Navathe, Pearson education
References:-
1. Database concepts & systems ,2nd edition , Ivan Bayross, SPD
2. Database Management System, Rajesh Narang, PHI.
3. An Introduction to database systems, 7th edition, C.J. Date , Pearson education

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University, Bhilai
Branch: Computer Science & Engineering Semester: VI
Subject: Object Oriented Modeling & Design Code: 322678(22)
(Professional Elective – I)
Total Theory Periods: 40 Total Tutorial Periods: 10
No. of class Tests to be 2 (Minimum) No. of assignments to be submitted: One per Unit
conducted:
ESE Duration: Three Hours Maximum Marks in ESE: 80 Minimum Marks in ESE: 28

Course Objective:
 Understand the basic steps of Object Oriented Analysis and Design.
 Gain practical knowledge in the UML diagrams and notations.
 Build an object-oriented model for a project using UML.

Course Outcome: Upon completion of this course student will be able to-
 Understand basic object-oriented concepts for designing a solution.
 Apply an iterative, use case-driven process to the development of a robust design model.
 Use the UML to represent the design model.
 Apply the OO concepts abstraction, encapsulation, inheritance, hierarchy, modularity, and polymorphism to the development of a robust
design model.
 Design a software system using object-oriented software engineering paradigm.

UNIT I Introduction and Modeling Concepts: Introduction- What is Object-Orientation?, What is Object-Oriented Development?,
Object-Oriented themes, Evidence for usefulness of Object-Oriented Development, OO Modeling history.
Modeling Concepts: Modeling as design technique-Modeling, Abstraction, The three Models. Class Modeling- Object and Class,
Links and Associations Concepts. Generalization and Inheritance, A Sample Class Model, Navigation of Class Models. Advanced
Class Modeling –Advanced Objects and Class Concepts, Association ends, N-array associations, Aggregation, Abstract Classes,
Multiple Inheritance, Metadata, Reification, Constrains, Derived Data, and Packages.
UNIT II State Modeling and Interaction Modeling: State Modeling- Events and States, Transition & Conditions, State diagrams, State
diagram behavior, Nested State diagrams, Concurrency. Advanced State Modeling- Nested State diagram, Nested States, Signal
Generalization, Concurrency, A Sample State Model, Relation of Class and State Models. Interaction Model- Use Case Models,
Sequence Models, Activity Models. Advanced Interaction Modeling- Use Case relationships, Procedural Sequence Models, Special
Constructs for activity Models.
UNIT III Analysis and Design: Process Overview- Development Stages, Development Life cycle. System Conception- Developing a System
concept, Elaborating a Concept, Preparing a Problem statement. Domain Analysis- Overview of Analysis, Domain Class Model,
Domain State Model, Domain Interaction Model, Iterating and Analysis. Application Analysis- Application Interaction Model,
Application Class Model, Application State Model, Adding Operations.
UNIT IV System design and class Design: System design: Overview of System Design, Estimating Performance, Making a Reuse Plan,
Breaking a System into Subsystems, Identifying Concurrency, Allocating Subsystems, Management of Data Storage, Handling
Global Resources, Choosing Software Control Implementation, Handling Boundary Conditions, Setting Trade-off Priorities,
Common Architectural Styles, Architecture of the ATM System.
Class design: Overview of Object Design, Bridging the gap, Realizing Use Cases, Designing Algorithms, Recursing Downward,
Refactoring, Design Optimization, Reification of Behavior, Adjustment of Inheritance, Organizing a Class Design, ATM Example
UNIT V Implementation: Implementation Modeling- Overview of Implementation, fine-tuning classes, Fine tuning generalizations,
realizing Associations, Testing. OO Languages- Introduction, Abbreviated ATM Model, Implementing Structure, Implementing
Functionality. Databases- Introduction, Abbreviated ATM Model, Implementing Structure-basic and advanced, Implementing
Structure for the ATM Example, Implementing functionality, OO Databases. Programming Style-OO Style, Reusability,
Extensibility, Robustness, Programming in-the-large.

Text Books:
1. Object – Oriented Modeling and Design with UML, Michael R Blaha and James R Rumbaugh, 2nd Edition, Pearson Education, India.
2. Object oriented systems development, Ali Bahrami, McGraw-Hill Higher Education, 1999.

Reference Books:
1. Object Oriented Analysis & Design, Atul Kahate, Tata McGraw-Hill Education

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
2. Object-Oriented Analysis and Design with Applications, Third Edition, Grady Booch, Robert A. Maksimchuk Michael W. Engle, Bobbi J.
Young, Ph.D., Jim Conallen, Kelli A. Houston

Name of the Programme: Bachelor of Engineering ::::: Duration of the Programme: Four Years
 Chhattisgarh Swami Vivekanand Technical University,Bhilai
Scheme of teaching and examination
B.E. VII Semester Computer Science & Engineering

Periods per week Scheme of Exam

Subject Total Credit
S.No Board of Study Subject Name Theory/Practical
Code Marks L+(T+P)/2
L T P ESE CT TA
Information Mobile Computing &
1 322731(33) 3 1 80 20 20 120 4
Technology Application
Comp. Science Parallel Processor and
2 322732(22) 3 1 80 20 20 120 4
& Engg. Computing
Comp. Science
3 322733(22) Network Programming 3 1 80 20 20 120 4
& Engg.
Comp. Science Cryptography & Network
4 322734(22) 3 1 80 20 20 120 4
& Engg. Security
5 Refer Table-2 Professional Elective-2 4 80 20 20 120 4
Comp. Science Soft Computing Lab
6 322761(22) 4 40 20 60 2
& Engg. (Matlab/Sci lab)
Comp. Science
7 322762(22) Network Programming Lab 4 40 20 60 2
& Engg.
Information
8 322763(33) Android Lab 4 40 20 60 2
Technology
Comp. Science
9 322764(22) Minor Project 5 100 40 140 3
& Engg.
Innovative &
10 Management 322765(76) 2 40 40 1
Entrepreneurial Skills
Comp. Science ** Practical Training **
11 322766(22) 1 40 40 1
& Engg. Evaluation / Library
TOTAL 16 4 20 620 100 280 1000 31

L:Lecture T:Tutorial P:Practical ESE: End Semester Examination CT: Class Test
TA: Teacher's Assessment
Note 1: Duration of All theory papers will be of Three Hours
Note 2: ** To be completed after VI semester and before the commencement of VII Semester

Table-2 : Professional Elective-2

S. No. Board of Study Subject Code Subject
1 Computer Science & Engg. 322740(22) Digital Image Processing
2 Computer Science & Engg. 322741(22) Advanced Computer Architecture
3 Computer Science & Engg. 322742(22) Operation Research
4 Computer Science & Engg. 322743(22) E-Commerce & Strategic IT
5 Computer Science & Engg.. 322744(22) Natural Languages Processing
6 Computer Science & Engg. 322745(22) OODBMS
7 Computer Science & Engg. 322746(22) Cloud Computing
8 Computer Science & Engg. 322747(22) Grid Computing
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VII Branch: Computer Science & Engg.
Subject: Mobile Computing and Application Code: 322731(33)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
• To introduce the fundamental design principles & issues in cellular & mobile communications.
• To enable the student to understand the basic features of cellular-mobile communication systems and
digital radio system.
• To motivate students to understand the different technology for working of mobile devices, their
advantages and disadvantages and emerging problems.
Unit- I Introduction, Cell Coverage &, Frequency Management: Mobile and wireless devices, Frequencies for
radio transmission, A basic cellular system, Cell Size. Elements of cellular radio systems, Design and Interference,
Concept of frequency reuse, cell splitting, Channels, Multiplexing, Access Techniques, Medium Access control,
Spread spectrum, Specialized MAC, Cell Throughput,, Co-channel interference reduction factor, Frequency
management, fixed channel assignment, non-fixed channel assignment, traffic & channel assignment, Why hand
off, types of handoff and their characteristics, dropped call rates & their evaluation.
Unit- II GSM Architecture & Services: GSM Services and Features, GSM System Architecture, GSM Radio
Subsystem, GSM Channel Types, Example of a GSM Call, Signal Processing in OSM, Channel Coding for Data
Channels, Channel Coding for Control Channels, Frequency and Channel Specifications. New Data Services:
DECT Functional Concept, DECT Radio Link, Personal Access Communication Systems, PACS System
Architecture, PACS Radio Interface, UMTS
UNIT-III: Wireless Networks: Wireless LAN, Hidden Nodes in Wireless Networks, Ordered MAC Techniques
and Wireless Networks, Deterministic MACs for Wireless Networks, Comparison Of MAC Techniques for
Wireless Networks; Infrared V/S Radio Transmission; IEEE 802.11, Architecture, Layers, Management;
HIPERLAN; Bluetooth; Wireless Broadband (WiMAX), RFiD, Java Card., WLL.
UNIT-IV: Mobile network and Transport layer: Mobile Network Layer; Mobile IP, DHCP, ADHOC
Networks; Mobile Transport Layer; Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP; Fast
Transmit/Fast Recovery, Transmission/Time Out Freezing, Selective Retransmission, Transaction Oriented TCP.
UNIT–V: Mobile System Development and Support: Wireless Application Protocol (WAP) – WAP Model,
WAP Gateway, WAP Protocols WAP User Agent Profile and Caching, Wireless Bearers for WAP, WAP
Developer Toolkits, Mobile Station Application Execution Environment Third-Generation Mobile Services -
Paradigm Shifts in Third-Generation Systems W-CDMA and cdma2000, Improvements on Core Network, Quality
Service in 3G Wireless Operating System for 3G Handset, Third- Generation Systems and Field Trials, Other Trial
Systems, Impact on Manufacture and Operator Technologies.
Course Outcome: After successful completion of the course students will be able to
• Understand the basic physical-layer architecture of a mobile communication system.
• Understand various multiple-access techniques for mobile communications, and their advantages and
disadvantages.
• Students will be able to acknowledge about the working and development of mobile and wireless devices
in detail, services provided by them and recent application development trends in this field.
Text Books
1. Mobile Communications – Schiller, Jochen; 2nd Indian Reprint, Pearson Education Asia – Addison Wesley
Longman PTE. Ltd.
2. Wireless Communication Principles and Practice, Theodore S Rappaport, 2nd Ed, Pearson Education.
Reference Books:
1. Mobile Data Wireless LAN Technologies – Dayem, Rifaat A.; Prentice Hall International.
2. The Essential Guide to Wireless Communication Applications – Dornan, A.; 1st Indian Reprint, Pearson
Education Asia.
3. Sandeep Singhal, “The Wireless Application Protocol”, Pearson Education Asia,
4. P. Stavronlakis, “Third Generation Mobile Telecommunication systems”, Springer Publishers.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Parallel processor and computing Code: 322732(22)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CTs to be conducted: 02

Course Objective
• To develop structural intuition of how the hardware and the software work, starting from simple systems to
complex shared resource architectures.
• Get a broad understanding of parallel computer architecture and different models for parallel computing
• To understand concepts related to memory consistency models, cache coherence, interconnection networks,
and latency tolerating techniques.
• To know about current practical implementations of parallel architectures.
• To learn how to design parallel programs and how to evaluate their execution

UNIT-I: Introduction & Technique of Parallelism: Trends towards parallel computing, parallelism in Uni-
processor systems, Architectural classification schemes, Amdahl’s law, Moore’s law, Principles of Scalable
Performance, Parallel Processing in Memory, Parallel Algorithms, Parallel Algorithm Complexity, Models of
Parallel Processing, Cache coherence, Cache coherence Protocols.
UNIT-II: Pipeline & Vector Processing: Conditions of Parallelism: Data & Resource dependencies, Program
flow mechanisms: Control-flow .vs. Data flow computers Principle of pipelining and vector processing: principles
of linear pipelining, classification of pipeline processors. General pipelines and reservation tables. Instruction and
arithmetic pipelines, vector processing, architecture of Cray –1, Pipeline hazards, VLIW computers, Array
Processing.
UNIT-III : Parallel Models & Mesh-Based Architectures: PRAM and Basic Algorithms, Data Broadcasting,
Parallel Prefix Computation, Shared- Memory Algorithms, Parallel Selection Algorithm, Sorting and Selection
Networks, Selection Networks, Circuit-Level Examples, Tree-Structured Dictionary Machine, Parallel Prefix
Networks, Sorting on a 2D Mesh or Torus, Routing on a 2D Mesh or Torus, Types of Data Routing Operations,
Greedy Routing Algorithms, Wormhole Routing, Numeric al 2 D Mesh Algorithms, Other Mesh-Related
Architectures, Meshes of Trees, Low-Diameter Architectures, Hyper-cubes and Their Algorithms, Sorting and
Routing on Hypercubes, Bitonic Sorting on a Hypercube, Dimension-Order Routing, Broadcasting on a
Hypercube, Other Hypercubic architectures, Butterfly and Permutation Networks, Plus-or-Minus-2'Network, The
Cube-Connected Cycles Network , Shuffle and Shuffle–Exchange Networks, A Sampler of Other Networks, Star
and Pancake Networks, Ring-Based Networks.
UNIT-IV: Multiprocessor architecture and Programming: Emulation and Scheduling, Emulations among
Architectures, Distributed Shared Memory, Data Storage, Input, and Output, Multithreading and Latency Hiding,
Parallel I/O Technology, Defect-Level Methods, Fault-Level Methods, Error-Level Methods, Parallel
Programming Parallel Operating Systems, Parallel File Systems.
UNIT-V: Parallel System Implementations: Shared-Memory MIMD Machines, Variations in Shared Memory,
MIN-Based BBN Butterfly, Vector-Parallel Cray Y-MP, CC-NUMA Stanford DASH, Message-Passing MIMD
Machines, Data-Parallel SIMD Machines, Processor and Memory Technologies.
Outcomes: On completion of this subject the student is expected to:
• Have an understanding of parallel algorithms, analysis and architectures.
• Be able to reason about ways to parallelize a problem
• Design and analyze the algorithms that execute efficiently on parallel computers
Name of Text Books:-
1. Computer Architecture & Parallel processing - Kai Hwang 7 Briggs.(MGH).
2. Parallel Computers: Arch.& Prog., Rajaraman & Siva Ram Murthy, PHI.
Name of Reference Books :-
1. Parallel Computer 2 –Arch..& Algo., Adam Hilger, R.W. Hockney, C.R. Jesshope,.
2. Advanced Computer Architecture with Parallel Programming", K. Hwang, MGH.
3. Parallel computing- Theory and practice - Michael J Quinn- Mc Graw Hill
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Network Programming Code: 322733(22)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CTs to be conducted: 02

Course Objective
• The main goal of this course is to enable the students to develop the necessary skills for developing robust &
high performance scalable network applications.
• To learn about raw sockets and socket programming.
• To understand simple network management protocols and basics of TCP &UDP sockets.

Unit- I Networking & TCP/IP: Communication protocols, Network architecture, UUCP, XNS, IPX/SPX for
LANs, TCP & IP headers, IPv4 & v6 address structures, Programming Applications: Time & date routines,
Internet protocols: Application layer, Transport layer, Network layer, Datalink layer protocols, Chat, Email, Web
server working method & programming.

UNIT-II Socket Programming: Creating sockets, Posix data type, Socket addresses, Assigning address to a
socket, Java socket programming, Thread programming, Berkeley Sockets: Overview, socket address structures,
byte manipulation & address conversion functions, elementary socket system calls – socket, connect, bind, listen,
accept, fork, exec, close, TCP ports (ephemeral, reserved), Berkeley Sockets: I/O asynchronous & multiplexing
models, select & poll functions, signal & fcntl functions, socket implementation (client & server programs), UNIX
domain protocols.

UNIT- III APIs & Winsock Programming: Windows socket API, window socket & blocking I/O model,
blocking sockets, blocking functions, timeouts for blocking I/O, API overview, Different APIs & their
programming technique, DLL & new API’s, DLL issues, Java Beans.

UNIT- IV Web Programming & Security: Java network programming, packages, RMI, Overview of Javascript,
WAP architecture & WAP services, Web databases, Component technology, CORBA concept, CORBA
architecture, CGI programming, Firewall & security technique, Cryptography, Digital Signature.

UNIT- V Client Server Programming: Client side programming: Creating sockets, implementing generic
network client, Parsing data using string Tokenizer, Retrieving file from an HTTP server, Retrieving web
documents by using the URL class. Server side programming: Steps for creating server, Accepting connection
from browsers, creating an HTTP server, Adding multithreading to an HTTP server.

Course Outcome: After successful completion of the course, students will be

• Familiar with protocols, network interfaces, and Design/performance issues in local area networks and wide
area networks,
• Familiar with basics of Socket and Socket programming.
• Familiar with contemporary issues in networking technologies,
• Familiar with network tools and network programming.
• Familiar with client server programming

Text Books:-
1. UNIX Network Programming, Steven.W.R, PHI (VOL I& II)
2. Window Socket Programming by Bobb Quinn and Dave Schutes
Reference Books :-
1. Windows Network Programming, Davis.R., ddison Wesley
2. Network Programming With Windows Socket By Baner .P., PH New Jersey
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY
BHILAI (C. G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Cryptography and Network Security Code: 322734(22)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Assignments: 1 per Unit
Minimum number of class tests to be conducted: 02

Course Objective:
• To understand the principles and practices of cryptography and network security
• To understand the practical applications that have been implemented and are in use to provide network
security
UNIT I: Overview: Security trends, The OSI Security Architecture, Security Attacks, Security Services, Security
Mechanisms, A Model for Network Security. Symmetric (Private Key) Ciphers: Classical Encryption
Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor Machines,
Steganography. Block Ciphers and the Data Encryption Standard: Block Cipher Principles, The Data
Encryption Standard (DES), The Strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design
Principles.
UNIT II: Symmetric Ciphers (continued): Basic Concepts in Number Theory and Finite Fields: Groups,
Rings, and Fields, Modular Arithmetic, the Euclidian algorithm, Finite Fields of the Form GF(p), Polynomial
Arithmetic, Finite Fields of the Form GF(2n). Advanced Encryption Standard: The Origins AES, Evaluation
criteria for AES, the AES Cipher. Stream cipher: Stream ciphers and RC4. Confidentiality using symmetric
encryption: Placement of encryption function, traffic confidentiality, key distribution.
UNIT III: Asymmetric (Public Key) Ciphers: Introduction to Number Theory: Prime Numbers, Fermat’s and
Euler’s Theorems, Testing for Primality, The Chinese Remainder Theorem, Discrete Logarithms. Public-Key
Cryptography and RSA: Principles of Public-Key Cryptosystems. Key Management-Other Public-Key
Cryptosystems: Key management, Diffie-Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve
Cryptography.
UNIT IV: Asymmetric Ciphers (continued): Message Authentication and Hash functions: Message
authentication requirements, authentication functions, Message authentication codes, Hash functions, Security of
Hash functions and MAC, SHA, HMAC, CMAC. Digital Signatures and Authentication protocols: Digital
signature, Authentication protocols, Digital signature standards,
UNIT V: Network Security applications: Authentication applications: Kerberos, X.509 Authentication
services, Public key infrastructure. Electronic mail security: PGP, S/MIME. Overview of IP Security. Web
Security: Web security considerations, SSL and TLS, Secure electronic transaction. System Security: Intruders,
Intrusion detection, password management, viruses and related threats, virus counter measures, Firewall design
principles, and trusted systems.
Course Outcome: after successful completion of this course, the students will be able to explain
• Conventional encryption algorithms for confidentiality and their design principles
• Public key encryption algorithms and their design principles
• Use of message authentication codes, hash functions , digital signature and public key certificates
• Network security tools and applications
• System-level security issues like threat of and countermeasures for intruders and viruses, and the use of
firewalls and trusted systems.
Text Book:
1. William Stallings, “Cryptography and Network Security, Principles and Practices”, Pearson Education,
Prentice Hall, 4th Edition.
2. Cryptography and Network Security, Atul Kahate, McGraw Hill Education (India) Private Limited; Third
edition.
Reference books:
1. Applied Cryptography: Protocols & Algorithms, Schneier & Bruce, MGH International.
2. Cryptography and Security – by Dr T R Padmanabhan N Harini , Wiley India Pvt Ltd, 2011.
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY
BHILAI (C. G.)
Semester: VII Branch: Computer Science & Engg.
Subject: Soft Computing Lab Code: 322761(22)
Total practical Periods: 42 Total Marks in End Semester Exam: 40
Course Objective:
• To introduce students tools and techniques of Soft Computing;
• To develop skills thorough understanding of the theoretical and practical aspects of Soft Computing.
• Introduce students to fuzzy systems, fuzzy logic and its applications
• To familiarize with neural networks and learning methods for neural networks;
• To introduce basics of genetic algorithms and their applications in optimization and planning;
Course outcome: After successful completion of the course students will be able to -
• Understand the need for Soft Computing;
• Understand different uses of Soft Computing in various areas;
• Understand the steps involved in the development of Soft Computing;
• Acquire a working knowledge of some popular tools for Soft Computing;
• Design, implement and verify computing systems by using appropriate Soft Computing techniques and tools
NOTE: All programming should be done using C/C++/Java//MATLAB/SciLab.

1. Write Matlab/Scilab Program for Following

• AREA = ?r2 (USING ARITHMETIC OPERATOR).
• e ? ?(150) (USING EXPONENTIAL OPERATOR).
• y = Sin2 ? /3 + Cos2 ? /3 (USING TRIGONOMETRY OPERATOR).
• y = Cos ? /4 + iSin ? /4 (USING COMPLEX NUMBER).
• y= log10(106) (USING LOGARITHMS OPERATOR).
2. Compute y- coordinates of a STRAIGHT LINE y = mx + c, where slope of line m =0.5 , intercept c= -2 and
x- coordinates : x = 0 to 10 for 0.5 increments.
3. Create following vectors t with 10 elements 1 to 10.
x = t sin(t) [ A MULTIPLE VECTORS}
y = (t-1) / (t+1) [ A DIVIDE VECTORS}
z = [sin(t2)/ (t2) [ A EXPONENTIAL VECTORS}
4. PLOT y = Sin x where 0 ?x? 2? .
5. PLOT y = e - 0.4 x Sin x where 0 ?x? 4?.
6. Write a script file to draw a unit circle.
7. Write a function factorial to compute the factorial n! for any integer n.
8. Write a function factorial to compute factorial n! using RECURSION for any integer n.
9. Write a function file crossprod to compute the cross product of two vectors u and v.
10. Write a Matlab program (m.file) to calculate union, intersection, complement and difference of two fuzzy sets.
Find whether the given matrix is (a) reflexive (b) tolerance and (c) transitivity matrix or not.
R=
11000
11001
00100
00010
01001 by writing an M-file.
11. Find whether the given matrix is symmetry or not
R=
1 0.5 0.3 0.6 0
0.5 1 0.7 0.5 0.9
0.3 0.7 1 0.6 0
0.6 0.5 0.6 1 0.5
0 0.9 0 0.5 1
by aMatlab program.
12. Find the fuzzy relation between two vectors R and S
R=
0.7 0.5
0.8 0.4
S=
0.9 0.6 0.2
0.1 0.7 0.5
Using max–product and max-min method by a Matlab program

13. Use Matlab command line commands to display the Gaussian membership function. Given x = 0–10 with
increment of 0.1 and Gaussian function is defined between 0.5 and −5.

14. Use Matlab command line commands to display the triangular membership function. Given x = 0–10 with
increment of 0.2 triangular membership function is defined between [3 4 5]

15. Consider the water tank with following rules

1. IF (level is okay) THEN (valve is no_change) (1)
2. IF (level is low) THEN (valve is open_fast) (1)
3. IF (level is high) THEN (valve is close_fast) (1)
Using Mamdani method and max–min method for fuzzification and method of centroid for defuzzification
method construct a FIS. Before editing that rules, membership functions must be defined with membership
function editor

16. Use Matlab’s Fuzzy Logic Toolbox to model the tip given after a dinner for two, where the food can be
disgusting, not good, bland, satisfying, good, or delightful, and the service can be poor, average, or good. To
get started, you type fuzzy in a Matlab window. Then use the fuzzy inference system and membership function
editors to define and tune your rules.

17. Derive expressions for the weights and thresholds of a McCulloch-Pitts neuron that can compute the following
input-output mappings:
in1 in2 out
0 0 1
0 1 0
1 0 0
1 1 0
Write Matlab code for the above ANN.
18. Write a program in Matlab to implement Roulette wheel and ranking selection method. Design 128, 64, 32, 16,
8 and 4-level uniform quantizers and quantize the gray-level image, lena.pgm. Compare the results by these six
different quantizers. Explain the artifacts (e.g., the visibility of undesirable contours).

19. Divide the image lena.pgm into blocks and each block has the size 4 x 4 pixels. Replace each block by the
intensity of the (2, 2) pixel within the block. The new image will be 1/4th the size in both dimensions. Display
the down-sampled image Spatial Transforms and Filtering

20. Apply power law transformation to the city.pgm image taking different values for gamma (γ = 3, γ = 4, and γ =
5).
21. Compute and plot (show the image and its histogram) the histogram of lena.pgm and city.pgm. Comment on
what information can be discerned about the images from an examination of the histogram.
22. Apply histogram equalization to the input images lcgrain.pgm and darkgrain.pgm; submit your code and the
output images.
23. Extract the gradient parts from the input image brain.pgm. Perform edge detection, Segmentation and Object
recognition
24. Extract the rice objects from the input image rice.pgm.
25. Develop an imaging application to detect and count text lines and number of words in a scanned document.
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY
BHILAI (C. G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Network Programming Lab Code: 322762(22)
Total practical Periods: 42 Total Marks in End Semester Exam: 40

• Minimum 12 experiments to be performed

• All network programs must be executed in UNIX environment.

1. Write an echo program with client and iterative server using TCP.
2. Write an echo program with client and concurrent server using TCP.
3. Write an echo program with client and concurrent server using UDP.
4. Write a client and server program for chatting.
5. Write a program to retrieve date and time using TCP.
6. Write a program to retrieve date and time using UDP.
7. Write a client and server routines showing Blocking I/O.
8. Write a client and server routines showing I/O multiplexing.
9. Write an echo client and server program using Unix domain stream socket.
10. Write an echo client and server program using Unix domain Datagram socket.
11. Write a client and server program to implement file transfer.
12. Write a client and server program to implement the remote command execution
13. Write a client program that gets a number from the user and sends the number to server for
conversion into hexadecimal and gets the result from the server.

Text Books:
1. Steven.W.R: UNIX Network Programming, PHI (VOL I& II)
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY
BHILAI (C. G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Android Lab Code: 322763(33)
Total practical Periods: 42 Total Marks in End Semester Exam: 40

Course objective:

• Understanding the working of Android applications

• To learn how to create GUI and handle events in Android applications.
• Understanding development of applications with data storage, APIs and Databases

Suggested List of Experiments (but should not be limited to)

1. Download and setup Android Environment

2. Using the Development environment
a. Create a new Project using wizard
b. Add source and resource files.
c. Import existing projects into workspace
d. Create testing Emulator
e. Compile and run the project
f. Debug the project
g. Debug on android device.
3. XML Files
a. AndroidManifest.xml
a.i. Edit the manifest and change min sdk and target sdk of application.
a.ii. Add main activity entries in manifest.
a.iii. Add second activity entries in manifest.
a.iv. Add Entries for Service, Broadcast receivers.
a.v. Add uses permissions for reading files, internet, camera.
b. Layouts
b.i. Create Linear Layout in xml
b.ii. Create Relative Layout in xml
b.iii. Create frame layout in xml
b.iv. Create a complex mixed layout using all above layouts
c. Drawables
c.i. Create xml drawable for rectangular, oval and other basic shapes
c.ii. Create xml drawable with Layer list for complex shapes.
d. Values
d.i. Create strings.xml to store all your application strings.
d.ii. Create color.xml to store all your color values
d.iii. Create styles.xml to store all your custom themes and style objects
e. Alternate resources based on qualifiers
e.i. Create separate drawables folders and xml files based on screen density (LDPI, MDPI, HDPI,
XHDPI, XXHDPI)
e.ii. Create separate styles.xml based on different android versions.
e.iii. Create separate layout folders based on device screen sizes and orientations.
4. Creating User Interface
a. Create application with Basic Views (Textview, Button, ListView)
b. Create application with different Layouts (Linear, Relative, Frame)
c. Create application to handle and respond on click using Click Listeners
5. Assets and Images
a. Create application which will access files from Assets folder (Images, sounds, Custom Fonts)
6. Application Fundamentals
a. Activities
a.i. Create application with one activity and display a layout created in xml.
a.ii. Create application which will log all activity lifecycle events using Android log api.
a.iii. Create application which should be Saving and restoring app state (eg textview text, checkbox
checked state)
b. Intents
b.i. Create application which will start another activity using intent.
b.ii. Create an activity which will pass data to second activity using intent.
b.iii. Create activity which will start second activity and get response back from second activity.
c. Services
c.i. Create
7. Content Providers
a. System provided content providers
a.i. Create application which can access/modify Contacts of device.
a.ii. Create application which can access & display Images available on device.
a.iii. Create application which can access and play Media files (Audio & Video)
b. Custom Contact providers
b.i. Create application which will provide some data to other applications using ContentProvider
system.
8. Broadcast Receivers
a. Create application to Listen to following system events using Receivers
a.i. Incoming SMS
a.ii. In and outgoing Phone Call
a.iii. Low Battery
a.iv. Storage state changed
b. Create application which will broadcast Custom event to custom Receivers.
9. Create application which will display following Notifications
a.i. Toast notification
a.ii. Status bar notification
a.iii. Dialog notification
10. Preference & Data Storage
a. Create application which will save and read back data using Shared Preference
b. SQLite database
b.i. Create app to create database using Open helper
b.ii. Create app to read, write and delete database entries
11. Networking & Web API
a. HTTP connectivity
a.i. Create app to connect and fetch data from a Http server/ website using URLConnection
a.ii. Create app to connect and fetch data from a Http server/ website using HTTPClient library
a.iii. Create app to connect and post data to Http server/ website using URLConnection
a.iv. Create app to connect and post data to Http server/ website using HTTPClient library
b. TCP Sockets or Sockets
b.i. Create a server app using tcp socket, it will send “Welcome” to client when its connected.
b.ii. Create a client app using tcp socket, it will send “Hello” to server once connected.
12. Google API
a. Create application using Maps api, it should display marker on current location of user
b. Create application which will display ads using Admob api
13. Accessing android hardware
a. Create Application to take picture and save it to file storage using camera api
b. Create application to display current direction using sensor api
c. Create application to show a toast if phone is waved in air.
d. Create application to show list of paired and nearby bluetooth devices.
14. Facebook SDK
a. Create application which can share link on facebook using Facebook sdk.
 b. Create application which can share photo on facebook using Facebook sdk.
15. Publish to playstore
a. Enable Obfuscation for your application using Proguard
b. Export Signed application package
c. Prepare Store listing
d. Upload and publish apk

COURSE OUTCOMES: Once the student has successfully completed this course, he/she will be able to
answer the following questions or perform following activities:

• Understands basic concepts and technique of developing applications for the Android phone.
• Able to use the SDK and other development tools.
• Acquaintances with how to publish Android applications to the Android Market.

Reference Books:
Head First Android- By Jonathan Simon
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Digital Image Processing Code: 322740(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
• Cover the basic theory and algorithms that are widely used in digital image processing
• Expose students to current technologies and issues that are specific to image processing systems
• Develop hands-on experience in using computers to process images
• Develop critical thinking about shortcomings of the state of the art in image processing

UNIT I: Introduction:
Image formation model, Spatial & Gray level resolution, Image enhancement in special domain: Piecewise
transformation functions, Histogram equalization, Histogram specification, image averaging, spatial filters-
smoothing and sharpening, Laplacian filter, Canny edge detector.

UNIT II: Image Enhancement in Frequency Domain & Image segmentation :

2D discrete Fourier transform & its inverse, filtering in frequency domain, Ideal & Gaussian low pass filters, High
pass filtering, FFT, Line detection, Edge detection, Edge linking & boundary detection, Thresholding, Region based
segmentation.

UNIT III: Morphological Image Processing:

Logic operations involving binary image, Dialation & Erosion, Opening & Closing, Applications to Boundary
extraction, region filling, connected component extraction.

UNIT IV: Image compression:

Coding redundancy- Huffman coding, LZW coding, run length coding, Lossy compression- DCT, JPEG, MPEG,
video compression.

UNIT V: Image representation & 3D:

Boundary descriptors, Shape numbers, Texture, Projective geometry, Correlation based and feature based stereo
correspondence, shape from motion, optical flow.

Outcomes: After successful completion of the course, student will be able to

• Describe, analyze and reason about how digital images are represented, manipulated, encoded and processed,
with emphasis on algorithm design, implementation and performance evaluation.
• Apply principles and techniques of digital image processing in applications related to digital imaging system
design and analysis.
• Analyze and implement image processing algorithms.

Name of Text Books:-

1. Ganzalez and Woods, Digital Image Processing, Pearson education.
2. Sonka and Brooks, Image Processing, TSP ltd,

Name of Reference Books:-

1. Jain and Rangachar, Machine Vision, MGH.
2. Schalkoff, Digital Image Processing, John Wiley and sons.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Advanced Computer Architecture Code: 322741(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
• To provide in-depth coverage of current and emerging trends in computer architectures, focusing on
performance and the hardware/software interface.
• To analyzing fundamental issues in architecture design and their impact on application performance.

UNIT I: Pipeline:
Linear: pipeline processor, Non linear pipeline processor, Instruction pipeline design, Mechanisms, Dynamic
instruction scheduling, Arithmetic pipeline design, Super-scalar processors, VLIW architecture.

UNIT II: Memory Hierarchy and I/O Organization ON:

Cache memories, Cache coherence, High bandwidth memories, High bandwidth I/O, Disk I/O, Bus specifications
and standards.

UNIT III: Parallel Computer Models & Program Parallelism:

Classification of Machines, SISD, SIMD & MIMD, Condition of parallelism, data and resource dependencies,
Program partitioning & scheduling, grain size latency, control flow versus data control, data flow architecture.

UNIT IV: synchronous Parallel processing :

Vector instruction types, vector access memory schemes, vector and symbolic processors, SIMD architecture,
SIMD parallel algorithms, SIMD computers and performance enhancements.

UNIT V: System Interconnection:

Network properties and routing, static interconnection networks, dynamic interconnection networks, Multiprocessor
system interconnection, Multistage & combining networks.

Course Outcomes: After successful completion of this course, students will be

• Discuss the organization of computer-based systems and how a range of design choices are influenced by
applications
• Differentiate different processor architectures and system-level design processes.
• Understand the components and operation of a memory hierarchy and the range of performance issues
influencing its design.
• Understand the organization and operation of current generation parallel computer systems, including
multiprocessor and multi core systems.
• Understand the principles of I/O in computer systems, including viable mechanisms for I/O and secondary
storage organization.

Text Books:-
1. Flynn Computer Architecture: Pipelined and parallel processor design, JB, Boston.
2. Computer Architecture & Parallel processing - Kai Hwang 7 Briggs. (MGH).

Reference Books:-
1. Parallel Computer 2 –Arch..& Algo, R.W. Hockney, C.R. Jesshope, Adam Hilger.
2. Advanced Computer Architecture with Parallel Programming, K. Hwang, MGH.
3. Parallel Computing, Theory and Practice, Michel J. Quinn, MGH.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VII Branch: Computer Science & Engg.
Subject: Operation Research Code: 322742(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
• To introduce use quantitive methods and techniques for effective decisions–making; model formulation and
applications those are used in solving business decision problems.
• To model decision making problems using major modeling formalisms of artificial intelligence and operations
research, including propositional logic, constraints, linear programs and Markov processes,
• To evaluate the computational performance of search, satisfaction, optimization and learning algorithms.
• To apply search, satisfaction, optimization and learning algorithms to real world problems.

UNIT –1 Linear Programming: LP formulations, Graphical method for solving LP with 2 variables, Simplex
method, Application of simplex method for maximization and minimization of LP problems, Artificial variable
technique for finding the initial basic feasible solution, The Big-M method, Degeneracy in simplex method, Duality
theory in LP, Dual simplex method.

UNIT-2: Transportation Model: North – West comer rule, Least cost method, Vogel's Approximation method,
Modi Method, Assignment problem, Dynamic Programming: Basic concepts, Bellman's optimality principle,
Dynamic programming approach in decision making, Optimal subdivision problem.

UNIT- 3: Inventory Model: Introduction to the inventory problem, Deterministic models, The classical EOQ
(Economic order quantity) model, Purchasing model with no shortage, Manufacturing model with no shortage,
purchasing model with shortage, Manufacturing model with shortage, Inventory models with probabilistic demand.

UNIT –4: Sequencing and Queuing Theory: Sequencing problem, Johnson's algorithm for processing N-jobs
through 2 machine problem, N-jobs through 3 machine problem, 2- job through N machine by graphical method,
Characteristics of queuing system- steady state M/M/1, M/M/1K and M/M/C queuing models.

UNIT- 5: CPM and PERT: Arrow network, Time estimates – Earliest expected time, Latest allowable occurrence
time and slack, Critical path, Probability of meeting scheduled date of completion of project, Calculation on CPM
network, Various floats for activities, Critical Path, Updating project, Operation time cost trade off curve & project
time cost trade off curve, selection of schedule based on cost analysis.

Course Outcome:
• Identify and develop operational research models from the verbal description of the real system.
• Understand the mathematical tools that are needed to solve optimization problems.
• Develop a report that describes the model and the solving technique, analyze the results and propose
recommendations in language understandable to the decision-making processes in Management Engineering.

Name of Text Books:-

1. Operation Research, Panneerselvam, Prentice Hall of India
2. Operation Research: An Introduction - Hamdy a. Taha, Prentice Hall of India
Name of Reference Books:-
1. Gillett B.E, Introduction to Operation Research- A Computer Oriented algorithmic approach, Mc Graw Hill.
2. Kanti Swarup, Gupta.P.K.,Man Mohan, Operations Research, Sultan Chand & Sons.
3. Vohra N.D., Quantitative Techniques in Managemental, T.M.H.
4. Zoints. S.,Linear & Integer Programming,Prentice Hall.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: E-Commerce and Strategic IT Code: 322743(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To understand the business impact and potential of e-commerce
• To learn about the technologies required to make e-Commerce viable
• To learn e-commerce from an enterprise point of view
• To learn about the working of various electronic payment systems

UNIT –Introduction:
What is E-Commerce, Forces behind E-Commerce, E-Commerce Industry Framework, and Brief History of E-
commerce. Inter Organizational E-Commerce, Intra Organizational E-Commerce, and Consumer to Business
Electronic Commerce, Architectural framework

Unit–II -Network Infrastructure:

LAN, Ethernet (IEEE standard 802.3) LAN , WAN , Internet, TCP/IP Reference Model, Domain Name Server ,
Internet Industry Structure.

UNIT–III: Electronic payment systems:

Types of electronic payment systems, digital token-based electronic payment systems, smart cards & electronic
payment systems, credit card based electronic payment systems, risk and electronic payment systems, designing
electronic payment systems.

UNIT–IV: Information Distribution and Messaging:

FTP,E-Mail, www server, HTTP, Web service implementation, Information publishing , Web Browsers, HTML,
Common Gateway Interface

UNIT –V: Mobile & wireless computing fundamentals:

Mobile computing framework, wireless delivery technology and switching methods, mobile information access
devices, mobile data internetworking standards, cellular data communication protocols, mobile computing
applications, personal communication service.

Course outcome: After successful completion of the course, students

• Will be able to apply the skills necessary for large-scale web based e-commerce project development.
• Will be able to work on information distribution and messaging services in e-commerce application.
• Will be able to work on business applications of wireless and mobile technologies for e-commerce.

Text books:
1. Frontiers of E-commerce by Kalakota & Whinston, Addison Wesley.
2. E-business road map for success by Dr. Ravi Kalakota& Marcia Robinson, Addison Wesley.

Reference book:
3. Electronic Commerce by Bharat Bhasker, TMH.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Natural Language Processing Code: 322744(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course objective:
• To understand the concepts of morphology, syntax, semantics and pragmatics of the language.
• To recognize the significance of pragmatics for natural language understanding
• To describe the simple system based on logic and demonstrate the difference between the semantic
presentation and interpretation of that presentation
• To describe the application based on natural language processing and to show the points of syntactic,
semantic and pragmatic processing

Unit –I: Introduction and syntactic processing

The study of Language, Linguistic background, Grammars and Parsing, Features and Augmented Grammars,
Grammars for Natural Language, towards efficient parsing, Ambiguity Resolution.

Unit –II: Semantic interpretation

Semantics and Logical Form, Linking Syntax and Semantics, Ambiguity Resolution, Strategies for Semantic
Interpretation, Scoping and the Interpretation of Noun Phrases.

Unit –III: Pragmatics

Discourse: Reference Resolution, Syntactic and Semantic coherence, Text Coherence, An Inference based
resolution algorithm. Dialogue and Conversational Agents: What makes dialogue different? Dialogue structure and
coherence.

Unit –IV: Natural Language generation

Introduction to language generation, architecture for generation, surface realization, systemic grammar, functional
unification grammar, discourse planning.

Unit –V: Machine translation

Language Similarities and Differences, transfer metaphor, syntactic transformations, lexical transfer, idea of
Interlingua, direct translation, using Statistical Techniques

Course Outcomes: After successful completion of the course, students

• Can set up, implement and evaluate natural language technology experiment step by step
• Will be familiar with a sample of machine learning techniques and can assess which ones are suitable for a
given problem
• Can explain the interaction between rule based and probabilistic methods in language technology.

Text Books:
1. Speech and Language Processing, by Jurafsky, D. & Martin, J.H.
2. Natural Language Understanding, Allen, J

Reference Books:
1. Foundations of General Linguistics by Atkinson, M, Kilby, D A & Roca, I
2. An Introduction to Language by Fromkin, V & Rodman, R
3. Natural Language Processing for Prolog Programmers by Covington, M A
4. Natural language processing in Prolog: an introduction to computational linguistics by Gazdar, G& Mellish.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Object oriented DBMS (OODBMS) Code: 322745(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course objective:
• This course discusses the requirements for advanced database features in database applications.
• Introduce Parallel and Distributed databases.
• Understand the enhanced data models for advanced applications
• Examines the concepts of various emerging database technologies.

UNIT I: The extended Entity- Relationship Model and Object model:

The ER model revisited, Motivation for complex data types, User defined abstract data types and structured types,
Subclasses, Super classes, Inheritance, Specialization and Generalization, Constraints and characteristics of
specialization and Generalization, Relationship types of degree higher than two.
UNIT II: Object oriented databases:
Overview of Object-Oriented concepts, Object identity, Object structure, and type constructors, Encapsulation of
operations, Methods, and Persistence, Type hierarchies and Inheritance, Type extents and queries, Complex objects;
Database schema design for OODBMS; OQL, Persistent programming languages; OODBMS architecture and
storage issues; Transactions and Concurrency control, Example of ODBMS.
UNIT III: Object relational and extended relational databases:
Database design for an ORDBMS - Nested relations and collections; Storage and access methods, Query processing
and Optimization; An overview of SQL3, Implementation issues for extended type; Systems comparison of
RDBMS, OODBMS, ORDBMS
UNIT IV: Parallel and distributed database and Client server architecture:
Architectures for parallel databases, Parallel query evaluation; Parallelizing individual operations, Sorting, Joins;
Distributed database concepts, Data fragmentation, Replication, and allocation techniques for distributed database
design; Query processing in distributed databases; Concurrency control and Recovery in distributed databases. An
overview of Client-Server architecture.
UNIT V: Databases on the web and semi structured data:
Web interfaces to the Web, Overview of XML; Structure of XML data, Document schema, Querying XML data;
Storage of XML data, XML applications; The semi structured data model, Implementation issues, Indexes for text
data. Enhanced Data Models for Advanced Applications: Active database concepts. Temporal database concepts.
Spatial databases, Concepts and architecture; Deductive databases and Query processing; Mobile databases,
Geographic information systems.
Course outcome: After successful completion of the course, students will be
• Able to understand the needs and concepts of object-oriented database, spatial database, web database, data
warehousing and data mining.
• Able to analyze, design and evaluate the construct of various advanced databases such as object-oriented,
object-relational, semi-structured, unstructured and distributed databases.
• Be able to implement practical solutions to GIS database problems using OO/OR database, spatial database,
data warehousing and data mining approaches.

Text Books:
1. Object Oriented Interfaces and Databases, Rajesh Narang, Prentice Hall of India
2. Database Management Systems, Raghu Ramakrishnan, Johannes Gehrke, McGraw-Hill
Reference books:
1. Fundamentals of Database Systems, Elmasri and Navathe, Pearson Education
2. Database System Concepts, Korth, Silberchatz, Sudarshan, McGraw-Hill.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Cloud computing Code: 322746(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course objective:
1. Cloud computing represents a latest in the long history computing mainframe, Personal computing networked
computing and expected to revolutionize the business is done.
2. This course covers the theoretical and practical aspects of cloud computing. At the end of the course, student will
be able to appreciate the cloud computing paradigm, recognize its various forms and able to implement some cloud
computing features.

UNIT I Introduction to Cloud Computing, The Emergence of Cloud Computing, Cloud-Based Service Offerings,
Benefits of using a Cloud Model, Key Characteristics of Cloud Computing, Understanding- Public & Private cloud
environments, The Evolution of Cloud Computing – Hardware & Internet Software Evolution.

UNIT II Cloud Security Challenges, Software-as-a-Service, Security Management People, Security Governance,
Security Portfolio Management, Security Architecture Design, Identity Access Management (IAM), Data Security.

UNIT III Cloud as: Communication-as-a-Service (CAAS), Infrastructure-as-a-Service (IAAS), Monitoring-as-a-

Service (MAAS), Platform-as-a-Service (PAAS), Software-as-a-Service (SAAS).

UNIT IV The MSP Model, Evolution from the MSP Model to Cloud Computing and Software-as-a-Service,
TheCloud Data Center, Basic Approach to a Data Center-Based SOA, Open Source Software, Service- Oriented
Architectures as a Step Toward Cloud Computing.

UNIT V Virtualization concepts & Smartphone: virtualization benefits, Hardware virtualization, Software
Virtualization, Memory Virtualization, Storage Virtualization, Data Virtualization, Network Virtualization,
Virtualization Security Recommendations, Introduction to Various Virtualization OS VMware , KVM, Virtual
Machine Security, Smartphone, Mobile Operating Systems for Smartphone’s (iPhone, Windows Mobile),
Google(Android) Blackberry, Ubuntu Mobile Internet.

Course Outcome:
1. Students will be able to perform cloud oriented analysis.
2. Students will be able to model cloud candidate derived from existing business documentation.
3. Students will be able to design the composition of a cloud services.
4. Students will be able to design application services for technology abstraction.

Text Books:
1. Toby Velte, Anthony Vote and Robert Elsenpeter, “Cloud Computing: A Practical Approach”, McGraw Hill,
2002.
Reference Books:
1. George Reese, “Cloud Application Architectures: Building Applications and Infrastructures in the Cloud”,
O’Reilly Media, 2003.
2. Tim Matherm, SubraKumaraswamy and ShahedLatif, “Cloud Security and Privacy: An Enterprise Perspective on
Risks and Compliance”, O’Reilly Media, 2005.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VII Branch: Computer Science & Engg.

Subject: Grid Computing Code: 322747(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course objective:
• To understand the need for and evolution of Grids in the context of processor- and data-intensive applications
• To be familiar with the fundamental components of Grid environments, such as authentication, authorization,
resource access, and resource discovery

UNIT I: Concepts and Architecture:

Introduction-Parallel and Distributed Computing-Cluster Computing-Grid Computing Anatomy and Physiology of
Grid- Web and Grid Services-Grid Standards - OGSAWSRF- Trends, Challenges and applications.
UNIT II: Grid Monitoring: GRID MONITORING
Grid Monitoring Architecture (GMA) - An Overview of Grid Monitoring Systems- R-GMA –Grid ICE – MDS-
Service Level Agreements (SLAs) - Other Monitoring Systems Ganglia, Grid Mon, Hawkeye and Network Weather
Service.
UNIT III: Grid Security and Resource Management:
Grid Security-A Brief Security Primer-PKI-X509 Certificates-Grid Security-Grid Scheduling and Resource
Management, Gridway and Gridbus Broker-principles of Local Schedulers- Overview of Condor, SGE, PBS, LSF-
Grid Scheduling with QoS.
UNIT IV: Data Management and Grid Portals
Data Management-Categories and Origins of Structured Data-Data Management Challenges-Architectural
Approaches-Collective Data Management Services-Federation Services-Grid Portals-Generations of Grid Portals.
UNIT V: Grid Middleware
List of globally available Middlewares - Case Studies-Recent version of Globus Toolkit and gLite - Architecture,
Components and Features. Features of Next generation grid.

Course Outcome: After successful completion of the course students will be

• be able to justify the applicability, or non-applicability of Grid technologies for a specific application
• be able to evaluate enabling technologies such as high-speed links and storage area networks for building
computer grids;
• be able to design a grid computing application in one of the key application areas e.g. Computer Animation, E-
Research;
Text Books:
1. Ian Foster, Carl Kesselman, The Grid 2: Blueprint for a New Computing Infrastructure, Elsevier Series, 2004.
2. Parvin Asadzadeh, Rajkumar Buyya, Chun Ling Kei, Deepa Nayar, and Srikumar Venugopal, High Performance
Computing: Paradigm and Infrastructure, Wiley Press.

Reference Books:
1. Vladimir Silva, Grid Computing for Developers, Charles River Media, January 2006.
2. Jarek Nabrzyski, Jennifer M. Schopf, Jan Weglarz, Grid Resource Management: State of the Art and Future
Trends , (International Series in Operations Research & Management Science), Springer; First edition, 2003
3. Fran Berman , Geoffrey Fox, Anthony J.G. Hey, Grid Computing: Making The Global Infrastructure a
Reality,Wiley, 2003
4. Maozhen Li , Mark Baker , The Grid: Core Technologies, Wiley, 2005
5. Joshy Joseph , Craig Fellenstein Grid Computing, IBM Press, 2004 19
6. Borja Sotomayor , Lisa Childers, Globus Toolkit 4 : Programming Java Services , The Elsevier Series in Grid
Computing, Morgan Kaufmann, 2005.
 Chhattisgarh Swami Vivekanand Technical University,Bhilai
Scheme of teaching and examination
B.E. VIII Semester Computer Science & Engineering
Scheme of
Periods per week Exam Credit
S.N Board of Subject Total
Subject Name L+(T+P)/
o Study Code Theory/Practical Marks
2
L T P ESE CT TA
Comp. Science Artificial Intelligence &
1 322831(22) 4 1 80 20 20 120 5
& Engg. Expert Systems
Comp. Science Data Mining &
2 322832(22) 3 1 80 20 20 120 4
& Engg. Warehousing
Comp. Science
3 322833(22) Cyber Security 3 1 80 20 20 120 4
& Engg.
4 Refer Table-3 Professional Elective-3 4 80 20 20 120 4

5 Refer Table-4 Open Elective – 4 4 80 20 20 120 4

Comp. Science Artificial Intelligence &
6 322861(22) 3 40 20 60 2
& Engg. Expert Systems Lab
Comp. Science
7 322862(22) Network Security lab 3 40 20 60 2
& Engg.
Comp. Science 322863(22) Software Technology
8 3 40 20 60 2
& Engg. Lab
Comp. Science
9 322864(22) Major Project 7 100 80 180 4
& Engg.
Comp. Science Report Writing &
10 322865(22) 2 40 40 1
& Engg. Seminar
11 Library 1

TOTAL 18 3 19 620 100 280 1000 32

End Semester CT: Class

P:Practical
L:Lecture T:Tutorial ESE: Examination Test
TA: Teacher's Assessment
Note : Duration of All theory papers will be of Three Hours

Professional Elective-3
Table -3
S.No. Board of Study Subject Code Subject Name
1 Computer Science &Engg. 322840(22) Neural Network & Fuzzy Logic
2 Computer Science &Engg. 322841(22) Distributed Parallel Processing
3 Computer Science &Engg. 322842(22) Distributed Multimedia
4 Computer Science &Engg. 322843(22) Decision Support System
5 Computer Science &Engg. 322844(22) Embeded systems
6 Computer Science &Engg. 322845(22) Real Time Systems
7 Computer Science &Engg. 322846(22) Pattern Recognition
8 Computer Science &Engg. 322847(22) Internet & Multimedia Technology
9 Computer Science &Engg. 322848(22) Software Testing
10 Computer Science &Engg. 322849(22) Wireless Networks
Note (1)- 1/4th of total strength of students subject to Minimum strength of twenty students is required to offer an elective in the
college in a particular academic session.
 Table-4: Open Elective -IV

S.No. Board of Studies Code Name of Subject

Management 300851(76) Enterprise Resource Planning
Information Technology 300852(33) E-Commerce & strategic IT
Management 300853(76) Technology Management
Decision Support & Executive Information
Information Technology 300854(33)
system
Computer Science & Engg. 300855(22) Software Technology
Management 300856(76) Knowledge Entrepreneurship
Management 300857(76) Finance Management
Management 300858(76) Project Planning, Management & Evaluation
Mechanical Engg. 300859(37) Safety Engineering
0 Computer Science & Engg. 300801(22) Bio Informatics
Mechanical Engg. 300802(37) Energy Conservation & Management
2 Nanotechnology 300803(47) Nanotechnology
3 Management 300804(76) Intellectual Property Rights
4 Mechanical Engg. 300805(37) Value Engineering
5 Civil Engg. 300806(20) Disaster Management
6 Civil Engg. 300807(20) Construction Management
7 Civil Engg. 300808(20) Ecology and Sustainable Development
8 Chem. Engg. 300809(19) Non Conventional Energy Sources
9 Electrical Engg. 300810(24) Energy Auditing and Management
0 Mechanical Engg. 300811(37) Managing Innovation & Entrepreneurship
Information Technology 300812(33) Biometrics
2 Information Technolgy 300813(33) Information Theory & Control
3 Computer Science & Engg. 300814(22) Supply Chain Management
4 Computer Science & Engg. 300815(22) Internet & Web Technology
5 Electrical Engg. 300816(24) Electrical Estimation and Costing
26 Electrical& Electronics Engg. 300817(25) Non Conventional Energy Sources
ote (1)‐1/4th of total strength of students subject to minimum
Note -1/4th of total strength of students is required to offer an elective in thecollege in a particular academic session.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Artificial Intelligence & Expert Systems Code: 322831(22)
Total Theory Periods: 50 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02
Course objective:
• Introduce the basic principles of AI towards problem solving, inference, perception, knowledge representation
and learning.
• Investigate applications of AI techniques in intelligent agents, expert systems, artificial neural Networks and
other machine learning models.
• Experiment with a machine learning model for simulation and analysis.
• Explore the current scope, potential, limitations, and implications of intelligent systems.
• To have a basic proficiency in a traditional AI language including an ability to write simple to intermediate
programs and an ability to understand code written in that language.
UNIT I Overview & Search Techniques:
Introduction to AI, Problem Solving, State space search, Blind search: Depth first search, Breadth first search,
Informed search: Heuristic function, Hill climbing search, Best first search, A* & AO* Search, Constraint
satisfaction. Game tree, Evaluation function, Mini-Max search, Alpha-beta pruning, Games of chance.
UNIT II Knowledge Representation (KR):
Introduction to KR, Knowledge agent, Predicate logic, WFF, Inference rule & theorem proving forward chaining,
backward chaining, resolution; Propositional knowledge, Boolean circuit agents.
Rule Based Systems, Forward reasoning: Conflict resolution, backward reasoning: Use of Back tracking, Structured
KR: Semantic Net - slots, inheritance, Frames- exceptions and defaults attached predicates, Conceptual Dependency
formalism and other knowledge representations.
UNIT III Handling uncertainty & Learning:
Source of uncertainty, Probabilistic inference, Bayes’ theorem, Limitation of naïve Bayesian system, Bayesian Belief
Network (BBN), Inference with BBN, Dempster-Shafer Theory, Fuzzy Logic, Fuzzy function, Fuzzy measure, Non
monotonic reasoning: Dependency directed backtracking, Truth maintenance systems. Learning: Concept of learning,
Learning model, learning decision tree, Paradigms of machine learning, Supervised & Unsupervised learning,
Example of learning, Learning by induction, Learning using Neural Networks.
UNIT IV Natural Language Processing (NLP) & Planning:
Overview of NLP tasks, Parsing, Machine translation, Components of Planning System, Planning agent, State-Goal &
Action Representation, Forward planning, backward chaining, Planning example: partial-order planner, Block world.
UNIT V Expert System & AI languages:
Need & Justification for expert systems- cognitive problems, Expert System Architectures, Rule based systems, Non
production system, knowledge acquisition, Case studies of expert system. Ai language: Prolog syntax, Programming
with prolog, backtracking in prolog, Lisp syntax, Lisp programming.
Course outcome: After successful completion of the course, students will be able
• Demonstrate fundamental understanding of artificial intelligence (AI) and expert systems.
• Apply basic principles of AI in solutions that require problem solving, inference, perception, knowledge
representation, and learning.
• Demonstrate awareness and a fundamental understanding of various applications of AI techniques in intelligent
agents, expert systems, artificial neural networks and other machine learning models.
• Demonstrate proficiency in applying scientific method to models of machine learning.
Text Books:-
1. Artificial Intelligence by Elaine Rich and Kevin Knight, Tata MeGraw Hill.
2. Introduction to Artificial Intelligence and Expert Systems by Dan W.Patterson, Prentice Hall of India.
Reference Books :-
1. Principles of Artificial Intelligence by Nils J.Nilsson, Narosa Publishing house.
2. Programming in PROLOG by Clocksin & C.S. Melish, Narosa Publishing house.
3. Rule based Expert Systems-A practical Introduction by M. Sasikumar, S.Ramani, et. al., Narosa Publishing House.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Data mining and warehousing Code: 322832(22)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02
Course objective:
• To understand the overall architecture of a data warehouse.
• The different data mining models and techniques will be discussed in this course.
• Evaluate different models used for OLAP and data pre-processing;
• Design and implement systems for data mining and evaluate the performance of different data mining algorithms;
• Propose data mining solutions for different applications.
• Differentiate Online Transaction Processing and Online Analytical processing

Unit-I: Overview and Concepts: Need for data warehousing, basic elements of data warehousing, Trends in data
ware housing. Planning and Requirements: Project planning and management, Collecting the requirements.
Architecture And Infrastructure: Architectural components, Infrastructure and metadata.

Unit-II: Data Design And Data Representation: Principles of dimensional modeling, Dimensional modeling
advanced topics, data extraction, transformation and loading, data quality.

Unit-III: Information Access and Delivery: Matching information to classes of users, OLAP in data warehouse,
Data warehousing and the web. Implementation And Maintenance: Physical design process, data warehouse
deployment, growth and maintenance.

Unit-IV: Data Mining: Introduction: Basics of data mining, related concepts, Data mining techniques Data Mining
Algorithms: Classification, Clustering, Association rules. Knowledge Discovery: KDD Process.

Unit-V: Web Mining: Web Content Mining, Web Structure Mining, Web Usage mining. Advanced Topics: Spatial
mining, Temporal mining. Visualization : Data generalization and summarization-based characterization, Analytical
characterization: analysis of attribute relevance, Mining class comparisons: Discriminating between different classes,
Mining descriptive statistical measures in large databases Data Mining Primitives, Languages, and System
Architectures: Data mining Primitives, Query language, Designing GUI based on a data mining query language,
Architectures of data mining systems Application and Trends in Data Mining: Applications, Systems products and
research prototypes, Additional themes in data mining, Trends in data mining

Course outcome: After successful completion of this course students will be

• Design a data warehouse for an organization
• Develop skills to write queries using DMQL
• Extract knowledge using data mining techniques
• Adapt to new data mining tools.
• Explore recent trends in data mining such as web mining, spatial-temporal mining.

Text Books:
1. Data warehousing- concepts, Techniques, Products and Applications by Prabhu, Prentice hall of India
2. Insight into Data Mining: Theory & Practice by Soman K P, Prentice hall of India.
3. Data Mining Introductory and Advanced Topics by M.H. Dunham, Pearson Education.
Name of Reference Books:
1. Data Warehousing Fundamentals by Paulraj Ponniah, John Wiley.
2. Introduction to Data mining with Case Studies by Gupta, PHI.
3. The Data Warehouse Lifecycle toolkit by Ralph Kimball, John Wiley.
4. Introduction to Building the Data warehouse, IBM, PHI.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)
Semester: VIII Branch: Computer Science & Engg.
Subject: Cyber Security Code: 322833(22)
Total Theory Periods: 40 Total Tutorial Periods: 12
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course objective:
• To Create cyber security awareness and to understand principles of web security
• To understand key terms and concepts in cyber law, intellectual property and cyber crimes, trademarks and
domain theft.
• To make attentive to students about possible hacking and threats in this communication era.
• Discuss Issues for creating Security Policy for a Large Organization.
Unit – 1: Cyber Security Fundamentals
Security Concepts: Authentication, Authorization, Non-repudiation, Confidentiality, Integrity, availability. Cyber
Crimes and Criminals: Definition of cyber-crime, types of cyber-crimes and types of cyber-criminals.
Unit – 2: Cyber attacker Techniques and Motivations
Anti-forensics: Use of proxies, use of tunneling techniques. Fraud techniques: Phishing and malicious mobile code,
Rogue antivirus, Click fraud. Threat Infrastructure: Botnets, Fast Flux and advanced fast flux.
Unit – 3: Exploitation
Techniques to gain foothold: Shellcode, Buffer overflows, SQL Injection, Race Conditions, DoS Conditions, Brute
force and dictionary attacks. Misdirection, Reconnaissance, and Disruption
Methods: Cross-Site Scripting (XSS), Social Engineering, WarXing, DNS Amplification Attacks.
Unit – 4: Information Technology Act 2000
Overview of IT Act 2000, Amendments and Limitations of IT Act, Electronic Governance, Legal Recognition of
Electronic Records, Legal Recognition of Digital Signature, Certifying Authorities, Cyber Crime and Offenses,
Network Service Providers Liability, Cyber Regulations Appellate Tribunal, Penalties and Adjudication.
Unit – 5: Cyber Law and Related Legislation
Patent Law, Trademark Law, Copyright, Software Copyright or Patented, Domain Names and Copyright disputes,
Electronic Data Base and its Protection, IT Act and Civil Procedure Code, IT Act and Criminal Procedural Code,
Relevant Sections of Indian Evidence Act, Relevant Sections of Bankers Book Evidence Act, Relevant Sections of
Indian Penal Code, Relevant Sections of Reserve Bank of India Act, Law Relating To Employees And Internet,
Alternative Dispute Resolution, Online Dispute Resolution (ODR).

Course Outcome –
• Students will be able to acknowledge about the cybercrime, cyber criminal, and intellectual property rights.
• Encouraging Open Standards.
• Protection and resilience of Critical Information Infrastructure.
• To enable effective prevention, investigation and prosecution of cybercrime and enhancement of law
enforcement capabilities through appropriate legislative intervention.
Text Books
1. Cyber Security Essentials, James Graham et al. CRC Press
2. Cyber Laws: Intellectual property & E Commerce Security, Kumar K. Dominant Publisher
Reference Books
1. Cyber Law Text & Cases, Gerald R. Ferrera, Margo E. K. Reder, CENGAGE LEARNING Publication.
2. Ethics in Information Technology, George W. Reynolds, CENGAGE LEARNING Publication.
3. Cyber Laws & IT Protection, Harish Chander, PHI Publication.
4. Ross J. Anderson. Security Engineering: A Guide to Building Dependable Distributed Systems. John Wiley,
New York, NY, 2001.
5. Matt Bishop. Computer Security: Art and Science. Addison Wesley, Boston, MA, 2003.
6. Frank Stajano. Security for Ubiquitous Computing. John Wiley, 2002.
7. Online Textbook Materials www.securityplusolc.com
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY,
BHILAI (C. G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Artificial Intelligence & Experts Systems Lab Code: 322861(22)
Total Practical Periods: 40 Duration of period: 50 minutes
Total Marks in End Semester Exam: 40 Number of Periods per Week: 3

Course Objectives:

Suggested List of Experiments (but should not be limited to):

1. Write a prolog program to find the rules for parent, child, male, female, son, daughter, brother, sister, uncle, aunt,
ancestor given the facts about father and wife only.
2. Write a program to find the length of a given list
3. Write a program to find the last element of a given list
4. Write a program to delete the first occurrence and also all occurrences of a particular element in a given list.
5. Write a program to find union and intersection of two given sets represented as lists.
6. Write a program to read a list at a time and write a list at a time using the well defined read & write functions.
7. Write a program given the knowledge base,
If x is on the top of y, y supports x.
If x is above y and they are touching each other, x is on top of y.
A cup is above a book. The cup is touching that book. Convert the following into wff’s, clausal form; Is it
possible to deduce that `The book supports the cup’.
8. Write a program given the knowledge base,
If Town x is connected to Town y by highway z and bikes are allowed on z, you can get to y from x by bike.
If Town x is connected to y by z then y is also connected to x by z.
If you can get to town q from p and also to town r from town q, you can get to town r from town p.
Town A is connected to Town B by Road 1. Town B is connected to Town C by Road 2.
Town A is connected to Town C by Road 3. Town D is connected to Town E by Road 4.
Town D is connected to Town B by Road 5. Bikes are allowed on roads 3, 4, 5.
Bikes are only either allowed on Road 1 or on Road 2 every day. Convert the following into wff’s, clausal form
and deduce that `One can get to town B from town D’.
9. Solve the classical Water Jug problem of AI.
10. Solve the classical Monkey Banana problem of AI.
11. Solve the classical Crypt arithmetic problems such as DONALD + GERALD = ROBERT of AI.
12. Solve the classical Missionary Cannibals problem of AI.
13. Solve the classical Travelling Salesman Problem of AI.
14. Solve the classical Blocks World Problem of AI.
15. Write a program to search any goal given an input graph using AO* algorithm.

List of Equipments/Machine required :

(i) PC with Wndows xp
(ii) Visual prolog compiler

Recommended Books :
1. Ivan Bratko : Logic & prolog programming.
2. Carl Townsend : Introduction to Turbo Prolog, BPB, Publication.
3. W.F. Clocksin & Mellish : Programming in PRLOG, Narosa Publication House.
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY,
BHILAI (C. G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Network Security Lab Code: 322862(22)
Total Practical Periods: 40 Duration of period: 50 minutes
Total Marks in End Semester Exam: 40 Number of Periods per Week: 3

Course Objectives:
• To understand the fundamentals of Cryptography through practical implementation.
• To implement standard algorithms used to provide confidentiality, integrity and authenticity.
• To understand the various key distribution and management schemes.
• To understand how to use cutting edge simulation tools
• To design security applications in the field of Information technology.

The following exercises are based on the cryptographic algorithms. They can be implemented using C, C++, Java, etc.
However the students are advised to use Java cryptographic packages to implement the programs in UNIX
environment. Minimum 12 experiments should be performed.

1. Write a C program that contains a string(char pointer) with a value ‘Hello world’. The program should XOR each
character in this string with 0 and displays the result.
2. Write a C program that contains a string(char pointer) with a value ‘Hello world’. The program should
a. AND and
b. XOR
Each character in this string with 127 and display the result.
3. Write a Java program to perform encryption and decryption using the following algorithms
a. Ceaser cipher
b. Substitution cipher
c. Hill Cipher
4. Write a C/Java program to implement the 8 bits simplified DES algorithm logic
5. Write a C/Java program to implement the Blowfish algorithm logic.
6. Write the RC4 logic in Java
7. Implement the Euclid Algorithm to generate the GCD of an array of 10 integers in ‘C’.
8. Implement Rabin-Miller Primality Testing Algorithm.
9. Write a Java program to implement RSA algorithm.
10. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.
11. Write a Java program to calculate the message digest of a text using the SHA-1 algorithm.
12. Calculate the message digest of a text using the MD5 algorithm in JAVA.
13. Create a digital certificate of your own by using the Java keytool.
14. Write Java program to hide of confidential information within Image using Steganography technique
15. Configure a firewall to block the following for 5 minutes and verify the correctness of this system using the
configured parameters:
a. Two neighborhood IP addresses on your LAN
b. All ICMP requests
c. All TCP SYN Packets
Course outcome: Students will be able to
• Develop programs to implement various encryption and decryption techniques.
• Develop programs to implement symmetric and asymmetric key crypto system.
• Develop programs to implement message authentication codes, digital signature.
• Use the cryptographic packages available in JDK.
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY,
BHILAI (C. G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Software Technology Lab Code: 322863(22)
Total Practical Periods: 40 Duration of period: 50 minutes
Total Marks in End Semester Exam: 40 Number of Periods per Week: 3

Course Objectives:
• The objective of this lab is to develop an ability to design and implement static and dynamic website
• To learn how to create a simple& advanced web page using html along with the usage of style sheets, lists,
creation or tables with borders, padding and colors.
• To get acquainted with JavaScript procedures and usage of regular expressions in JavaScript.

Expt-1: Develop and demonstrate a XHTML document that illustrates the use external style sheet, ordered list, table,
borders, padding, color, and the <span> tag.

Expt-2: Develop and demonstrate a XHTML file that includes Java script for the following problems:
a) Input : A number n obtained using prompt
Output : The first n Fibonacci numbers
b) Input : A number n obtained using prompt
Output : A table of numbers from 1 to n and their squares using alert

Expt-3: Develop and demonstrate a XHTML file that includes JavaScript script that uses functions for the following
problems:
a) Parameter: A string
Output: The position in the string of the left-most vowel
b) Parameter: A number
Output: The number with its digits in the reverse order
Guideline:
1. Declare the script tag as text/javascript in the beginning of the <body> of html program
2. Get the number to be reversed from the user using prompt()
3. Validate input number (should be a positive number between 0 to 9) using the regular expression “/^[0-9]+$/
“ and alert the user for invalid input using alert()
4. Reverse the number using modulus operation.
5. Use math.floor(number/10) to get the floor of number after division (used for reversing)
6. Display the reversed string using alert()

Expt-4(a): Develop and demonstrate, using Java script, a XHTML document that collects the USN ( the valid format
is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case
characters followed by three digits; no embedded spaces allowed) of the user. Event handler must be included for the
form element that collects this information to validate the input. Messages in the alert windows must be produced
when errors are detected.
(b): Modify the above program to get the current semester also (restricted to be a number from 1 to 8)

Expt-5: Develop and demonstrate, using JavaScript script, a XHTML document that contains three short paragraphs
of text, stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over
some part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to
become completely visible.
Expt-6: Design an XML document to store information about a student in an engineering college affiliated to
CSVTU.
• The information must include Enrolment, Univ_Roll, Name, Name of the College, Brach, Year of Joining,
and e-mail id.
• Create sample data for 10 students. Create a CSS style sheet and use it to display the document.

Expt-7: (a) Write a Perl program to display various Server Information like Server Name, ServerSoftware, Server
protocol, CGI Revision etc.
(b) Write a Perl program to accept UNIX command from a HTML form and to display the output of the command
executed.

Expt-8: Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of
4 greeting messages.

Expt-9: Write a Perl program to display a digital clock which displays the current time of the server

Expt-10: Write a Perl program to insert name and age information entered by the user into a table created using
MySQLand to display the current contents of this table.

EXPT-11: Write a PHP/.Net program to store current date-time in a COOKIE and display the “Last visited on date-
time on the web page upon reopening of the same page.

EXPT-12: Write a PHP/.Net program to store page views count in SESSION, to increment the count on each refresh,
and to show the count on web page.

EXPT-13: Create a XHTML form with Name, Address Line 1, Address Line 2, and E-mail text fields. On submitting,
store the values in MySQL table. Retrieve and display the data based on Name.

EXPT-14: Using PHP/.Net develop a program to accept book information viz. Accession number, title, authors,
edition and publisher from a web page and store the information in a database and to search for a book with the title
specified by the user and to display the search results with proper headings.

EXPT-15: Using PHP/.Net Technology develop an online portal of an online Book store. The pages should resemble
www.amazon.com the website should consist the following pages.
• Home page
• Registration and user Login
• User Profile Page
• Books catalog
• Shopping Cart
• Payment By credit card
• Order Conformation
Validate the Registration, user login, user profile and payment by credit card pages using JavaScript.

Course outcome:
At the end of the course, students should be able to:
• Design and implement dynamic websites with good aesthetic sense of designing and latest technical know-
how's.
• Have a Good grounding of Web Application Terminologies, Internet Tools, E – Commerce and other web
services
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY,
BHILAI (C. G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Major Project Code: 322864(22)
Total Practical Periods: 7 per week Duration of period: 50 minutes
Total Marks in End Semester Exam: 100 Number of Periods per Week: 7

Guideline for Allocation of project:

1. Information regarding broad area must be made available to the students well in advance (may be during previous
semester).
2. Information must cover following parameters.
I. Broad area: Subject or expertise/application area.
II. Required skills: Knowledge of subject(s), software, tools & other characteristics.
III. Type of project: Hardware, software, design, survey, study based etc.
IV. Guide available: Name of Guide (S) from Department & Institute.
V. Other related information depending upon specific branch & institute.
3. It is also recommended to give proper counseling to pick up suitable project.
4. Students must get chance to select projects as per their choice or decided mutually between students and
department faculty (HoD) concern.
5. One project group must contain maximum four students, however students can do project individually but it should
be approved by department.
6. Compiled list of projects must be submitted to the University within 25 days of start of semester.
7. Compiled list may contain following parameters.

Monitoring of project:
1. It is recommended to give projects as per the specializations of existing faculty of the department instead of outside
person/agency.
2. Project must be allocated, developed and monitored by department / institution itself, but not by outside agencies.
3. Regular review by guide is recommended to ensure development & contribution of students.

Internal Evaluation & Submission of project:

1. Evaluation of project would be as per the examination scheme of the University, which is based on internal as well
as external evaluation.
2. Internal assessment requires submission of project report for getting approved by the concern authority.
However printing and binding would be as per the conventional format.
3. Evaluation will be based on live demonstration / presentation and Viva.
4. Final submission of project is expected as,
• Submission of a copy to the University,
• One copy to the Institution central library,
• One copy to the department.

External Evaluation:
External assessment of project would be like conduction of practical exams of University, and must be executed as
per the norms of practical exams.
NOTE: Completion of Project outside the department/Institution should not be encouraged.
 CHHATTISGARH SWAMI VIVEKANAND TECHNICAL UNIVERSITY,
BHILAI (C. G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Report writing and Seminar Code: 322865(22)
Total Practical Periods: 28 Duration of period: 50 minutes
Total Marks in End Semester Exam: NIL Minimum Number of class test to be conducted: Two
Teacher's Assessment: 40 marks

Number of Periods per Week: 7

Unit –I:
Introduction to Technical Writing: how differs from other types of written communication Purpose of technical writing,
Correspondence: prewriting, writing and rewriting Objectives of Technical Writing. Audience Recognition:
High-tech audience, Low tech audience, Lay audience, Multiple Audience.
Unit – II:
Correspondence: Memos, Letters, E-mails, Its differentiation, types of letters, Document Design, its importance,
Electronic Communication: Internet, Intranet, extranet, Writing effective e-mail.
Unit – III:
Summary: Report Strategies, Effective style of technical report writing: Structures: content, introduction, conclusions,
references, etc., Presentation, Writing first draft, revising first draft, diagrams, graphs, tables, etc. report lay-out.
Unit –IV:
Report Writing: Criteria for report writing, Types of Report: Trip report, Progress report, lab report, Feasibility report, project
report, incident report, etc. Case Studies.
Unit –V:
Proposals & Presentation: Title page, Cover letter, Table of Content, list of illustrations, summary, discussion, conclusion,
references, glossary, appendix, Case Studies. Oral Presentation/ Seminar:

Text Books:
1. Sharon J. Gerson & Steven M. Gerson "Technical Writing - Process& Product", Pearson Education.

Reference Books:
1. Sunita Mishra, "Communication Skills for Engineers" Pearson Education
2. Davies J.W. "Communication for engineering students", Longman
3. Eisenberg, "Effective Technical Communication", Mc. Graw Hill.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: SUPPLY CHAIN MANAGEMENT Code: 300814(33)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
The objective of this module is to provide the participants with a good knowledge on supply chain management
and how these topics can be related with the organization and their business needs.

Outcomes: On completion of this program student will know how the Supply chain management is essential to
company success and customer satisfaction and also how SCM knowledge and capabilities can be used to
support medical missions, conduct disaster relief operations, and handle other types of emergencies. SCM also
plays a role in cultural evolution and helps improve our quality of life.

UNIT I FUNDAMENTALS OF SUPPLY CHAIN MANAGEMENT

Supply chain networks, Integrated supply chain planning, Decision phases in s supply chain, process view of a
supply chain, supply chain flows, Overview of supply chain models and modeling systems, Supply chain
planning: Strategic, operational and tactical, Understanding supply chain through process mapping and process
flow chart.

UNIT II SCM STRATEGIES, PERFORMANCE

Supply chain strategies, achieving strategic fit, value chain, Supply chain drivers and obstacles, Strategic
Alliances and Outsourcing, purchasing aspects of supply chain, Supply chain performance measurement: The
balanced score card approach, Performance Metrics. Planning demand and supply: Demand forecasting in
supply chain, Aggregate planning in supply chain, Predictable variability.

UNIT III PLANNING AND MANAGING INVENTORIES

Introduction to Supply Chain Inventory Management. Inventory theory models: Economic Order Quantity
Models, Reorder Point Models and Multiechelon Inventory Systems, Relevant deterministic and stochastic
inventory models and Vendor managed inventory models.

UNIT IV DISTRIBUTION MANAGEMENT

Role of transportation in a supply chain - direct shipment, warehousing, cross-docking; push vs. pull systems;
transportation decisions (mode selection, fleet size), market channel structure, vehicle routing problem.
Facilities decisions in a supply chain. Mathematical foundations of distribution management, Supply chain
facility layout and capacity planning,

UNIT V STRATEGIC COST MANAGEMENT IN SUPPLY CHAIN

The financial impacts, Volume leveraging and cross docking, global logistics and material positioning, global
supplier development, target pricing, cost management enablers, Measuring service levels in supply chains,
Customer Satisfaction/Value/Profitability/Differential Advantage.

REFERENCES
1. David Simchi-Levi, Philip Kaminsky, and Edith Simchi-Levi Designing and Managing the Supply Chain:
Concepts, Strategies, and Case Studies, Second Edition, , McGraw-Hill/Irwin, New York, 2003. 31
2. Sunil Chopra and Peter Meindel. Supply Chain Management: Strategy, Planning, and Operation, Prentice Hall of
India, 2002.
3. Sunil Chopra & Peter Meindl, Supply Chain Management , Prentice Hall Publisher, 2001
4. Robert Handfield & Ernest Nichols, Introduction to Supply Chain Management , Prentice hall Publishers, 1999.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Biometrics Code: 300813(33)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
The basic objective in offering this course is to study the state-of-the-art in biometrics technology can explore
the way to improve the current technology. The students can learn and implement various biometrics
technologies using advanced algorithm.

Course outcomes:

On completion of this program student will:

1. Understand the basic definition of ‘Biometric Recognition’ and the distinctive of this form of
biometrics.
2. Be able to state precisely what functions these systems perform.
3. Be able to draw a system-level diagram for any biometric system and discuss its components.
4. Be able to solve verification, identification, and synthesis problems for a variety of biometrics such as
fingerprint, face, iris, hand gestures and cryptography.
5. Be able to use the biometrics ingredients of existing system to obtain a given security goal.
6. Judge the appropriateness of proposal in research papers for a given applications.
7. Be able to design a biometric solution for a given application.

Unit I: Introduction of Biometrics

Biometrics: definition, history, basic working architecture, types; Performance measures of biometrics;
applications and benefits of biometrics; design of biometrics; biometric identification versus verification.
Unit II: Face and Iris Biometrics
Background of face and iris recognition; Face recognition methods: Eigen face methods, contractive
transformation method; Challenges of face biometrics; Design of iris biometrics: image segmentation, image
preprocessing, determination of iris region; Advantages and disadvantages of face and iris biometrics.
Unit III: Fingerprint and Sign Language Biometrics
Fingerprint matching: image acquisition, image enhancement and segmentation, image binarization, minutiae
extraction and matching; Sign language biometrics: Indian sign language (ISL) biometrics, SIFT algorithm,
advantages and disadvantages of ISL and fingerprint biometrics.
Unit IV: Biometric Cryptography and Privacy Enhancement
Introduction to biometric cryptography; general purpose cryptosystems; Cryptographic algorithms: DES and
RSA; Privacy concerns and issues related to biometrics; biometrics with privacy enhancement; soft biometrics;
comparison of various biometrics; Identity and privacy.
Unit V: Scope of Biometrics and Biometric Standards
Multimodal biometrics: basic architecture and fusion scheme, application, example of AADHAAR; scope and
future market of biometrics; role of biometrics in enterprise and border security; DNA biometrics; biometric
standards; biometric APIs.
Suggested Books:

1. Biometrics: concepts and applications by Dr G R Sinha and Sandeep B. Patil, Wiley India Publications,
2013.
2. Introduction to biometrics by Anil K Jain, Arun Ross and Karthik Nandakumar, Springer, 2011.
3. Biometrics Identity verification in a networked world by Samir nanawati, Michael Thieme and Raj
Nanawati, US edition of Wiley India, 2012.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Decision Support and Executive Information System Code: 300854(33)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
1. To review and clarify the fundamental terms, concepts and theories associated with Decision Support
Systems, computerized decision aids, expert systems, group support systems and executive information
systems.
2. To examine examples and case studies documenting computer support for organizational decision
making, and various planning, analysis and control tasks.
3. To discuss and develop skills in the analysis, design and implementation of computerized Decision
Support Systems.
Course outcomes:
On completion of this program student will:
1. Recognize the relationship between business information needs and decision making
2. Appraise the general nature and range of decision support systems
3. Appraise issues related to the development of DSS

UNIT-I Decision Support System:

What is a DSS, Decision Making Rational Decisions, Definitions of Rationality, Bounded Rationality
and Muddling Through, The Nature of Managers, Appropriate Data Support, Information Processing Models,
Group Decision Making?

UNIT-II Component OF DSS:

Data Component : Information and its Usefulness, Characteristics of Information, Databases to Support
Decision Making, Database Management Systems, Data Warehouses, Data Mining and Intelligent Agents
Model Component-:Models Representation Methodology, TimeModel Based ManagementSystems, Access to
Models Understandability of Results, Integrating Models Sensitivity of aDecision, Brainstorming and
Alternative Generation, Evaluating Alternatives, Running External Models. Mail Component: Integration of
Mail Management Examples of Use implications for DSS.

Unit-III Intelligence and Decision Support Systems:

Programming Reasoning, Backward Chaining Reasoning, Forward Chaining Reasoning, Comparison, Certainty
Factors,User-Interface Component:User Interface Components, The Action Language, Menus, Command
Language, I/O Structured Formats, Free Form Natural Language, The Display or Presentation Language,
Windowing Representations, Perceived Ownership of Analyses, Graphs and Bias Support for All Phases of
Decision Making, The Knowledge Base Modes of Communication

Unit-IV Designing A DSS:Planning for DSS, Designing a Specific DSS, Interviewing

Techniques,OtherTechniques, Situational AnalysisDesign Approaches, Systems Built from Scratch,
Using Technology to Form the Basis of the DSS, Evaluating a DSS Generator, Using a DSS Generator,The
Design Team, DSS Design and Re-engineering Discussion .

Unit-V Implementation and Evaluation of DSS : Implementation Strategy , Prototypes, Interviewing ,User
Involvement , Commitment to Change, Managing Change, Institutionalize System, Implementation and System
Evaluation, Technical Appropriateness, Measurement Challenges , Organizational Appropriateness.

Name Of Text Books-:

Decision Support System By Vicki l Sauter
Management Information system-Gerald V. Post & David L. Anderson
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Software Technology Code: 300855(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective

• The basic objective in offering this course is to be employed as a practicing engineer in fields such as
design, research, development, testing, and manufacturing

UNIT-1 ASSEMBLY LANGUAGE PROGRAMMING

Pentium Assembly languages-Registers, Memory Model, Addressing mode, 1source Link, Installation,
Assembler Directives. ASSEMBLER DESIGN Simple manual Assembler, Assembler Design Process, Load
and Go Assembler, Object File Formats.

UNIT-2 LINKERS
Linking -Combining Object Modules, Pass I, Pass II; Library Linking; Position Independent Code
(PIC); Shared Library Linking. LOADERS- Binary Image; Types of Loaders.

UNIT 3
MACROPROCESSORS
Macro in NASM- Local Labels in Macro Body, Nested Macros.; Design of Macroprocessors – Major Data
Structures, Macroprocessing Technique, Simple macroprocessors without nesting, Nested calls & definitions

UNIT – 4 COMPILERS
Lexical Analysis; Syntax Analysis; Intermediate Code Generation; Target Code Generation;
Optimizing Transformation

UNIT – 5 TEXT EDITORS

Design of a Text Editor ; Data Structures for Text Sequences; Text Document Design; Text view Design
DEBUGGER Features; Breakpoint mechanism; Hardware support; context of Debugger; Check pointing &
reverse Execution

Outcomes: After successful completion of the course, student will be able to

1. an ability to apply knowledge of mathematics, science, and engineering.
2. an ability to design and conduct experiments, as well as to analyze and interpret data.

Textbooks
1. SYSTEM SOFTWARE by Santanu Chattopadhyay ; Prentice Hall of India
2. Software Engineering By Roger S Pressman ; Mc -Graw Hill

References
1. Foundations of Software Technology and Theoretical Computer Science, By V. (Venkatesh) Raman:
Springer
2. Software Visualization by John Stasko; MIT press
3. Software Engineering By Rajib Mall : PHI
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Bio Informatics Code: 300801(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective
1. This course aims to provide students with a practical and hands-on experience with common
bioinformatics tools and databases.
2. Students will be trained in the basic theory and application of programs used for database
searching, protein and DNA sequence analysis, prediction of protein function.

UNIT-1
Bioinformatics-introduction, Application, Data Bases and Data Management, Central Dogma; information
search and Data retrieval, Genome Analysis and Gene mapping- Analysis, Mapping, Human Genome Project
(HGP).

UNIT-2
Alignment of Pairs and Sequences; Alignment of Multiple Sequences and Phylogenetic Analysis; Tools for
similarity Search and Sequence Alignment- FASTA BLAST.

UNIT-3
Profiles and Hidden Marcov Models (HMMs); Gene Identification and Prediction-Basics, Pattern Recognition,
Methods and Tools; Gene Expression and Micro arrays.

UNIT-4
Protein Classification and Structure Visualization; Protein Structure Prediction; Proteomics; Computational
methods-Analysis of Pathways, Metabolic Network Properties, Metabolic Control Analysis, Stimulation of
Cellular Activities, Biological Mark Up Languages.

UNIT-5
Drug Discovery-Introduction, Technology and Strategies, Cell Cycle, G-protein, Coupled, Receptors.
Computer Aided Drug Design-Introduction, Drug Design Approaches, Designing methods, ADME-Tox
Property Prediction.

Outcomes: After successful completion of the course, student will be able tohave a good working knowledge
of basic bioinformatics tools and databases such as GenBank, BLAST, multiple alignment, and phylogenetic
tree construction. Further students will understand the basic theory behind these procedures and be able to
critically analyze the results of their analysis using such tools.

TEXT BOOKS

I. BIOINFORMATICS by S.C. Rastogy, 2nd Edition, Prentice Hall of India. II.

BIOINFORMATICS by V. R Srinivas, Prentice Hall of India

REFERENCES
1. BIOINFORMATIC COMPUTING by Bergeron, MIT Press.
2. Evolutionary Computation in Bioinformatics, Gary B. Fogel, David W. Corne (Editors), 2002
3. Introduction to Bioinformatics, Arthur M. Lesk, 2002, Oxford University Press
4. Current Topics in Computational Molecular Biology (Computational Molecular Biology), Tao Jiang,
Ying Xu, Michael Zhang (Editors), 2002, MIT Press
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Neural Network and Fuzzy Logic. Code: 322840(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To provide the student with the basic understanding of neural networks and fuzzy logic fundamentals, Program
the related algorithms and Design the required and related systems.
• To cater the knowledge of Neural Networks and Fuzzy Logic Control and use these for controlling real time
systems.

UNIT-I Introduction to Artificial Neural Networks:

Elementary Neurophysiology, Models of a Neuron, Neural Networks viewed as directed graphs, Feedback, from
neurons to ANN, Artificial Intelligence and Neural Networks; Network Architectures, Single-layered Feed forward
Networks, Multi-layered Feed forward Networks, Recurrent Networks, Topologies.

UNIT-II Learning and Training:

Activation and Synaptic Dynamics, Hebbian, Memory based, Competitive, Error-Correction Learning, Credit
Assignment Problem: Supervised and Unsupervised learning, Memory models, Stability and Convergence, Recall
and Adaptation.

UNIT-III A Survey of Neural Network Models:

Single-layered Perceptron – least mean square algorithm, Multi-layered Perceptrons – Back propagation Algorithm,
XOR – Problem, The generalized Delta rule, BPN Applications, Adalines and Madalines – Algorithm and
applications.

UNIT-IV Applications:
Talking Network and Phonetic typewriter: Speech Generation and Speech recognition,
Neocognitron – Character Recognition and Handwritten Digit recognition, Pattern Recognition Applications.

UNIT-V Neural Fuzzy Systems:

Introduction to Fuzzy sets, operations, relations, Examples of Fuzzy logic, Defuzzification,
Fuzzy Associative memories, Fuzziness in neural networks and examples.

Course outcome:
• To provide adequate knowledge about concepts of feed forward neural networks and feedback neural networks.
• To teach about the concept of fuzziness involved in various systems.
• To provide adequate knowledge about fuzzy set theory.
• To provide comprehensive knowledge of fuzzy logic control and adaptive fuzzy logic and to design the fuzzy
control using genetic algorithm.
• To provide adequate knowledge of application of fuzzy logic control to real time systems.

Text Books:
1. Artificial Neural Networks by B. Yagna Narayan, PHI
2. Neural Networks Fuzzy Logic & Genetic Alogrithms by Rajshekaran & Pai, Prentice Hall
Reference Books:
1. Neural Networks by James A. Freeman and David M. Strapetuns, Prentice Hall,.
3. Neural Network & Fuzzy System by Bart Kosko, PHI.
4. Neural Network Design by Hagan Demuth Deale Vikas Publication House
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Distributed Parallel Processing. Code: 322841(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To develop structural intuition of how the hardware and the software work, starting from simple systems to
complex shared resource architectures.
• Get a broad understanding of parallel computer architecture and different models for parallel computing.
• To learn about strategies for how algorithms that were originally developed for single-processor systems can be
converted to run efficiently on parallel computers.
• To know about current practical implementations of parallel architectures.
• To learn how to design parallel programs and how to evaluate their execution
• To understand the characteristics, the benefits and the limitations of parallel systems and distributed
infrastructures

UNIT – I: Parallel processing – Definition, Architectures; Programmability- Operating Systems Support, Types of
Os, Parallel Programming Models, Software Tools; Data Dependency Analysis; Shared Memory Programming:
Thread based Implementation- Management, Example, Attributes Mutual exclusion, Events & condition Variables,
Deviation computation
UNIT-II: Distributed Computing -I- message passing, general model, programming model, PVM-Process
Control, Information, Message Buffers, Signaling, Sending, receiving, Group Operations, Starting PVM, Compiling
PVM Application, PVM Console Commands.
UNIT-III: Distributed Computing-II- remote procedure call, parameter passing, Locating the server, semantics,
security, problem areas, Java Remote method invocation, DCE, Deploying application in DCE, POSIX Thread
reference-Creation, Attributes, Termination, Mutual Exclusion primitives, Condition Variables, Cancellations,
Specific data Functions.
UNIT-IV: Algorithms for parallel machines- Computations, Histogram Computation, Parallel Reduction,
Quadrature problem, Matrix Multiplication, Parallel Sorting Algorithms, solving linear systems, probabilistic
algorithms.
UNIT-V: Parallel programming languages- Sample Problem; Fortran 90; n-CUBE C; Occam; C-Linda.
Debugging parallel programming- techniques, message passing, shared memory; Data Flow Computing, Systolic
Architecture, functional and logical paradigms, distributed shared memory. Distributed Data Bases- Objectives,
Issues, System, Distribution Options Data Base Integrity, Concurrency Control, DDBMS Structure. Distributed
Operating Systems-Need, Network Operating Systems, DOS Goals, Design Issues, Amoeba.

Course outcome: On completion of this subject the student is expected to:

• Have an understanding of parallel algorithms, analysis and architectures.
• Obtain experience developing parallel algorithms for various parallel architectures.
• Be able to reason about ways to parallelize a problem and evaluate a parallel platform for a given problem
• Become familiar with programming with MPI and Map Reduce/Hadoop

TEXT BOOKS
1. Introduction to Parallel Processing by M. Sasikumar et al- Prentice Hall of India.
2. Parallel Distributed Processing by David E Ramulhat , MIT press

REFERENCE BOOKS
1. Parallel Processing by Rajaraman V - Prentice Hall of India.
2. An Introduction to Distributed and Parallel Processing by John A. Sharp; Alfred Waller Ltd
3. Parallel and Distributed Processing by Rolim, Jose; Springer
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Distributed Multimedia. Code: 322842(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To understand the systems aspects of creating and deployinginteractive multimedia applications.
• To study the datacoding, streaming multimedia servers, temporal specification languagesand rendering systems
required to store and deploy multimediainformation in distributed, networked environments.

Unit-I: Components of Distributed system: Application software, Document store, Image and still video store,
Audio and full motion video store, Object directory service agent, Components service agent, User interface service
agent. Distributed Client- Server Operation: Clients in distributed work group computing, Database operations,
Middleware in distributed work group computing.

Unit-II: Multimedia object server: Types of multimedia server, mass storage for multimedia servers, write once
read many optical disks, rewritable optical disks, Optical disk libraries, network topologies for multimedia object
servers. Multi server Network topologies: traditional LANs, Extended LANs, High Speed LANs, WANs, Network
performance issues.

Unit-III: Distributed Multimedia database: Database organization for multimedia applications, transaction
management for multimedia system, managing hypermedia records as objects.
Managing distributed object: Inter server communication, object server architecture, object identification, object
revision management, optimizing network location of object, object directory services, multimedia object retrieval,
database replication techniques, Object migrations schemes, Optimizing object storage.

Unit-IV: System Design Methodology and Considerations

Fundamental Design issue, key deliverables, data mining enterprise requirements, technology assessments, Business
information model, Examining current architecture and feasibility, Performance analysis: Performance analysis and
monitoring, Impact of performance issues on design.

Unit-V: Designing for performance: Storage management, Access management and optimization of storage
distribution, Maximizing network transportation, managing system performance. Multimedia system design:
System design methodology, designing system object, object oriented multimedia system, designing objects, system
design analysis, system extensibility.

Course outcome: End of the course students

• Be familiar with multimedia data types and the conversion between analogue and digital forms.
• Have gained experience in the use of multimedia systems and the ability to manipulate multimedia data
programmatically.
• Have gained an understanding of the issues that arise when multimedia communication is attempted across the
Internet.
• Understand the issues that arise when designing and building multimedia systems.

Text Books
1. Multimedia system design Prabhat K.Andleigh, Kiran Thakrar
2. Multimedia: Computing, Communication and Application by Ralf Steinmetz and Klara Nahrstedt.

Reference Books
1. Data and Computer Communication by William Stallings
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Decision Support System Code: 322843(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To review and clarify the fundamental terms, concepts and theories associated with Decision Support Systems,
computerized decision aids, expert systems, group support systems and executive information systems.
• To examine examples and case studies documenting computer support for organizational decision making, and
various planning, analysis and control tasks.
• To discuss and develop skills in the analysis, design and implementation of computerized Decision Support
Systems.
• To understand that most Decision Support Systems are designed to support rather than replace decision makers
and the consequences of this perspective for designing DSS.
• To discuss organizational and social implications of Decision Support Systems.

Unit-I: Overview of different types of decision-making: Strategic, tactical and operational. Consideration of
organizational structures. Mapping of databases, MIS, EIS, KBS, expert systems OR modeling systems and
simulation, decision analytic systems onto activities within an organization. Extension to other 'non organizational'
areas of decision making. Relationship with knowledge management systems

Unit-II: Studies of human cognition in relation to decision making and the assimilation of information. Cultural
issues. Implications for design of decision-making support. Communication issues.

Unit –III: Normative, descriptive and prescriptive analysis: requisite modeling. Contrast with recognition primed
decision tools.

Unit –IV: Database, MIS, EIS, KBS, Belief nets, data mining. OR modeling tools: simulation and optimization.
History, design, implementation: benefits and pitfalls. Risk assessment. Decision analysis and strategic decision
support.

Unit –V: Group decision support systems and decision conferencing. Intelligent decision support systems: tools and
applications. Cutting-edge decision support technologies. History, design, implementation: benefits and pitfalls.
Deliberative e-democracy and e-participation

Course outcome: At the end of the course students will

• Recognize the relationship between business information needs and decision making
• Appraise the general nature and range of decision support systems
• Appraise issues related to the Analyse, design, development and implement a DSS
• Select appropriate modeling techniques

Text Books
1. P.R. Kleindorfer, H.C. Kunreuther, P.J.H. Schoemaker , “Decision Sciences: an integration Perspective”,
Cambridge University Press 1993
2. G.M. Marakas, Decision support Systems in the 21st Century, Prentice Hall.

Reference Books
1. E. Turban and J.E. Aronson, Decision support Systems and Intelligent Systems. Prentice Hall
2. V.S.Janakiraman and K.Sarukesi, Decision Support Systems, PHI
3. Efrem G. Mallach, Decision Support and Data Warehouse Systems, tata McGraw-Hill.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Embedded Systems Code: 322844(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
1. To introduce students to the modern embedded systems and to show how to understand and program such
systems using a concrete platform built around A modern embedded processor like the Intel ATOM.

UNIT I EMBEDDED COMPUTING

Challenges of Embedded Systems – Embedded system design process. Embedded processors – ARM processor –
Architecture, ARM and Thumb Instruction sets

UNIT II EMBEDDED C PROGRAMMING

C-looping structures – Register allocation – Function calls – Pointer aliasing – structure arrangement – bit fields –
unaligned data and endianness – inline functions and inline assembly – portability issues.

UNIT III OPTIMIZING ASSEMBLY CODE

Profiling and cycle counting – instruction scheduling – Register allocation – conditional execution – looping
constructs – bit manipulation – efficient switches – optimized primitives.

UNIT IV PROCESSES AND OPERATING SYSTEMS

Multiple tasks and processes – Context switching – Scheduling policies – Interprocess communication mechanisms
– Exception and interrupt handling - Performance issues.

UNIT V EMBEDDED SYSTEM DEVELOPMENT

Meeting real time constraints – Multi-state systems and function sequences. Embedded software development tools
– Emulators and debuggers. Design methodologies – Case studies – Complete design of example embedded
systems.
Course outcome:
• Describe the differences between the general computing system and the embedded system, also recognize
the classification of embedded systems..
• Become aware of the architecture of the ATOM processor and its programming aspects (assembly Level)
• Become aware of interrupts, hyper threading and software optimization.
• Design real time embedded systems using the concepts of RTOS.
• Analyze various examples of embedded systems based on ATOM processor

Text books and Reference books:

1. Andrew N Sloss, D. Symes, C. Wright, “ARM System Developers Guide”, Morgan Kaufmann / Elsevier, 2006.
2. Michael J. Pont, “Embedded C”, Pearson Education , 2007.
3. Wayne Wolf, “Computers as Components: Principles of Embedded Computer System Design”, Morgan
Kaufmann / Elsevier, 2nd. edition, 2008.
4. Steve Heath, “Embedded System Design” , Elsevier, 2nd. edition, 2003.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Real Time Systems Code: 322845(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02
Course Objective:
• To study real-time computer control systems and their implementation techniques.
• Provide examples of real-time systems including functionality and implementation platforms.
• Describe and exemplify design parameters for real-time systems including execution time, implementation,
communication & user interface.
• Study a range of methodologies for specifying and designing real time systems.
• Understand hardware and software design and implementation of real-time systems
• Describe and apply systems engineering methods and techniques in the design and analysis of real-time
systems.
Unit-I: Basic Real- Time Concepts, Computer Hardware, Language Issues:
Basic component Architecture, terminology, Real Time Design Issues, CPU, Memories, Input- Output, Other
Devices Language Features, Survey of Commonly Used Programming Languages, Code Generation
Unit-II: Software life cycle, Real Time Specification and Design Techniques, Real Time Kernels: Phases of
software life cycle, Non-temporal Transition in the software life cycle, Spiral model, Natural languages,
Mathematical Specification, Flow Charts, Structure Charts, Pseudocode and programmable Design Languages,
Finite state Automata, Data Flow Diagrams, Petrinets, Statecharts, Polled Loop Systems, phase/State Driven Code,
Coroutines, Interrupt Driven System, Foreground/Background Systems Full Featured Real Time OS
Unit-III: Intertask Communication and Synchronization, Real Time memory Management, System
Performance Analysis and Optimization: Buffering Data, Mail boxes Critical Region, Semaphores, Event Flags
and Signals, Deadlock, Process Stack Management, Dynamic Allocation, Static Schemes, Response Time
Calculation, Interuupt Latency, Time Loading and its Measurement, Scheduling NP Complete, Relocating Response
Times And time Loading, Analysis of Memory Requirements, Reducing Memory Loading, I/O Performance.
Unit-IV: Queuing Models, Reliability, Testing, And Fault Tolerance, Multiprocessing Systems:
Basic Buffer size Calculation, Classical Queuing Theory, Little’s Law, Faults, Failures ,bugs AND effects.
Reliability, Testing, Fault Tolerence, Classification of Architectures, Distributed Systems, Non Von Neumann
Architectures.
Unit-V: Hardware/ Software Integration, Real Time Applications:
Goals of Real Time System Integration, Tools, Methodology, The Software Hesisenberg Uncertainity Principle,
Real Time Systems As Complex System, First Real Time Application Real Time Databases, Real time Image
Processing Real Time UNIX, building Real Time Applications with Real Time Programming Languages.
Course outcome:
• Clearly differentiate the different issues that arise in designing soft and hard real-time, concurrent, reactive,
safety-critical and embedded systems.
• Explain the various concepts of time that arise in real-time systems.
• Describe the design and implementation of systems that support real-time applications. Justify and critique
facilities provided by real-time operating systems and networks.
• Design, construct and analyze a small, concurrent, reactive, real-time system.
• Select and use appropriate engineering techniques, and explain the effect of your design decisions on the
behavior of the system.
Text Books :
1. Real Time System, Jane W.S.Liu
2. Real Time Systems Design and Analysis by Phillip A. Laplante,PHI
Reference Books:
1 Hard Real Time Computing Systems Predictable Scheduling Algorithms and applications by Giorgio C. Buttazzo
2 Real Time Design Patterns: Robust Scalable Architecture for Real Time System by BrucePowel Douglass
3. Real Time System: Scheduling, Analysis and Verification by Albert M.K. Change
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY
BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Pattern recognition Code: 322846(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To provide the quintessential tools to a practicing engineer faced with everyday signal processing classification
and data mining problems.
• To the theoretical concepts and practical issues associated with pattern recognition.

UNIT 1: Introduction; Probability-Probability of events, Random Variables, Joint distributions and density ,
Moments of Random Variables, estimation, Minimum Risk Estimator.; Matrix Algebra –Eigenvalues & Eigen
Vectors.

UNIT 2: Statistical Decision Making-Bayes’ Theorem, Multiple features, Conditional independent features,
Decision boundaries, Unequal cost of errors, Leaving-one-out technique, Characteristics curves Nonparametric
Decision making-Histograms, Kernel & window estimation, Nearest neighbor Classification technique, Adaptive
Decision boundaries & Discriminant Function, choosing a decision making Technique; Clustering.

UNIT 3: Artificial Neural Networks-Introduction, Nets without hidden layers, Nets with hidden layers, The Back-
Propagation Algorithm, Hopfield Nets, Classifying Sex from facial Images. Pattern recognition using SAS.

UNIT 4: Processing of Waveforms and Images-Introduction, Gray level scaling Transformation, Equalization,
Interpolation, Edge detection, Line detection & Template Matching, The Statistical Significance of Image Features.

UNIT 5: Image Analysis-Scene segmentation & labeling, Counting Objects, Perimeter measurement, Representing
boundaries, Projection, Hough transformation, shapes of regions, texture, color, system design, the classification of
white blood cell, Image Sequence Computer Vision.

Course outcome: At the end of the course students will be able to;
• Formulate and describe various applications in pattern recognition
• Understand the Bayesian approach to pattern recognition
• Mathematically derive, construct, and utilize Bayesian-based classifiers, and non-Bayesian classifiers both
theoretically and practically.
• Understand basic concepts such as the central limit theorem, the curse of dimensionality, the bias-variance
dilemma, and cross-validation
• validate and assess different clustering techniques

Text Books:
1. Pattern Recognition and Image Analysis, by Earl Gose ; Prentice Hall of India
2. M. I. Schlesinger, V. Hlavác, Ten Lectures on Statistical and Structural Pattern Recognition, Kluwer Academic
Publishers.

Reference books:
1. S. Theodoridis, K. Koutroumbas, Pattern recognition, Academic Press.
2. J. Sklanski and G.N. Wassel, Pattern Classifiers and Trainable Machines, Springer, New York
3 . Foryth , Computer Vision, PHI
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Internet and Multimedia Technology Code: 322847(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To understand the technical details of common multimedia data formats, protocols, and compression techniques
of digital images, video and audio content.
• To understand the technical details of JPEG and MPEG families of standards.
• To understand the principles and technical details of several wired and wireless networking protocols.
• To understand and describe technical aspects of popular multimedia web applications including VoD and VoIP.

UNIT-I: Theory of Internet:- Introduction, Evolution of Internet, Internet applications, Internet Protocol: TCP/IP,
Protocol, Versions, Class full addressing, IP data gram, ICMP & IGMP. Functions of ARP and RARP, User Data
gram Protocol (UDP), Transmission Control Protocol (TCP): Flow-Control, Error-Control. Internet Security &
Firewalls.
UNIT-III Bounded Media for Internet :- Cable media, Telephone network, ISDN: Overview, Interfaces &
functions, Physical Layer, Data Link Layer, Network Layer Services, Signaling System Number 7. ATM & B-
ISDN: Introduction Services & Applications, Principles & building blocks of B-ISDN, DIAS network.
UNIT-III Un-Bounded Media for Internet:- Wireless media : Components and working of Wireless network,
IEEE 802.11 standards and WLAN types, Ad-hoc networks, MACAW Protocol. Features and Goals of Bluetooth,
Bluetooth products and security, TCP Over Wireless & Ipv6 : Mobile IP, support of Mobility on the Internet,
Mobile TCP, Traffic Routing in Wireless Networks, Circuit switched Data Services, Packet switched Data services.
WLL Architecture, WLL Technologies and frequency spectrum, Local Multipoint Distribution Service (LMDS),
Ultra Wideband Technology.
UNIT-IV Introduction to Multimedia:- Concept of Non-Temporal and Temporal Media. Hypertext and
Hypermedia. Presentations: Synchronization, Events, Scripts and Interactivity, Compression Techniques: Basic
concepts of Compression. Still Image Compression.: JPEG Compression., Features of JPEG2000. Video
Compression: MPEG- 1&2 Compression Schemes, MPEG-4 Natural Video Compression. Audio Compression:
Introduction to speech and Audio Compression, MP3 Compression Scheme. Compression of synthetic graphical
objects.
UNIT-V Multimedia Systems Technology: Architecture for Multimedia Support: Multimedia PC/Workstation
Architecture, Characteristics of MMX instruction set, I/O systems: IEEE 1394 interface, Operating System Support
for Multimedia Data: Resource Scheduling with real time considerations, File System, I/O Device Management.
Multimedia Information Management: Multimedia Database Design, Content Based Information Retrieval: Image
Retrieval, Video Retrieval, Overview of MPEG-7, Design of Video-ondemand systems.

Course outcome: After successfully completing this course, students will be able
• To develop a thorough understanding of the major aspects of multimedia data representation and multimedia
content delivery platforms.
• Proper evaluate, develop, and enhance the distributed multimedia applications
Text Books:-
1. TCP/IP Protocol Suite By Behrouz A. Forouzan. TMH.
2. Multimedia Concept & Practice, Hartman & Carey, PHI
Reference Books:-
1. Multimedia Technology, TAY Vaughan, McGraw-Hill
2. Virtual Reality Systems, John Vince, Addison Wesley
3. ATM Network by Rainer Handel, Manfred N Huber Stijan Schoder, LPE.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Software Testing Code: 322848(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• To study software testing objectives, process, criteria, strategies, and methods.
• To study various software testing issues and solutions in software unit, integration, regression, and system
testing.
• To study planning of a test project, design test cases, conduction of testing operations, generation of a test report.
• To understand automation testing process, its problems and solutions.

Unit-I: Quality Revolution, Software Quality, Role of Testing, Objectives of Testing, Concept of Complete Testing,
Central Issue of Testing, Sources of Information for Test Case selection, Test Planning and Design, Monitoring and
Measuring Test Execution, Test Tools and Automation, Test Team Organization and Management.

Unit-II: Basic Concepts of Testing Theory, Theory of Goodenough and Gerhart, Theory of Weyuker and Ostrand,
Theory of Gourlay, Adequacy of Testing, Limitations of Testing, Static Unit Testing, Defect Prevention, Dynamic
Unit Testing, Debugging.

Unit-III: Outline of Control Flow Testing, Control Flow Graph, Paths in Control Flow Graphs, Path Selection
Criteria, Data Flow Testing criteria, Comparison of Data Flow and Test Selection Criteria, Domain Error, Testing of
Domain Errors.

Unit-IV: System Test design, Test design Factors, Requirement Identification, Test Objective Identification,
Structure of a System Test Plan, Assumptions, Test Approach, Test Suite Structure, Types of Acceptance Testing

Unit-V: Five Views of Software Quality, Quality Control, Quality assurance, Cost of quality, Software Quality
Assurance, SQA Plan, ISO 9000, Capability Maturity Model, McCall s Quality Factors.

Course outcome: After successful completion of the course, students will be

• To design and conduct a software test process for a software testing project.
• To identify various software testing problems, and solve these problems by designing and selecting software
test models, criteria, strategies, and methods.
• To use software testing methods and modern software testing tools for their testing projects.

Text Books
1. Kshirasagar Naik, “Software Testing and Quality Assurance”, John Wiley & Sons.
2. William Perry, “Effective Methods for Software Testing”, John Wiley & Sons.

Reference Books
1. Cem Kaner and Jack Falk, “Testing Computer Software”, Wiley.
2. Ron Patton, “Software Testing”, SAMS Publications.
 CHHATTISGARH SWAMI VIVEKANAD TECHNICAL UNIVERSITY, BHILAI (C.G.)

Semester: VIII Branch: Computer Science & Engg.

Subject: Wireless Networks Code: 322849(22)
Total Theory Periods: 50 Total Tutorial Periods: NIL
Total Marks in End Semester Exam: 80 Minimum number of CT to be conducted: 02

Course Objective:
• Understand the architecture and applications of current and next generation wireless networks: Cellular,
WLANs, sensor networks, mobile ad-hoc networks and intermittently connected mobile networks.
• Learn how to design and analyze various medium access and resource allocation techniques wireless networks.
• Learn to design and analyze transport layer protocols, with an emphasis on congestion control, including TCP
over wireless, congestion sharing mechanisms, explicit and precise rate control, utility optimization-based
approaches, and backpressure-based utility optimization.
UNIT-1
Wireless Communication Standard-First, Second and Third Generation Wireless Communication Network,
Coverage Extension, Types; Characterization of Wireless Channels- multipath Propagation, Linear Time Variant,
Channel Model, Channel Correlation Function, Large Scale Path Loss and Shadowing, Fading.
UNIT-2
Bandpass Transmission Technique for Mobile Radio- Signal Space and Decision Region, Digital Modulation-
MPSK, MSK, GMSK,OFDA, Power Spectral Density, Probability of Transmission Error; Receiver Technique for
Fading Dispersive Channels.
UNIT-3
CELLULAR COMMUNICATION-Frequency reuse and mobility Management, Cell Cluster Concept, Co Channel
and Adjacent Channel Interference, Call Blocking and Delay at Cell Site, Cell Splitting,
Sectoring;
UNIT-4
Multiple Access Technique, Random Access, Carrier Sense Multiple Access( CSMA), Conflict Free Multiple
Access Technology and Spectral Efficiency-FDMA, TDMA, CDMA; Mobility management and In wireless
network-CAC, Handoff Management, Location Management for Cellular Network and PCS network, Traffic
calculation.
UNIT-5
Wireless Internetworking-Mobile IP , Internet Protocol (IP), Transmission Control Protocol (TCP), Network
Performance, Wireless Application Protocol(WAP) , Mobile AD HOC Network

Course outcome:
• Have knowledge and understanding of basic mobile network architecture
• Have knowledge and understanding of some basic technologies that are in use
• Be able to make critical assessment of mobile systems
• Be able to analyze and propose broad solutions for a range of mobile scenarios

Text Books:
1. WIRELESS COMUNICATION & NETWORKING by Mark & Zuang , PHI
2. Wireless Communications And Networks, WILLIAM STALLINGS , PHI

Reference Books:
1. Wireless Network Performance Handbook , by SMITH , McGraw- Hill
2. Principles Of Wireless Networks, By PAHLAVAN , PHI