B.

Tech Computer Science and Engineering (Artificial Intelligence and Data Science)
Scheme of Studies/Examination
Semester III
S. Course No. Subject L:T:P Hours/ Credits Examination Schedule Duration
No. Week of Exam
(Hrs.)
Major Minor Practical Tota
Test Test l
1 BS-CS-AIDS- Mathematics for Big 3:0:0 3 3 75 25 0 100 3
201A Data & Optimization
2 PC-CS-AIDS- Object Oriented 3:0:0 3 3 75 25 0 100 3
203A Programming
3 PC-CS-AIDS- Data Structures & 3:0:0 3 3 75 25 0 100 3
205A Algorithms
4 PC-CS-AIDS- Introduction to Artificial 3:0:0 3 3 75 25 0 100 3
207A Intelligence
5 PC-CS-AIDS- Programming Language 3:0:0 3 3 75 25 0 100 3
209A
6 HM-902 Business Intelligence and 3:0:0 3 3 75 25 0 100 3
Entrepreneurship
7 PC-CS-AIDS- Data Structures & 0:0:2 2 1 0 40 60 100 3
213LA Algorithms Lab
8 PC-CS-AIDS- Artificial Intelligence 0:0:2 2 1 0 40 60 100 3
215LA Lab
9 PC-CS-AIDS- Object Oriented 0:0:2 2 1 0 40 60 100 3
217LA Programming Lab
Total 24 21 450 270 180 900

11 SIM-201A* Seminar on Summer 2:0:0 2 0 0 50 0 50

Internship

*Note: SIM-201A* is a mandatory credit-less course in which the students will be evaluated for the Summer
Internship (training) undergone after 2nd semester and students will be required to get passing marks to qualify.
 BS-CS-AIDS-201A Mathematics for Big Data & Optimization
Lecture Tutorial Practical Credit Major Minor Test Total Time
Test
3 0 0 3 75 25 100 3 Hour
Purpose To introduce the concepts of mathematics in Data Science.

Course Outcomes (CO)

CO1 Demonstrate understanding of basic mathematical concepts in data science, relating to
linear algebra, probability, and calculus
CO2 Employ methods related to these concepts in a variety of data science applications
CO3 Apply logical thinking to problem-solving in context.
CO4 Use appropriate technology to aid problem-solving and data analysis
UNIT-I

Fourier series: Introduction, Fourier-Euler Formula, Dirichlet’s conditions, Change of intervals, Fourier series for even
and odd functions, Half range sine and cosine series.

Fourier Transform: Fourier Integral theorem, Fourier sine and cosine transforms and its properties, Convolution,
Parseval’s identity for fourier transforms, Fourier Transform of derivative of a function.

UNIT-II

First order ordinary differential equations: Exact, linear and Bernoulli’s equations, Euler’s equations, Equations not
of first degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s type.

Differential equations of higher orders:Second order linear differential equations with constant coefficients, method
of variation of parameters, Cauchy and Legendre’s linear differential equations.

UNIT-III

Solution of polynomial and transcendental equations: Bisection method, Newton-Raphson method and Regula-Falsi
method, Finite differences, Interpolation using Newton’s forward and backward difference formulae. Interpolation with
unequal intervals: Lagrange’s formulae. Numerical differentiation using forward and backward difference.
Numerical Integration:Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules, Ordinary differential equations: Euler and
modified Euler’s methods. Runge-Kutta method of fourth order for solving first order equations.
UNIT-IV

Introduction – Formulation and classification of optimization problems, overview of analytical solution of

unconstrained optimization problems, constrained optimization, convex set, convex functions, convex optimization
problem, Kuhn Tucker condition, Search methods: overview og single variable search methods, search methods for
multivariable unconstrained problems: optimality criteria, unidirectional search-direct search methods-evolutionary
search methods.

Suggested Books:

• Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.

• P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2nd Edition, Reprint
2012.
• S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.

• Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th Reprint, 2010.

• Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.

• N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.

• B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.

• W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems, 9th Edition,
Wiley India, 2009.

• E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India, 1995.

• E. L. Ince, Ordinary Differential Equations, Dover Publications, 1958.

• G.F. Simmons and S.G. Krantz, Differential Equations, Tata McGraw Hill, 2007.

• Optimization Methods for Engineers, N.V.S. Raju, PHI Learning Pvt. Ltd.
 PC-CS- Object-Oriented Programming
AIDS- 203A
Lecture Tutorial Practical Credit Major Minor Test Total Time
Test
3 0 0 3 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of Object Oriented Programming Language for design
and implement the Object Oriented System.
Course Outcomes (CO)
CO1 To introduce the basic concepts of object oriented programming language and the its
representation.
CO2 To allocate dynamic memory, access private members of class and the behavior of inheritance
and its implementation.
CO3 To introduce polymorphism, interface design and overloading of operator.
CO4 To handle backup system using file, general purpose template and handling of raised exception
during programming.
UNIT – I
Introduction to C++, C++ Standard Library, Illustrative Simple C++ Programs. Header Files, Namespaces, Application
of object oriented programming.
Object Oriented Concepts, Introduction to Objects and Object Oriented Programming, Encapsulation, Polymorphism,
Overloading, Inheritance, Abstract Classes, Accessifier (public/ protected/ private), Class Scope and Accessing Class
Members, Controlling Access Function, Constant, Class Member, Structure and Class

UNIT – II
Friend Function and Friend Classes, This Pointer, Dynamic Memory Allocation and Deallocation (New and Delete),
Static Class Members, Constructors, parameter Constructors and Copy Constructors, Deconstructors,
Introduction of inheritance, Types of Inheritance, Overriding Base Class Members in a Derived Class, Public, Protected
and Private Inheritance, Effect of Constructors and Deconstructors of Base Class in Derived Classes.

UNIT – III
Polymorphism, Pointer to Derived class, Virtual Functions, Pure Virtual Function, Abstract Base Classes, Static and
Dynamic Binding, Virtual Deconstructors.
Fundamentals of Operator Overloading, Rules for Operators Overloading, Implementation of Operator Overloading
Like <<,>> Unary Operators, Binary Operators.

UNIT – IV
Text Streams and binary stream, Sequential and Random Access File, Stream Input/ Output Classes, Stream
Manipulators.
Basics of C++ Exception Handling, Try, Throw, Catch, multiple catch, Re-throwing an Exception, Exception
specifications.
Templates: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non- Type
Template arguments.

Suggested Books:
1. The complete reference C ++ by Herbert shieldt Tata McGraw Hill.
2. Object Oriented Programming in Turbo C++ by Robert Lafore, 1994, The WAITE Group Press.
3. Shukla, Object Oriented Programming in c++, Wiley India.
4. C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall.
5. Programming with C++ By D Ravichandran, 2003, T.M.H.
Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 PC-CS-AIDS-
Data Structures & Algorithms
205A
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of Data Structures for design and implement the software
systems logically and physically.
Course Outcomes (CO)
CO 1 To introduce the basic concepts of Data structure , basic data types ,searching and sorting based on
array data types.
CO 2 To introduce the structured data types like Stacks and Queue and its basic operations’ implementation.
CO 3 To introduce dynamic implementation of linked list.
CO 4 To introduce the concepts of Tree and graph and implementation of traversal algorithms.
UNIT – I
Introduction to Data Structures, Data Types, Built in and User Defined Data Structures, Applications of Data
Structure, Algorithm Analysis, Worst, Best and Average Case Analysis, Notations of Space and Time Complexity,
Basics of Recursion.

Arrays, One Dimensional Arrays, Two Dimensional Arrays and Multi-Dimensional Arrays, Sparse Matrices, Searching
from array using Linear and Binary Searching Algorithm, Sorting of array using Selection, Insertion, Bubble, Radix
Algorithm

UNIT – II
Stacks: Definition, Implementation of Stacks and Its Operations, Evaluation of Infix, prefix and Postfix Expression,
Inter-conversion of Infix, Prefix and Post-Fix Expression, Implementation of Merge Sort and Quick Sort Algorithm.

Queues: Definition, Sequential Implementation of Linear Queues and Its Operations, Circular Queue and Its
Implementation, Priority Queues and Its Implementation, Applications of queues.

UNIT – III
Linked Lists: Need of Dynamic Data Structures, Single Link List and Its Dynamic Implementation, Traversing,
Insertion, Deletion Operations on Single Link Lists. Comparison between Static and Dynamic, Implementation of
Linked List. Circular Link Lists and Doubly Link List, Dynamic Implementation of Primitive Operations on Doubly
Linked Lists and Circular Link List. Dynamic Implementation of Stacks and Queues.

UNIT – IV
Trees: Definition, Basic Terminology, Binary Tree, External and Internal Nodes, Static and Dynamic Implementation
of a Binary Tree, Primitive Operations on Binary Trees, Binary Tree Traversals: Pre-Order, In-Order and Post-Order
Traversals. Representation of Infix, Post-Fix and Prefix Expressions using Trees.

Introduction to Binary Search Trees: B+ trees, AVL Trees, Threaded Binary trees, Balanced Multi-way search trees,
Implementation of Heap Sort Algorithm.

Graphs: Basic Terminology, Definition of Undirected and Directed Graphs, Memory Representation of Graphs,
Minimum-Spanning Trees, Warshal Algorithm, Graph Traversals Algorithms: Breadth First and Depth First.

Suggested Books:

• Theory and Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline, TMH.

• Data Structures and Algorithms by PAI, TMH.

• Fundamentals of Data structures by Ellis Horowitz and Sartaj Sahni, Pub, 1983, AW.

• Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition, Addison-
Wesley, 1999, Low Priced Edition.

• Data Structures and Program Design in C by Robert Kruse, PHI,

• Shukla, Data Structures using C++, Wiley India

• Introduction to Computers Science -An Algorithms Approach, Jean Paul Tremblay, Richard B. Bunt, 2002,
T.M.H.

• Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H.

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
PC-CS-AIDS- Introduction to Artificial Intelligence
207A
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3 75 25 100 3 Hour
Purpose To gain a broad understanding of the discipline of Artificial Intelligence and its scope in various
emerging areas.
Course Outcomes(CO)
CO1 Demonstrate fundamental understanding of Artificial Intelligence (AI) and its foundation

CO2 Apply basic principles of AI in solutions that require problem solving, inference, perception,
knowledge representation, and learning
CO3 Demonstrate proficiency in applying scientific method to models of machine learning
CO4 Demonstrate an ability to share in discussions of AI, its current scope and limitations, and societal
implications

UNIT – I
Scope of AI: Games, theorem proving, natural language processing, vision and speech processing, robotics, expert
systems, AI techniques-search knowledge, abstraction.
Problem Solving (Blind): State space search; production systems, search space control; depth first search , breadth-
first search. Heuristic Based Search: Heuristic search, Hill climbing, best-first search, branch and bound, Problem
Reduction, Constraint Satisfaction End, Means-End Analysis.
UNIT – II
Game Playing: Game Tree, Minimax Algorithm, Alpha Beta Cutoff, Modified Minimax Algorithm, Horizon Effect,
Futility Cut-off.
Knowledge Representation: Predicate Logic: Unificatioin, Modus Ponens, Modus Tolens, Resolution in Predicate
Logic, Conflict Resolution Forward Chaining, Backward Chaining, Declarative and Procedural Representation, Rule
based Systems.
Structured Knowledge Representation: Semantic Nets: Slots, exceptions and default frames, conceptual
dependency, scripts.
UNIT – III
Knowledge Engineering: First order logic, Syntax and semantics for first order logic, Inference in First
order logic – prepositional versus first order logic, unification and lifting, forward chaining, backward
chaining , Resolution, Knowledge representation
Handling Uncertainty: Non-Monotonic Reasoning, Probabilistic reasoning, use of certainty factors, fuzzy logic.
Natural Language Processing: Introduction, Syntactic Processing, Semantic Processing, Pragmatic Processing.
UNIT – IV
LEARNING PRINCIPLES : Learning from observations , forms of learning , Inductive learning , Learning decision
trees, Ensemble learning, Knowledge in learning,Logical formulation of learning ,Explanation base learning,Learning
using relevant information, Inductive logic programming,Statistical learning methods,Learning with
complete data ,Learning with hidden variable, genetic algorithm, learning by inductions, neural networks.

Expert Systems: Need and justification for expert systems, knowledge acquisition, Case Studies: MYCIN, RI.
Suggested Books:
1. E. Rich and K. Knight, “Artificial Intelligence”, TMH, 2nd Ed., 1992.
2. N. J. Nilsson, “Principles of AI”, Narosa Publ. House, 1990.
3. M. N. Hoda, “Foundation Course in Artificial Intelligence”, Vikas Pub., 2004.
4. P. H. Winston, "Artificial Intelligence", Pearson Education, 3rd Edition, 2002. Artificial Intelligence.
5. D. W. Patterson, “Introduction to AI and Expert Systems”, PHI, 1992.
6. R. J. Schalkoff, “Artificial Intelligence – An Engineering Approach”, McGraw Hill Int. Ed. Singapore, 1992.
7. M. Sasikumar, S. Ramani, “Rule Based Expert Systems”, Narosa Publishing House, 1994. 5. Tim Johns, “Artificial
Intelligence, Application Programming, Wiley Dreamtech, 2005.
 PC-CS-
Programming Languages
AIDS- 209A
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of programming languages for design and implement the
software intensive systems.
Course Outcomes (CO)
CO 1 To introduce the basic concepts of programming language, the general problems and methods related
to syntax and semantics.
CO 2 To introduce the structured data objects, subprograms and programmer defined data types.
CO 3 To outline the sequence control and data control.
CO 4 To introduce the concepts of storage management using programming languages.
UNIT – I
Introduction: A brief history, Characteristics of a good programming language, Programming language translators-
compiler and interpreters, Elementary data types – data objects, variable and constants, data types. Specification and
implementation of elementary data types, Declarations, type checking and type conversions, Assignment and
initialization, Numeric data types, enumerations, Booleans and characters.

Syntax and Semantics: Introduction, general problem of describing syntax, Formal method of describing Syntax,
attribute grammar dynamic semantic.

UNIT – II
Structured data objects: Structured data objects and data types, specification and implementation of structured data
types, Declaration and type checking of data structure, vector and arrays, records Character strings, variable size data
structures, Union, pointer and programmer defined data objects, sets, files.

Subprograms and Programmer Defined Data Types: Evolution of data type concept abstraction, encapsulation and
information hiding, Subprograms, type definitions, abstract data types, over loaded subprograms, generic subprograms.

UNIT – III
Sequence Control: Implicit and explicit sequence control, sequence control within expressions, sequence control within
statement, Subprogram sequence control: simple call return, recursive subprograms, Exception and exception handlers,
co routines, sequence control. Concurrency – subprogram level concurrency, synchronization through semaphores,
monitors and message passing

Data Control: Names and referencing environment, static and dynamic scope, block structure, Local data and local
referencing environment, Shared data: dynamic and static scope, Parameter and parameter transmission schemes.

UNIT – IV
Storage Management: Major run time elements requiring storage, programmer and system controlled storage
management and phases, Static storage management, Stack based storage management, Heap storage management,
variable and fixed size elements.

Programming Languages: Introduction to procedural, non-procedural, structured, logical, functional and object
oriented programming language, Comparison of C and C++ programming languages.
Suggested Books:

• Terrence W. Pratt, Marvin V. Zelkowitz, Programming Languages Design and Implementation, Pearson.

• Allen Tucker and Robert Noonan, Programming Languages–Principles and Paradigms, Tata McGraw-Hill,
2009.

• Ellis Horowitz, Fundamentals of Programming Languages, Galgotia Publications, 2010.

• C. Ghezzi, Programming Languages Concepts, Wiley Publications, 2010.

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 HM-902 Business Intelligence and Entrepreneurship
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3 75 25 100 3
Purpose To make the students conversant with the basics concepts in management thereby leading to nurturing
their managerial skills.
Course Outcomes (CO)
CO1 Students will be able understand who the entrepreneurs are and what competences needed to become
an Entrepreneur.
CO2 Students will be able understand insights into the management, opportunity search, identification of
a Product; market feasibility studies; project finalization etc. required for small business enterprises.
CO3 Students can be able to write a report and do oral presentation on the topics such as product
identification, business idea, export marketing etc.
CO4 Students will be able to know the different financial and other assistance available for the small
industrial units.
UNIT – I
Entrepreneurship : Concept and Definitions; Entrepreneurship and Economic Development; Classification and Types
of Entrepreneurs; Entrepreneurial Competencies; Factor Affecting Entrepreneurial Growth – Economic, Non-Economic
Factors; EDP Programmes; Entrepreneurial Training; Traits/Qualities of an Entrepreneurs; Manager Vs. Entrepreneur,
Entrepreneurial challenges.

UNIT – II
Opportunity / Identification and Product Selection: Entrepreneurial Opportunity Search and Identification; Criteria
to Select a Product; Conducting Feasibility Studies; Sources of business ideas, Marketing Plan : Conducting of
Marketing Research, Industry Analysis, Competitor analysis, market segmentation and positioning, building a
marketing plan, marketing mix, launching a new product; export marketing, Methods of Project Appraisal, Project
Report Preparation; Specimen of Project Report; Project Planning and Scheduling using Networking Techniques of
PERT / CPM.

UNIT – III
Small Enterprises and Enterprise Launching Formalities : Definition of Small Scale; Rationale; Objective; Scope;
SSI; Registration; NOC from Pollution Board; Machinery and Equipment Selection , Role of SSI in Economic
Development of India; major problem faced by SSI,MSMEs – Definition and Significance in Indian Economy;
MSME Schemes, Challenges and Difficulties in availing MSME Schemes.

UNIT – IV
Role of Support Institutions and Management of Small Business : DIC; SIDO; SIDBI; Small Industries
Development Corporation (SIDC); SISI; NSIC; NISBUD; State Financial Corporation SIC; Venture Capital : Concept,
venture capital financing schemes offered by various financial institutions in India.

Special Issues for Entrepreneurs: Legal issues – Forming business entity, requirements for formation of a
Private/Public Limited Company, Entrepreneurship and Intellectual Property Rights: IPR and their importance. (Patent,
Copy Right, Trademarks) , Case Studies-At least one in whole course.
Note:
• Case studies of Entrepreneurs – successful, failed, turnaround ventures should be discussed in the class.
• Exercises / activities should be conducted on ‘generating business ideas’ and identifying problems and opportunities.
• Interactive sessions with Entrepreneurs, authorities of financial institutions, Government officials should be organized

Suggested Readings:

1. “Entrepreneurship development small business enterprises”, Pearson, Poornima M Charantimath,2013.

2. Roy Rajiv, “Entrepreneurship”, Oxford University Press, 2011.
3. “Innovation and Entrepreneurship”,Harper business- Drucker.F, Peter, 2006.
4. “Entrepreneurship”, Tata Mc-graw Hill Publishing Co.ltd new Delhi- Robert D. Hisrich, Mathew J. Manimala,
Michael P Peters and Dean A. Shepherd, 8th Edition, 2012
5. Enterpreneurship Development- S.Chand and Co.,Delhi- S.S.Khanka 1999
6. Small-Scale Industries and Entrepreneurship. Himalaya Publishing House, Delhi –Vasant Desai 2003.
7. Entrepreneurship Management -Cynthia, Kaulgud, Aruna, Vikas Publishing House, Delhi, 2003.

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 PC-CS-AIDS- Data Structure & Algorithms Lab
213LA
Lecture Tutorial Practical Credit Minor Test Practical Total Time
0 0 2 1 40 60 100 3
Purpose To introduce the principles and paradigms of Data Structures for design and implement the software
systems logically and physically.
Course Outcomes (CO)
CO1 Implement linear and non linear data structures using linked list.
CO2 Apply various data structures such as stack, queue and tree to solve the problems.
CO3 Implement various searching and sorting techniques.
CO4 Choose appropriate data structure while designing the applications and analyze the complexity of
the algorithms.

LIST OF PRACTICALS
1. Write a program for Binary search methods.
2. Write a program for insertion sort, selection sort and bubble sort.
3. Write a program to implement Stack and its operation.
4. Write a program for quick sort.
5. Write a program for merge sort.
6. Write a program to implement Queue and its operation.
7. Write a program to implement Circular Queue and its operation.
8. Write a program to implement singly linked list for the following operations: Create, Display, searching,
traversing and deletion.
9. Write a program to implement doubly linked list for the following operations: Create, Display, inserting,
counting, searching, traversing and deletion.
10 Write a program to implement circular linked list for the following operations: Create, Display, inserting,
counting, searching, traversing and deletion.
11. Write a program to implement insertion, deletion and traversing in B tree

NOTE: A student has to perform at least ten experiments. Seven experiments should be performed from the
above list. Remaining three experiments may either be performed from the above list or designed &
set by the concerned institution as per the scope of the syllabus.
 PC-CS-AIDS- Artificial Intelligence Lab
215LA
Lecture Tutorial Practical Credit Minor Test Practical Total Time
0 0 2 1 40 60 100 3
Purpose To gain a broad understanding of the discipline of Artificial Intelligence

Course Outcomes
CO1 To understand the basic concepts of Artificial Intelligence.

CO2 To apply various AI Search algorithms.

CO3 To understand the fundamentals of knowledge representation and theorem proving using AI
tools.
CO4 Ability to apply knowledge representation and machine learning techniques to real life
problems.

LIST OF PRACTICALS:
1. Introduction to PYTHON & study of basic commands.
2. Write a program to implement Factorial, Fibonacci of a given number.
3. Write a program to solve 8 queens problem.
4. Solve a problem using Depth First Search.
5. Solve a problem using Breadth First Search.
6. Solve 8 puzzle problem using Best First Search
7. Solve Robot Traversal Problem using Means End Analysis
8. Solve Travelling Salesman Problem.
Suggested Books:

1. Artificial Intelligence: A Modern Approach,. Russell & Norvig, Prentice Hall.

2. Artificial Intelligence, Elain Rich and Kevin Knight, TMH.

3. Artificial Intelligence-A modern approach, Staurt Russel and peter norvig, 1998, PHI.

4. Artificial intelligence, Patrick Henry Winston:, 1992, Addition Wesley 3 Ed.

 PC-CS-AIDS- Object Oriented Programming Lab
217LA
Lecture Tutorial Practical Credit Minor Test Practical Total Time
0 0 2 1 40 60 100 3 Hour
Purpose To introduce the principles and paradigms of Object Oriented Programming Language for design
and implement the Object Oriented System.
Course Outcomes (CO)
CO1
Implement object oriented concepts such as objects,classes abstraction and message passing.
CO2 Implement the friend function ,function overloading and virtual function
CO3 Implement Operator overloading, Inheritance and method overriding.
CO4 Implement the various functions on String and apply I/O operation to handle file system
LIST OF PRACTICALS

1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called power

( ) that takes a double value for n and an int value for p, and returns the result as double value. Use a default argument
of 2 for p, so that if this argument is omitted, the number will be squared. Write a main ( ) function that gets values from
the user to test this function.

2. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. For
example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis. The sum of
two points can be defined as a new point whose X coordinate is the sum of the X coordinates of the points and whose
Y coordinate is the sum of their Y coordinates. Write a program that uses a structure called point to model a point.
Define three points, and have the user input values to two of them. Then set the third point equal to the sum of the other
two, and display the value of the new point. Interaction with the program might look like this:

Enter coordinates for P1: 3 4

Enter coordinates for P2: 5 7

Coordinates of P1 + P2 are : 8, 11

3. Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator,
and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or
dividing the two numbers. (It should use a switch statement to select the operation). Finally it should display the result.
When it finishes the calculation, the program should ask if the user wants to do another calculation. The response can
be ‘Y’ or ‘N’. Some sample interaction with the program might look like this.

Enter first number, operator, and second number: 10/ 3

Answer = 3.333333
Do another (Y/ N)? Y
Enter first number, operator, second number 12 + 100
Answer = 112
Do another (Y/ N) ? N
4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange
(767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number
separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input
a number for the other one. Then display both numbers. The interchange might look like this:

• Enter your area code, exchange, and number: 415 555 1212
• My number is (212) 767-8900
• Your number is (415) 555-1212
5. Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and
DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another
object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM
object or DB objects, depending on the units in which the results are required. The display should be in the format of
feet and inches or metres and cenitmetres depending on the object on display.

6. Create a class rational which represents a numerical value by two double values- NUMERATOR and
DENOMINATOR. Include the following public member Functions:

• constructor with no arguments (default).

• constructor with two arguments.

• void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator
and denominator.

• Overload + operator to add two rational number.

• Overload >> operator to enable input through cin.

• Overload << operator to enable output through cout.

Write a main ( ) to test all the functions in the class.

7. Consider the following class definition

class father {

protected : int age;

public;

father (int x) {age = x;}

virtual void iam ( )

{ cout < < “I AM THE FATHER, my age is : ”<< age<< end1:}

Derive the two classes son and daughter from the above class and for each, define iam ( ) to write our similar but
appropriate messages. You should also define suitable constructors for these classes. Now, write a main ( ) that creates
objects of the three classes and then calls iam ( ) for them. Declare pointer to father. Successively, assign addresses of
objects of the two derived classes to this pointer and in each case, call iam ( ) through the pointer to demonstrate
polymorphism in action.

8. Write a program that creates a binary file by reading the data for the students from the terminal. The data of each
student consist of roll no., name ( a string of 30 or lesser no. of characters) and marks.

9. A hospital wants to create a database regarding its indoor patients. The information to store include

a) Name of the patient

b) Date of admission

c) Disease

d) Date of discharge

Create a structure to store the date (year, month and date as its members). Create a base class to store the above
information. The member function should include functions to enter information and display a list of all the patients in
the database. Create a derived class to store the age of the patients. List the information about all the to store the age of
the patients. List the information about all the pediatric patients (less than twelve years in age).
10. Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Add an instance
variable, named department, of type string. Supply a method to to String that prints the manager’s name, department
and salary. Make a class Executive inherits from Manager. Supply a method to String that prints the string
“Executive” followed by the information stored in the Manager superclass object. Supply a test program that tests
these classes and methods.

11. Imagine a tollbooth with a class called toll Booth. The two data items are a type unsigned int to hold the total number
of cars, and a type double to hold the total amount of money collected. A constructor initializes both these to 0. A
member function called payingCar ( ) increments the car total and adds 0.50 to the cash total. Another function, called
nopayCar ( ), increments the car total but adds nothing to the cash total. Finally, a member function called displays the
two totals. Include a program to test this class. This program should allow the user to push one key to count a paying
car, and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and
total cash and then exit.

12. Write a function called reversit ( ) that reverses a string (an array of char). Use a for loop that swaps the first and last
characters, then the second and next to last characters and so on. The string should be passed to reversit ( ) as an
argument. Write a program to exercise reversit ( ). The program should get a string from the user, call reversit ( ), and
print out the result. Use an input method that allows embedded blanks. Test the program with Napoleon’s famous phrase,
“Able was I ere I saw Elba)”.

13. Create some objects of the string class, and put them in a Deque-some at the head of the Deque and some at the tail.
Display the contents of the Deque using the forEach ( ) function and a user written display function. Then search the
Deque for a particular string, using the first That ( ) function and display any strings that match. Finally remove all the
items from the Deque using the getLeft ( ) function and display each item. Notice the order in which the items are
displayed: Using getLeft ( ), those inserted on the left (head) of the Deque are removed in “last in first out” order while
those put on the right side are removed in “first in first out” order. The opposite would be true if getRight ( ) were used.

14. Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as
current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility.
The current account provides cheque book facility but no interest. Current account holders should also maintain a
minimum balance and if the balance falls below this level, a service charge is imposed.

Create a class account that stores customer name, account number and type of account. From this derive the classes

cur_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order
to achieve the following tasks:

a) Accept deposit from a customer and update the balance.

b) Display the balance.

c) Compute and deposit interest.

d) Permit withdrawal and update the balance.

e) Check for the minimum balance, impose penalty, necessary and update the balance.

f) Do not use any constructors. Use member functions to initialize the class members.

15. Create a base class called shape. Use this class to store two double type values that could be used to compute the
area of figures. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a
member function get_data( ) to initialize baseclass data members and another member function display_area( ) to
compute and display the area of figures. Make display_area ( ) as a virtual function and redefine this function in the
derived classes to suit their requirements. Using these three classes, design a program that will accept dimensions of a
triangle or a rectangle interactively and display the area.

Remember the two values given as input will be treated as lengths of two sides in the case of rectangles and as base and
height in the case of triangles and used as follows:
Area of rectangle = x * y

Area of triangle = ½ * x * y

NOTE: A student has to perform at least ten experiments. Seven experiments should be performed from the
above list. Remaining three experiments may either be performed from the above list or designed & set by the
concerned institution as per the scope of the syllabus.

B. Tech Computer Science and Engineering (Artificial Intelligence and Data Science)
 Scheme of Studies/Examination
Semester IV

S. Course No. Subject L:T:P Hours/ Credits Examination Schedule Duration

No. Week of Exam
(Hrs.)
Major Minor Practical Total
Test Test
1 BS-AIDS- Bayesian Data Analysis 3:0:0 3 3 75 25 0 100 3
202A
2 PC-CS- Data Science with R 3:0:0 3 3 75 25 0 100 3
AIDS- 204A Programming
3 ES-CS- Intelligent 3:0:0 3 3 75 25 0 100 3
AIDS- 206A Communication
Systems
4 PC-CS- Internet and web 3:0:0 3 3 75 25 0 100 3
AIDS- 208A technology
5 PC-CS- Database Management 3:0:0 3 3 75 25 0 100 3
AIDS- 210A System
6 PC-CS- Operating system 3:0:0 3 3 75 25 0 100 3
AIDS- 212A
7 PC-CS- R Lab 0:0:2 2 1 0 40 60 100 3
AIDS-
214LA
8 PC-CS- Internet and web 0:0:2 2 1 0 40 60 100 3
AIDS- technology Lab
216LA
9 PC-CS- Database Management 0:0:2 2 1 0 40 60 100 3
AIDS- System Lab
218LA
Total 24 21 450 270 180 900

MC -901A Environmental Sciences 3:0:0 3 0 0 100 0 100 3

10
BS-AIDS- Bayesian Data Analysis
202A
Lecture Tutorial Practical Credit Major Test Minor Test Total Time

3 0 0 3 75 25 100 3 Hrs.

Purpose Aim of this course is to equip students with the skills to perform and interpret Bayesian Data analysis
Course Outcomes(CO)
CO1 Demonstrate fundamental understanding of Bayesian Inference and models
CO2 Understand and apply Bayesian statistics, posterior inference and decision analysis for making Bayesian
models.
CO3 Demonstrate Computation , approximation and simulating from probability distributions in Bayesian
analysis
CO4 Understand Bayesian forms of the standard statistical models

UNIT – I
Fundamental of Bayesian Inference

Probability & Inference : The Bayesian Approach, Basic Probability, Bayes' Bayes' Law, Posterior Distribution,
Bayesian Framework , The three steps of Bayesian Data Analysis, Statisitcal Infernece and Bayesian Infernece, Discrete
Probability Examples:- genetics and spell checking, Bayesian Inference in Applied Science
Models: Single and multi-variate models, Bayesian networks, Second-order models (i.e., distributions over distribution
parameters), Infinite models: Gaussian process, Dirichlet process, Hierarchical models, Non-parameteric models.
UNIT – II
Bayesian Data Analysis
Posterior predictive checking of model in applied Bayesian statistics, Graphical posterior predictive check, Measures of
predictive accuracy, Information criteria and cross-validation Model comparison based on predictive performance ,
Model comparison using Bayes factors , Bayesian decision theory in different contexts ,Using regression predictions,
Multistage decision making, Hierarchical decision analysis for radon measurement , Personal vs. institutional decision
analysis.
UNIT – III
Computation & Approximations
Introduction Bayesian computation, Numerical integration, Distributional approximations , Markov chain simulation,
Metropolis and Metropolis-Hastings algorithms , Using Gibbs and Metropolis as building blocks, Gibbs Sampling
Examples in R and WinBUGS, Inference and assessing convergence, Hamiltonian Monte Carlo, Posterior modes
Normal and related mixture approximations, Finding marginal posterior modes using EM, Approximating conditional
and marginal posterior densities
UNIT – IV
Regression Models

Bayesian analysis of the classical regression model, Regression for causal inference: incumbency in congressional
elections, Goals of regression analysis, Hierarchical Linear Model: - Regression coefficients, Interpreting a normal prior
distribution, varying intercepts and slopes, Standard generalized linear model likelihoods, Working with generalized
linear models 407 16.3 Weakly informative priors for logistic regression, Models for multivariate and multinomial
responses 423 16.7 Loglinear models for multivariate discrete data,
Nonlinear and Nonparametric Models: Parametric nonlinear models, Gaussian process models, Finite mixture
models, Dirichlet process models.

Suggested Books:

1. Bayesian Data Analysis, by Andrew Gelman, John Carlin, Hal Stern, David Dunson, Aki Vehtari, and Donald
Rubin, Chapman and Hall/CRC
2. Data Analysis: A Bayesian Tutorial, D. S. Sivia, Clarendon Press, 1996
3. Doing Bayesian Data Analysis: A Tutorial Introduction with R, John Kruschke, Academic press.
 PC-CS- Data Science and R Programming
AIDS- 204A

Lecture Tutorial Practical Credit Major Minor Test Total Time

Test

3 0 0 3 75 25 100 3 Hrs.

Purpose To Describe what Data Science is and the skill sets needed to be a data scientist..

Course Outcomes (CO)

CO1 Basics of Data Science, Explain basic Statistics. Identify probability distributions commonly
used as foundations for statistical modeling. Fit a model to data.

CO2 Using R to carry out basic statistical modeling and analysis..

CO3 Explain the significance of exploratory data analysis (EDA) in data science. Apply basic tools
(plots, graphs, summary statistics) to carry out EDA.

CO4 Describe the Data Science Process and how its components interact via machine learning
models.

UNIT -I

What is Data Science, What does Data Science involve, Era of Data Science, Business Intelligence vs Data Science,
Life cycle of Data Science, Tools of Data Science, Introduction to Big Data and Hadoop, Introduction to R, Introduction
to Spark, Introduction to Machine Learning.

Statistics: Describing a Single Set of Data, Central Tendencies, Dispersion, Correlation, Simpson’s Paradox, Some
Other Correlational Caveats, Correlation and Causation. Probability: Dependence and Independence, Conditional
Probability, Bayes’s Theorem, Random Variables, Normal Distribution, Binary distribution.

UNIT -II

R Programming, What is R, Installing R and RStudio, RStudio Overview, Working in the Console , Writing data,
Reading from csv files, Data Types, Operators, Functions, Vectors, Data Frames, Factors, Sorting Numeric, Character,
and Factor Vectors, Special Values, Installing and loading packages, Setting up your working directory, Downloading
and importing data, Working with missing data , Extracting a subset of a data frame, Writing R scripts, Creating reports,
Flow Control, while loops, for loops, If / else, Debugging tools, Data Analysis Pipeline, Data Extraction, Types of Data,
Raw and Processed, Data Wrangling

UNIT -III

Data Manipulation in R, List Management, Data Transformation, Merging Data Frames, Outlier Detection, Combining
multiple vectors, Logical Regression, Hierarchical Clustering, PCA for Dimensionality Reduction, Data Import
Techniques, Exploratory Data Analysis, Visualization of Data, Loading different types of dataset in R, Arranging the
data, Plotting the graphs, Statistical graphs, Creating bar chart and dot plot, Creating histogram and box plot, Plotting
with base graphics, Plotting and coloring in R

UNIT -IV

Machine Learning using R: Modeling, Linear Regression, Logistic Regression, K-Means, K-Means++, Hierarchical
Clustering – Agglomerative, CART, Random forest, Naïve Bayes, Implementing Support Vector Machine in R,
Suggested Book

1. R for Data Analysis in Easy Steps by Mike Mc Grath .

2. Beginning Data Science in R: Data Analysis, Visualization, and Modelling for the Data Scientist by Thomas
Mailund.

3. The Elements of Statistical Learning, 2nd edition. — Springer, 2009. Hastie, T., Tibshirani, R., Friedman, J.

4. Statistical Analysis with R For Dummies by: Joseph Schmuller.

5. Machine Learning: A Probabilistic Perspective. Murphy, K. - MIT Press, 2012.

6. “Practical Data Science with R”. Nina Zumel, John Mount. Manning, 2014.

7. Advanced R: Data Programming and the Cloud by by: Matt Wiley,Joshua F. Wiley.

8. Python for Data Analysis: Data Wrangling with Pandas, NumPy, and IPython ,2nd edition, Wes
McKinney,O’Reilly Media (2017)
ES-CS-AIDS- Intelligent Communication Systems
206A

Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3 75 25 100 3 Hrs.
Purpose To gain a broad understanding of intelligent communication system and its scope in various
emerging areas.
Course Outcomes(CO)
CO1 To be able to understand the theoretical basis of communication system process
CO2 Demonstrate the concept of Information theory and describe various sources available to transfer
the information.
CO3 To have the in depth knowledge of the Communication Network Structure and study various
protocols.
CO4 To deal with the practical aspect of intelligent communication system.

UNIT – I
Communication System: Elements of communication system, introduction to analog and digital communication
systems, Nyquist, Sampling Theorem. Quantization, Pulse Code Modulation, Delta Modulation, Pass band Digital
Transmission via Carrier Modulation: ASK, FSK, BPSK, and QPSK. Multiplexing technique: Time Division
Multiplexing (TDM), Frequency Division Multiplexing (FDM).

UNIT – II
Information Theory: Introduction to information theory, Information sources; average code word length; Huffman
encoding; Channel capacity, discrete memory less channels and capacity, channel coding theorem; theory and practice
of error-control coding: trellis diagram and the Viterbi algorithm, connection-type communication and connectionless-
type communication, numbering plan.

UNIT – III
Communication Network Structure: Telephone Network Architecture, Computer Network Architecture: Computer
Network, Network Architecture, OSI Protocol, Specific Structure of the OSI Reference Model, Internet Network
Architecture: TCP/IP Protocol, TCP/IP Subprotocol Structure.
Advances in Communication Networks: Integrated Services Digital Network, N-ISDN, B- ISDN, Session Initiation
Protocol (SIP), Asynchronous Transfer Mode

UNIT – IV
Intelligent Communication Systems: Concept of Intelligent Communication Systems, Functions of the Intelligent
Processing Layer, Structure of the Knowledge-Base System, Design Methodology for Telecommunication Services:
state-of-the-art design methodology, definition, graph theory, conflicts among telecommunication services, conflict of
charge policy, high-level description of telecommunication.

Basic Technology of the Intelligent Communication System: Application of Production Rules to

Telecommunications, Description of Telecommunication Services in a Semantic Network, Symbolic Logic, Predicate
Logic: Definitions and Operations for Predicate Logic, Clausal Form, Herbrand Universe and the Herbrand Theorem,
Proof of Tautology, Resolution Principle, Logical Consequence, Horn Set, Application to Telecommunication Service.

Suggested Books
1. Communication Systems: Analog and Digital by R. P. Singh and B. D. Sapre, Tata- McGraw Hill
2. Intelligent Communication Systems- Nobuyoshi Terashima (2001) Reference
3. B.P. Lathi and Z. Ding: Modern Digital and Analog Communication Systems, Fourth Edition, 2010,
ISBN-13: 978-0-19-533145-5 (main text)
 PC-CS- Internet & Web technology
AIDS- 208A
Lecture Tutorial Practical Credit Major Minor Test Total Time
Test
3 0 0 3 75 25 100 3 Hrs.
Purpose To gain a broad understanding of the discipline of Web engineering and its application to the
development and management of Web Applications.
Course Outcomes
CO1 Learn the basic concepts of information and web architecture.
CO2 Learn about the skills that will enable to design and build high level web enabled applications.
CO3 Understand the applicability of Java Script as per current software industry standards.
CO4 Acquaint the latest programming language for the implementation of object based and procedure
based applications using Python.

UNIT – I
Information Architecture: The role of Information Architect, Collaboration and communication, Organizing
information, organizational challenges, Organizing web sites and Intranets, Creating cohesive organization systems,
designing navigation systems, types of navigation systems, Integrated navigation elements, designing elegant navigation
systems, Searching systems, Searching your web site, designing the search interface, Indexing the right stuff, To search
or not to search grouping content, conceptual design, High level Architecture Blueprint. Architectural Page Mockups,
Design Sketches.

UNIT – II
Introduction to XHTML and HTML5: Origins and Evolution of HTML and XHTML, Basic Syntax, Standard
XHTML Document Structure, Basic Text Markup, Images, Hypertext Links, Lists, Tables, Forms, HTML5, Syntactic
Differences between HTML and XHTML.

Cascading Style Sheets: Introduction, Levels of Style Sheets, Style Specification Formats, Selector Forms, Property
Value Forms, Font Properties, List Properties, Color, Alignment of Text, Box Model, Background Images, Conflict
Resolution.

UNIT – III
Java Script: Overview of JavaScript, Object Orientation and JavaScript, General Syntactic Characteristics, Primitives,
Operations, and Expressions, Screen Output and Keyboard Input, Control Statements, Object Creation and Modification,
Arrays, Functions, Constructors, Pattern Matching Using Regular Expressions, Errors in Scripts

UNIT – IV
Python: Introduction to Python, Data Types and Expressions, Control Statements, Strings and Text Files, Lists and
Dictionaries, Design with Functions, Design with Classes

Suggested Books:
• By Peter Morville, Louis Rosenfeld, “Information Architecture on the World Wide Web”, O'Reilly Media,
2006.
• Robert W. Sebesta, “Programming The World Wide Web”, Eight Edition, Pearson India, 2015.
• Kenneth A. Lambert, “The Fundamentals of Python: First Programs”, 2011, Cengage Learning.
• Thomas A Powell, “HTML The Complete Reference”, Tata McGraw Hill Publications.
 PC-CS- Data Base Management Systems
AIDS- 210A
Lecture Tutorial Praqctica Credit Major Minor Test Total Time
l Test
3 0 0 3 75 25 100 3 Hrs.
Purpose To familiarize the students with Data Base Management system
Course Outcomes
CO1 To provide introduction to relational model.
CO2 To learn about ER diagrams and SQL.
CO3 To understand about the concept of functional dependencies.
CO4 To understand about Query Processing and Transaction Processing.

UNIT – I
Introduction: Concept & Overview of DBMS, Advantages of DBMS over file processing system, Database Languages,
Responsibilities of Database Administrator, Database Users, Three Schema architecture of DBMS & Data
Independence, Data Models.

Entity-Relationship Model: Basic concepts, Mapping Constraints, Keys, Entity-Relationship Diagram, Weak Entity
Sets, Extended E-R features: Specialization and Generalization.

UNIT – II
The Relational Data Model & Algebra: Relational Model: Structure of relational Databases, Relational Algebra &
various operations (Set operation, select, project, joins, division), Relational Calculus: Domain, Tuple.

Integrity Constraints & Introduction to SQL:-

Domain Constraints, Referential Integrity Constraints, Basic Structure & Concept of DDL, DML, DCL, Aggregate
Functions, Null Values, Introduction to views, creating, modifying and deleting views.

UNIT – III
Relational Database Design : Functional Dependency, Different anomalies in designing a Database., Normalization –
1NF, 2NF, 3NF, Boyce-CODD Normal Form, Normalization using multi-valued dependencies, 4NF, 5NF.

UNIT – IV
Transaction Processing Concept: Introduction to transaction processing, transaction model properties, serializability:-
Serial, non-serial and Serializable Schedules, Conflict Serializability.

Concurrency Control: Need of concurrency control, Different concurrency control Techniques: locking based,
timestamps based technique. Deadlock handling and Recovery Techniques:- Deferred update/ immediate update,
shadow paging.

Suggested Books:

• Elmasri and Navathe , “Fundamentals of Database Systems” , Addision-Wesley,

• Silberschatz, and Korth ,”Database System Concepts”, McGraw-Hill
• Date , “An Introduction to Database Systems” ,Addison-Wesley,
• Bhattacharyya, “Database Management Systems” , Tata McGraw-Hill Publishing.
.PC-CS-AIDS- OPERATING SYSTEMS
212A
Lecture Tutorial Practical Credit Major Minor Test Total Time
Test
3 0 0 3 75 25 100 3 Hrs.
Purpose To familiarize the students with the basics of Operating Systems.
Course Outcomes (CO)
CO1 To understand the structure and functions of Operating system.
CO2 To learn about processes, threads and scheduling algorithms.
CO3 To understand the principle of concurrency.
CO4 To understand the concept of deadlocks.
CO5 To learn various memory management schemes.
CO6 To study I/O management and file systems.
CO7 To study the concept of protection and security.

UNIT – I

Introduction: Introduction to OS. Operating system functions, Different types of O.S.: batch process, multi-
programmed, time-sharing, real-time, distributed, parallel.
System Structure: Computer system operation, I/O structure, storage structure, storage hierarchy, different types of
protections, operating system structure (simple, layered, virtual machine), O/S services, system calls.

UNIT – II
CPU scheduling: scheduling criteria, preemptive and non-preemptive scheduling, scheduling algorithms, algorithm
evaluation, multi-processor scheduling.
Threads: overview, benefits of threads, user and kernel threads.
Process Management: Concept of processes, process states, process control, co-operating processes, inter-process
communication.
Process Synchronization: background, critical section problem, critical region, synchronization hardware, Classical
problems of synchronization, semaphores.

UNIT – III

Deadlocks: Concept of deadlock, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock
detection, recovery from deadlock.
Memory Management: background, logical vs. physical address space, contiguous memory allocation, paging,
segmentation, segmentation with paging. Concept of fragmentation.
Virtual Memory: background, demand paging, concept of page replacement, page replacement algorithms, allocation
of frames, thrashing.
Unit-IV

File Systems: file concept, file organization and access methods, allocation methods, directory structure, free-space
management
I/O Management: I/O hardware, polling, interrupts, DMA, kernel I/O subsystem (scheduling, buffering, caching,
spooling and device reservation)
Disk Management: disk structure, disk scheduling (FCFS, SSTF, SCAN,C-SCAN) , disk reliability, disk
Performance parameters
Protection and Security:
Goals of protection and security, security attacks, authentication, program threats, system threats, threat monitoring.
Case studies: UNIX file system, Windows file system

Suggested Books:
• Operating System Concepts”, Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, Wiley
• Operating systems: a concept based approach”, Dhananjay M. Dhamdhere, McGraw Hill .
• Operating Systems : Internals and Design Principles, William Stallings, Pearson
• Operating Systems Design and Implementation” ,(Prentice Hall Software Series) Andrew S Tanenbaum and
Albert S Woodhull.
• Taub and Schilling, Principles of Communication Systems, TMH.
• Mithal G K, Radio Engineering, Khanna Pub.
• Sirnon Haykin, Communication Systems, John Wiley.

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
PC-CS-AIDS- R Lab
214LA
Lecture Tutorial Practical Credit Minor Practical Total Time
Test
0 0 2 1 40 60 100 3 Hour
Purpose To Describe what Data Science is and the skill sets needed to be a data scientist
Course Outcomes (CO)
CO1 Install and use R for simple programming tasks. Extend the functionality of R by
using add-on packages.
CO2 Extract data from files and other sources and perform various data manipulation
tasks on them. 4. Code statistical functions in R.
CO3 Use R Graphics and Tables to visualize results of various statistical operations on
data .
CO4 Apply the knowledge of R gained to data Analytics for real life applications.

LIST OF PRACTICALS

1. Write an R script, to create R objects for calculator application and save in a specified location in disk.
2. Write an R script to find basic descriptive statistics using summary, str, quartile function on sample datasets.
3. Write an R script to find subset of dataset by using subset (), aggregate () functions on sample dataset.
4. Write an R script for Reading different types of data sets (.txt, .csv) from web and disk and writing in file in
specific disk location.
5. Write an R script for Reading Excel data sheet and XML dataset.
6. Find the data distributions using box and scatter plot of sample dataset.
a. Find the outliers using plot.
b. Plot the histogram, bar chart and pie chart on same data.
7. How to find a corelation matrix and plot the correlation on sample data set.
a. Plot the correlation plot on dataset and visualize giving an overview of relationships among data
b. Analysis of covariance: variance (ANOVA), if data have categorical variables
8. Import a data from web storage. Name the dataset and now do Logistic Regression to find out relation
between variables that are affecting the admission of a student in a institute based on his or her GRE score,
GPA obtained and rank of the student. Also check the model is fit or not. require (foreign), require(MASS).
9. Apply multiple regressions, if data have a continuous independent variable. Apply on above dataset (in Que
8).
10. Apply regression Model techniques to predict the data on above dataset (in Que 8).
ES-CS-AIDS- Internet & Web Technology Lab
216LA
Lecture Tutorial Practical Minor Test Practical Total Time
0 0 3 40 60 100 3 Hrs.
Purpose To introduce the concepts of HTML5, JavaScript and Python.
Course Outcomes (CO)
CO1 Design webpages using HTML, JavaScript and CSS.
CO2 Design and test simple function/program to implement Searching and sorting techniques using
Python.
CO3 Develop program in Java Script for pattern matching using regular expressions and errors in
scripts.
CO4 Design client-server based web applications.
LIST OF PRACTCALS

1. Create your own page with your favorite hobbies using HTML, JavaScript and CSS.
2. Create a frameset in HTML that is divided into three sections. The frameset should have three zones.
a. The Topmost section of the frameset should take up about just 15% of the browser window. Name this
frame title.
b. The middle section should be 75% of the browser window. Name this frame title.
c. The lower section should be 10% of the browser window. Name this frame menu.
3. Create pages for each section. For the lowermost section, create page that loads the content into the middle
section. The topmost section should contain a page describing the web page itself.
4. Create a web page, which displays the map of your country Link, each city /state on the image map, such that
the respective HTML page of the city/state is displayed when the user selects an area.
5. Add the tickertape applet to your page by customizing it for the following settings:
a. Increase the count by one.
b. Accordingly update the message count.
c. Change the text color to (237,192,171)
d. Experiment with changing the scrolling speed.
e. Customize the message text as per your page requirement.
6. Incorporate a quest book into the Diary Food Webpage and use Java Script to build validations into the form.
7. Use Cascading Style sheets (CSS) to modify the following:
a. Change background.
b. Change font type, face and color.
c. Align Text.
d. Remove underlines from hyperlinks.
8. Write the program for using JavaScript by using for – loops (through a block of code a number of times), for/in -
loops (through the properties of an object), while - loops (through a block of code while a specified condition
is true), do/while - loops (through a block of code while a specified condition is true).
9. Write a program in Java Script for the following:
a. Copying, passing, and comparing by value
b. Copying, passing, and comparing by reference
c. References themselves are passed by value

10. Write program in Java Script for pattern matching using regular expressions and errors in scripts.
11. Write a Python function/program that accepts the lengths of three sides of a triangle as inputs. The program
output should indicate whether or not the triangle is an equilateral triangle.
12. Write the Python functions for linear search, binary search, selection sort, Bubble Sort, Insertion Sort and
converting Fibonacci to a linear algorithm.
13. Write program in Python using Lists and dictionaries, Control statements and Strings and text files.
 PC-CS-AIDS- Database Management Systems Lab
218LA
Lecture Tutorial Practical Credit Practical Minor Test Total Time
0 0 2 1 60 40 100 3Hour
Purpose To implement practically the various concepts of DBMS
Course Outcomes
CO1 To understand& Implement basic DDL commands.
CO2 To learn & Implement DML and DCL commands.
CO3 To understand the SQL queries using SQL operators.
CO4 To understand the concept of relational algebra and implement using examples.

LIST OF PRACTCALS
1. Create a database and write the programs to carry out the following operation:
• Add , Delete and modify a record in the database
• Generate queries
• Data operations
• List all the records of database in ascending order.
2. To perform various integrity constraints on relational database.
3. Create a database and perform the following operations:-
1. Arithmetic and Relational operations
2. Group by & having clauses
3. Like predicate for pattern matching in database
4. Create a view to display details of employees working on more than one project.
5. Create a view to display details of employees not working on any project.
6. Using two tables create a view which shall perform natural join, equi join, outer joins.
7. Write a procedure to give incentive to employees working on all projects. If no such employee found give app.
Message.
8. Write a procedure for computing amount telephone bill on the basic of following conditions.
1. telephone rent Rs. 205 including first 105 free units.
2. if extra units>0 but <500 then rate is 80 paise per unit.
3. if extra units>500 then rate is Rs. 1.20 per unit.
For this purpose create a table with name, Phone No., No. of units consumed, bill amount of a customer.
9. Write a procedure for computing income tax of employee on the basic of following conditions:-
1. if gross pay<=40,000 then I.T rate is 0%.
2. if gross pay>40,000 but <60000 then I.T rate is 10%.
3. if gross pay>60,000 but <1,00,0000 then I.T rate is 20%.
4. if gross pay>1,00,0000 then I.T rate is 30%.
For this purpose create a table with name, ssn, gross salary and income tax of the employee.
10. Write trigger for before and after insertion, deletion and updation process.

NOTE: A student has to perform at least ten experiments.Seven experiments should be performed from the above
list. Remaining three experiments may either be performed from the above list or designed & set by the concerned
institution as per the scope of the syllabus
 MC-901A Environmental Sciences
Lecture Tutorial Practical Credit Major Minor Test Total Time
Test
3 0 0 0 75 25 100 3 Hrs.
Purpose To learn the multidisciplinary nature, scope and importance of Environmental sciences.
Course Outcomes (CO)
CO1 The students will be able to learn the importance of natural resources.
CO2 To learn the theoretical and practical aspects of eco system.
CO3 Will be able to learn the basic concepts of conservation of biodiversity.
CO4 The students will be able to understand the basic concept of sustainable development.

UNIT – I
The multidisciplinary nature of environmental studies, Definition, Scope and Importance, Need for public awareness,
Natural Resources: Renewable and Non-Renewable Resources: Natural resources and associated problems.

(a) Forest Resources: Use and over-exploitation, deforestation, case studies. Timber eztraction, mining, dams and their
effects on forests and tribal people.
(b) Water Resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over water, dams-
benefits and problems.
(c) Mineral Resources: Use and exploitation, environmental effects of extracting and using mineral resources, case
studies.
(d) Food Resources: World Food Problems, changes caused by agriculture and overgazing, effects of modern agriculture,
fertilizer-pesticide problems, water logging, salinity, case studies.
(e) Energy Resources: Growing energy needs, renewable and non-renewable energy sources, use of alternate energy
sources. Case studies.
(f) Land Resources: Land as a resource, land, degradation, man induced landslides, soil erosion and desertification.
Role of an individual in conservation of natural resources, Equitable use of resources for sustainable lifestyle.

UNIT – II
Ecosystem-Concept of an ecosystem: 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 function of the following ecosystem: (a) Forest Ecosystem, (b) Grassland
Ecosystem, (c) Desert Ecosystem and (d) Aquatic Ecosystems (ponds, streams, lakes, rivers, oceans, esturaries

Field Work: Visit to a local area to document Environment assets-river/forest/grassland/hill/mountain, Visit to a local
polluted site-Urban /Rural Industrial/Agricultural, Study of common plants, insects and birds, Study of simple
ecosystems-pond, river, hill, slopes etc. (Field work equal to 5 lecture hours).

UNIT – III
Biodiversity and its conservation: Introduction, Definition: genetic, species and ecosystem diversity. Biogeographical
classification of India. Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option
values. Biodiversity of global, National and local levels. India as a mega-diversity nation Hot spot of Biodiversity,
Threats to biodiversity: Habitat loss, poaching of wild life, man-wildlife conflicts, Endangered and endemic species of
India, Conservation of Biodiversity- In situ and Ex-Situ conservation of biodiversity.

Environmental Pollution Definition: Cause, 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- cause, 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
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, Human population and the Environment, Population
growth, variation among nations, Population explosion-Family Welfare Programme, Environment and human health.
Human rights, Value Education, HIV/AIDS, Women and Child Welfare, Role of Information Technology in
Environment and Human Health, Case Studies, Drugs and their effects; Useful and harmful drugs, Use and abuse of
drugs, Stimulant and depression drugs, Concept of drug de-addiction, Legal position on drugs and laws related to drugs.

Suggested Books:

• Environmental Studies- Deswal and Deswal. Dhanpat Rai and Co.

• Environmental Science and Engineering Anandan, P. and Kumaravelan, R. 2009. Scitech Publications (India)
Pvt. Ltd., India
• Environmental Studies. Daniels Ranjit R. J. and Krishnaswamy. 2013. Wiley India.
• Environmental Science- Botkin and Keller. 2012. Wiley , India

Note: The Examiner will be given the question paper template to set the question paper.