SCHOOL OF COMPUTER APPLICATION & IT

YBN UNIVERSITY

Syllabus of
B. Sc. in Information Technology
B.Sc. IT
(CHOICE BASED CREDITSYSTEM)

1
 YBN UNIVERSITY

Vision

YBN University envisions to be a global university for Center of Excellence with set standards in
education, research, creativity, entrepreneurship and ethical values, overcoming challenges in the service
of mankind encompassing equity and productivity.

Mission

With strong belief in the astounding future of our students, YBN University looks forward for the set
goals and the actions it undertakes. The following are its key prepositions:

• To disseminate knowledge that transform students into leaders who possess the intellect, aptitude,
skill and confidence to succeed in all pursuits of life.
• Develop academic programs that meet the needs of regional, state, national and global communities.
• To create a collaborative environment, open to free exchange of ideas, where education, research,
creativity and entrepreneurship can flourish.
• Collaborate with other educational and non-educational institutions to achieve mutual goals and
expand student opportunities through internship and placements.
• Provide students/faculties with the richest possible journey of educational development in a
supportive and congenial environment.

Values

• Excellence: We aim to achieve excellence in all our work, always being principled, considerate and
respectful.
• Diversity: We value the opportunity to work, learn and develop in a community that embraces the
diversity of individuals enhancing multicultural learning junctures.
• Integrity: Having a strong belief to act with honesty, courage and trustworthiness, we support an
environment of respect among students/faculties/staffs.
• Ethical: Having commitment to ethical and responsible behavior in our own actions, we look
forward to develop the same in our students.
• Innovation: We build strength through innovation into our curriculum, culture, workplace and
campus creating an environment with opportunities for growth and change.
• Resilience: We change, adapt and transform, also are creative to meet the ever changing needs of
the University and the Society.
• Commitment: We sustain a deep allegiance and commitment to the interests of the region and
state in which we are based, alongside our national and international efforts, ensuring relevance to all.

2
The CBCS provides an opportunity for the students to choose courses from the
prescribed courses comprising core, elective/minor or skill based courses.

1. Types of courses in CHOICE BASED CREDIT SYSTEM (CBCS)

1.1 Core Course: A course, which should compulsorily be studied by a candidate as a core
requirement is termed as a Core course.
1.2 Elective Course: Generally, a course which can be chosen from a pool of courses and
which may be very specific or specialized or advanced or supportive to the discipline/
subject of study or which provides an extended scope or which enables an exposure to
some other discipline/subject/domain or nurtures the candidate’s proficiency/skill is
called an Elective Course.
1.2.1 Discipline Specific Elective (DSE) Course: Elective courses offered by the
main discipline/subject of study are referred to as Discipline Specific Electives.
1.2.2 Project work/Dissertation is considered as a special course involving
application of knowledge in solving /analyzing /exploring a real life situation /
difficult problem. A candidate studies such a course on his own with an advisory
support by a teacher/faculty member. The work done will have to be submitted in
writing as a dissertation.
1.2.3 Generic Elective (GE) Course: Elective courses that are generic or
interdisciplinary by nature are called Generic Electives. Students will have to choose
one elective each in the first four semesters from the lists GE1 to GE4 given in this
syllabus.

1.3 Ability Enhancement Courses (AEC)

The Ability Enhancement (AE) Courses are the course that leads to Knowledge
enhancement. These are of two types.
1.3.1 AE Compulsory Course (AECC): Environmental Studies,
English Communication/MIL Communication.
1.3.2 AE Elective Course (AEEC): AEEC courses are value-based and/or skill-based
and are aimed at providing hands-on-training, competencies, skills, etc. These courses
are to be chosen from a pool of courses designed to provide value-based and/or skill-
based instruction.
2. B.Sc. in INFORMATION TECHNOLOGY Programme Details

2.1 Programme Objectives:

Students who choose B.Sc. in IT Programme, develop the ability to think critically, logically,
analytically and to use and apply current technical concepts and practices in the core
development of solutions in the form of Information technology.

3
 The knowledge and skills gained with a degree in Computer Science prepare graduates for a
broad range of jobs in education, research, government sector, business sector and industry.

The program covers the various essential concepts in Computer Science. The course lays a
structured foundation of Computer fundamentals, Numerical methods, Data structure,
Algorithm and Complexity analysis, Software Engineering, Programming Concepts in various
languages(C, C++, Java, Visual Basic etc.), Computer Networking, System Programming and
Administration, Operating System, Digital Image Processing, Embedded systems, Computer
Architecture, Microprocessor, PHP programming, Numerical methods, Combinatorial
optimization, Computer Graphics and Database management system.

An exceptionally broad range of topics covering current trends and technologies in computer
science: Programming in Python, Cyber Security, Data mining, R-Programming, Data
Sciences, Artificial Intelligence and Android Programming. Also, to carry out the hand on
sessions in Computer lab using various Programming languages and tools to have a deep
conceptual understanding of the topics to widen the horizon of students’ self-experience.

2.2 Programme Learning Outcomes: The completion of the

B.Sc. in IT Programme shall enable a student to:

i) To communicate technical information both orally and in writing

ii) Apply the knowledge gained in core courses to a broad range of advanced topics in
computer science, to learn and develop sophisticated technical products independently.
iii) To design, implement, and evaluate computer-based system, process, component, or
program to meet desired needs by critical understanding, analysis and synthesis
iv) Identify applications of Computer Science in other fields in the real world to enhance
the career prospects
v) Realize the requirement of lifelong learning through continued education and research. vi)
Use the concepts of best practices and standards to develop user interactive and abstract
application
vii) Understand the professional, ethical, legal, security, social issues and responsibilities

2.3 Programme Structure:

The BSc IT programme is a three-year course divided into six-semesters. A student is required
to complete 148 credits for the completion of course and the award of degree.

Semester Semester
Part – I First Year Semester I : 22 Semester II : 22
Part – II Second Year Semester III: 28 Semester IV: 28
Part – III Third Year Semester V:24 Semester VI:24

4
 2.4 Prerequisite
Students who want to take admission in B.Sc. - IT Programme, must have passed Higher
Secondary (Science) or equivalent level examination having Mathematics as a subject and securing
minimum pass mark in Mathematics at Higher Secondary level.

2.5 Programme Implementation Requirement:

The B.Sc. - IT programme is a three-year course divided into six-semesters. For proper
implementation of the UGCBCS programme the following infrastructure are necessary:

a) Sufficient lab facilities with computers and software

b) At least 7 full time teaching faculties.

2.6 Instruction for questions paper setter:

Question Paper setter should set from the prescribed text books, mentioned in the syllabus.

3. Credit allocation (B.Sc. in IT)

Course

*Credits
Theory + Practical Theory + Tutorial

I Core Course (6 credits)

(14 papers) 14X4=56 14x5=70

Core Course Practical / Tutorial* (14 Papers) 14x2=28 14x1=14

I. Elective Course (6 credits) (8

Papers)

A.1. Discipline Specific Elective (4 Papers) 4x4=16 4x5=20

A.2. Discipline Specific Elective Practical/ Tutorial* 4×2 = 8 4×1 = 4

(4 Papers)

B.1. Generic Elective/ Interdisciplinary (4 Papers) 4x4=16 4x5=20

B.2. Generic Elective Practical/ Tutorial* 4x2=8 4x1=4

(4Papers)

5
 Optional dissertation or project work in place of one Discipline Specific Elective paper (6
credits) in 5th semester

1.Ability Enhancement Compulsory Courses 2x4=8 2x4=8

(AECC)
(2 Papers of 4 credit each)

Environmental Science

English Communication

2. Skill Enhancement Courses (SEC) (Minimum 2) 2x4=8 2x4=8

(2 Papers of 4 credit each)
Total credit 148 148

*Wherever there is practical, there will be no tutorial and vice-versa

6
 CBCS Course Structure for B.Sc. (IT)
SEMESTER WISE PLACEMENT OF THE COURSES
Ability
Enhancement Skill
Semester CORE COURSE Compulsory Enhancement
(14) Course Course (SEC) Elective: Discipline Elective:
(AECC) (2) (2) Specific DSE (4) Generic(GE)(4)
1Y3BSIT-101 1Y3BSIT-103 1Y3BSIT-104
I Computer Fundamental ENG A/B
and Programming GE-1
1Y3BSIT-102
Mathematics-I

1Y3BSIT-201 1Y3BSIT-203 1Y3BSIT-204

II Data Structure and ENV A/B
algorithm GE-2
1Y3BSIT-202
Digital Logic

1Y3BSIT-301 1Y3BSIT-304 1Y3BSIT-305

Computer Organization A/B/C A/B
III SEC -1 GE-3
1Y3BSIT-302
Operating System
1Y3BSIT-303
Database Management
System
1Y3BSIT-401 1Y3BSIT-404 1Y3BSIT-405
Programming in JAVA A/B/C A/B
IV SEC -2 GE-4
1Y3BSIT-402
Software Engineering
1Y3BSIT-403
Data Communication and
Computer Networks

1Y3BSIT-501 1Y3BSIT-503
V Compiler Design A/B/C
DSE -1

1Y3BSIT-502 1Y3BSIT-504
Web Technology DSE -2

1Y3BSIT-601 1Y3BSIT-603
VI System Administration A/B/C
using Linux DSE-3

1Y3BSIT-602 1Y3BSIT-604
Computer Graphics A/B/C
DSE -4

7
 Skill Enhancement Course (SEC)

SEC 1 (choose one)

1Y3BSIT-304A: UNIX/LINUX Programming
1Y3BSIT-304B: Programming in Python
1Y3BSIT-304C: HTML Programming

SEC 2 (choose one)

1Y3BSIT-404A: Android Programming
1Y3BSIT-404B: PHP Programming
1Y3BSIT-404C: R Programming

Discipline Specific Electives (DSE)

DSE 1(choose one)

1Y3BSIT-503A: E-commerce
1Y3BSIT-503B: Object Oriented Analysis and Design
1Y3BSIT-503C: Computer Oriented Optimization Techniques

DSE-2
1Y3BSIT-504: Project Work / Dissertation

DSE 3, DSE 4 (choose two)

1Y3BSIT-603A OR 1Y3BSIT-604A: Microprocessor
1Y3BSIT-603B OR 1Y3BSIT-604B: Data Mining and Warehousing
1Y3BSIT-603C OR 1Y3BSIT-604C: Artificial
Intelligence

GE 1 (choose one)
1Y3BSIT-104A: ICT Hardware
1Y3BSIT-104B: Office Automation

GE 2 (Choose one)
1Y3BSIT-204A: Mathematics - II
1Y3BSIT-204B: Programming in C++

GE 3 (choose one)
1Y3BSIT-305A: Multimedia and Application
1Y3BSIT-305B: Computer Oriented Numerical Methods

GE 4 (choose one)
1Y3BSIT-405A: Theoretical Foundation of Computing
1Y3BSIT-405B: Information Security and Cyber Laws

8
 Semester – I
S. No. Sub. Code Class Per Credit Max. Marks Total
Week Marks
T P Th. Pr.
1 1Y3BSIT-101 4 2 6 70 30 100
2 1Y3BSIT-102 5 0 6 70 30 100
3 1Y3BSIT-103 5 0 4 70 30 100
4 1Y3BSIT-104 4 2 6 70 30 100
A/B

Semester – II
S. No. Sub. Code Class Per Credit Max. Marks Total
Week Marks
T P Th. Pr.
1 1Y3BSIT-201 4 2 6 70 30 100
2 1Y3BSIT-202 5 0 6 70 30 100
3 1Y3BSIT-203 5 0 4 70 30 100
4 1Y3BSIT-204 5 0 6 70 30 100
A/
B 4 2 6 70 30 100

Semester – III
S. No. Sub. Code Class Per Credit Max. Marks Total
Week Marks
T P Th. Pr.
1 1Y3BSIT-301 5 0 6 70 30 100
2 1Y3BSIT-302 4 2 6 70 30 100
3 1Y3BSIT-303 4 2 6 70 30 100
4 1Y3BSIT-304 3 2 4 70 30 100
A/B/C
5 1Y3BSIT-305 4 2 6 70 30 100
A/B

9
 Semester – IV
S. No. Sub. Code Class Per Credit Max. Marks Total
Week Marks
T P Th. Pr.
1 1Y3BSIT-401 4 2 6 70 30 100
2 1Y3BSIT-402 4 2 6 70 30 100
3 1Y3BSIT-403 4 2 6 70 30 100
4 1Y3BSIT-404 3 2 4 70 30 100
A/B/C
5 1Y3BSIT-405 4 0 6 70 30 100
A/
B 4 2 6 70 30 100
Semester – V
S. No. Sub. Code Class Per Credit Max. Marks Total
Week Marks
T P Th. Pr.
1 1Y3BSIT-501 4 2 6 70 30 100
2 1Y3BSIT-502 4 2 6 70 30 100
3 1Y3BSIT-503 4 2 6 70 30 100
A/B/C
4 1Y3BSIT-504 5 0 6 70 30 100
Semester – VI

S. No. Sub. Code Class Per Credit Max. Marks Total

Week Marks
T P Th. Pr.
1 1Y3BSIT-601 5 0 6 70 30 100
2 1Y3BSIT-602 5 0 6 70 30 100
3 1Y3BSIT-603 5 0 6 70 30 100
A/B/C
4 1Y3BSIT-604 5 0 6 70 30 100
A/B/C

10
 Detailed Syllabus

1Y3BSIT-101: COMPUTER FUNDAMENTALS ANDPROGRAMMING

UNIT 1: Fundamentals (17 Lectures)

Major components of a Digital Computer (A brief introduction of CPU, Main memory,

Secondary memory devices and I/O devices) Keyboard, monitor, mouse, printers,
Secondary storage devices (floppy disks, hard disks and optical disks), backup system and
why it is needed? Bootstrapping a Computer. Representation of numbers (only a brief
introduction to be given) and characters in computer. ASCII. EDCDIC and Gray codes.
Interpreter, Assembler, Linker and Loader. Definition and concepts of algorithm and its
different implementations-pseudo code, flowchart and Computer programs.

Number System: Binary, Hexadecimal, Octal, BCD, and conversions of number systems.
Representation of signed integers, Sign and magnitude, 1‘s complement and 2‘s
complement representation. Arithmetic operations using 2‘scomplement representation and
conditions for overflow/underflow and its detection.

UNIT 2: Introduction to C (17 Lectures)

Elementary data types, variables, constants and identifiers. Integer, character floating point and
string constants. Variable declarations. Syntax and semantics. Reserved word. Initialization
of variable during declarations Constant data types. Expression in C, precedence and
associativity of C operators, unary, binary and ternary operators. C arithmetic operators,
assignment operators, relational operators, logical operators and bit –wise operators. L-
value and R-value. Side effects of operators. Expression statement. Conditional Statement-
if, if-else, switch, Iterative Statement white, do-while, for.

Other Statement –break, continue, goto, return, null Statement, block Statement. Function:
function declaration. Calling a function. Parameters –Call by value, call by reference and its
absence in C. Recursion and how it works. Cast and size of operator. Automatic type Conversion.

Simple programs like programs to compute an arithmetic expression, unit conversion, the sum
of a series (like trigonometric series), GCD, factorial (both recursive and non-recursive version),
Fibonacci number (both recursive and non-recursive version), generation of prime numbers,
reversing digits of an integer, finding the square root of a number, prime factors of an integer,
base conversion of numbers, test if three points form a triangle and classify triangles as right
angled, isosceles, equilateral etc., roots of a quadratic equation, generation of simple patterns of
characters onscreen.

11
 UNIT 3: Arrays and pointers (12 Lectures)

Storage classes: Automatic, External, Static, Register. Scope and lifetime of variables. Arrays and
pointers and corresponding operators. Pointer arithmetic. Programs using arrays and pointers
like sum, average, minimum, maximum of an array of numbers. Add and delete an
element of an array. Merge two sorted arrays. String manipulation programs like string
concatenation, palindrome, reverse, copy etc. Matrix manipulation like Sum of rows,
columns, and diagonal elements of a matrix, transpose of a matrix.
UNIT 4: Searching and Sorting (4 Lectures)

Linear search, binary search. Selection sort and bubble sort.

UNIT 5: Structures and Files (10 Lectures)

Structure – declaration and use. Structure member resolution and structure pointer member
resolution operators. Programs to show the use of structure. Standard C library.

Files in C—opening, closing, reading and writing of files. Seeking forward and backward.
Simple examples of file handling programs.

LABORATORY

At least 20 programming assignments have to be done by each student from the

following list. The assignments should be selected in such a way that all the features
of C language are included.

1. Write a program to convert a given temperature value from Fahrenheit scale to

Centigrade scale and vice versa.
2. Write a program to display ASCII value of a character.
3. Write a program to check whether a number is perfect or not.
4. Write a program to find out the biggest of three numbers using nested if.
5. A company insures its drivers if either of the following conditions are satisfied
Driver is married.

Driver is an unmarried, male and above 30 years of age. Driver is unmarried, female and above
25 years of age.
Write a program to decide if a driver is to be insured using logical operators.
6. Write a program to read a list of positive integers terminated by -1 and display the odd and even
numbers separately and also their respective counts.
7. Write a program to read values of n and x and print the value of y using switch case where

12
a. y=n+x when n=1
b. y=1+x/n when n=2
c. y=n+3x when n=3
d. y=1+nx when n>3 or n<1.
8. Write a program to n values of sales and then calculate the commission on sales amount where
the commission is calculated as follows:
a. If sales <= Rs.500, commission is5%.
b. If sales > 500 but <= 2000, commission is Rs 35 plus 10% above Rs500.
c. If sales > 2000 but <= 5000, commission is Rs 185 plus 12% aboveRs.2000.
d. If sales >5000, commission is12.5%.
9. Write a program to find out minimum, maximum, sum and average of n numbers without using
array.
10. Program to find mean and standard deviation (SD) for a set of n numbers without using array.
11. Write a program to find out the roots of a quadratic equation. Use proper testing to find checks
for real and complex roots.
12. Write a program to print the digits of a number in words. (eg. if a number 841 is entered through
the keyboard your program should print ―Eight Four One‖.)
13. Write a program to print the PASCAL Triangle up to the n-th row where n is an input to the
program.
14. Write a function to return the HCF of two positive integers. Write a main function to read two
positive integers and print their HCF and LCM by using the above function.
15. Write a program to convert a decimal number into binary number using function.
16. Write a program to display the result of sine series using function.
17. Write a program to find the sum of the following series

1+x-x^3/3!+x^5/5!-x^7/7!+ . . . . . corrected up to the 3 decimal place.

18. Write a program to read n numbers in a sorted array and insert a given element in a particular
position
19. Write functions to compute the factorial of a number using both recursive and non-recursive
procedure.
20. Writeaprogramtoprintthevaluesofncrandnprforgivenpositiveintegersn r>
0. Use a function fact(n) to return the factorial of a non-negative integern.
n n
cr=n!/r!*(n-r)! pr=n!/(n-r)!

21. Write a program to display the first n Fibonacci numbers using function.
22. Write a program to display the prime numbers within a given range. Write a function to check
whether a given integer is prime or not and use it.
23. Write a program to Multiply two matrices using function.

13
24. Write a program to display the upper Triangle and lower Triangle of a given square
Matrix using function.
25. Write a function to check if a given square matrix is symmetric or not. Write a main function
to implement it.
26. Write a program to read a m X n matrix and calculate the Row sum and Column Sum of the
matrix
27. Write a function to read in an integer and print the representation of the number using the sign
and magnitude representation scheme using 8 bits. The program should check for
overflow/under flow conditions. The left most bit is to be used as the sign bit.
28. Write a program to merge two sorted arrays.
29. Write a program to implement selection sort using function.
30. Write a program to count the number of vowels in a string.
31. Write a program to concatenate two strings using function (without using library function).
32. Write a program to convert a string from upper case to lower case and vice versa.
33. Write a program to swap two numbers using function (pass the pointers).
34. Write a program to sort n number of strings in ascending order using pointer.
35. Write a program using pointers to copy a string to another string variable (without using
library function).
36. Declare a structure of a student with details like roll number, student name and total marks.
Using this, declare an array with 50 elements. Write a program to read details of n students
and print the list of students who have scored 75 marks and above.
37. Create a structure to store the following information of employees.
a. Employee‘s number, name, pay and date of joining.

It has been decided to increase the pay as per the following rules: Pay<= Rs.3000 :
20%increase
Pay <= Rs.6000 but>Rs.3000 :15% increase
Pay>Rs.6000 :no increase
Write a program to implement the above structure.
38. Write a program to read a text file and count the number of vowels in the text file.
39. Write a program to copy a text file to another file.

REFERENCE BOOKS

B.S. Gottfried, Programming with C, Tata McGraw Hill

E..Balagurusamy, Programming in ANSI C, Tata McGraw Hill

B.W. Kernighan and D.M.Ritchie, The C Programming Language,

PHI Anita Goel, Computer Fundamentals, Pearson, 2010

14
 1Y3BSIT-102: MATHEMATICS- I
UNIT 1: Sets, Relations and Functions (10 Lectures)

Sets, relations, properties of binary relations, closures of relation, equivalence relations,

equivalence classes and partitions. Partial ordering relations and lattices. Functions, oneto
one and onto, principles of mathematical induction.
UNIT 2: Graph Theory (10 Lectures)

Basic Definition of graph. Connectivity of graph, cut points cycles, Hamiltonian graphs, trees,
different Characterization of trees, bipartite graph, Algorithms on graph, Breadth first
search, Depth first search.
UNIT 3: Combinatorics (10 Lectures)

Basic of counting principles, principle of inclusion exclusion, application of inclusion and

exclusion. Pigeonhole principle, generalized Pigeonhole principle and its application,
permutations and combinations, permutations with repetitions, combinations with
repetitions, permutations of sets with indistinguishable objects.
UNIT 4: Matrices (10 Lectures)

Row and column operations, vectors and matrices, partitioning of matrices, representing relations
using matrices, Determinant of a square matrix, minor, cofactor, the Cayley Hamilton
theorem, inverse of a matrix, product form of inverse. Rank of a matrix. Solutions of
simultaneous linear equations, existence of solutions, solution by Gaussian elimination,
Eigen values and Eigenvectors.
UNIT 5: Logic (10 Lectures)

Connectives, truth tables, normal forms CNF, DNF, Converting expressions to CNF and
DNF, Theory of inference, Prepositional calculus. Boolean Algebra. Predicate calculus
(only introduction), predicates and quantifiers.
UNIT 6: Vector Space (10 Lectures)

Definition and examples of vector spaces. Elementary properties of R as a vector space.

Subspaces of a vector space. Union, intersection and sum of two subspaces. Subspaces
generated by a subset of a vector space. Definition, example and properties of linearly
independent and dependent set of vectors. Basis and dimension of a vector space. Examples
of finite dimensional vector spaces.

15
 REFERENCE BOOKS

1. Kolman /Rahman,Discrete Mathematical Structure, Peason Education.

2. K. H. Rosen, Discrete Mathematics and its Applications, Mc-Graw Hill InternationalEd.
3. J. P. Tremblayand R.Manohar,Discrete Mathematics structures with applications to
Computer Science, Mc-Graw Hill.
4. N. Ch. S.N. Iyengar, K. A. Venkatesh, V. M. Chandrasekaran, P. S. Arunachalam,
Discrete Mathematics, VikashPublishing House Pvt.Ltd.

1Y3BSIT-103: ENGLISH COMMUNICATION

UNIT-I (4 Lectures)

The Process of Communication: Communication, the Process of Communication, Barriers of

Communication, Different Types of Communication, Characteristics and Conventions of Conversation,
Conversational Problems of Second/Foreign Language Users, Difference Between Conversation and
Other Speech Events

UNIT- II (4 Lectures)

Telephone Techniques: Speaking and Listening, Conference Calls, Vocabulary Building,

Writing, Grammar and Usage, Pronunciation, Job Applications and Interviews: Reading, Curriculum
Vitae, Preparing for an Interview, Listening and Speaking in the Interviews Group Discussions: Group-
Discussion, Study Skills, Language Focus, Speaking.

UNIT- III (4 Lectures)

Soft Skills Practice, Personality Development, Participating in Group Discussion and Job Interviews,
Time Management Presentation Skills, Leadership Skills, Assertiveness, Lateral Thinking, Team Work
and Interpersonal Skills, Emotional Intelligence, Self-Confidence and Courage, Attitude.

UNIT- IV (4 Lectures)

Speaking Skills and Presentation: Presentation Design and Delivery. Monologue Dialogue, Group
Discussion. Effective Communication/ Mis-Communication. Interview, Public Speech. Effective
Writing, Report Writing, Resume, Circular, Notice and letter Writing.

UNIT- V (4 Lectures)

Importance of English as a vehicle of Spoken and written Communication. Close Reading

Comprehension Summary Paraphrasing Analysis and Interpretation. Translation (from Indian language

16
to English and vice-versa). Introduction to Articles of eminent Indian authors. Short Stories of eminent
Indian authors.

References:
°
Darer. Shankar-Communication Skills in English Language
°
Dr. Uremia Rai and S.M.Rai- Business Communication
°
B. K. Das- an Introduction to Professional English and Soft Skills
°
Barun K. Mitra- Personality Development and Soft Skills
°
Shashikumar and Dhameja-Spoken English
°
Raymond Williams- English Grammar
°
Wren and Martin -English Grammar and Composition
°
Justin Seeley -Designing Presentation
°
Laura Bergelles- Public Speaking Foundations
°
M.a.K. Halliday- Spoken and Written Language
°
B Balasubriamaniam-Phonetics for Indian Students
° °
R C Sharma- Business Correspondence Dowel Jones- the
°
Handbook of English Phonetics Merriam Webster - Guide to
Business Correspondence.
°
Ashish Singh - How to Communicate Effectively

1Y3BSIT-104A: ICTHARDWARE
UNIT 1: (12 Lectures)

Evolution of computer system, Modern computer, Classification of computer, Personal computer

hardware: Monitor, Keyboard, Mouse, Scanner, printer, speaker
UNIT 2: (12 Lectures)

Hard Disk Drive: logical structure and file system, FAT, NTFS. Hard disk tools: Disk cleanup,
error checking, de fragmentation, scanning for virus, formatting, installing additional HDD.
New trends in HDD. Floppy Disk Drive

17
UNIT 3: (12 Lectures)

Optical Media, CDROM, theory of operation, drive speed, buffer, cache, CD-r, CD-W, DVD
ROM, DVD technology, preventive maintenance for DVD and CD drives, New
Technologies. Driver installation, Writing and cleaning CD and DVD.

UNIT 4: (12 Lectures)

Processor: Intel processor family. Latest trends in processor, Motherboard, Sockets and slots,
power connectors. Peripheral connectors. Bus slots, USB, pin connectors. Different kinds
of motherboards. RAM, different kinds of RAM. RAM up gradation. Cache and Virtual
Memory concept.
UNIT 5:
(12 Lectures)

SMPS. BIOS. Network Interface Card, network cabling, I/O Box, Switches, RJ 45 connectors,
Patch panel, Patch cord, racks, IP address.

LABORATORY

Each student should do at least 6 assignments (tasks) from the following list.

Objectives:
The Practical introduces the students to a personal computer and its basic peripherals, the process
of assembling a personal computer, installation of system software like Windows OS, LINUX
OS, device drivers. Basic system administration in Linux which includes: Basic Linux commands
in bash, Create hard and symbolic links, Text processing, using wildcards In addition hardware
and software level troubleshooting process, tips and tricks would be covered.

Different ways of hooking the PC on to the network and internet from home and workplace and
effectively usage of the internet. Configuring the TCP/IP setting. Usage of web browsers,
email, newsgroups and discussion forums would be covered. In addition, awareness of
cyber hygiene, i.e., protecting the personal computer from getting infected with the viruses,
worms and other cyber-attacks would be introduced.

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.
18
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.

Task 3: Every student should individually install MS windows 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: Basic commands in Linux

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. Installation of antivirus software, configure their personal
firewall and windows update on their computer. Then they need to customize their browsers
to block pop ups, block active x downloads to avoid viruses and/or worms.

REFERENCE BOOKS

1. Comdex: Hardware and Networking Course

Kit,DreamTechpress 2. Ron Gilster, PC hardware: A beginners
Guide,Tata Mc GrawHill.

19
 1Y3BSIT-104B: OFFICE AUTOMATION
UNIT 1: Word Processing (15 Lectures)

Introduction to Word Processing, Features, Learning document window, Creating,

Saving & Closing a document, opening an Existing document, editing a Document,
Formatting Features (Paragraph Formats, aligning text & paragraph, Border and
Shading, Header & Footers, Bullet & Numbering), Inserting & Editing a Table,
Inserting Picture, Checking & Spelling Correction, Page Setup, Print Preview,
Printing a document, Mail Merge, Document Template & Wizards.
UNIT 2: Spreadsheet (15 Lectures)

Introduction to Spreadsheet, creating, saving and editing a workbook, Inserting,

deleting
Worksheets, Opening & Moving around in existing worksheets, working with
Formula & Cell referencing, Functions, working with ranges - creating, editing and
selecting ranges, Format Feature: AutoFormat Feature, Changing alignment,
Character styles, Date Format, Border &Colors etc. Previewing & Printing a
worksheet, Creating Charts & Graphs. Database in worksheet, macro, linking and
embedding
UNIT 3: Presentation Tools (15 Lectures)

Creating & saving Presentations, opening an existing Presentation, working in

different views, working with slides, Adding and Formatting Text, Formatting
Paragraphs, Checking Spelling and correcting typing mistakes, adding clip art and
other pictures, Inserting Animation, designing slide shows, Running and controlling
slide show, Printing Presentation.

Portable Document Format: storing, creation, conversion.

UNIT 4: DTP Software (15 Lectures)

Local language pack in Office Packages: installation and use, Document design
using any DTP package, Graphics design and manipulation using any currently
available package

Practical / Lab work to be performed

(N.B: Students have to perform the following experiments and they are encouraged to work
in the Linux platform)

1. Create a new folder and do the following:

20
 • Make a word processing document in it.
• Make a Spreadsheet document in it.
• Make a new folder in it
• Rename the initial folder Move the initial folder Copy the initial
folder.
• Delete the initial folder
2. Implement the various well known features of the operating system such as Painting,
System tools,
Entertainment tools etc.
3. Implement various display properties by right clicking on the Desktop.
4. Explore the taskbar
5. Set the wall paper and screen saver.
6. Set the data/time.

Word Processing Tool

1. Create a document and
a. Put Bullets and Numbers
b. Apply various Font parameters.
c. Apply Left, Right, and Centre alignments.
d. Apply hyperlinks
e. Insert pictures
f. Insert ClipArt
g. Show the use of WordArt
h. Add Borders and Shading
i. Show the use of Find and Replace.
j. Apply header/footers
2. Create any document and show the use of File versions.
3. Create any document and show the difference between paste and paste special.
4. Create a document to show the use of Washout/Watermark.
5. Implement the concept of mail merge.
6. Implement the concept of macros.
7. Implement the concept of importing a file/document.
8. Implement the concept of merging the documents.
9. Crate a student table and do the following:
a. Insert new row and fill data
b. Delete any existing row
c. Resize rows and columns
d. Apply border and shading
e. Apply merging/splitting of cells
f. Apply sort
g. Apply various arithmetic and logical formulas.

21
 10. Create your resume using General Templates.

Spreadsheet Tool

1. Create a student worksheet containing roll numbers, names and total marks. Open a
document in
Word and insert the excel worksheet using: -
i) Copy/Paste ii) Embedding iii)
Linking

2. The term wise marks for APS class of 20 students are stored in 3 separate sheets named
term1, term2 and term3. Create 4th worksheet that contains student names and their total and
average marks for the entire year. Give proper headings using headers. Make the column
headings bold and italic. The 4th worksheet should contain college name as the first line.
Make it bold, italic and center it.

3. Using a simple pendulum, plot 1-T and 1-T2 graph.

2
I t1 t2 t3 Mean(t) T=t/20 T
70
80
90
100
4. Consider the following employee worksheet: -

Full Name Grade Basic HRA PF Gross Net (VA)

(First Last) 1/2/3 Salary Vehicle
Allowance

HRA is calculated as follows:

Grade HRA %(of Basic)
1 40%
2 35%
3 30%

Gross = Basic + HRA + VA Net = Gross –PF

22
PF is 8% for all Grades

VA is 15000, 10000 and 7000 for Grades 1, 2 and 3.

i) Find max, min and average salary
of employees in respective Grade
ii) Count no. of people where
VA>HRA iii) Find out
most frequently occurring grade.
iv) Extract records where employee name starts with “A” has HRA>10000
v) Print Grade wise report of all employees with subtotals of net salary and also
grand totals. Use subtotal command.
vi) Extract records where Grade is 1 or 2 and salary is between 10000 and 20000
both inclusive.

5.In a meeting of a marketing department of an organization it has been decided that price of
selling an item is fixed at Rs40. It was resolved to increases the sale of more of more items
and getting the profit of Rs40,000/. Use Goal Seek of find out how many items you will
have to sell to meet your profit figure.

6. To study the variation in volume with pressure for a sample of an air at constant temperature
by plotting a graph for P – V and P-I/V. Sample observations are:-

Pressure(P) Volume (V) I/V PV P/V

75 20
78.9 19
83.3 18
88.2 17
7. Plot the chart for marks obtained by the students (out of 5) vs. frequency (total number of
students in class is 50).

8. Create the following worksheet(s) containing a year wise sale figure of five salesmen in Rs.

Salesman 2002 2003 2004 2005

MOHAN 10000 12000 20000 50000
MITRA 15000 18000 50000 60000
SHIKHA 20000 22000 70000 70000
ROHIT 30000 30000 100000 80000
MANGLA 40000 45000 125000 90000

Apply the following Mathematical & Statistical functions:

i) Calculate the commission for each salesman under the condition: -
23
 a) If total sales are greater than Rs. 3, 00,000/-, then commission is 10% of
total sale made by the salesman.
b) Otherwise, 4% of total sale.
ii) Calculate the maximum sale made by each salesman.
iii) Calculate the maximum sale made in each year.
iv) Calculate the minimum sale made by each salesman. v) Calculate the minimum sale
made in each year.
vi) Count the no. of salespersons. vii) Calculate the cube of sales
made by Mohan in the year2002. viii) Find the difference in sales by
salesman Mitra between the year 2002 and 2003. Find the absolute
value of difference.
ix) Also calculate the Mode, Stddev, Variance, and Median for the sale made by each
salesman.
ix) Calculate the year wise Correlation coefficient between the sales man Mohan and
Mitra year wise

9.The following table gives a year wise sale figure of five salesmen in Rs.

Salesman 2000 2001 2002 2003

S1 10000 12000 20000 50000
S2 15000 18000 50000 60000
S3 20000 22000 70000 70000
S4 30000 30000 100000 80000
S5 40000 45000 125000 90000
i) Calculate total sale year wise. ii)
Calculate the net sales made by each
salesman
iii) Calculate the commission for each salesman under the condition: -
a) If total sales are greater than Rs. 4, 00,000/-, then commission is 5% of total
sale made by the salesman.
b) Otherwise, 2% of total sale.
iv) Calculate the maximum sale made by each
salesman. v) Calculate the maximum sale made in each
year.
vi) Draw a bar graph representing the sale made by each salesman.
vii) Draw a pie graph representing the sale made by salesmen in
year2001.

10. Consider the following worksheet for APS 1st year students: -
S. No. Name PH CH BY MT CS Total % Grade
Marks
24
 1
2

Grade is calculated as follows: -

If%>=90 Grade A If %>=80 &<90 Grade B If % >=70 &<80 Grade C If % >=60

&<70 Grade D

Otherwise students will be declared fail.

i) Calculate Grade using if function ii) Sort the data according to total marks
iii) Apply filter to display the marks of the students having more than
65%marks. iv) Draw a pie chart showing % marks scored in each subject by
the topper of the class. v) Draw the doughnut chart of the data as in(iv) vi)
Enter the S.No. of a student and find out the Grade of the student using
VLOOKUP.
vii) Extract all records where name
a) Begins with “A”
b) Contains “A”
c) Ends with “A”
Presentation Tool
1. Make a presentation of College Education System using
a. Blank Presentation
b. From Design Template
c. From Auto Content Wizard
2. Make a presentation on “Wild Life” and apply the following:
a. Add audio and video effects
b. Apply various Color Schemes
c. Apply various animation schemes.
d. Apply Slide Show REFERENCE BOOKS

1. Anita Goel, Computer Fundamentals, Pearson, 2012

25
 1Y3BSIT-201: DATA STRUCTURE ANDALGORITHM

UNIT 1: (10 Lectures)

Concept of Data Types, elementary structure, words and their interpretations, packed words
UNIT 2: (10 Lectures)

Arrays: Types, memory representation, address translation functions for one & two dimensional
arrays, different examples.

Linked Structure:

Singly and doubly linked list, circular and non-circular, list manipulation with pointers, example
involving insertion and deletion of elements and their comparative studies with
implementations using array structure
UNIT 3: (10 Lectures)

Stacks and Queues

Definitions, representation using array and linked list structure, application of stack and queues
in simulation, postfix conversion and evolution of arithmetic expressions
UNIT4: (10 Lectures)

Binary Trees
Definition, quantitative properties, memory representation, Trees traversal algorithms (recursive
and non-recursive), threaded trees. BFS and DFS

UNIT 5: (10 Lectures)

Sorting and Searching

Linear and binary search algorithms, performance and complexity, binary search trees
(construction, insertion, deletion and search) Concept of optimal binary search trees,
Terminology, performance evaluation, sorting algorithms (non recursive, recursive
description, Complexity, advantages and disadvantage, implementation) Bubble sort,
insertion sort, selection sort, heap sort, quick sort, merge sort & radix sort, External Sorting.

26
UNIT 6: (10 Lectures)
Analysis of Algorithm

Time and Space complexity of algorithms, average case and worst case analysis, asymptotic
notation as a measure of algorithm complexity, O and notations, Analysis of sorting algorithms-
Selection sort, Bubble sort, Insertion sort, Heap sort, Quick sort and analysis of searching
algorithms – linear search and binary search.

LABORATORY

Write programs using C language

Each student should do at least 12 assignments from the following list.
1. Implement binary search and linear search algorithms on arrays.
2. Implement following sorting algorithms:
i) Bubble sorting ii) Insertion sort iii)
Heapsort iv) Quicksort
v) Merge sort

3. Write a program to create a singly linked list and insert an element at the beginning,
end, and at a given position of the linked list.
4. Write a program to create a singly linked list and delete an element from any
position of the linked list.
5. Write a program to create a singly linked list. Write functions for
i) counting the number of elements in a
list
ii.to search for a given element in a list. If the item has been
found, then it should return the position at which the item was
found; otherwise it should return -1 to indicate not found.
6. Write a function to concatenate two linked lists.
7. Write a function to merge two sorted linked lists.
8. Write a program to create a doubly linked list and insert an element at any position.
9. Write a program to create a doubly linked list and delete an element from a given
position.
10. Write a program to create a circular linked list and insert / delete an element at any
position. 11. Write a program to implement a stack using
i) array
structure
ii) linked list
structure
12. Write a program to implement two stacks using a single array.
13. Write a program to evaluate a postfix expression using stack.
14. Write a program to convert an infix expression into a post fix expression.

27
 15. Write a program to implement a queue using array.
16. Write a program to implement a queue using linked list.
17. Write a program to implement a circular queue using array.
18. Write a program to implement a circular queue using linked list.
19. Write a program to create a binary search tree using link representation and display
the elements in preorder, in order and post order using recursive function.
20. Write a program to create a binary search tree using link representation and i)
search ii) delete an item from the binary search tree.
REFERENCE BOOKS

1. Horowitz and Sahani, Narosa,Data Structure

2. A.N.Kamthane, Introduction to Data Structures in C, Pearson,2007.
3. Langsam, Augentein and Tanenbaum,Data Structure using C and C++, PHI 4.
S.K.Bandyopadhyay, K.N.Dey,Data Structures using C, Pearson.

1Y3BSIT-202: DIGITALLOGIC

UNIT 1: Boolean algebra and Logic gates (12 Lectures)

Boolean operators, axiomatic definition of Boolean algebra, Rules (postulates and basic
theorems) of Boolean algebra, dual and complement of Boolean expression, Canonical form and
Standard form, Sum of product and product of sum for m. Conversion between Boolean
expression and truth table. Boolean expression and their simplification by algebraic method,
Karnaugh map method (till four variable k-map) and Quine Mc Cluskey method, Don't care
condition. Logic gates:
Different types of gates, Implementation of logic expression with logic gates.

UNIT 2: Combinational circuit (12 Lectures)

Adder: half adder, full adder, parallel binary adder, Subtracters: half subtracter and full
subtracter, Magnitude comparator, Decoder, Encoder, Application examples of decoder
and encoder, Multiplexer, Demultiplexer, Application examples of multiplexer and
demultiplexer, programmable logic Array (PLA)
UNIT 3: Sequential Circuit (12 Lectures)

Simple RS flipflop or latch, Clocked RS flipflop, D flipflop, JK flipflop, T flipf lop, Edge
triggered flipflop (SR, D, JK), Asynchronous preset and clear inputs, master Slave Flip
Flop, JK Master slave flip flop., edge triggering and level triggering. Analysis of Clocked
Sequential circuits, State Reduction and Assignment, Flip–Flop Excitation tables. Design
Procedure for sequential circuits.

28
 UNIT 4: Counters (12 Lectures)

Ripple counters: Binary Ripple Counter, BCD Ripple Counter. Synchronous Counters: Binary
Counter, Binary Up and down Counter, BCD Counter, Timing Sequences. Ring counter
and Johnson counter. Counter design using state diagram, state table and state equation.

UNIT 5: Resisters and the Memory Unit (12 Lectures)

Resisters: Shift registers (serial in serial out, serial in parallel out, parallel in serial out, parallel
in parallel out), Resisters with parallel Load, Bidirectional shift resister with parallel load.

Memory Unit: Semiconductor memory: RAM, RAM Family, Examples of RAM: Integrated
circuit Memory, Magnetic core Memory, Cache memory. Flash memory, Basic flash
memory, Comparison of flash memory with other memories, SIMM and DIMM.

REFERENCE BOOKS

1. Digital Logic and Computer Design, Morris M.Mano

2. Digital Fundamentals, Floyd andJain

1Y3BSIT-203: ENVIRONMENTAL SCIENCE

UNIT-I (6 Lectures)

The Multidisciplinary nature of environmental studies and Natural resources. Definition; Scope and
importance, Need for public awareness. Natural resources and associated problems. Forest resources:
Use and Over-exploitation, deforestation, case studies. Timber extraction, mining, dams and their effects
on forests and tribal people. Water resources: Use and over-utilization of surface and ground water,
floods, drought, conflicts over water, dam’s benefits and problems. Mineral resources: Use and
exploitation, environmental effects of extracting and using mineral resources, case studies. Food
resources: World food problems, changes caused by agriculture and overgrazing, effects of modern
agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. Energy resources:
Growing energy needs, renewable and non-renewable energy sources, use of alternate energy sources,
Case studies.
UNIT-II (4 Lectures)

Ecosystems, Biodiversity and its Conservation. Concept, structure and function of an ecosystem,
producers, consumers and decomposers, energy flow in the ecosystem, ecological succession, food
chains, food webs and ecological pyramids. Introduction, types, characteristic features, structure and

29
function of the following ecosystem: - Forest ecosystem, Grassland ecosystem, Desert ecosystem,
Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries).

UNIT-III (5 Lectures)

Environmental Pollution. Definitions. Causes, effects and control measures of: (a) Air
pollution (b) Water pollution (c) Soil pollution (d) Marine pollution (e) Noise pollution
(f) Thermal pollution (g) Nuclear hazards.
Solid waste Management: Causes, effects and control measures of urban and industrial wastes. Role of
an individual in prevention of pollution. Pollution case studies. Disaster management:
floods, earthquake, cyclone and landslides.
UNIT-IV (5 Lectures)

Social Issues and the Environment. From Unsustainable to Sustainable development. Urban problems
related to energy. Water conservation, rain water harvesting, watershed management. Resettlement and
rehabilitation of people; its problems and concerns. Case studies. Environmental ethics: Issues and
possible solutions. Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents
and holocaust. Case studies. Wasteland reclamation, Consumerism and waste products. Environment
Protection Act- Air (Prevention and Control of Pollution) Act, Water (Prevention and Control of
Pollution) Act, Wildlife Protection Act. - Forest Conservation Act, Issues involved in enforcement of
environmental legislation, Public awareness.

References:
°
Environmental Studies For Undergraduate Courses - UGC e-Text book by Erach Bharucha available
at http://www.ugc.ac.in/oldpdf/modelcurriculum/env.pdf

1Y3BSIT-204A: MATHEMATICS-II

UNIT 1: Sequence and Series (12 Lectures)

Sequence of real numbers, bounded, convergent and non-convergent sequences, Uniqueness of

the limit and bounds of a convergent sequence, Cauchy sequence, Cauchy's general
principle of convergence (proof of the necessary part only). Sub sequences, convergence
and divergence of monotonic sequences. Algebraic operations on limit (statements of the
theorems without proof), Infinite series, statements of basic properties of infinite series
(without proof), Absolute and conditional convergence, Tests for convergence:
Comparison test, Ratio test.

30
UNIT 2: Trigonometry (12 Lectures)

Geometrical representation of complex numbers the Argand plane. Polar form of a complex
number. Modulus, amplitude and their various properties. De Moiver's theorem. Expansion
of cos(x) and sin(x) in positive integral powers of x. Gregory‘s series, Hyperbolic functions.
UNIT 3: Abstract Algebra (12 Lectures)

Group Theory:

Definition and examples of groups. Per mutation group and cyclic group. Subgroups and Cossets
Lagrange's theorem on the order of a subgroup of a finite group. Normal subgroups.
Quotient groups. Homomorphism of Group; properties of Homomorphism; isomorphism
of group.
Ring Theory:

Definition and examples. Simple property of Rings. Integral domain, Field and their elementary
properties.
UNIT 4: (12 Lectures)

Relation between the roots and Coefficients of a general Polynomial equation in one variable.
Transformation of equations Descartes’ rule of signs, Symmetric functions of roots;
Solution of Cubic equation by Cordon’s Methods.
UNIT 5: Calculus (12 Lectures)

Roll's theorem, Lagrange ‘s Mean Value theorem and Taylor‘s theorem. Meaning of the sign of
derivative. Indeterminate forms, maxima and minima (single variable).

REFERENCE BOOKS

1. S. K. Mapa;Higher Algebra (Classical); Ashok Prakashan,Kolkata.

2. Das and Mukherjee, Higher Trigonometry, U. N. Dhur andSons.
3. V. K. Khanna & KS. K. Bhambri, A course in Abstract Algebra; VikasPub. House, Pvt. Ltd.,
NewDelhi.
4. S. Singh and Q. Zameerruddin; Modern Algebra; VikasPub. House, Pvt. Ltd., NewDelhi.

1Y3BSIT-204B: Programming in C++

UNIT 1: Introduction to C++ (3 Lectures)

History of C and C++, Overview of Procedural Programming and Object-Orientation Programming,

Using main () function, Compiling and Executing Simple Programs in C++.

31
UNIT 2: Data Types, Variables, Constants, Operators and Basic I/O (5 Lectures)

Declaring, Defining and Initializing Variables, Scope of Variables, Using Named Constants,
Keywords, Data Types, Casting of Data Types, Operators (Arithmetic, Logical and Bitwise),
Using Comments in programs, Character I/O, Formatted and Console I/O (cin, cout), Using Basic
Header Files (stdio.h, iostream.h, conio.hetc.).

UNIT 3: Expressions, Conditional Statements and Iterative Statements (6 Lectures)

Simple Expressions in C++ (including Unary Operator Expressions, Binary Operator

Expressions), Understanding Operators Precedence in Expressions, Conditional Statements (if
construct, switch-case construct), Understanding syntax and utility of Iterative Statements (while,
do-while, and for loops), Use of break and continue in Loops, Using Nested Statements
(Conditional as well as Iterative)

UNIT 4: Functions and Arrays (6 Lectures)

Utility of functions, Call by Value, Call by Reference, Functions returning value, Void functions,
Inline Functions, Return data type of functions, Functions parameters, Differentiating between
Declaration and Definition of Functions, Command Line Arguments/Parameters in Functions,
Functions with variable number of Arguments.

Creating and Using One Dimensional Arrays (Declaring and Defining an Array, initializing an
Array, Accessing individual elements in an Array, Manipulating array elements using loops), Use
Various types of arrays (integer, float and character arrays / Strings) Two-dimensional Arrays
(Declaring, Defining and Initializing Two Dimensional Array, Working with Rows and
Columns), Introduction to Multi-dimensional arrays

UNIT 5: Derived Data Types (Structures and Unions) (6 Lectures)

Understanding utility of structures and unions, Declaring, initializing and using simple structures
and unions, manipulating individual members of structures and unions, Array of Structures,
Individual data members as structures, Passing and returning structures from functions, Structure
with union as members, Union with structures as members.

UNIT 6: Pointers and References in C++ (6 Lectures)

Understanding a Pointer Variable, Simple use of Pointers (Declaring and Dereferencing Pointers
to simple variables), Pointers to Pointers, Pointers to structures, Problems with Pointers, Passing
pointers as function arguments, Returning a pointer from a function, using arrays as pointers,
Passing arrays to functions. Pointers vs. References, Declaring and initializing references, using
references as function arguments and function return values

32
UNIT 7: Memory Allocation in C++ (6 Lectures)

Differentiating between static and dynamic memory allocation, use of new and delete operators,
storage of variables in static and dynamic memory allocation

UNIT 8: File I/O, Pre-processor Directives (6 Lectures)

Opening and closing a file (use of fstream header file, ifstream, ofstream and fstream classes),
Reading and writing Text Files, using put (), get (), read () and write () functions, Random access
in files, Understanding the Preprocessor Directives (#include, #define), Macros

UNIT 9: Using Classes in C++ (6 Lectures)

Principles of Object-Oriented Programming, Defining & Using Classes, Class Constructors,

Constructor Overloading, Function overloading in classes, Class Variables &Functions, Objects as
parameters, specifying the Protected and Private Access, Copy Constructors, Overview of
Template classes and their use.

UNIT 10: Overview of Function Overloading and Operator Overloading (5 Lectures)

Need of Overloading functions and operators, overloading functions by number and type of
arguments, looking at an operator as a function call, Overloading Operators (including assignment
operators, unary operators)

UNIT 11: Inheritance, Polymorphism and Exception Handling (5

Lectures)

Introduction to Inheritance (Multi-Level Inheritance, Multiple Inheritance), Polymorphism

(Virtual Functions, Pure Virtual Functions), Basics Exceptional Handling (using catch and throw,
multiple catch statements), Catching all exceptions, Restricting exceptions, Re throwing
exceptions.

Practical / Lab work to be performed

1. Write a program to find greatest of three numbers.
2. Write a program to find gross salary of a person
3. Write a program to find grade of a student given his marks.
4. Write a program to find divisor or factorial of a given number.
5. Write a program to print first ten natural numbers.
6. Write a program to print first ten even and odd numbers.
7. Write a program to find grade of a list of students given their marks.
8. Create Matrix class. Write a menu-driven program to perform following Matrix
operations (2-D array implementation):
a) Sum b) Difference c) Product d) Transpose

33
REFERENCE BOOKS

1. Herbtz Schildt, "C++: The Complete Reference", Fourth Edition, McGraw Hill.2003
2. Bjarne Stroustrup, "The C++ Programming Language", 4th Edition, Addison-Wesley,
2013.
3. Bjarne Stroustroup, "Programming -- Principles and Practice using C++", 2nd Edition,
Addison-Wesley 2014.
4. E Balaguruswamy, "Object Oriented Programming with C++", Tata McGraw-Hill
Education, 2008.
5. Paul Deitel, Harvey Deitel, "C++ How to Program", 8th Edition, Prentice Hall, 2011.
6. John R. Hubbard, "Programming with C++", Schaum's Series, 2nd Edition, 2000.
7. Andrew Koeni, Barbara, E. Moo, "Accelerated C++", Published by Addison-Wesley,
2000.
8. Scott Meyers, "Effective C++", 3rd Edition, Published by Addison-Wesley, 2005.
9. Harry, H. Chaudhary, "Head First C++ Programming: The Definitive Beginner’s Guide",
First Create space Inc, O-D Publishing, LLC USA.2014
10. Walter Savitch, "Problem Solving with C++", Pearson Education, 2007.
11. Stanley B. Lippman, JoseeLajoie, Barbara E. Moo, "C++ Primer", Published by
AddisonWesley, 5th Edition, 2012
1Y3BSIT301: COMPUTER ORGANIZATION

UNIT 1: Introduction (10 Lectures)

Functional units of a computer, basic instructions, interconnection of functional units, bus

structure, memory locations, memory addresses, memory operations, instruction and
instruction sequencing (straight Line sequencing and branching), addressing modes,
introduction to assembly language, stack, subroutine, I/O instructions.
UNIT 2: Register Transfer Logic (10 Lectures)

Introduction, inter register transfer, arithmetic micro operation, logic micro operation, shift
micro operation, Conditional control statements, fixed point binary data, instruction code,
design of a simple computer.
UNIT 3: Processor Logic Design (10 Lectures)

Processor organization, design of arithmetic and logic unit, status register, design of accumulator.

34
UNIT 4: Control Logic Design (10 Lectures)

Hardware control, microprogrammed control block diagram, symbolic microprogram,

microprogrammed CPU organization

UNIT 5: I/O Subsystem (10 Lectures)

Program controlled I/O, Interrupts: enabling and disabling interrupts, handling interrupts from
multiple sources (priority control), DMA, structure and working of hard disk, CDROM, printer.
UNIT 6: Memory subsystem (10 Lectures)

Semiconductor memory, SRAM, DRAM, ROM, speed size and cost, Cache memory, Mapping
functions, replacement algorithms

REFERENCE BOOKS

1. M.Morris Mano, Computer System Architecture,

PHIpublication 2. Hamachar, VranesicandZaky,Computer
Architecture.

1Y3BSIT-302: OPERATING SYSTEM

UNIT 1: Introduction (12 Lectures)

What is an operating system? evolution of operating systems, simple batch systems, time-
sharing systems, personal computer systems, parallel systems, distributed systems, real
time systems, and functions of operating systems.
UNIT 2: Memory Management (12 Lectures)

Logical versus physical address space, swapping. Contiguous allocation, paging,

segmentation, fragmentation, segmentation with paging, protection

Virtual Memory: paging, demand paging, page replacement algorithms, page tables, TLBs-
translation look aside buffers, inverted page tables, thrashing.

UNIT 3: Processes and Threads (12 Lectures)

Processes: Process model, process creation, process termination, Process hierarchies,

process states, implementation of processes.

Threads: The thread model, thread usage, threads in user space and kernel, threads in Linux
Inter process Communication: race conditions, critical regions, mutual exclusion with busy
waiting, sleep and wakeup, semaphores, message passing, mail box, inter process

35
 communication in Linux Classical IPC problems: the dining philosophers problem, the
readers and writers problem, the sleeping barber problem.

Scheduling: introduction to scheduling, scheduling in batch system and interactive systems,

scheduling in real time systems, policy versus mechanism, thread scheduling.
UNIT 4: Deadlocks (12 Lectures)

System model, conditions for deadlock, conditions for deadlock modeling, deadlock
detection with one and multiple resource of each type, recovery from deadlock, deadlock
avoidance, deadlock prevention

Secondary storage Structure: Disk structure, disk scheduling, disk management, disk
reliability.

Device Management: Techniques for device management, dedicated devices, shared

devices, storage devices, buffering
Principles of I/O hardware: I/O devices, device controller, memory mapped I/O, direct
memory access
Principle of I/O software: programmed I/O, interrupt driven I/O, I/O using DMA.
I/O software layers: Interrupt handlers, device drivers, device independent I/O software,
User space I/O software.

Disks: Disk for matting, disk arm scheduling algorithm.

UNIT 5: File System (12 Lectures)

File Concept, file structure, file types, file access, file attributes, file operation, directory
structure, directory operations, Linux file system ,file system structure, implementing files,
implementing directories, shared files ,file system reliability, file system
performance, allocation methods, free space management. File system calls in Linux,
Structure of ext2 file system. Ext3 file system and journaling.

Practical

Each student should do at least 12 assignments from the following list.

1. Write a program to create a child process that starts looping and then terminates.
2. Write a program to Show that the child can be set up to ignore a signal from its parent.
3. Write a program to Show that a process can ignore a signal.
4. Write a program to Create a thread in which prints "We are proud to be Indians" and
terminates.

36
 5. Write a program to demonstrate how to "wait" for thread completions by using the P thread
join routine. Threads are explicitly created in a joinable state.
6. Write a program to create a thread in which print "We are proud to be Indians" and pass
multiple arguments using structure during its creation.
7. Write a program to compute the dot product of two vectors.
8. Write a program to compute the dot product of two vectors and also show the use of mutex
variables.
9. Write a program to create threads, the main thread creates three threads. Two of these
threads increment a counter variable while third thread watches the value of the counter
variable. When the counter variable reaches a predefined limit, the waiting thread is
signaled by one of the incrementing threads. The waiting thread "awakens" and then
modifies the counter. The program continues until the incrementing threads reach a final
value and also print the final value.
10. Write a program to fork () a child process so that we have two processes running: Each
process communicates via a semaphore. The respective process can only do its work (not
much here) When it notices that the semaphore track is free when it returns to 0. Each
process must modify the semaphore accordingly.
11. Write a program to show how 2 processes can talk to each other using kill () and signal
().
We will fork () 2 process and let the parent send a few signals to its child.
12. Write a program to show attaching and detaching shared memory.
13. Write a program to show the communication between two processes through shared
memory.
14. Write a program to implement Banker‘s Algorithm.
15. Write a program to simulate synchronization of Sleeping Barber problem.
16. Write a program to simulate Dining Philosophers Algorithm.

REFERENCE BOOKS

1. Tanenbaum― Modern OperatingSystems

2. Silberschatz , Galvin, Gang , Operating systemconcepts

37
 1Y3BSIT-303: DATABASE MANAGEMENTSYSTEMS

UNIT 1: File structure (15 Lectures)

Record storage and primary file organization: memory hierarchies and storage devices, Storage
of Databases, placing file records on disks: Records and its Types, Files, fixed length records
and variable length records, Record Blocking, allocating file blocks on disks, operation on files.
Issues in Physical Design: Concept of indexes

UNIT 2: Overview of Database Management System: (15 Lectures)

Definition of Database, Traditional File Approach vs. DBMS approach, Characteristics of The
Database approach, DBMS user, Role of a DBA, Advantage of using DBMS, DBMS
architecture, Data independence ANSI/SPARC 3 level architecture.
UNIT 3: Relational Models (15 Lectures)

Fundamental integrity rules: entity integrity, referential integrity, Relational algebra (Select
, Project,Cross ,Product , theta join, equi join, natural join, outer join ),Set Operation ANSI
SQL – 92Standard: DDL, DML, SQL constructs (Select .. From… Where… Group by
Having … Order by….), Insert, Delete, Update, View, Definition and use, nested quires,
Constraints considers (NOT NULL , UNIQUE, Check Primary key. Foreignkey)

UNIT 4: Database Design (15 Lectures)

Conceptual model, logical model, physical model, ER model as a tool for conceptual design
entities, attributes and relationships, weak and strong entities, conversion of ER model into
relational schema.

Normalization: informal design guidelines for relational schemas (overview level),

functional dependencies, different types of keys. Normal forms (first, second, third,
BCNF).

PRACTICAL

Each student should do at least 6 assignments from the following list.

38
Create a table Employee with the following columns:

Emp_no,(numeric) primarykey

Emp_name (string)

Join_date (Date)

Basic_pay_fixed_at (numeric)

Date_of_birth (Date)

Insert the following data into the table.

Emp_no. Emp_name Join_date Basic_pay_fixed_at Date_of_birth 1001 Charles Babbage

01-Jun-2000 8000.00 03-10-1973

1002 George Boole 01-Jul-2001 5000.00 04-12-1972

1003 E.F. Codd 01-Jun-2001 8000.00 06-03-1969

1004 Bill Gates 01-Jul-2003 5000.00 09-10-1995

1005 Tony Greig 01-Aug-2004 8000.00 04-05-1985

Create the following two tables and insert data into thetables.

Player (Roll no.→Primary Key)

Roll no. Name

10 VijayAmrithraj

39
20 LeanderPaes

30 MaheshBhupathi

40 SaniaMirza

Match (Match_no→Primarykey,Rollno→Foreign key)

Match_no Roll_no. Match_Date Opponent

1 20 10-Jul-2008 Washington
2 30 12-Jan-2008 Sampras

3 20 12-Aug-2008 Borg
4 30 20-Mar-2008 Vijay

Perform the following two operations:

(i) Perform EQUIJOIN operation to retrieve data from both the files.
(ii) Perform OUTERJOIN operation to retrieve the unmatched records.

2. Design an ER diagram for a BANK database schema. To consider that each Bank
can have multiple branches, and each branch can have multiple Accounts and
Loans for customer. Also to specify the non-weak & weak entity types, key
attributes & key types, relationship types, instances, constraints and
participations.

3. Create a table Student taking the attributes given bellow

Roll_no, Student_name, Address,

Date_of_addmission, Class Section andContact_no.

Write appropriate queries to perform the following operations:

40
 a) To insert values in the Studenttable.

b) To delete values from Studenttable

c) To list the names of all students which roll_no>20.

d) To search for students who got admitted before01-01-2006.

e) To change the name of the student whose roll number is 10 toAmar.

4. Create tables Department and Employee with the attributes

given bellow. Employee (EmpNo , Empname,

Address,Dno)

Department ( Dno, Dname, Location ) Dno in Employee is a foreign key.

Write appropriate queries to perform the following operations:

a) To insert values in thetables.

b) To retrieve the names and addresses of all Employees working in the Finance
department.
c) To print the location where Administration department islocated.
d) To delete all information regarding a particularemployee.

Create table Student and Course taking the attributes given bellow.

Student (Roll_no, Name, Semester, Course_no(Foreign key))

Course (Course_no, Course_name)

Write appropriate queries for the following operations:

e) To retrieve names of all students who are admitted to the course‗BCA‘.

41
 f) To retrieve the names of all students who sec ours enameis‗BCA
‘andwhoareinthe3rd
semester.

g) To display details of all courses in which more than 100 students got admitted.

h) For course being offered, display the course name and number of students
admitted to the course.

5. Create tables Employee, Department, Location, Works_on, and Project taking

the attributes given bellow.

Employee (Fname, Lname, Empno, Bdate, Address, Salary, Dnumber )

Department
(Dname,Dnumber,Mgrno)
Locations (Dnumber, DLocation) Works_on(Empno, Pnumber, Hours_per_day)

Project (Pname, Pnumber, Location,Dnumber (Foreign)) Dependent(Empno, Dependent_name,

Sex, DOB, Relationship)

Write appropriate queries for the following operations:

a) Retrieve the names and addresses of all employees who work in the Finance
department.

b) To retrieve the names of all employees who works on all the projects controlled by
department number6

c) For each department, print the name of the department and the name of the manager
of the department.

d) Retrieve the location where the Administration department is located.

e) For every project located in Mumbai list the project number, the controlling
department and department manger‘s name and address.
f) Find out how many employees are there in each department.
g) Find the total salary of all employees of the ― Research ‖department, as well as the
maximum, minimum and average salary in this department
h) Retrieve the name of all employees who have no dependent.
i) Alter the ―Employee‖ table by deleting the column Date.

42
 j) Retrieve the Fname, Lname of all employees whose salary is higher than average
salary.
k) For each department retrieve the department number, the number of employee in
the department and their average salary.
l) Retrieve the name of all employees who have two or more dependent
m) Retrieve the details of all employees who works on project number1,2,3

6. Create Table

Client_master (Client_no,name, address, Bdue)

Product_master(P_number,Description,saleprice,costprice)
Sales_master(Salesmno,Sname,Addres,Salamnt,Remarks)
Sales_order(O_no,Client_no,Odate,Delyaddr,Salesmno)
Sales_order_detail(Order_no,Product_no, Qtyorder, product_rate,Qty_dispatched)

Write appropriate queries to perform the following operations:

i) List name of all clients having ‗a‘as the second letter in their names.

ii) Retrieve the description and total Qty sold for each product.

iii) Find product no. and description of non-moving products (i.e. product not

being sold). iv)For each product being sold, list the product number and the total

amount (in Rs.) sold.

v) List all client who stay in ‗Bangalore‘or‗Mumbai‘

vi) List the clients who stay in a city whose First letter is‗M‘

vii) Find the names of clients who had purchased the item‗Trouser‘.

viii) Find out if T-Shirt ‘has been ordered by any client and if so print the details
of

The client.

ix) List details of all products whose unit price is more than Rs.5000.00.

43
 x) Calculate the total amount (in Rs.) purchased by each client that has
purchased items amounting more than Rs.20000.

7. Create table

Author (Author_id, Name, City, Country)

Catalog (Book_id, Title, Author1_id, Author2_id, Publisher_id, Category_id, Year, Price)

Publisher (Publisher_id, Name, City, Country)

Order_details(Order_no, Book_id, Quantity) Category(Category_id, Description)

Order_summary(Order_no,Member_id,Odate,Amount,Ostatus) Member(Member_id,
Name, Address, Contact)

Assume that all books have at most two authors.

Write appropriate queries to perform the following operations:

a) Retrieve the title, author, and publisher names of all books published in 1999
and2006.
b) Retrieve the title of all books whose one author is ‗ATanenbum‘.
c) Get the details of all books whose price is greater than the average price of
thebooks.
d) Get the names of all the books for which an order has beenplaced.
e) Get the names of all authors who have more than ten books in thecatalog.
f) Get the details of the authors whose books are being sold from the bookclub.
g) Get the title and price of all books whose price is greater than the maximum of the
category average.

REFERENCE BOOKS

1. C.J.Date,Introduction to database management system,

2. Elmasri&Navathe,Fundamentals of data base management system
3. S KSingh,Database systems – concepts and application in database

44
 1Y3BSIT-304A: UNIX/LINUX Programming

UNIT 1: Introduction (6 Lectures)

What is Linux/Unix Operating systems, difference between linux/unix and other operating
systems, Features and Architecture, Various Distributions available in the market, Installation,
Booting and shutdown process, System processes (an overview), External and internal commands,
Creation of partitions in OS, Processes and its creation phases – Fork, Exec, wait

UNIT 2: User Management and the File System (6 Lectures)

Types of Users, creating users, granting rights, User management commands, File quota and
various file systems available, File System Management and Layout, File permissions, Login
process, Managing Disk Quotas, Links (hard links, symbolic links)

UNIT 3: Shell introduction and Shell Scripting (8 Lectures)

What is shell and various type of shell, Various editors present in linux, Different modes of
operation in vi editor, what is shell script, Writing and executing the shell script, Shell variable
(user defined and system variables), System calls, Using system calls, Pipes and Filters, Decision
making in Shell Scripts (If else, switch), Loops in shell, Functions, Utility programs (cut, paste,
join, tr, uniq utilities), Pattern matching utility (grep)

Practical / Lab work to be performed Based on Linux

1. Write a shell script to check if the number entered at the command line is prime or
not.
2. Write a shell script to modify ―cal‖ command to display calendars of the specified
months.
3. Write a shell script to modify ―cal‖ command to display calendars of the specified
range of months.
4. Write a shell script to accept a login name. If not a valid login name display message
– Entered login name is invalid‖.
5. Write a shell script to display date in the mm/dd/yy format.
6. Write a shell script to display on the screen sorted output of ―who‖ command along
with the total number of users.
7. Write a shell script to display the multiplication table any number,
8. Write a shell script to compare two files and if found equal asks the user to delete
the duplicate file.
9. Write a shell script to find the sum of digits of a given number

10. Write a shell script to merge the contents of three files, sort the contents and then
display them page by page.

45
 11. Write a shell script to find the LCD (least common divisor) of two numbers.
12. Write a shell script to perform the tasks of basic calculator.
13. Write a shell script to find the power of a given number.
14. Write a shell script to find the binomial coefficient C(n , x).
15. Write a shell script to find the permutation P(n,x).
16. Write a shell script to find the greatest number among the three numbers.
17. Write a shell script to find the factorial of a given number.
18. Write a shell script to check whether the number is Armstrong or not.
19. Write a shell script to check whether the file have all the permissions or not.
20. Program to show the pyramid of special character ―*‖.

REFERENCE BOOKS

1. Sumit abha, Das, Unix Concepts And Applications, Tata McGraw-Hill Education, 2006
2. Michael Jang RHCSA/ RHCE Red Hat Linux Certification: Exams (Ex200 & Ex300)
(Certification Press), 2011
3. Nemeth Synder& Hein, Linux Administration Handbook, Pearson Education, 2nd
Edition,2010
4. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Unix Network Programming,
The sockets Networking API, Vol. 1, 3rd Edition,2014

1Y3BSIT-304B: Programming in Python

UNIT 1: Planning the Computer Program (2Lectures)

Concept of problem solving, Problem definition, Program design, Debugging, Types of errors in
programming, Documentation
UNIT 2: Techniques of Problem Solving (2 Lectures)

Flowcharting, decision table, algorithms, Structured programming concepts, Programming

methodologies viz. top-down and bottom-up programming
UNIT 3: Overview of Programming (4 Lectures)

Structure of a Python Program, Elements of Python

UNIT 4: Introduction to Python (4 Lectures)

Python Interpreter, Using Python as calculator, Python shell, Indentation, Atoms, Identifiers and
keywords, Literals, Strings, Operators (Arithmetic operator, Relational operator, Logical or
Boolean operator, Assignment, Operator, Ternary operator, Bit wise operator, Increment or
Decrement operator).

46
 UNIT 5: Creating Python Programs
(4 Lectures)

Input and Output Statements, Control statements (Branching, Looping, Conditional Statement, Exit
function, Difference between break, continue and pass.), Defining Functions, Default arguments.
UNIT 6: Python File Operations (4 Lectures)

Understanding read functions, read (), readline() and readlines(), Understanding write functions,
write() and writelines(), Programming using fileOperations, Reading config files in python,
Writing log files in python.

Practical / Lab work to be performed

Section: A (Simple programs)

1. Write a menu driven program to convert the given temperature from Fahrenheit to Celsius
and vice versa depending upon user’s choice.
2. WAP to calculate total marks, percentage and grade of a student. Marks obtained in each
of the three subjects are to be input by the user. Assign grades according to the following
criteria:
Grade A: Percentage >=80
Grade B: Percentage>=70 and <80
Grade C: Percentage>=60 and<70
Grade D: Percentage>=40 and <60
Grade E: Percentage<40
3. Write a menu-driven program, using user-defined functions to find the area of rectangle,
square, circle and triangle by accepting suitable input parameters from user.
4. Write a program to display the first n terms of Fibonacci series.
5. Write a program to find factorial of the given number.
6. Write a program to find sum of the following series for n terms:
1 – 2/2! + 3/3! - - - - - n/n!
7. Write a program to calculate the sum and product of two compatible matrices.

Section: B (Visual Python)

All the programs should be written using user defined functions, wherever possible.

1. Write a menu-driven program to create mathematical 3D objects

(i) curve, (ii) sphere (iii) cone (iv)arrow (v) ring (vi) cylinder.
2. Write a program to read n integers and display them as a histogram.
3. Write a program to display sine, cosine, polynomial and exponential curves.

47
 4. Write a program to plot a graph of people with pulse rate p vs. height h. The values of p
and h are to be entered by the user.
5. Write a program to calculate the mass m in a chemical reaction. The mass m (in gms)
disintegrates according to the formula m=60/(t+2), where t is the time in hours. Sketch a
graph for t vs. m, where t>=0.
6. A population of 1000 bacteria is introduced into a nutrient medium. The population p grows
as follows:
P(t) = (15000(1+t))/ (15+ e)
where the time t is measured in hours. WAP to determine the size of the population at given
time t and plot a graph for P vs t for the specified time interval.
7. Input initial velocity and acceleration, and plot the following graphs depicting equations of
motion:
(i) velocity wrt time (v=u+at)
(ii) distance wrt time ( s=u*t+0.5*a*t*t)
(iii) distance wrt velocity ( s=(v*v-u*u)/2*a )
8. Write a program to show a ball bouncing between 2 walls. (Optional)

REFERENCE BOOKS

1. T. Budd, Exploring Python, TMH, 1st Ed, 2011

2. Python Tutorial/Documentation www.python.or 2015
3. Allen Downey, Jeffrey Elkner, Chris Meyers , How to think like a computer scientist
:
learningwith Python , Freely available online.2012
4. http://docs.python.org/3/tutorial/index.html
5. http://interactivepython.org/courselib/static/pythonds
6. http://www.ibiblio.org/g2swap/byteofpython/read/

1Y3BSIT-304C:HTML Programming
UNIT 1: The Basics (3 Lectures)

Introduction to HTML, the Head, the Body, Colors, Attributes, check box, Radio Button, Text, Text
Area, Lists, ordered and unordered
UNIT 2: HTML Formatting (3 Lectures)

New Paragraph, Line Break, Blank Space, Preformatted text, Div. element Bold text, Important
text, Italic text, Emphasized text, marked text, Small text, Deleted text, Inserted text, Subscript text,
Superscript text, HTML quotations, HTML Comments, HTML colors

48
UNIT 3: Links (3Lectures)

Introduction, Relative Links, Absolute Links, Link Attributes, Using the ID Attribute to Link within
a Document
UNIT 4: Images (2Lectures)

Putting an Image on a Page, Using Images as Links, Putting an Image in the Background
UNIT 5: Tables (5 Lectures)

Creating a Table, Table Headers, Captions, Spanning Multiple Columns, Styling Table
UNIT 6: Forms (4 Lectures)

Basic Input and Attributes, Other Kinds of Inputs, Styling forms with CSS, where to Go from
Here

Practical / Lab work to be performed

1. Create an HTML document with the following formatting options:

(i) Bold
(ii) Italics
(iii) Underline
(iv) Headings (Using H1 to H6 heading styles)
(v) Font (Type, Size and Color)
(vi) Background (Colored background/Image in background)
(vii) Paragraph
(viii) Line Break
(ix) Horizontal Rule
(x) Pre tag
2. Create an HTML document which consists of:
(i) Ordered List
(ii) Unordered List
(iii) Nested List
(iv) Image

49
3. Create an HTML document which implements Internal linking as well as External
Linking.
4. Create a table using HTML which consists of columns for Roll No., Student‘s name
and grade.
Result
Roll No Name Grade

5. Create a Table with the following view:

Place an Image Here

6. Create a form using HTML which has the following types of controls:
(i) Text Box
(ii) Option/radio buttons

50
 (iii) Check boxes
(iv) Reset and Submit buttons

7. Create HTML documents (having multiple frames) in the following three formats:

Frame 1
Frame 2

Frame 1

Frame 2 Frame 3

REFERENCE BOOKS

1. Virginia De Bolt , Integrated HTML and CSS A Smarter, Faster Way to Learn Wiley /
Sybex , 2006
2. Cassidy Williams, Camryn Williams Introduction to HTML and CSS, O'Reilly, 2015

1Y3BSIT-305A: Multimedia and Applications

UNIT 1: Multimedia (6Lectures)

Introduction to multimedia, components, uses of multimedia, multimedia applications, virtual

reality
UNIT 2: Text (4 Lectures)

Fonts & Faces, Using Text in Multimedia, Font Editing & Design Tools, Hypermedia &
Hypertext

UNIT 3: Images (6 Lectures)

Still Images – bitmaps, vector drawing, 3D drawing & rendering, natural light & colors,
computerized colors, color palettes, image file formats.
UNIT 4: Sound (6 Lectures)

Digital Audio, MIDI Audio, MIDI vs Digital Audio, Audio File Formats
51
UNIT 5: Video (8 Lectures)

How video works, analog video, digital video, video file formats, video shooting and editing.
UNIT 6: Animation (10 Lectures)

Principle of animations, animation techniques, animation file formats.

UNIT 7: Internet and Multimedia (6 Lectures)

www and HTML, multimedia on the web – web servers,web browsers, web page makers and
site builders.
UNIT 8: Making Multimedia (14 Lectures)

Stages of a multimedia project, Requirements to make good multimedia, Multimedia Hardware

Macintosh and Windows production Platforms, Hardware peripherals- Connections, Memory and
storage devices, Multimedia software and Authoring tools.

Practical / Lab work to be performed

Practical exercises based on concepts listed in theory using Flash/ GIMP/ Photoshop/
Animation
Tools/ Image Editors/ Video Editors. Optional
Implement the followings using Flash-

1. Create an animation using the tools panel and the properties panel to draw the following
– Line, pe , oval, circle, rectangle , square, pencil , brush , lasso tool
2. Create an animation using text tool to set the font, size, color etc.
3. Create an animation using Free transform tool that should use Followings-Move
Objects
Skew Objects Stretch Objects Rotate Objects Stretch Objects while maintaining proportion
Rotate Objects after relocating the center dot
4. Create an animation using layers having following Features-Insert layer, Delete layer,
guide layer, Mask layer.
5. Modify the document (changing background color etc.) using the following tools
Eraser tool Hand tool Ink bottle tool Zoom Tool Paint Bucket Tool Eyedropper tool
6. Create an animation for bus car race in which both starts from the same point and car
wins the race.
7. Create an animation in which text Hello gets converted into Good Bye (using
motion/shape twining).
8. Create an animation having five images having fade-in fade-out effect.
9. Create an scene to show the sunrise (using multiple layers and motion twining)
10. Create an animation to show the ripple effect.

52
 11. Create an animation (using Shape twining and shape hints) for transforming one shape
into another.
12. Create an animation for bouncing ball (you may use motion guide layer).

REFERENCE BOOKS

1. Tay Vaughan, ―Multimedia: Making it work‖, TMH, Eighth edition.2011

2. Ralf Steinmetz and Klara Naharstedt, ―Multimedia: Computing, Communications
Applications‖, Pearson.2012
3. Keyes, ―Multimedia Handbook‖, TMH,2000.
4. K. Andleigh and K. Thakkar, ―Multimedia System Design‖, PHI.2013

1Y3BSIT-305B: Computer Oriented Numerical Methods

UNIT 1: (8 Lectures)

Floating point representation and computer arithmetic, Significant digits, Errors: Round-off error,
Local truncation error, Global truncation error, Order of a method, Convergence and terminal
conditions, efficient computations
UNIT 2: (12 Lectures)

Bisection method, Secant method, Regula Falsi method, Newton Raphson method, Newton ‘s
method for solving nonlinear systems, Gauss elimination method (with row pivoting) and Gauss
Jordan method, Gauss Thomas method for tridiagonal systems
UNIT 3: (10 Lectures)

Iterative methods: Jacobi and Gauss-Seidel iterative methods, Interpolation: Lagrange ‘s form and
Newton’s form
UNIT 4: (12 Lectures)

Finite difference operators, Gregory Newton forward and backward differences Interpolation,
Piecewise polynomial interpolation: Linear interpolation, Cubic spline interpolation (only
method), Numerical differentiation: First derivatives and second order derivatives, Richardson
extrapolation UNIT 5: (9 Lectures)

Numerical integration: Trapezoid rule, Simpson ‘s rule (only method), Newton Cotes open
formulas.
Extrapolation methods: Romberg integration, Gaussian quadrature, Ordinary differential equation:
Euler ‘s method

53
UNIT 6: (9 Lectures)

Modified Euler ‘s methods: Heun method and Mid-point method, Runge-Kutta second methods,
Heun method without iteration, Mid-point method and Ralston ‘s method Classical 4th order
Runge-Kutta method, Finite difference method for linear ODE

Practical / Lab work to be performed

1. Find the roots of the equation by bisection method.

2. Find the roots of the equation by secant/Regula Falsi method.
3. Find the roots of the equation by Newton ‘s method.
4. Find the solution of a system of nonlinear equation using Newton ‘s method.
5. Find the solution of tridiagonal system using Gauss Thomas method.
6. Find the solution of system of equations using Jacobi/Gauss-Seidel method.
7. Find the cubic spline interpolating function.
8. Evaluate the approximate value of finite integrals using Gaussian/Romberg
integration.
9. Solve the boundary value problem using finite difference method.

Note: Programming is to be done in any one of Computer Algebra Systems:

MATLAB / MATHEMATICA / MAPLE.

REFERENCE BOOKS

1. Laurence V. Fausett, Applied Numerical Analysis, Using MATLAB, Pearson, 2/e (2012)
2. M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and
Engineering Computation, New Age International Publisher, 6/e (2012)
3. Steven C Chapra, Applied Numerical Methods with MATLAB for Engineers and
Scientists, Tata McGraw Hill, 2/e (2010).

54
 1Y3BSIT-401: PROGRAMMING INJAVA
UNIT 1: (15 Lectures)

Java language basics: Basic features, Java virtual machine concepts. Data types: -
primitive data types and variables. Java Key words, integer and floating point data
type, character and Boolean types, declaring and initialization variables. Java
operators, Expressions, Statements-- selection statements, control statements,
iterative statements, jump statements.

Classes & Objects: Creating objects, assigning object reference variables, Introducing methods

Arrays- Static methods, Constructors, overloading constructors., Strings, and Vector,

This Keyword Using object as parameters- argument passing, returning objects,
Method Overloading, garbage collection, the Finalize () method.

Inheritance and Polymorphism- Inheritance basics, access control, multilevel

inheritance, method overriding, abstract classes, polymorphism, Final keyword,
Multithreaded programming,

I/O in Java- I/O basics, Streams and stream classes, reading from and writing to console,
reading writing files
UNIT2: (15 Lectures)

Java applets: The Applet Class, Applet Architecture, An Applet skeleton: initialization and
termination, handling events, HTML Applet Tag, Control.
UNIT 3: (15 Lectures)

Networking: Socket overview -- datagram socket and TCP/IP based server socket, Internet
Addressing --- DNS, URL, Event handling Drivers in Java.
UNIT4: (15 Lectures)

Java Database Connectivity: Establishing a connection (JDBC, ODBC connectivity),

transactions with database.

LABORATORY

Each student should do at least 8 assignments from the following list.

1. Design a class to represent a bank account and include the following data

55
 members – Data Members: name of the depositor, account number, type
of a/c, balance amount in the a/c

Methods: to assign initial values, to deposit an amount, to withdraw an amount after checking
the minimum balance (Rs.1000), to display the name of the depositor and balance.
2. Write an applet programming to print the first name, last name, sex, address, mobile
no. and pin code of an end user passing parameters.
3. Write an applet programming to create three buttons and draw a rectangle on
clicking the first button, a solid rounded rectangle on clicking the second button and
a solid circle and an arc on clicking the third button.
4. Write a program to create 3 – threads for execution with different priorities.

5. Write a program to create three threads for execution of the natural nos. less than 5
using synchronization concept.
6. Write a java program for a class teacher that contains two fields name and
qualification. Extend the class to department that contains data members dept_no
and dept_name. An interface name as college contains one field name of the college.
Using the above classes and interface get the appropriate information and display
them.
7. Design three classes person, employee and student using the concept of inheritance.
Each class should have a constructor of its own properties as name, age, gender and
common method showdata().
8. Write a program to create an array of employee name and salary related to the
employee. If the
salaryisgreaterthanRs.10,000raiseanexception―SalaryisgreaterthanRs.10,000‖,oth
erwise display the required information.
9. Design a user interface to insert, update, delete, search and browse a record of
employee database for emp_id, emp_name, sex, basic, desig anddate_join.
10. Design a menu as Operation and Exit. The Operation menu contains the menu items
as Addition, Subtraction, Multiplication, Division and Remainder of two numbers.
On clicking the respective menu items perform the desired operation. Further on
clicking
the Exit menu put a confirmation messages ― Do you want to exit-
Yes/No? ‖.If Yes then terminate the application, otherwise it exists.
REFERENCE BOOKS

1. E. Balaguruswamy, Programming in Java, Tata Mc-GrawHill.

2. PatrikNaughton& Herbert Schildt― The complete referencejava‖

56
 1Y3BSIT-402: SOFTWAREENGINEERING

Unit1: Introduction (15 Lectures)

Software Processes & Characteristics, Software life cycle Models- Waterfall, Prototype,
Evolutionary and Spiral Models Software Requirements analysis & specifications:
Requirement engineering, requirement, elicitation techniques like FAST, QFD,
requirements analysis using DFD, Data dictionaries, ER Diagrams, Requirements
documentation, Nature of SRS, Characteristics & organization of SRS.
Unit2: Software Project Planning(15 Lectures)

Size Estimation like lines of Code & Function Count, Cost Estimation Models, COCOMO, Risk
Management.
Unit3: Software Design (15 Lectures)

Data design,Architectural design, Interface design, Function Oriented Design, Object

Oriented Design, Cohesion & Coupling, Classification of Cohesiveness & Coupling,
Software Metrics: different types of projectmetrics.
Unit4 : Software Testing and Maintenance (15 Lectures)

Testing Process, Design of Test Cases, Types of Testing, Functional Testing,

StructuralTesting, Test Activities,Unit Testing, Integration Testing and System Testing.
Debugging Activities Software Maintenance: Management of Maintenance,
Maintenance Process, Reverse Engineering, Software Re engineering, Configuration
Management, Documentation. Software quality Assurance.

CASE tools Analysis tools, design tools, SQA tools, software testing tools.

LABORATORY

Each student should do at least 3 assignments from the following list.

1. Xpaize.com wants to computerize its sales, purchase & booking of shares

through online mode. A user enters his/her user name and password
(assigned at the time of registration).

User chooses one of the above actions and finally receives the transaction/account details on the
action chosen.

Perform the following tasks for the above problem.

a) Develop SRS.
57
 b) Draw DFDs of level 0 and level1.
c) Draw an ER diagram and its related tables.

2. The university wants to computerize its admission process. The system

should maintain data of all new students as well as old students, their results
issue admission letter, allocate study center or should also allow students to
move from one center to another study Centre.

Perform the following tasks for the above problem.

a) Develop SRS.
b) Draw DFDs of level 0 and level1.
c) Draw an ER diagram and its related tables.
3. A Tic – Tac- Toe is a computer game in which human player and computer
makes alternative moves on a 3X3 square. A move consists of marking a
previously unmarked square. The player who is first to place three
consecutive marks along a straight line (i.e. along a row , column or
diagonal) on the square wins . As soon as the either of the winner wins a
message congratulating them is displayed. If neither of the player manages
to get three consecutive marks along a straight line and all the squares on
the board are filled up, then the game is drawn. The computer always tries
to win a game.

Perform the following tasks for the above problem.

a) Draw DFDs of level 0 and level1.
b) Draw an ER diagram and its related tables.

4. A supermarket needs to develop the following software to encourage regular

customers. For this the customer needs to supply his /her residence address,
telephone number & the driving license number. Each customer who is
registered for this scheme is assigned a unique customer number (CN)by
the computer. Based on the generated CN a clerk manually prepares a
customer identity card after getting market managers signature on it . A
customer can present his customer identity card to the checkout staff
whenever he makes any purchases. In this case the value of his purchase is
credited against his CN. At the end of each year the supermarket intends to
award surprise gifts to ten customers who make the highest total purchase
over the year. AL spit intends to award a 22 caret gold coin to every
customer whose purchase exceeded Rs. 10,000. The entries against the CN
are reset on the last day of every year after the prize winner list are
generated.

58
Perform the following tasks for the above problem.
c) Draw DFDs of level 0 and level1.
d) Draw an ER diagram and its related tables.

REFERENCE BOOKS

1. Rajeev Mall, Software Engineering‖, PHI

2. PressmanRoger, SoftwareEngineeringAPractitionersApproach,TataMcGrawHill
3. JamesF.Peters,WitoldPedrycz―SoftwareEngineeringAnEngineeringApproach

1Y3BSIT-403: DATA COMMUNICATION AND COMPUTERNETWORKS

UNIT 1: INTRODUCTION (5 Lectures)

Usage of Computer Network, study of topology, concept of protocol, Connection less and
connection Oriented Service, Layered architecture, study of OSI and TCP model.
UNIT 2: PHYSICAL LAYER (5 Lectures)

Introduction to Guided and Unguided media, physical description of twisted pair,

coaxial cable, and fiber optic cable, Maximum data rate of a channel (Nyquist and
shannons law), Basic concepts of Modulation and demodulation, Data encoding
techniques (Manchester and Differential Mancestar encoding) . Network connecting
devices hub, repeater, bridge, switch, router, and gateway
UNIT 3: DATA LINK LAYER (16 Lectures)

LLC

Functions and services of DLL, Framing and Framing Methods, Concept of Error
Control, Error Correcting code(Hamming code), Error detecting code(CRC), Concept
of Flow Control, Piggybacking, Stop-and-Wait sliding window protocol, Pipelining
techniques(Go backN, Selective Repeat).
MAC

What is MAC? Static Channel Allocation, Dynamic Channel Allocation, Pure

ALOHA, Slotted ALOHA, Carrier Sense Protocol, 1-persistent CSMA, Non-
PersistentCSMA, CSMA/CD, Ethernet(IEEE 802.3) and Ethernet Frame Format,
Basic concept of Wireless LAN(IEEE 802.11), Binary Exponential
BackoffAlgorithm.
UNIT 4: NETWORKLAYER (12 Lectures)

Services and Functions of Network Layer, Virtual Circuit and Datagram Subnet,
Routing, Distance Vector Routing, the Count-to-Infinity problem, Link State Routing,
59
Congestion (definition and factors of congestion only), Definition of Quality of
Service, Traffic shaping, Leaky Bucket and token Bucket Algorithm, Concept of IP
Address.
UNIT 5: TRANSPORT LAYER (12 Lectures)

Functionality of transport Layer, Establishment and release of connection, TCP and

UDP(Overview), Introduction to Sockets and socket primitives, port numbers.
UNIT 6: APPLICATION LAYER(10 Lectures)

Concept of E-mail, Telnet, WWW, DNS, HTTP, FTP, URL, SMTP, MIME.

LABORATORY

Each student should do at least 4 assignments from the following list.

Avoid using Loopback Communication for the assignments,1-4:

1. Write a server socket program using TCP/IP in java where the client side will send a
request for an existing file to the server side and if the file exists in the server then
send the contents of that particular file to the client in reply, otherwise display a
message ―file does not exist on the server‖, if exists displays the contents on the
client side.
2. Develop a chat application using TCP/IP in java.

3. Develop a client-server application using TCP/IP in java to input user‘s information

and finally send them to the server and store there in afile.
4. Develop a server socket program where the client takes principal, rate of interest and
number of years and send them to the server. In the server receive this information
and find the simple interest and finally send the result to the client again and display
it on the client‘s VDU.
5. Configure a Local Area Network (Wired/Ethernet) in Linux environment. Configure
the network interface card using ifconfig command and also explore ping, ifdown and
ifup commands.
REFERENCE BOOKS

1. Red Hat Linux:Proffitt:PHI

2. Introduction to system Administration:IBMseries:PHI

60
 1Y3BSIT-404A: Android Programming
UNIT 1: Introduction (2 Lectures)

What is Android and its importance, Brief history about Android, Pre-requisites to
learn Android, Development tools, Android architecture-software stack.
UNIT 2: Get started with Android (4 Lectures)

Installation of Android Studio, SDK, emulator, creating your first Project App,
explore project structure- Manifest, java, res, gradle, Activity, Layout, Common UI
components, Creating UI through code, Run the application in Emulator and Android
device.
UNIT 3: Activities (3 Lectures)

Creating a new activity, Application context, Intent, Activity Life cycle,

communicating among Activities, connecting to internet resource, Web View.
UNIT 4: Designing User Interface (3 Lectures)

Using Button control, Array List, Spinner, List View, Grid View, Adapters, Sidebar
Menus, Notification (toast, Status bar), Adding image, audio, Video.
UNIT 5: Background Task and Local File Storage (3 Lectures)

Broadcast Receiver, services in Android, Reading/writing local data, Accessing the

Internal File system.
UNIT 6: Database (5 Lectures)

SQLite- Introducing SQLite, SQLiteOpenHelper and creating a database, Opening

and closing a database, Inserts, updates, and deletes operation, Data Binding, using
content provider, firebase, storing and sharing data in the cloud.

Practical / Lab work to be performed

1. Create an application with two fields (Number 1, Number2). On clicking

button, the sum of the two numbers are displayed on another text field.
2. Create a Login application with two fields (username and password). On
successful login go to next screen, also pass user name to next screen. And
on failing login, alert user using Toast.
3. Create an application with two fields (name and value). On clicking button,
the value on the two fields passes to the next screen and display it on text
field.
4. Create an application with a button. On clicking the button open browser with
an URL. (open google page)

61
 5. Create a spinner with names of some countries. On selecting a particular
country, Display a toast message with currency name of that country.
6. Create an application with Navigation side bar menu item. On clicking the
sidebar menu item, it open activity page of that particular menu item.
7. Create an application with static Broadcast Receiver features. When a SMS
comes, it displays an alert message.
8. Create an application to display an image and button. On button click the
image is changed. The images are put inside the resource folder.
9. Create an application with a button. On clicking it, notification is displayed
on top of the app. When swipe and click it display second activity page.
10. Create an application with two button for start and stop services. On clicking
start button it will play default ringtone in the background. On clicking stop
button, it stops.
11. Create an application to play a video.
12. Create an application with a text field. On clicking the Add button the content
of the text field is save to a file in internal memory storage. On clicking the
Load button the content of the file in the internal storage is displayed again
in the text field.
13. Create an application to create a database in Sqlite with a table of user
information (id, name, marks etc.). The application can also perform insert,
retrieve, update and delete operation.

Reference Books

1. Grant Allen, Beginning Android 4, A press, 2012.

2. Wei-Meng Lee, Beginning android 4 application Development, John Wiley &
sons, Inc, 2012.
3. John Horto, Android programming for Beginners by Packt Publishing Ltd.

62
 1Y3BSIT-404B: PHP Programming
UNIT 1: Introduction to PHP (4 Lectures)

PHP introduction, inventions and versions, important tools and software

requirements (like Web Server, Database, Editors etc.), PHP with other
technologies, scope of PHP, Basic Syntax, PHP variables and constants, Types
of data in PHP, Expressions, scopes of a variable (local, global), PHP
Operators: Arithmetic, Assignment, Relational, Logical operators, Bitwise,
ternary and MOD operator, PHP operator Precedence and associativity
UNIT 2: Handling HTML form with PHP (2 Lectures)

Capturing Form Data, GET and POST form methods, dealing with multi value fields,
Redirecting a form after submission
UNIT 3: PHP conditional events and Loops (3 Lectures)

PHP IF Else conditional statements (Nested IF and Else), Switch case, while, For and
Do While Loop, Goto, Break, Continue and Exit
UNIT 4: PHP Functions (3 Lectures)

Function, Need of Function, declaration and calling of a function, PHP Function

with arguments, Default Arguments in Function, Function argument with call
by value, call by reference, Scope of Function Global and Local
UNIT 5: String Manipulation and Regular Expression (4 Lectures)

Creating and accessing String, Searching & Replacing String, Formatting, joining
and splitting String , String Related Library functions, Use and advantage of
regular expression over inbuilt function, Use of preg_match(), preg_replace(),
preg_split() functions in regular expression
UNIT 6: Array (4 Lectures)

Anatomy of an Array, Creating index based and Associative array ,Accessing array,
Looping with Index based array, with associative array using each() and foreach(),
Some useful Library function
Practical / Lab work to be performed
1. Create a PHP page using functions for comparing three integers and print the
largest number.
2. Write a function to calculate the factorial of a number (non-negative integer).
The function accepts the number as an argument.
3. Write a program to check whether the given number is prime or not.
4. Create a PHP page which accepts string from user. After submission that page
displays the reverse of provided string.
5. Write a PHP function that checks if a string is all lower case.

63
 6. Write a PHP script that checks whether a passed string is palindrome or not?
(A palindrome is word, phrase, or sequence that reads the same backward as
forward, e.g., madam or nurses run)
7. Write a program to sort an array.
8. Write a PHP script that removes the whitespaces from a string.
Sample string: 'The quick " " brown fox' Expected Output: The quick”
“brown fox 9. Write a PHP script that finds out the sum of first n odd
numbers.
10. Create a login page having user name and password. On clicking submit, a
welcome message should be displayed if the user is already registered
(i.e.name is present in the database) otherwise error message should be
displayed.
11. Write a PHP script that checks if a string contains another string.
12. Create a simple 'birthday countdown' script, the script will count the number
of days between current day and birth day.
13. Create a script to construct the following pattern, using nested for loop. *
**
***
****
*****
14. Write a simple PHP program to check that emails are valid.
15. WAP to print first n even numbers.
16. $color = array ('white', 'green', 'red'')
Write a PHP script which will display the colors in the following way:
Output: white, green, red,
•green • red
• white
17. Using switch case and dropdown list display a ―Hello‖ message depending
on the language selected in drop down list.
18. Write a PHP program to print Fibonacci series using recursion.
19. Write a PHP script to replace the first 'the' of the following string with 'That'.
Sample: ‘the quick brown fox jumps over the lazy dog.'
Expected Result: That quick brown fox jumps over the lazy dog.
Reference Books
1. Steven Holzner, "PHP: The Complete Reference Paperback", McGraw Hill
Education (India), 2007.
2. Timothy Boronczyk, Martin E. Psinas, "PHP and MYSQL (Create-Modify-
Reuse)", Wiley India Private Limited, 2008.
3. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5", 3rd
Edition Paperback, O'reilly, 2014.
4. Luke Welling, Laura Thompson, PHP and MySQL Web Development", 4th
Edition, Addition Paperback, Addison-Wesley Professsional,2008.

64
 5. David Sklar, Adam Trachtenberg, "PHP Cookbook: Solutions & Examples for
PHP Programmers", 2014.

1Y3BSIT-404C: R Programming

UNIT 1: Introduction (6 Lectures)

Overview and History of R, Getting Help, R Data Types and Objects, Subsetting,
Vectorized, Operations, Reading and Writing Data.
UNIT 2: Control (8 Lectures)

Control Structures, Functions, lapply, tapply, split, mapply, apply, Scoping Rules,
Coding Standards.
UNIT 3: Simulation (6 Lectures)

Loop functions, Debugging Tools, Simulation, R Profiler.

Practical / Lab work to be performed

1. Write a program that prints “Hello World” to the screen.

2. Write a program that asks the user for a number n and prints the sum of the
numbers 1 to n
3. Write a program that prints a multiplication table for numbers up to 12.
4. Write a function that returns the largest element in a list.
5. Write a function that computes the running total of a list.
6. Write a function that tests whether a string is a palindrome or not.
7. Implement the sorting algorithms: Selection sort, Insertion sort, Bubble Sort
8. Implement linear search and binary search algorithm.
10. Implement matrices addition, subtraction and multiplication

REFERENCE BOOKS

1. William N. Venables and David M. Smith, An Introduction to R. 2nd Edition.

Network Theory Limited.2009
2. Norman Matloff, The Art of R Programming - A Tour of Statistical Software
Design, No Starch Press.2011

65
 1Y3BSIT-405A: THEORETICAL FOUNDATION OF COMPUTING

Unit1: Finite Automata (10 Lectures)

DFA, NFA, NFA with €moves. Equivalence of DFA and NFA. Reduction of the
number of states in a finite automaton.
Unit2: Regular Languages and Regular Grammar (10 Lectures)

Concept of languages and grammar. Regular expressions. Connection between

regular expressions and regular languages. Regular grammars, Right and Left
Linear Grammars. Equivalence between Regular languages and Regular
grammars.
Unit3: Properties of Regular Languages (10 Lectures)

Closure under simple set operations union, intersection, concatenation,

complementation and star closure. proof of pumping lemma for regular
language. Proof of no regularity using Pigeonhole principle and using pumping
lemma for regular languages.
Unit4: Context free languages (10 Lectures)

Context free grammars, leftmost and rightmost derivations, derivation trees. Parsing
and Ambiguity in grammars and languages. Simplification of Context free
Grammars removing useless productions, empty productions and unit
productions. Normal forms Chomsky and Greibach normal forms.
Unit5: Pushdown Automata (10 Lectures)

Definition and language accepted (acceptance by empty stack and final state and
their equivalence).Pushdown Automata and Context free languages.
Deterministic PDA and Deterministic Context free Languages.

REFERENCE BOOKS

1. An introduction to For mal Languages and Automata, Peter Linz,Narosa.

2. Introduction to Automata Theory, Languages and Computation, Hopcroft and
Ullman, AddisonWesley.
3. K. L. P. Mishra, N. Chandrasekaran; Theory of Computer Science (Automata,
Languages and Computation), P. H.I.
4. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to
Algorithms,Tata
5. Mcgraw Hill Publishers.

66
 1Y3BSIT-405B: Information Security and Cyber Laws

UNIT 1: Introduction (8 Lectures)

Information Security- History, overview, Definitions, Basic principles, Key Concepts,

Security threats and responses, Security classification for information.
UNIT 2: Digital Crime (4 Lectures)

Overview of Digital crime/ Cybercrime, criminology related to computer systems and

cyber space
UNIT 3: Information Gathering Techniques (8 Lectures)

Tools of the attacker, information and cyber warfare, scanning and spoofing, password
cracking, Sniffing, malicious software, Session Hijacking
UNIT 4: Risk Analysis and Threat (10 Lectures)

Risk analysis, Risk Management, Risk assessment, Key principles of Computer

security, Security Policies, Central Mechanisms, Authentication and
Authorization techniques, Data Protection, Access Control, Digital Evidence,
Computer forensics and Incident Response Plans.
UNIT 5: Introduction to Cryptography and Applications (10 Lectures)

Concepts of cryptography, Types of cryptography, Digital Signature, Digital

Signature Certified Codifying techniques, Ciphers (Caeser Cipher, Rail-Fence
Cipher), Application of Cryptography
UNIT 6: Safety Tools and Issues (10 Lectures)

Security Governance, Firewalls, Logging and Intrusion Detection systems, Windows

and windows XP / NT security, Unix/Linux security, ethics of hacking and
cracking o
UNIT 7: Cyber laws to be covered as per IT 2008 (10 Lectures)

Chapter 1: Definitions

Chapter 2: Digital Signature and Electronic Signature

[Section 43] Penalty and Compensation for damage to computer, computer system,
etc.

[Section 65] Tampering with Computer Source Documents

[Section 66 A] Punishment for sending offensive messages through communication

service, etc.

67
[Section 66 B] Punishments for dishonestly receiving stolen computer resource or
communication device

[Section 66C] Punishment for identity theft

[Section 66D] Punishment for cheating by personating by using computer resource

[Section 66E] Punishment for violation of privacy

[Section 66F] Punishment for cyber terrorism

[Section 67] Punishment for publishing or transmitting obscene material in electronic

form

[Section 67A] Punishment for publishing or transmitting of material containing

sexually explicit act, etc. in electronic form [Section 67B] Punishment for
publishing or transmitting of material depicting children in sexually explicit
act, etc. in electronic form
[Section 72] Breach of confidentiality and privacy
Practical / Lab work to be performed
1. Demonstrate the use of Network tools: ping, ipconfig, ipconfig, tracert, arp,
netstat, whois
2. Use of Password cracking tools : John the Ripper, Ophcrack. Verify the
strength of passwords using these tools.
3. Perform encryption and decryption of Caesar cipher. Write a script for
performing these operations.
4. Perform encryption and decryption of a Rail fence cipher. Write a script for
performing these operations.
5. Use nmap/zenmap to analyze a remote machine.
6. Use Burp proxy to capture and modify the message.
7. Demonstrate sending of a protected word document.
8. Demonstrate sending of a digitally signed document.
9. Demonstrate sending of a protected worksheet.
REFERENCE BOOKS

1. M. Merkow, J. Breithaupt, Information Security Principles and Practices,

Pearson Education.2005
2. G.R.F. Snyder, T. Pardoe, Network Security, Cengage Learning, 2010
3. A. Basta, W.Halton, Computer Security: Concepts, Issues and
Implementation, Cengage Learning India, 2008

68
 1Y3BSIT-501: COMPILER DESIGN

Unit 1: Introduction (12 Lectures)

What is a compiler? Phases of compiler. Overview of working of a compiler, linker,

loader.
Unit 2: Lexical Analysis (12 Lectures)

NFA, DFA, conversion from NFA to DFA. Regular expression. Regular expression
to NFA conversion. Minimization of DFA., Structure of Lexical analyzer, use
of finite automata to write lexical analyzer.
Unit 3: Syntax analysis (12 Lectures)

Grammar representation. Derivation and parse tree. Ambiguity and possible

elimination. Top down parsing. Recursive descent and predictive top down
parsing. Elimination of Left recursion. Bottom up parsing. Operator
precedence parsing, LR parsing (including SLR and LALR). Error detection
and recovery. Parser table construction.
Unit 4: BCode generation (12 Lectures)

Symbol table contents, implementation. Type checking. Syntax directed translation.

Forms of intermediate codes. Abstract Syntax Trees, Directed Acyclic Graph,
Three address code. Intermediate code generation for different language
constructs, Boolean expressions, if, if else, while, case or switch. Target code
generation issues, register allocation, Runtime storage management
Unit 5: Code Optimization (12 Lectures)

DAG, basic blocks, Common subexpression elimination, variable propagation, code

motion, strength reduction, elimination of dead code, loop optimization.

REFERENCE BOOKS

1. Aho, Sethi, Ullman; Compilers, Principles, Techniques,

Tools,Pearson Education
2. Compiler Design, SantanuChattopadhyay,P.H.I.

69
 1Y3BSIT-502: WEB TECHNOLOGY
UNIT 1: Internet Basics: (5 Lectures)

History of the internet, the world wide web, getting connected, web page, home page,
web site, Internet services: email.
UNIT 2: Client Server Model:(10 Lectures)

Structure of an HTML document. HTML tags. The HTTP protocol details. Client
side software. Web browsers (Netscape/Mozilla as example). DHTML Web
server architecture and functions of a web server. JDBC and ODBC. Server
side vs client side scripts, advantages and disadvantages of each. Client side
and server side scripting languages and their uses. Dynamic web page. CGI
scripts, Java Scripts and JSP as examples. PHP and Perl as scripting language.
Browser plugins.
UNIT 4: Web Object Model: CORBA (5 Lectures)

UNIT 5: XML:(10 Lectures)

Well-formed XML syntax. References, well-formed documents ML semantics. DTD,

XML Schema, RELAXNG. Displaying XML on web. XML extensions.
Processing XML files, Using programming language and the SAX
API, Using a programming language and the DOM API, Using a transformation
engine and a filter, Push Parsing, Data binding, Non extractive XML
UNIT 6: Distributed Multitier Application: (10 Lectures)

J2EE Components, J2EE Clients, Web Components, Business Components. J2EE

Containers, Container Services , Container Types, Enter prise JavaBeans
Technology, Java Servlet Technology, JavaServer Pages Technology.

Application server: Persistence, Transaction processing, Concurrency control,

Events using, Java Message Service, naming and directory services (JNDI),
Security (Java Cryptography Extension (JCE) and JAAS )Deployment of
software components in an application server Remote procedure calls using
RMIIIOP. Exposing business methods as Web Services.

J2EE 1.4API (10 Lectures)

Java Message Service API, Java Transaction API, Java Mail API, JavaBeans
Activation Framework, Java API for XML Processing, Java API for XML
Based RPC, SOAP with Attachments API for Java, Java API for XML,
Registries, J2EE Connector Architecture, JDBC API
70
Web Security:

Firewall, wrapper and Proxy.

REFERENCE BOOKS:
1. M.L.Young,The Inter net Complete,
2. J. Dwight, M. Erwin, R.Niles,.Using CGI
3. J.Jaworski, Mastering JavaScript and Jscript
4. D.Godmann, Dynamic HTML.
5. D.P.Nagpal,Understanding HTML
6. http://java.sun.com/j2ee

71
 1Y3BSIT-503A: E-Commerce Technologies
UNIT 1: An introduction to Electronic commerce (10 Lectures)

What is E-Commerce (Introduction AndDefinition), Main activities E-Commerce,

Goals of E-Commerce, Technical Components of E-Commerce, Functions of
E-Commerce, Advantages and disadvantages of E-Commerce, Scope of E-
Commerce, Electronic Commerce Applications, Electronic Commerce and
Electronic, Business models
(C2B,C2C, B2B, B2C,B2G,G2B,G2C)
UNIT 2: The Internet and WWW (10 Lectures)

Evolution of Internet, Domain Names and Internet Organization (.edu, .com, .mil,
.gov, .net etc.), Types of Network, Internet Service Provider, World Wide
Web, Internet & Extranet, Role of Internet in B2B Application, building own
website, Cost, Time, Reach, Registering a Domain Name, Web promotion,
Target email, Banner,
Exchange, Shopping Bots
UNIT 3: Internet Security (10 Lectures)

Secure Transaction, Computer Monitoring, Privacy on Internet, Corporate Email

privacy, Computer Crime (Laws, Types of Crimes), Threats, Attack on
Computer System, Software Packages for privacy, Hacking, Computer Virus
(How it spreads, Virus problem, virus protection, Encryption and Decryption,
Secret key Cryptography, DES, Public Key Encryption, RSA, Authorization
and Authentication, Firewall, Digital Signature (How it Works)
UNIT 4: Electronic Data Exchange (10 Lectures)

Introduction, Concepts of EDI and Limitation, Applications of EDI, Disadvantages of

EDI,
EDI model, Electronic Payment System: Introduction, Types of Electronic Payment
System,
Payment Types, Value Exchange System, Credit Card System, Electronic Fund
Transfer,
Paperless bill, Modern Payment Cash, Electronic Cash
UNIT 5: Planning for Electronic Commerce (10 Lectures)

Planning Electronic Commerce initiates, Linking objectives to business strategies,

Measuring cost objectives, Comparing benefits to Costs, Strategies for
developing electronic commerce web sites

72
 UNIT 6: Internet Marketing (10 Lectures)

The PROS and CONS of online shopping, the cons of online shopping, Justify an
Internet business, Internet marketing techniques, The E-cycle of Internet
marketing,
Personalization e-commerce.

Practical / Lab work to be performed

Web and E- Commerce Technologies LAB (based on the following topics):

1. Hyper Text Markup Language (HTML): structural setup; page layout; text
manipulation; special characters; images; links. Intermediate: image maps;
tables; frames, forms; meta tags; web forms.
2. Cascading Style Sheets(CSS): embedding/linking; HTML element selectors;
classes; ID selectors, text manipulation; background; borders and spacing;
layout; context selectors and grouping, pseudo-classes; pseudo-elements.
3. Java Script: writing your first script; creating HTML tags; user input and
output; loops and tables; payroll calculator, forms and text fields; validating
an email address; radio buttons; check boxes; self-grading tests, image
rollovers; slide shows; real-time clock; controllable clock; working with
cookies.
4. Perl/CGI 10: sample Perl operations; random numbers; lists; dealing four
poker hands; time manipulation; subroutines, hash tables; files; string
matching, CGI; registration lists; surveys.
5. SQL and regular expressions: Regular expressions: select; where; order by;
insert; update; delete, like; aggregate functions; create table; alter table; drop
deterministic functions; non-deterministic functions, basics; repeating;
positioning.
6. Beginner: between; in; distinct; group by; aliases; table., nested selects;
Sound Ex; join;
7. ASP structural setup: response write; retrieving from forms; retrieving from
query string; variables; control constructs; subroutines and functions; session
state; application variables; server variables; debugging, reading and writing
cookies; server-side includes; response object methods; VBScript functions;
error handling; debugging, browser details; CDONTS; files; output from a
record set; global.asa; setup instructions for using IIS and ASP. Flash 3
Create Flash movies of moving and interactive objects.

REFERENCE BOOKS -

1. G.S.V.Murthy, E-Commerce Concepts, Models, Strategies- :- Himalaya

Publishing House, 2011.

73
 2. Kamlesh K Bajaj and DebjaniNag , E- Commerce , 2005.
3. Gray P. Schneider , Electronic commerce, International Student Edition,
2011,
4. Henry Chan, Raymond Lee, Tharam Dillon, Elizabeth Chang, E Commerce,
Fundamentals and Applications, Willey Student Edition, 2011 ITB-HD-
1Y3BSIT-503B:OBJECT ORIENTED ANALYSIS AND DESIGN

UNIT 1: Introduction: (5 Lectures)

What is object oriented programming? Usefulness of object oriented development.

UNIT 2: Object Modeling: (15 Lectures)

Objects and classes, Links and Association, advanced links and association
concepts, Generalization and Inheritance, grouping constructs, Aggregations,
Abstract Classes, Generalization as Extension and Restriction.
UNIT 3: Dynamic Modeling: (10 Lectures)

Events and States, Operations, Nested State Diagram, Concurrency, Synchronization

of concurrent activities, relation of objects and dynamic models.
UNIT 4: Function Modelling (10 Lectures)

Data Flow Diagram, Process, Data Flow, Actor, Data Store, Control Flow, Operations
and Constraints, Relation of functional to object and dynamic model.
UNIT 5: Design Methodology: (10 Lectures)

Analysis, Problem statement, Design: Breaking a system into a sub system,

Identifying Concurrency, allocating subsystems to processors and tasks,
Management of data Stores, Handling Global Resources, Handling Boundary
Conditions, Choosing Software Control Implementation, setting trade off
priorities.
UNIT 6: Object Design: (10 Lectures)

Overview of object design, Combining the Three Models, Design Optimization,

Implementation of Control, Adjustment of inheritance, design of association,
Object Representation, Physical Packaging and Documentation.

REFERENCE BOOKS:
James Rumbaugh, Blaha, Premelani. Eddy,LorensenObject Oriented Modeling and
Design,

74
1Y3BSIT-503C: COMPUTER ORIENTED OPTIMIZATIONTECHNIQUES

Unit 1: Linear Programming Techniques (12 Lectures)

The simplex algorithm, Charma‘ smethod of penalties, the two phase algorithm,
problem of degeneracy and cycling, Duality theorem, revised simplex
algorithm, revised simplex method versus simplex method. Sensitivity
analysis, changes in the requirement vector, the cost vector and the coefficient
matrix.
Unit 2: Transportation and Assignment problem (12 Lectures)

Various algorithms such as the algorithm of stepping stones, Hungerian etc.

Unit 3: Non-Linear Programming (12 Lectures)

Constraint minima and maxima, necessary and sufficient condition for maxima and
minima:
Kuhn Tucker principle, quadratic programming
Unit 4: Queuing theory (12 Lectures)

The exponential distribution, queue disciplines such as M/M/1, M/M/C.

Unit 5: Simulation (12 Lectures)

Even type of simulation, Monte Carlo techniques, and simulation techniques applied
to queues.

REFERENCE BOOKS-
1. S.LGass,―Linear Programming
2. K.V.Mittal& G Mohan, ― OptimizationMethods
3. K.Swarap, P.K.Gupta, M.Mohan, ― OperationResearch

75
 CODE: 1Y3BSIT-504: PROJECT WORK

Total Lectures: 60 Credits: 6 (Lab: 06)

Each student will be assigned some project work at the starting of the 5thsemester. The
objective of the project is to train the student to independently search, identify and
study real life important topics in CS/IT; to develop skills among students in a
particular field of CS/IT; and to expose students to the world of technology,
innovation, and research. Each group (group of at most 3 students) is expected to take
a unique problem under the guidance/supervision of a faculty member of the
department. The problem should be such that the students get a chance to explore one
or two technologies in depth and grab good command over those technologies after
successful completion of the project. Repetition of the problems already attempted by
students of the previous years should not be encouraged unless the problem has
exceptionally great research importance and scope. Application problems, if found
interesting and arisen at the demand of a particular situation, may also be assigned;
but typical information management systems with just two or three simple database
tables and/or data- entry forms are to be discouraged. The project may be done in other
Institutes/Organizations with prior permission from the concerned department of the
College and in this case also one project supervisor should have to be from the
concerned department in the College. The work will have to be submitted in the form
of a dissertation. Project presentation and evaluation will have to be done as per the
regulation of TDC for semester system of G.U. with choice based credit and grading
system.

A maximum of Four (04) projects would be assigned to one teacher.

1Y3BSIT-601: SYSTEM ADMINISTRATION USING LINUX

Unit 1: (12 Lectures)

What is System Administration? Duties of a System Administrator. Basic features

of the Linux operating system. Installation requirements, Portioning the Hard
drive in Linux, Installing the Linux system, Linux system Startup and
Shutdown.
Unit2: (12 Lectures)

Basics of Linux file system: hierarchy and types. Commands, cp, mv, rm, mkdir,
rmdir, more, touch, ln, mount, umount, mkfs,.absolute and relative path names.
Linux file types, attributes of file, setting user and group ownership of files and
access permissions. mounting and unmounting file systems and partitions.
Structure of/etc/fstab file and its purpose. hard link, symbolic link.

76
 Introductions of Shells. Linux environment variables. Basics of Shell
Programming
Unit3: (12 Lectures)

Program and Process. Foreground process, Background Process, daemons. Basic

commands for starting and stopping processes. Examining the list of running
processes on the system and understand the data presented there. cron, crontab
file format, Standard I/O, Standard error, redirection and piping.
Unit4: (12 Lectures)

Managing user accounts: Adding a user, password, Creating Groups, adding and
deleting groups, viewing user account information, structureof/etc/passwd,

/etc/shadow,/etc/group files System monitoring and logging, Monitoring memory

usage, disk space usage. Backup and Restore procedure
Unit5: (12 Lectures)

IP address and IP addsress classes, subneting, CIDR, Interface configuring with

ifconfig, Gateway configuration, adding routes, ping, netstat, traceroute.
Understanding the significance of the /etc/services file and well known port
numbers. Server configuration DHCP, NFS, NIS, SAMBA, PROXY.

REFERENCE BOOKS

1. Red HatLinux: Proffitt: PHI

2. Introduction to system Administration: IBMseries: PHI
3. Essential System Administration: Frisch:O'REILLY ITB-HC-

1Y3BSIT-602: COMPUTER GRAPHICS

UNIT 1: (14 Lectures)

Introduction: computer graphics and its applications.

Graphics Devices:
Input Devices: Keyboard, Mouse, Trackball & Space ball, Joystick, Data Glove,
Digitizers, Image Scanners, Touch panels, Light Pens systems.

Output display devices: Refresh CRT, Raster scan display and Random scan
display technique, color display techniques Beam penetration method and
Shadow mask method, Direct view storage tubes, emissive

77
 &non emissive flat panel displays Plasma panels, Thin film electrostatic
displays, LED and LCD monitor, Three dimensional viewing devices and
Virtual Reality systems;

Display processor: Raster scan systems, Random scan systems,

UNIT 2: (12 Lectures)

Output primitives: line drawing algorithms DDA algorithm and Bresenham‘s Line
Algorithm, Midpoint Algorithm for Circle and Ellipse Generation, Curve
generation.

Attributes for output primitives :

Area filling Algorithms scan line polygon fill, Nonzero winding number rule;
Scanline curve filling, Boundary fill algorithm, Flood fill algorithm; Character
generation techniques, generation of bitmap and outlined font.
UNIT 3: (12 Lectures)

2D Geometric Transformations: Basic transformations translation, rotation and

Scaling, matrix representations and Homogeneous coordinate representations,
Composite transformations among translation, rotation and scaling, General
Pivot point rotation,
General fixed-point scaling, General scaling directions, Other transformations
reflection and shear, Transformation between coordinate Systems, Definition
of Affine transformations.

2D viewing: definition, viewing transformation pipeline, window to viewport

coordinate transformation.

2D Clipping: Concept and Algorithm: point clipping, line clipping Cohen Sutherland
algorithm, Area clipping, text clipping, polygon clipping.
Interactive picture construction techniques: Basic positioning methods,
constraints, grids, gravity fields, rubber band methods, dragging, painting & rawing.

UNIT 4: (14 Lectures)

3D concepts: Display methods Parallel projection, perspective projection,

3D geometric transformations: Transformation, Translation, Rotation and Scaling

around axes, 3D Viewing Projections – Parallel and Perspective.
UNIT 5: (8 Lectures)

Visible surface detection: Definition, Algorithms for visible surface detection –

Depth buffer method, A buffer method, Ray casting method, Curved
surfaces, Wire frame Methods
78
Illumination and Surface rendering: definition and importance, light sources,
Basic illumination models Ambient light, Diffuse reflection, Specula reflector and
Phong model, combined diffuse and secular ref lections for multiple light sources,
Warn model, Intensity attenuation, Color considerations, Transparency, Shadows.
REFERENCE BOOKS
Computer Graphics, D. Hearn and M.P.Baker, PHI Ltd.

1Y3BSIT-603A OR 1Y3BSIT-604A: MICROPROCESSOR

Unit1: Internal Organization of 8085A microprocessor (12 Lectures)

User Programmable registers, PC, SP, accumulator, flags, data bus, address bus,
control bus, instruction word size, opcode format, data format, memory
addressing, I/O addressing, address decoding for memory and I/O.
Unit2: 8085Amicroprocessorarchitecture (12 Lectures)

Pinout of 8085A microprocessor, multiplexed address/data bus, control and status

signal, demultiplexing of control signals, other signals, bus timings, fetch
decode and execute cycle, timing diagram for opcode fetch memory read and
memory write, interfacing memory andI/O.
Unit3: Assembly language programming in 8085A microprocessor (12 Lectures)

Complete instruction set in detail, programming examples, logic operation, counter

sand time delays, stack and subroutine, processing arrays, bit manipulation.
Unit4: Interfacing (14 Lectures)

In and OUT instruction, decoding addresses, Interfacing LED, relay, seven segment
display, switch, keyboard.
Unit 5: Interrupts (10 Lectures)

Vectored interrupts, interrupt Priorities, general purpose programmable peripheral

devices like 8255A, control and status registers, programming 8255A,
introducing to 8279, 8254 and 8237 (block diagrams and basic functions).

REFERENCE BOOKS:
1.Ramesh S. Gaonkarj, Microprocessor Architecture, Programming and Application
with the 8085

79
1Y3BSIT-603B oR 1Y3BSIT-604B: DATA MINING AND WAREHOUSING
Total Lectures: 60 Credits: 6 (Theory: 05, Tutorial: 01)

UNIT 1: Data Warehousing: (15 Lectures)

Overview and concepts: Need for Data Warehousing, Basic elements of Data
Warehousing, differences between Database Systems and Data Warehouse.

Planning and Requirements: Project planning and management, collecting the

requirements. Architecture and Infrastructure: Data Warehouse Architecture
and its components, Infrastructure and metadata.

Data Design and Data Representation: Principles of dimensional modeling, advanced

topics data extraction, transformation and loading, data quality.

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 2: Data Mining

UNIT 2.1: Introduction: (10 Lectures)

Basics of data mining, Different definitions of Data Mining and related concepts,
Data mining process Data preparation, data cleaning and data visualization.
KDD process. Data mining techniques: Clustering, Association rules and
Decision trees.
UNIT 2.2: Clustering: (15 Lectures)

Partitional versus Hierarchical Clustering, types of data in clustering. Partitional

Clustering methods – kmeans, kmedoids, PAM, CLARA, CLARANS.

Hierarchical clustering methods – BIRCH, CURE. Density based clustering methods

DBSCAN. Categorical clustering – DBSCAN.
UNIT 2.3: Rule Mining: (10 Lectures)

What is an association rule? Mining association rules, frequent sets and border sets,
algorithms for mining association rules – Apriori algorithm, Pincer Search
algorithm, Border algorithm. Generalized association rule, quantitative
association rule, association rule with item constraint.
UNIT 2.4: Decision Trees: (5 Lectures)

80
Introduction, tree construction principle, decision tree generation algorithms – CART,
ID3.
UNIT 2.5: Advanced Topics: (5 Lectures)

(Only basics of the following topics):

Web mining: Web Content Mining, Web Structure, Mining, Web Usage mining.
Spatial mining, Temporal mining – Temporal association rules, sequence mining and
GSP algorithm, discovery of frequent episodes.

REFERENCE BOOKS
1. A.K. Puzari, Data Mining Techniques, University Press.
J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufman.
2001.
1Y3BSIT-603C oR 1Y3BSIT-604C: ARTIFICIAL INTELLIGENCE

UNIT: 1 (12 Lectures)

Definition of artificial intelligence, Numerical computation, information storage,

repetitive operations, other definitions of artificial intelligence, numeric versus
symbolic, algorithm versus non algorithms, area if artificial intelligence, expert
system, natural language processing, speech recognition, automatic
programming, organization of artificial intelligence system, the underlying
assumptions, artificial intelligence techniques.
UNIT:2 (12 Lectures)

Is the good solution absolute or relative, production systems, production system

characteristics, problem solving: defining the problem as a state space search,
Water Jug Problem, Basic problem solving methods : Reason forward from the
initial states , Reason backward from the goal states, Problem trees versus
Problem Graphs, Knowledge representation: Matching and Indexing.
UNIT:3(12 Lectures)

Heuristic search, Heuristic functions, OR graph, ANDOR graph, Weak methods:

Generate and Test, Hill Climbing, Breadth first search, Best first search OR
graph, Problem reduction, Constraints satisfaction, Means End Analysis.
UNIT:4 (12 Lectures)

Game playing: The Minimax Procedure , Adding Alpha Beta Cutoffs, Knowledge
Representation using predicate logic, Representing simple facts in logic,
Augmenting the representation with computable functions and predicates,
81
 Resolution, Conversion to clause form, The basis of resolution, Resolution in
prepositional logic , The Unification algorithm, Resolution in predicate logic ,
Resolution algorithm for predicate logic, Introduction to Non monotonic
Reasoning, Statistical and probabilistic reasoning.
UNIT: 5 (12 Lectures)

Natural language Understanding, Introduction to Understanding, What makes

understanding hard, Understanding single sentences, Keyword matching,
Syntactic analysis , semantic analysis , semantic grammars ,Case grammars
Learning: Introduction to learning, Random learning and Neural nets, Learning
by parameter adjustment, Learning in General Problem Solver (GPS), Concept
Learning.

REFERENCE BOOKS:
1. Elaine Rich,Artificial Intelligence,McGraw Hill book Co. 1982.
2. PH Winston, Artificial Intelligence, Addison Wesley, 1983.

3. Yoshikai Shirai & Junichi Tsujii, John Willeysons, Artificial Intelligence

Concepts, Techniques and Applications.
4. MW Richaugh, Artificial Intelligence A knowledge based application, PWSRent
Publishing,Boston.

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

82