SCHOOL OF COMPUTER SCIENCE AND ENGINEERING

Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235

Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering (AI & ML)
Year : Second Year Semester : III
Course Title : Algorithm Analysis and Design Short Title : AAD
Course Code : CSAIML301T
Theory : 3 Hours/Week
Max. University Theory Examination: 50 Marks Continuous Internal Assessment: 50 Marks
Max. Time for Theory Exam.: 2.5 Hrs Credit: 3

Course Objectives :
1. To analyze time and space complexity of various algorithms.
To develop algorithm for solving various computational problems by applying various
2.
algorithm design strategies.
3. To understand the effect of choice of data structures on the complexity of algorithm.
Course Outcomes :
1 Apply the best data structure for designing an algorithm to solve a given problem.
2 Evaluate different algorithms with respect to time and space complexity.
Student understands the new notion of Z-transform and their usability in solving difference
3
equations.
4 Understand different complexity classes.

Unit
Details Hours
No.
Basic Concepts of Algorithms: Notion of Algorithm, Fundamentals of Algorithmic
Solving, Important problem types, Fundamentals of the Analysis Framework,
1 Asymptotic Notations and Basic Efficiency Classes, Mathematical analysis of non- 8
recursive algorithms. Mathematical analysis of recursive algorithm: recurrence
relations, solution of recurrence relations using substitution method
Brute Force, Divide and Conquer Strategy: Selection sort, Bubble sort, Sequential
2 searching (Linear Search), Brute force string matching, General method, Merge sort, 8
Quick Sort, Binary Search, Strassen’s matrix multiplication
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Greedy Approach and Dynamic Programming: Fractional Knapsack problem, Min-

imum cost spanning tree: Prim’s and Kruskal’s algorithm, Single source shortest path
3 8
problem, Principle of optimality, Multi-stage graph problem, all pair shortest path prob-
lem, 0/1 Knapsack problem, Traveling salesperson problem.
Backtracking and Branch and Bound : General method backtracking, N-Queen prob-
4 lem, 0/1 Knapsack problem, General method of branch & bound, 0/1 Knapsack prob- 8
lem, Traveling sales person problem
Lower Bound Theory and Complexity Classes: Lower bounds, Decision trees, P, NP
5 8
and NP Complete problems
Total (Hrs) 40

Resources :
1. Algorithm Design, Jon Kelinberg and Eva Tardos, 1st Edition, Pearson
Education 2014.
2. Design & Analysis of Algorithms, Gajendra Sharma, Khanna Book Publishing
2018.
3. Fundamentals of algorithms, Horowitz E, Sahini S, Rajasekaran S., University
Press 2008.
Text Books
4. Introduction to algorithms, Cormen, Leiserson, Rivest, Stein, 3rd Edition, PHI.
2012
5. An introduction to analysis of algorithms, R. Sedgewick, 1st edition, Pearson
Education 1996.
6. Data Structures and Program Design in C By Robert L. Kruse, C.L. Tondo,
Bruce Leung, Pearson Education. 2007.
E-Resources http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering (AI & ML)
Year : Second Year Semester : III
Course Title : Database Systems Short Title : DBS
Course Code : CSAIML302T Max. University Theory Examination: 50 Marks
Theory : 3 Hours/Week Continuous Internal Assessment: 50 Marks
Max. Time for Theory Exam.: 2.5 Hrs Credit: 3

Course Objectives :
Students should be able to understand various basics of DBMS and query languages. They should
learn different types of database systems and their applications in different scenarios.
Course Outcomes :
1 Understand the basics of databases and data management.

2 Understand various theoretical and practical principles involved in the design and
use of databases systems with the help of database
3 Design and implement databases for various scenarios.
4 Design a database scenario for handling big data.

Unit No. Details Hours

Introduction: Characteristics and fundamental concepts of Databases, Types of Data
Models and Data Modelling, Elements of Database Systems, Classification and
1 08
comparison of Database Management Systems (Regular and NoSQL Page),
concurrency control, Lock based concurrency control, Time stamping methods.
Structured and semi-structured data management: Structured data, relational
databases, Relational model, Functional Dependencies, normal forms, algorithms for
2 08
query optimization, Semi-structured data, document-databases, semi-structured data
abstraction, representation, and search.
Transaction Management: Transaction concept, transaction state, ACID properties,
3 serializability, Recoverability, Implementation of Isolation, Testing for serializabil- 08
ity.
Unstructured Data Management: Unstructured text, Information retrieval systems,
4 08
document retrieval and ranking.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Big Data Management

5 Platforms for Big Data, algorithms for Map-Reduce & Hadoop, Platforms for 08
Big Graphs, algorithms for large graphs.
Total (Hrs) 40

Resources :
1. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S.
Sudharshan, Tata McGraw Hill, 2006
2. Fundamentals of Database Systems, Elmsari and Navathe, Pearson Educa-
tion 2013
3. Database Management Systems, Ramakrishnan and Gehrke, McGrawHill
2003
4. “An Introduction to Database Systems”, C.J.Date, A.Kannan,
S.Swamynathan, Pearson Education, 2006
5. Database Management Systems, R.P. Mahapatra, Khanna Book Publish-
ing 2016.
Text Books
6. J. D. Ullman, “Principles of Database Systems”, 2nd Ed., Galgotia Publi-
cations
7. Learning Spark: Lightning-Fast Big Data Analysis / Holden Karau, Andy
Konwinski, Patrick Wendell, Matei Zaharia / O'Reilly Media; 1st edition /
ISBN-13: 978-1449358624 / ISBN-10: 1449358624
8. Data on the Web: From Relations to Semistructured Data and XML /
Serge Abiteboul, Peter Buneman, Dan Suciu / 1st Edition / ISBN-13: 978-
1558606227 /
9. Introduction to Information Retrieval / Christopher Manning, Prabhakar
Raghavan, Hinrich Schütze / book and slides available online
E-Resources http://nptel.ac.in
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Computer Networks Short Title : CN
Course Code : CSAIML303 Max. University Theory Examination: 50 Marks
Theory : 3 Hours/Week Continuous Internal Assessment: 50 Marks
Max. Time for Theory Exam.: 2.5 Hrs Credit: 3

Course Objectives :
Students should be able to have an understanding of the fundamental concepts of computer networking
and have a basic knowledge of the various network models and their uses. They should be able to
analyze simple protocols and independently study literature concerning computer networks.
Course Outcomes :
1 Understand basic computer network technology.
2 Understand the different types of network topologies and protocols.
3 Analyze the different types of network devices and their functions within a network.
4 Analyze the architecture and principles of today's computer networks.
Understand the requirements for the future Internet and its impact on the computer network
5
architecture.

Unit No. Details Hours

Computer Networks and The Internet:
What is the Internet; network edge; network core; Delay, Loss and
1 8
throughput in Packet-Switched Networks; Protocol Layers and their Service
Models.
Application Layer:
Principles of Network Applications; The Web and HTTP; File Transfer:
2 FTP; Electronic Mail in the Internet; DNS - The Internet's Directory 8
Service; Peer-to-Peer applications; Socket Programming – Creating network
applications.
Transport Layer:
Introduction and Transport-Layer Services; Multiplexing and
3 Demultiplexing; Connectionless Transport: UDP; Principles of Reliable of 8
Data Transfer; Connection-Oriented Transport: TCP; Principles of
Congestion Control, TCP Congestion Control.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Network Layer:
Introduction; Virtual circuit and datagram networks; What is inside a
4 router; Internet Protocol (IP): Forwarding and Addressing in the Internet; 8
Routing Algorithms; Routing in the Internet; Broadcast and Multicast
Routing.
Data Link Layer:
5 Introduction to the link layer; Error Detection and Correction Techniques; 8
Multiple Access links and Protocols; Switched local area networks.
Total (Hrs) 40

Resources :
1. James F. Kurose and Keith W. Ross, “Computer Networking: A top-down ap-
proach”, Pearson Education, 6th edition. 2012
2. A.S. Tanenbaum, “Computer Networks”, 5th Edition, PHI 2010
3. Bhavneet Sidhu, “An Integrated Approach to Computer Networks”, Khanna
Book Publishing House 2019.
Text Books 4. G. Keiser, “Local Area Networks”, 2nd Edition, TMH 2002
5. D. Bertesekas and R. Gallager, “Data Networks”, 2nd Edition, PHI 2000
6. William Stallings, “Data & Computer Communication”, PHI, 10th Edition 2013
7. B.A. Forouzan, “Data communications and networking”, TMH, 5th Edition2012
8. B.A. Forouzan, “Local Area Networks”, TMH. 2002
9. B.A. Forouzan, “TCP/IP Protocol Suite”, TMH.2004
E-Resources http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Introduction to Machine Short Title : IML
Learning
Course Code : CSAIML304 Max. University Theory Examination: 50 Marks
Theory : 3 Hours/Week Continuous Internal Assessment: 50 Marks
Max. Time for Theory Exam.: 2.5 Hrs Credit: 3

Course Objectives :
The students will understand the basics of Machine Learning. They will also learn and will be able to
apply different machine learning models to various datasets.
Course Outcomes :
1 Understand basic applications and issues of Machine Learning
2 Understand the different types of datasets
3 Analyze and work with different datasets
4 Analyze various Machine Learning techniques and algorithms
5 Apply various algorithms to different datasets.

Unit No. Details Hours

Introduction:
What Is Machine Learning?, How Do We Define Learning?, How Do We
1 Evaluate Our Networks?, How Do We Learn Our Network?, What are da- 8
tasets and how to handle them?, Feature sets, Dataset division: test, train
and validation sets, cross validation.
Basics of machine learning:
Applications of Machine Learning, processes involved in Machine Learn-
2 ing, Introduction to Machine Learning Techniques: Supervised Learning, 8
Unsupervised Learning and Reinforcement Learning, Real life examples of
Machine Learning.
Supervised learning:
Classification and Regression: K-Nearest Neighbor, Linear Regression,
3 Logistic Regression, Support Vector Machine (SVM), Evaluation 8
Measures: SSE, MME, R2, confusion matrix, precision, recall, F-Score,
ROC-Curve.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Unsupervised learning:
Introduction to clustering, Types of Clustering: Hierarchical, Agglomera-
4 8
tive Clustering and Divisive clustering; Partitional Clustering - K-means
clustering.
Miscellaneous:
Dimensionality reduction techniques: PCA, LDA, ICA. Introduction to
5 8
Deep Learning, Gaussian Mixture Models, Natural Language Processing,
Computer Vision.
Total (Hrs) 40

Resources :
1. Introduction to Machine Learning, By Jeeva Jose, Khanna Book Publishing
Co., 2020.
2. Machine Learning for Dummies, By John Paul Mueller and Luca Massaron,
Text Books For Dummies, 2016.
3. Machine Learning, By Rajeev Chopra, Khanna Book Publishing Co., 2021.
4. Machine Learning: The New AI, By Ethem Alpaydin, The MIT Press, 2016.
5. Machine Learning, Tom M. Mitchell, McGraw Hill Education, 2017.
1. https://www.udacity.com/course/intro-to-machine-learning--ud120
E-Resources 2. https://www.coursera.org/learn/machine-learning-duke
3. http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Artificial Intelligence Short Title : AI
Course Code : CSAIML305
Max. University Theory Examination: 50 Marks Continuous Internal Assessment: 50 Marks
Theory : 3 Hours/Week Tutorial: 1 hour/week
Max. Time for Theory Exam.: 2.5 Hrs Credit: 4

Course Objectives :

Students will learn the basic concepts and techniques of Artificial Intelligence. They should be able to
develop AI algorithms for solving practical problems.

Course Outcomes :
1 Understand the basic concepts and techniques of Artificial Intelligence.
2 Apply AI algorithms for solving practical problems
3 Describe human intelligence and AI
4 Explain how intelligent system works.
5 Apply basics of Fuzzy logic and neural networks.
6 Explain Expert System and implementation
Unit No. Details Hours
Introduction:
Artificial Intelligence and its applications, Artificial Intelligence Techniques,
Level of models, criteria of success, Intelligent Agents, Nature of Agents,
1 Learning Agents. AI Techniques, advantages, and limitations of AI, Impact and 8
Examples of AI, Application domains of AI. The AI Ladder - The Journey for
Adopting AI Successfully, Advice for a career in AI, Hotbeds of AI Innovation.
Problem solving techniques:
State space search, control strategies, heuristic search, problem characteristics,
2 production system characteristics., Generate and test, Hill climbing, best first 8
search, A* search, Constraint satisfaction problem, Mean-end analysis, Min-
Max Search, Alpha-Beta Pruning, Additional refinements, Iterative Deepening.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Logic:
3 Propositional logic, predicate logic, Resolution, Resolution in proportional 8
logic and predicate logic, Clause form, unification algorithm,
Knowledge Representation schemes and reasoning:
Mapping between facts and representations, Approaches to knowledge rep-
resentation, procedural vs declarative knowledge, Forward vs. Backward
4 8
reasoning, Matching, conflict resolution, Non- monotonic reasoning, De-
fault reasoning, statistical reasoning, fuzzy logic Weak and Strong filler
structures, semantic nets, frame, conceptual dependency, scripts.
Planning:
The Planning problem, planning with state space search, partial order plan-
5 ning, planning graphs, planning with propositional logic, Analysis of plan- 8
ning approaches, Hierarchical planning, conditional planning, Continuous
and Multi Agent planning.
Total (Hrs) 40

Resources :
1. A Classical Approach to Artificial Intelligence, M.C. Trivedi, Khanna
Book Publishing, 2019.
2. Artificial Intelligence: A modern approach by Stuart Russel, Pearson
Education, 2010.
Text Books
3. Artificial Intelligence by Rich and Knight, The McGraw Hill, 2017.
4. Artificial Intelligence: A new synthesis by Nils and Nilson, Elsevier, 1997.
5. Artificial Intelligence by Luger, Pearson Education, 2002.
6. Artificial Intelligence by Padhy, Oxford Press, 2005.
1. https://www.udemy.com/course/artificial-intelligence-az/
E-Resources 2. https://www.edx.org/course/artificial-intelligence-ai
3. http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Open Elective – I(IoT) Short Title : OE-1(IoT)
Course Code : CSAIML306A Theory : 3 Hours/Week
Max. University Theory Examination: 50 Marks Continuous Internal Assessment: 50 Marks
Max. Time for ESE: 2.5 Hrs Credit: 3
Course Objectives :
Understanding core technology, applications, sensors used and IOT architecture along with the
industry perspective. Principles and operations of different types of sensors commonly used on mobile
platform will be taught in a manner that by the end of the course the students will be able to design
and implement real time solutions using IOT.
Course Outcomes :
Understand core technology, applications, sensors used and IOT architecture along with the
1
industry perspective.
2 Understand Raspberry’s working and implementation.
3 Understand various communication protocols used in IoT.
4 Apply various IOT technologies in real-life applications.

Unit
Details Hours
No.
Introduction to IoT: What is IoT, how does it work? Difference between Embed-
1 ded device and IoT device, Properties of IoT device, IoT Ecosystem, IoT Decision 8
Framework, IoT Solution Architecture Models, Major IoT Boards in Market.
Setting Up Raspberry/Arduino to Create Solutions: Explore Raspberry Pi,
2 setting up Raspberry Pi, showing working of Raspberry Pi using SSH Client and 8
Team Viewer, Understand Sensing actions, Understand Actuators and MEMS
Communication Protocols used in IoT: Types of wireless communication, Major
wireless Short- range communication devices, properties, comparison of these de-
3 8
vices (Bluetooth, WIFI, ZigBee, 6LoWPAN), Major wireless Long-range commu-
nication devices, properties, comparison of these devices (Cellular IoT, LPWAN)
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

IoT Applications: Industrial Internet 4.0, Applications such as: Smart home, wear-
4 ables, smart city, smart grid, connected car, connected health (digital health, tele- 8
health, telemedicine), smart retail.
Sensors: Applications of various sensors: Google Maps, Waze, WhatsApp, Ola Po-
sitioning sensors: encoders and accelerometers, Image sensors: cameras, Global
positioning sensors: GPS, GLONASS, IRNSS, Galileo and indoor localization sys-
5 8
tems, Motion & Orientation Sensors: Accelerometer, Magnetometer, Proximity
Sensor, Gyroscope Calibration, noise modeling and characterization and noise fil-
tering and sensor data processing. Privacy &Security
Total (Hrs) 40

Resources :
1. Vijay Madisetti and Arshdeep Bahga, Internet of Things (A Hands-on Ap-
proach), 1st Edition, VPT, 2014
2. Francis da Costa, Rethinking the Internet of Things: A Scalable Approach to
Connecting Everything, 1stEdition, Apress Publications, 2014
Text Books
3. CunoPfister, Getting Started with the Internet of Things, O Reilly Media, 2011
4. Kyung, C.-M., Yasuura, H., Liu, Y., Lin, Y.-L., Smart Sensors and Systems,
Springer International Publishing, 2015

E-Resources 1. http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Open Elective – I(Robotics) Short Title : OE-1(Robotics)
Course Code : CSAIML306B Theory : 3 Hours/Week
Max. University Theory Examination: 50 Marks Continuous Internal Assessment: 50 Marks
Max. Time for ESE: 2.5 Hrs Credit: 3
Course Objectives :

The students will be able to understand the basic concepts and fundamentals of robotics. They will
also be able to use AI in the field of robotics.

Course Outcomes :
1 Understand the basics of robotics
2 Understand game playing concepts involving robotics and AI
3 Apply robotics to create robot driven systems.
4 Analyse and co-relate robotics with AI and use in real-world applications.

Unit
Details Hours
No.
Introduction: Introduction to Robotics Fundamentals of Robotics, Robot Kine-
matics: Position Analysis, Dynamic Analysis and Forces, Robot Programming
1 languages & systems: Introduction, the three levels of robot programming, re- 8
quirements of a robot programming language, problems peculiar to robot pro-
gramming languages.
Need of AI in Robotics: History, state of the art, Need for AI in Robotics.
2 8
Thinking and acting humanly, intelligent agents, structure of agents.
Game Playing: AI and game playing, plausible move generator, static evaluation
3 8
move generator, game playing strategies, problems in game playing.
Robotics fundamentals: Robot Classification, Robot Specification, notation,
4 kinematic representations and transformations, dynamics techniques; trajectory 8
planning and control.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Robotics and Its applications: DDD concept, Intelligent robots, Robot anato-
my-Definition, law of robotics, History and Terminology of Robotics-Accuracy
5 and repeatability of Robotics-Simple problems-Specifications of Robot-Speed of 8
Robot, Robot joints and links-Robot classifications-Architecture of robotic sys-
tems-Robot Drive systems-Hydraulic, Pneumatic and Electric system
Total (Hrs) 40

Resources :
1. Robotics, Vision and Control: Fundamental Algorithms in MATLAB, Peter
Corke, Springer, 2011.
2. Robotics: Everything You Need to Know About Robotics from Beginner to
Expert, Peter McKinnon, Createspace Independent Publishing Platform,
2016.
Text Books
3. Introduction to AI Robotics, Second Edition, By Robin R. Murphy, MIT
press, 2001.
4. Artificial Intelligence for Robotics: Build intelligent robots that perform
human tasks using AI techniques, Francis X. Govers, Packt Publishers,
2018.
E-Resources 1. http://nptel.ac.in/
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Analysis of Algorithm and Short Title : AAD Lab
Design Lab
Course Code : CSAIML307P Practical: 2 Hours/Week
Term Work: 25 Marks ESE: 25 Marks
Max. Time for ESE: 3 Hrs Credit: 1

Course Objectives :
1 To analyze time and space complexity of various algorithms.

2 To develop algorithm for solving various computational problems by applying various algorithm
design strategies.
3 To understand the effect of choice of data structures on the complexity of algorithm.

Course Outcomes :
1 Apply the best data structure for designing an algorithm to solve a given problem.

2 Evaluate different algorithms with respect to time and space complexity.

3 Create algorithms to solve various computational problems.
4 Understand different complexity classes.

Sr. No. Practical Description

Concern faculty member should suitably frame at least Eight laboratory assignments from the follow-
ing list.
1 Write a program to perform Bubble sort for any given list of numbers.

2 Write a program to perform Insertion sort for any given list of numbers.

3 Write a program to perform Quick Sort for the given list of integer values.

4 Write a Program to perform Merge Sort on the given two lists of integer values
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Write a Program to perform Binary Search for a given set of integer values recursively and
5
non recursively.
6 Write a program to find solution for knapsack problem using greedy method.

7 Write a program to find minimum cost spanning tree using Prim’s Algorithm

8 . Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.

9 Write a program to perform Single source shortest path problem for a given graph.

10 Write a program for all pairs shortest path problem

11 Write a program find maximum number of edge disjoint paths between two vertices
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Database Systems Lab Short Title : DBS Lab
Course Code : CSAIML308P Practical: 2 Hours/Week
Term Work: 25 Marks ESE: 25 Marks
Max. Time for ESE.: 3 Hrs Credit: 1

Course Objectives :
1 To understand and use Data Definition Language to define and modify database schema
2 To understand and use Data manipulation language to query, update, and manage a database
3 To demonstrate competence with the fundamental tasks involved with implementing a DBMS.
Course Outcomes :
1 Develop a database with various constraints using SQL Data Definition Language.
2 Use DML queries to retrieve, insert, delete and update the database.
Apply various SQL features such as Aggregate functions, Set Operations and Views to resolve
3
the queries.
4 Demonstrate Stored Procedure, Stored function and Trigger on a Sample Databases.
Develop database application using ODBC/JDBC interface to store and retrieve data from the
5
database.

Sr. No. Practical Description

Concerned faculty member should suitably frame at least EIGHT Laboratory assignments from the fol-
lowing list.
Creating a sample database using any client server RDBMS package using SQL DDL
1
queries. This will include constraints.
2 SQL DML queries: Use of SQL DML queries to retrieve, insert, update and delete the
database.
SQL Queries: The queries should involve SQL feature such as aggregate functions, group
3
by, having, order by clause.
SQL Queries: The queries should involve Set Operations and Set Comparisons on the
4
database
Develop two tier architecture and use ODBC/JDBC connections to store and retrieve data
5 from the database. You may consider any applications like employee management system,
library management system etc.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Execute DDL statements which demonstrate the use of views. Try to update the base table
6
using its corresponding view.
Write a database trigger on Library table. The System should keep track of the records that
7 are being updated or deleted. The old value of updated or deleted records should be added in
Library_Audit table.
8 Write a program to demonstrate PL/SQL block

9 Write a program to demonstrate PL/SQL stored procedure.

10 Write a program to demonstrate different types of Join.

11 Write a program to demonstrate PL/SQL stored function

Practical/Oral/Presentation:
Practical/Oral/Presentation shall be conducted and assessed jointly by internal and external examiners.
The performance in the Practical/Oral/Presentation examination shall be assessed by at least a pair of
examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet
in the format as specified by the University.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Computer Networks Lab Short Title : CN Lab
Course Code : CSAIML309P Practical: 2 Hours/Week
Term Work: 25 Marks ESE: 25 Marks
Max. Time for ESE.: 3 Hrs Credit: 1

Course Objectives :
1 To understand the fundamental concepts of computer networking
2 To have a basic knowledge of the various network models and their uses.
3 To analyze Various protocols

Course Outcomes :
1 Understand basic computer network technology.
2 Understand the different types of network topologies and protocols.
3 Analyze the different types of network devices and their functions within a network.
4 Analyze the architecture and principles of today's computer networks.

5 Understand the requirements for the future Internet and its impact on the computer
network architecture.

Sr. No. Practical Description

Implement the data link layer framing methods such as character count, character stuffing
1
and bit stuffing
2 Write a simulation of sliding window protocols.

3 Configure given network topologies using any network simulator software.

4 Write a programs for error detecting codes.

5 Write a program for using TCP and UDP Sockets.

6 Write a simulation of Routing Protocols

 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

7 Implement Dijkstra’s algorithm to compute the shortest path through a graph

8 Obtain Routing table art each node using distance vector routing algorithm

Practical/Oral/Presentation:
Practical/Oral/Presentation shall be conducted and assessed jointly by internal and external examiners.
The performance in the Practical/Oral/Presentation examination shall be assessed by at least a pair of
examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet
in the format as specified by the University.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

School: School of Computer Science and Engineering

Programme: B. Tech – Computer Science and Engineering
Year : Second Year Semester : III
Course Title : Introduction to Machine Learn- Short Title : IML Lab
ing Lab
Course Code : CSAIML310P Practical: 2 Hours/Week
Term Work: 25 Marks ESE: 25 Marks
Max. Time for ESE.: 3 Hrs Credit: 1

Course Objectives :
1 To Understand the basics of Machine Learning.
2 To learn and apply different machine learning models to various datasets.

Course Outcomes :
1 Understand basic applications and issues of Machine Learning
2 Understand the different types of datasets
3 Analyze and work with different datasets
4 Analyze various Machine Learning techniques and algorithms
5 Apply various algorithms to different datasets.

Sr. No. Practical Description

1 Introduction to Python
2 Programs based on Loops and Conditions and other preliminary stuff,
3 Program based on Functions, Classes and Modules,
4 Program based on Exceptions, Database access
Mathematical computing with Python packages like: numpy, Mat- plotLib, pandas Tensor
5
Flow, Keras
Implement basic ML models like SVM, KNN, K-Means, Logistic Regression, Linear Re-
6
gression
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
Neelam Vidya Vihar, Sijoul, Mailam, Madhubani, Bihar – 847235
Website:http://www.sandipuniversity.edu.in Email: [email protected]

Practical/Oral/Presentation:
Practical/Oral/Presentation shall be conducted and assessed jointly by internal and external examiners.
The performance in the Practical/Oral/Presentation examination shall be assessed by at least a pair of
examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet
in the format as specified by the University.