ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY

Guwahati

Course Structure and Syllabus

Computer Science and Engineering (CSE)

Semester V/ CSE/ B.TECH

Sl. Subject Hrs/week Credits

Subject
No. Code

L T P C
Theory
1 MA131501 Probability and Random process 3 2 0 4
2 CS131502 Formal Language and Automata Theory 3 2 0 4
3 CS131503 Computer Graphics 3 2 0 4
4 CS131504 Database Management Systems 3 2 0 4
5 EE131505 Microprocessor and Microcontroller 3 2 0 4
6 HS131506 Principles of Management 2 0 0 2
Practical
7 CS131513 Computer Graphics Lab 0 0 2 1
8 CS131514 Database Management Systems Lab 0 0 2 1
9 EE131515 Microprocessor and Microcontroller Lab 0 0 2 1
Total 17 10 6 25
Total Contact Hours: 33
Total Credits : 25

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 1

Course Title : PROBABILITY AND RANDOM PROCESS Class Hours/week 4
Course Code: MA131501 Expected weeks 12
Total hrs. of 36+12
L-T-P-C: 3-2-0-4
classes = 48

MODULE TOPIC COURSE CONTENT HOURS

Sets and set operations; Probability space;

1 INTRODUCTION 8
Conditional probability and Bayes theorem.
Probability mass function, probability distribution
function, example random variables and
DISCRETE
distributions; Continuous random variables,
2 RANDOM 10
VARIABLES
probability density function, probability distribution
function, example distributions.

Functions of one and two random variables, moments

of random variables; Conditional distribution,
JOINT densities and moments; Characteristic functions of a
3 10
DISTRIBUTIONS random variable; Markov, Chebyshev and Chernoff
bounds.

RANDOM
SEQUENCES AND Limit theorems; Strong and weak laws of large
4 10
MODES OF numbers, central limit theorem.
CONVERGENCE
RANDOM Mean and covariance functions. Ergodicity.
PROCESS AND Transmission of random process through LTI. Power
5 STATIONARY spectral density.
10
PROCESSES
TOTAL 48

Text/Reference Books:

1. H. Stark and J. Woods, ``Probability and Random Processes with Applications to Signal
Processing,'' Third Edition, Pearson Education
2. A. Papoulis and S. Unnikrishnan Pillai, ``Probability, Random Variables and Stochastic Processes,''
Fourth Edition, McGraw Hill.
3. K. L. Chung, Introduction to Probability Theory with Stochastic Processes, Springer International,
4. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability, UBS Publishers,
5. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Stochastic Processes, UBS Publishers
6. S. Ross, Introduction to Stochastic Models, Harcourt Asia, Academic Press.

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 2

Course Title : FORMAL LANGUAGE AND AUTOMATA
Class Hours/week 4
THEORY
Expected weeks 12
Course Code: CS131502 Total hrs. of 36+12
L-T-P-C: 3-2-0-4 classes = 48

MODULE TOPIC COURSE CONTENT HOURS

STRINGS AND
1 ALPHABETS
Basics of Strings and Alphabets 6
DFA, transition graphs, regular languages, non-
FINITE
2 AUTOMATA
deterministic FA, equivalence of DFA and 8
NDFA
Regular grammars, regular expressions,
GRAMMAR AND
3 LANGUAGES
equivalence between regular languages, 8
properties of regular languages, pumping lemma.
Leftmost and rightmost derivation, parsing and
CONTEXT FREE
4 LANGUAGES
ambiguity, ambiguity in grammar and languages, 8
normal forms
NDPDA, DPDA, context free languages and
PUSHDOWN PDA, comparison of deterministic and non-
5 AUTOMATA
10
deterministic versions, closure properties,
pumping lemma for CFL
TURING Turing Machines, variations, halting problem,
6 MACHINES
4
PCP
CHOMSKY
7 HIERARCHY
Chomsky Hierarchy 4
TOTAL 48

TEXTBOOKS / REFERENCES:

1. An Introduction to Formal Languages and Automata, by Peter Linz, Third Edition, Narosa
Publishers
2. Introduction to Automata Theory, Languages & Computation – J. E. Hopercroft and J. D.
Ullman, Published by Narosa
3. Introduction to Languages and The Theory of Computation – J. C. Martin, McGraw Hill
International Edition.

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 3

 Class Hours/week 4
Course Title : COMPUTER GRAPHICS Expected weeks 12
Course Code: CS131503 Total hrs. of 36+12
L-T-P-C: 3-2-0-4 classes = 48

MODULE TOPIC COURSE CONTENT HOURS

History of computer graphics, applications,
graphics pipeline, physical and synthetic
images, synthetic camera, modeling,
1 INTRODUCTION animation, rendering, relation to computer 8
vision and image processing, review of basic
mathematical objects (points, vectors, matrix
methods)
OpenGL architecture, primitives and
attributes, simple modeling and rendering of
INTRODUCTION TO two- and three-dimensional geometric
2 OPENGL
10
objects, indexed and RGB color models,
frame buffer, double buffering, GLUT,
interaction, events and callbacks, picking.
Homogeneous coordinates, affine
transformations (translation, rotation, scaling,
GEOMETRIC
3 TRANSFORMATIONS
shear), concatenation, matrix stacks and use 8
of model view matrix in OpenGL for these
operations.
Classical three dimensional viewing,
computer viewing, specifying views, parallel
4 VIEWING and perspective projective transformations; 9
Visibility- z-Buffer, BSP trees, Open-GL
culling, hidden-surface algorithms.
Light sources, illumination model, Gouraud
and Phong shading for polygons.
SHADING AND
5 RASTERIZATION
Rasterization- Line segment and polygon 9
clipping, 3D clipping, scan conversion,
polygonal fill, Bresenham's algorithm.
Texture mapping, compositing, textures in
DISCRETE
6 TECHNIQUES
OpenGL; Ray Tracing- Recursive ray tracer, 4
ray-sphere intersection.
TOTAL 48

Text Books:
1. Edward Angel, Interactive Computer Graphics. A Top-Down Approach Using OpenGL
(fifth Edition), Pearson Education
2. Donald Hearn and Pauline Baker, Computer Graphics with OpenGL (third edition),
Prentice Hall
3. F. S. Hill Jr. and S. M. Kelley, Computer Graphics using OpenGL (third edition), Prentice
Hall
4. Peter Shirley and Steve Marschner, Computer Graphics (first edition), A. K. Peters

Web Resources:
http://www.graphicsforum.in

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 4

Course Title : DATABASE MANAGEMENT SYSTEMS
Course Code: CS131504 Class Hours/week 4
Expected weeks 12
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48

MODULE TOPIC COURSE CONTENT HOURS

Purpose of database systems-
Components of DBMS – DBMS
Architecture and Data Independence-
BASIC CONCEPTS Data modeling - Entity Relationship
1 10
Model, Relational – Network-
Hierarchical and object oriented models-
Data Modeling using the Entity
Relationship Model.
Relational databases – relational
algebra- tuple relational calculus. Data
STRUCTURE OF
2 RELATIONAL DATABASES
definition with SQL, insert, delete and 8
update statements in SQL –views – data
manipulation with SQL
Transaction and System Concepts-
Desirable properties of Transactions-
Schedules and Recoverability-
Serializability of Schedules-Query
processing and Optimization-
INTRODUCTION TO
Concurrency Control- -assertions –
3 TRANSACTION 12
PROCESSING triggers.
Oracle case study: The basic structure of
the oracle system – database structure
and its manipulation in oracle- storage
organization in oracle - Programming in
PL/SQL- Cursor in PL/SQL
Design guidelines– Relational database
design – Integrity Constraints – Domain
Constraints- Referential integrity –
Functional Dependency- Normalization
using Functional Dependencies, Normal
forms based on primary keys- general
4 DATABASE DESIGN 12
definitions of Second and Third Normal
Forms. Boyce Codd Normal Form–
Multivalued Dependencies and Forth
Normal Form – Join Dependencies and
Fifth Normal Form – Pitfalls in
Relational Database Design.

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 5

 Distributed Database Concepts- Data
Fragmentation,
Replication and Allocation Techniques-
5 DISTRIBUTED DATABASES
Different Types- Query Processing – 6
semijoin - Concurrency Control and
Recovery.

TOTAL 48

TEXT BOOKS:

1. Fundamentals of Database System Elmasri and Navathe (4rd Edition), Pearson Education
Asia
2. Database System Concepts - Henry F Korth, Abraham Silbershatz, Mc Graw Hill 2nd
edition.

3. Atul Kahate , “ Introduction to Database Management System”, Pearson Educations

4. Paneerselvam,”DataBase Management System”, PHI Learning

REFERENCE BOOKS:

1. An Introduction to Database Systems - C.J.Date (7th Edition) Pearson Education Asia

2. An Introduction to Database Systems – Bibin C. Desai, Galgotia Publications

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 6

Course Title : MICROPROCESSOR AND MICROCONTROLLER
Course Code: EE131505
L-T-P-C: 3-2-0-4 Class Hours/week 4
Expected weeks 12
Total hrs. of 36+12
classes = 48

MODULE TOPIC COURSE CONTENT HOURS

Introduction to the microprocessor, The
ALU, Up registers, Basic concepts of
programmable device – Bus organization,
MICROPROCESSOR
1 system components etc., The interface 8
ARCHITECTURE
section, The timing and control section,
State transition sequence, Block diagram.

Data representation, instruction formats,

addressing modes, Instruction set, software
PROGRAMMING
2
MICROPROCESSORS
design, assembly language programming, 8
program looping, subroutine linkage,
position independency, recursion.
Memory structure and its requirements,
basic concepts and address decoding,
MEMORY
3
INTERFACING
interfacing circuit, address decoding and 8
memory addresses, basics of 8155,
interfacing of 8155 memory section.
Serial and parallel data transfer schemes,
DATA TRANSFER interrupts and interrupt service procedure.
4 8
SCHEMES 8085 interrupts and vector locations, SIM
and RIM instructions, RST instructions.
OPAMPS, Opto-couples, DAC, ADC,
sample& hold amplifiers, multiplexers,
5 I/O DEVICES 8
buffers, Timer counter, Data acquisition
systems.

INTRODUCTION TO
6
MICROCONTROLLER
Architecture, RISC and CISC processors. 4

INSTRUCTION SET Instruction set and programming

7 4
AND PROGRAMMING 8051micro controllers.

TOTAL 48

REFERENCES:

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

(3e), Penram Pub
2.Mazidi M. A. & J. G. Mazidi - The 8051 Microcontroller and embedded systems,
Pearson
3.Microprocessors and Interfacing: Nikhil Marriwala, Katson

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 7

 Class Hours/week 2
Course Title : PRINCIPLES OF MANAGEMENT Expected weeks 12
Course Code: HS131506 Total hrs. of 24
L-T-P-C: 2-0-0-2 classes

MODULE TOPIC COURSE CONTENT HOURS

Definition, nature, importance, evolution of
management thoughts – pre & post scientific
era, contributions made by Taylor, Fayol,
Gilbreth,Elton Mayo, McGregor, Maslow –
1 MANAGEMENT covering Time & Motion Study, Hawthrone 4
Experiments; Is management a science or art?
Functions of manager, ethics in managing and
social responsibility of managers.

Why Management process starts with

planning, steps in planning, planning premises,
types of planning, barriers to effective
planning, operational plan, strategic planning,
PLANNING & Mckinsey’s 7’s Approach, SWOT analysis,
2 CONTROL
4
Controlling- concept, Planning- control
relationship, process of control, human
response to control, dimension of control,
MBO.

Nature, process of decision making, decision

making under Certainty and Uncertainty,
decision-tree, group-aided decision, brain-
storming. Organizing – concept, nature and
DECISION MAKING &
3 ORGANIZING
process of organizing, authority and 4
responsibility, delegation and empowerment,
centralization and decentralization, concept of
departmentation.

Concept, Manpower planning, Job design,

recruitment & selection, training and
development, performance appraisal,
STAFFING &
4 MOTIVATION
motivation, motivators and satisfaction, 3
motivating towards organizing objectives,
morale building.

Defining leadership and its role, should

managers lead, leadership style, leadership
development, Leadership behaviour.
LEADERSHIP &
5 COMMUNICATION
Communication- Process, Bridging gap-using 3
tools of communication, electronic media in
Communication

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 8

 Financial functions of management, Financial
FINANCIAL
6 MANAGEMENT
Planning, Management of Working Capital, 3
Sources of Finance.
Functions of Marketing, Product Planning &
Development, Marketing Organization, Sales
MARKETING
7 MANAGEMENT
Organization, Sales Promotion, Consumer 3
Behaviour, Marketing Research and
Information
TOTAL 24

TEXTBOOKS/REFERENCE BOOKS:

1. Robbins & Caulter, Management, Prentice Hall of India.

2. John R.Schermerhorn, Introduction to Management, Wiley-India Edition.
3. Koontz, Principles of Management, Tata-McGrew Hill.
4. Richard L. Daft, New Era of Management, Cengage Learning.
5. Stoner, Freeman and Gilbert. Jr., Management, Prentice Hall of India.
6. Koontz, Weihrich, Essentials of Management, Tata-McGrew Hill.
7. D.C. Bose, Principles of Management and Administration, Prentice Hall of India.

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 9

 PRACTICALS
Course Title : COMPUTER GRAPHICS LAB
Course Code: CS131513
L-T-P-C: 0-0-2-1
Expected No. of weeks : 12 (approx)

EXPERIMENT
AIM OF THE EXPERIMENT HOURS
NO.
1. WAP to draw following figure using inbuilt function:-

a. c.

d.

b.
1 3

e. f.

Write a program to draw a cube using inbuilt function.

Write a program to write your name.
Write a program to draw your name and department.
Write a program to draw a football moving on x-axis.
Write a program to draw a concentration circle.
Write a program to draw a line using DDA algorithms.
Write a program to draw a line using Bresenham’s algorithms.
Write a program draw a moving car.
2 27
Write a program to draw a rectangle using boundary fill algorithms.
Write a program to Draw a circle and fill color with flood fill
algorithm.
Write a program to draw a rectangle is using flood-fill algorithms and
inside that draw a circle using boundary-fill algorithms.
Write a program to draw a circle using midpoint circle drawing
algorithms.
Write a program to draw two circles which is moving from

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 10

 both side of the screen and join it on the middle of the screen.
Write a program to draw an Indian flag and fill color.
Write a program to Rotate, Translate and scaling a line
Write a program to draw a moving man.
Write a program to draw a chess board.
Write a program to draw a clock.
Write a program to draw a poster for your college.

TOTAL 30

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 11

Course Title : DATABASE MANAGEMENT SYSTEMS LAB
Course Code: CS131514
L-T-P-C: 0-0-2-1
Expected No. of weeks : 12 (approx)

EXPERIMENT
AIM OF EXPERIMENT HOURS
NO.
Consider the following relational schema

Employee (Emp_no, Name, Salary, design, dept_id, DOJ)

Department (Dept_id, DName, loc, DOE)

1 (a) Display the name of the employees working in marketing dept. 3

(b) Display the details of the employee joined in the month of July.

(c) Display the details of the employee who gets maximum salary.

(d) Count the no of employees in each dept.

Consider the following relational schema

Student (Rollno, Name, Address, DOB, C_id)

2 Course ( C_id, Cname, Dur, Fees) 3

(a) Display rollno,name,cname,fees of each student

(b) Count the no of students in each course

Consider the following relational schema

Books(book_id,b_name,author,purchase_date,cost)

Members(member_id,m_name,address,phone,birthdate)

Issue_return(book_id,member_id,issue_date,return_date)

(a) Find the author of the books that have not been issued.

(b) Display the member_id and no of books issued to that (Assume

3 that if a book in Issue_Return relation does not have a return_date 3
then it is issued)

(c) Find the book that has been issued the minimum no of times.

(d) Display the names and author of the books that have been issued at
any time to a member whose name begins with "Ra".

(e) Display the name and Cost of those books that have been issued to
any member whose date of birth is less than 01-01-1989 but not
been issued to any member having the birth date equal to or

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 12

 greater than 01-01-1989.

Consider the following relational schema

Student(name,phone,dob,s_id)

Course(c_id,cname,credit,teacher_id)

Result(s_id,c_id,mark)

(a) Find the name of the students whose results are not declared in any
course

(b) Find the teachers who are teaching more than one course

(c) Display the name and marks of those students who were born
4 before 1-1-1989 and score more than 80 marks in any course 3
(d) Find the details of students securing pass marks in more than 3
course

(e) Find the total no of credits earned by a students whose id is 10.

(f) Find name of the students who got maximum overall marks.

(g) Display the name and marks of those students who scored more
than 80 marks in any subject.

(h) Find the details of the students securing less than 30 marks in more
than 3 subjects.

Consider the following relational schema

Customer( C_id, Name , Address )

Item(i_code , Name , Price )

Purchase (P_id ,C_id , I_code, qty , pdate )

5 3
(a) Find the name of the customer who has done maximum purchase.

(b) Display the name of the item that has been purchased maximum no
of times in the month of Feb.

(c) Display the name of the customer who didn’t purchase any item.

Create three triggers (insert, delete and update) on emp table so that:

i) Whenever a new record is inserted then the emp_id and date of

6 insertion is stored in another table called new_rec. 3
ii) whenever a record is deleted the emp_id and date of deletion is
stored in another table called old_rec.

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 13

 iii) whenever employee's salary is updated the emp_id , old salary and
updated salary is stored in another table called update_info.

7 Write a procedure to accept a emp_id and display the employee details. 3

8 Write a procedure to accept a emp_id and return the employee salary. 3

Emp(emp_no,name,salary,supervisor_no,dept_code)

Dept(dept_code, dept_name)

i) employees who get more salary than their supervisor

9 ii) Department name and total number of employees in each 3

Department.

iii) Name and department of employee(s) who earn maximum

salary.

TOTAL 27

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 14

Course Title : MICROPROCESSOR AND MICROCONTROLLER LAB
Course Code: EE131515
L-T-P-C: 0-0-2-1
Expected No. of weeks : 12 (approx)

EXPERIMENT
AIM OF THE EXPERIMENT HOURS
NO.

1 Addition of immediate 8 bit numbers 3

2 3
Subtraction of immediate 8 bit numbers
3 3
Addition of 8 bit numbers stored in memory location
4 3
Block transfer of data in memory segments far apart
5 Block transfer of data in memory segments overlapping each other 3

6 Addition of an array of bytes stored in consecutive memory 3

7 Addition of unknown number of bytes stored in consecutive memory 3

8 3
Addition of two 16 bit numbers stored in memory
9 Subtraction of two 16 bit numbers stored in memory 3

10 Multiplication of two 8 bit unsigned numbers stored in memory 3

Division of one 8 bit unsigned number by another 8 bit unsigned number

11 3
stored in memory
TOTAL 33

************

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 15