EAST WEST INSTITUTE OF TECHNOLOGY

(An Autonomous institute under VTU, Belagavi)

PSCSC101: Artificial Intelligence

Course Frame Work:
Credits: L-T-P-S: 4 – 0 – 0– 0 Total Credits: 4
Contact Hours/Week: 4 Direct Teaching Hours: 50 Total Contact Hours: 50
Prerequisite: Introductory Knowledge of Machine Learning, Foundations of
Mathematics for AI
Course Learning Objective:
● Define the foundational concepts of artificial intelligence and key problem-solving
techniques.
● Explain the knowledge representation and reasoning techniques to solve complex
problems in AI systems.
● Use machine learning algorithms to evaluate their performance in real-world
applications.
● Build the applications of natural language processing and robotics to enhance human-
computer interaction.
● Explore the ethical considerations and societal implications of AI technologies
Course Outcomes:
On successful completion of the course, students will be able to:
1. Define the foundational concepts of artificial intelligence and key problem-solving techniques.
2. Explain the knowledge representation and reasoning techniques to solve complex problems in
AI systems.
3. Use machine learning algorithms to evaluate their performance in real-world applications.
4. Build the applications of natural language processing and robotics to enhance human-
computer interaction.

Syllabus Hours
Module 1:Introduction to Artificial Intelligence and Problem Solving 10
Definition and scope of AI, History and evolution of AI, Types of AI: Narrow AI vs. General
AI, Problem formulation and problem-solving techniques, Search algorithms: Uninformed and
informed search strategies, Heuristic search and constraint satisfaction problems

Module-2: Knowledge Representation and Reasoning 10

Types of knowledge representation, Propositional logic and first-order logic ,Semantic
networks and frames, Ontology’s and their applications, Deductive and inductive reasoning,
Rule-based systems and non-monotonic reasoning, Probabilistic reasoning and Bayesian
networks
Module-3: Machine Learning 10
Introduction to machine learning, Supervised, unsupervised, and reinforcement learning,
Common algorithms: Decision trees, SVM, neural networks Evaluation metrics for machine
learning models ,Practical applications of machine learning in AI systems..
Module-4: Natural Language Processing and Robotics 10
Basics of natural language processing (NLP), Text processing and language models,
Sentiment analysis and language generation, Robotics fundamentals and sensor
technologies, Robot kinematics, control, and applications of AI in robotics.
Module-5: Ethical and Societal Implications of AI 10
Ethical considerations in AI development ,AI and job displacement Privacy concerns and
data security, Bias and fairness in AI algorithms, Accountability and transparency in AI
systems, The role of government and regulation in AI, Public perception and trust in AI
technologies, Future of AI and its impact on society.
Text Books:
1. Artificial Intelligence: A Modern Approach" by Stuart Russell and Peter Norvig, 4th
Edition (2021)
2. "Deep Learning" by Ian Goodfellow, Yoshua Bengio, and Aaron Courville third Edition.
Reference Books:
1. "Pattern Recognition and Machine Learning" by Christopher M. Bishop Edition: fourth
Edition (2020)
2. "Artificial Intelligence: Foundations of Computational Agents" by David L. Poole and
Alan K. Mackworth Edition: third Edition (2021).
Web links and Video Lectures (e-Resources):

● [Link]
● [Link]
● [Link]
● [Link]
 EAST WEST INSTITUTE OF TECHNOLOGY
(An Autonomous institute under VTU, Belagavi)

PSCSC102: Fundamentals of Data Science

Course Frame Work:
Credits: L-T-P-S: 3- 0 – 0 – 0 Total Credits: 3
Contact Hours/Week: 3 Direct Teaching Hours: 40 Total Contact Hours: 40
Prerequisite:
Machine learning, algorithms, data inference, programming, mathematics, and statistics to
extract useful information from raw data and solve complex problems
Course Learning Objective
• Programming data science concepts and Big Data, modelling using R language.
• Analyze Basic tools of EDA, Data science process with case studies and Different
algorithms.
• Optimize & solve real life problems with different spam filter.
• Explore Feature Generation and Feature Selection

Course Outcomes:
On successful completion of the course, students will be able to:
Theory
1. Explain Data science, big data and fitting
2. Explore Data analysis and Data science process and R programs for the algorithm
3. Analyse and feature selection algorithms and Recommendation systems.
4. Design Map Reduce Solutions
Syllabus Hours
Module-1: Introduction: 08
What is Data Science? Big Data and Data Science hype – and getting past the hype, why
now? – Datafication, Current landscape of perspectives, A data Science Profile, Skill sets.
Statistical Inference, Populations and samples, Big Data, new kinds of data, m o d e l l i n g ,
statistical modeling probability distributions, fitting a model, -
Introduction to R
Module-2: Exploratory Data Analysis and the Data Science Process: 08
Basic tools (plots, graphs and summary statistics) of EDA, Philosophy of EDA, The Data
Science Process, Case Study: RealDirect (online realestate firm). Algorithms, machine
Learning Algorithms, Three Basic Algorithms: Linear Regression, k-Nearest Neighbours
(kNN), k-means, R Programs for the algorithms
Module-3: Spam Filter, K-NN and spam Filter, Naïve Bayes Algorithm 08
Spam Filter, Linear Regression and Spam Filter, K-NN and spam Filter, Naïve Bayes
Algorithm, Spam Filter using Naïve Bayes, Laplace Smoothing, Comparing Naïve Bayes
to K-NN, Scraping the Web, introduction to Logical Regression and M6D case study
Module-4: Feature Generation and Feature Selection (Extracting Meaning from Data): 08
Motivating application: user (customer) retention. Feature Generation (brainstorming, role
of domain expertise, and place for imagination), Feature Selection algorithms. Filters;
Wrappers; Decision Trees; Random Forests. Recommendation Systems: Building a User-
Facing Data Product, Algorithmic ingredients of a Recommendation Engine,
Dimensionality Reduction, Singular Value Decomposition, Principal Component Analysis,
Exercise: build your own recommendation system
Module-5: Data Engineering 08
Map reduce, Word Frequency Problem, Map Reduce Solution, Other Examples of Map
Reduce, Pregel-An Introduction. Data Visualization: Basic principles, ideas and tools for data
visualization. Mining Social-Network Graphs: Social networks as graphs, Clustering of
graphs, Direct discovery of communities in graphs, Partitioning.
Text Books:
1. Cathy O Neil, Rachel Schutt, 2014, “Doing Data Science-Straight Talk from the
Frontline”, Orielly
2. Jure Leskovek, Anand Rajaraman, Jeffrey Ullman, 2014 Mining of Massive Data Sets,
Cambridge University Press.
Reference Books:
1. Kevin Murphy, 2013, Machine learning: A Probabilistic Perspective,
2. Peter Bruce, Andre Bruce, Practical Statistics for Data Scientists, Orielly Series

Web links and Video Lectures (e-Resources):

• [Link]
• [Link]
• [Link]
 EAST WEST INSTITUTE OF TECHNOLOGY
(An Autonomous institute under VTU, Belagavi)

PSCSC103: Advanced Computer Networks

Course Frame Work:
Credits: L-T-P-S: 3 – 0 – 0 – 0 Total Credits: 3
Contact Hours/Week: 3 Direct Teaching Hours: 40 Total Contact Hours: 40
Prerequisite: A basic Understanding of computer networks and networking concepts
Course Learning Objective:
Students will be able to explain various network protocols of their respective layers.

Course Outcomes:
On successful completion of the course, students will be able to:
Theory
[Link] and classify network services, protocols and architectures, explain why they are
layered.
2. Choose key Internet applications and their protocols and apply to develop their own
applications (e.g. Client Server applications, Web Services) using the sockets API.
3. Develop effective communication mechanisms using techniques like connection
establishment, queuing theory, recovery Etc.
Syllabus Hours
Module-1: Foundation 08
Building a Network, Requirements, Perspectives, Scalable Connectivity, Cost-Effective
Resource sharing, Support for Common Services, Manageability, Protocol layering,
Performance, Bandwidth and Latency, Delay X Bandwidth Product, Perspectives on
Connecting, Classes of Links, Reliable Transmission, Stop-and-Wait, Sliding Window,
Concurrent Logical Channels
Module-2: Internetworking I 08
Switching and Bridging, Datagram’s, Virtual Circuit Switching, Source Routing, Bridges and
LAN Switches, Basic Internetworking (IP), What is an Internetwork? Service Model, Global
Addresses, Datagram Forwarding in IP, sub netting and classless addressing, Address
Translation (ARP), Host Configuration (DHCP), Error Reporting (ICMP), Virtual Networks and
Tunnels
Module-3: Internetworking- II: 08
Network as a Graph, Distance Vector (RIP), Link State (OSPF), Metrics, The Global Internet,
Routing Areas, Routing among Autonomous systems (BGP), IP Version 6 (IPv6), Mobility and
Mobile IP.

Module-4: End-to-End Protocols: 08

Simple Demultiplexer (UDP), Reliable Byte Stream (TCP), End-to-End Issues, Segment
Format, Connecting Establishment and Termination, Sliding Window Revisited, Triggering
Transmission, Adaptive Retransmission, Record Boundaries, TCP Extensions, Queuing
Disciplines, FIFO, Fair Queuing, TCP Congestion Control, Additive Increase/ Multiplicative
Decrease, Slow Start, Fast Retransmit and Fast Recovery.
Module-5: Congestion Control and Resource Allocation: 08
Congestion-Avoidance Mechanisms, DEC bit, Random Early Detection (RED), Source-Based
Congestion Avoidance. The Domain Name System (DNS), Electronic Mail (SMTP, POP,
IMAP, MIME), World Wide Web (HTTP), Network Management (SNMP)
Text Books:
1. Computer Networks: A System Approach, Larry Peterson and Bruce S Davis, Elsevier, 5th
Edition 2014.
2. Internetworking with TCP/IP, Principles, Protocols and Architecture, Douglas E Comer,
PHI, 6th Edition 2014.
Reference Books:
1. Computer Networks, Protocols, Standards and Interfaces, Uyless Black, PHI, 2nd Edition
Sears and Zemansky, University Physics, Pearson Education, 2000
2. TCP /IP Protocol Suite, Behrouz A Forouzan, Tata McGraw-Hill, 4th Edition

Web links and Video Lectures (e-Resources):

• [Link]
• [Link]
• [Link]
• [Link]
 EAST WEST INSTITUTE OF TECHNOLOGY
(An Autonomous institute under VTU, Belagavi)

PSCSC104: Data Structure & Algorithms for Problem Solving

Course Frame Work:
Credits: L-T-P-S: 3 – 0 – 0 – 0 Total Credits: 3
Contact Hours/Week: 3 Direct Teaching Hours: 40 Total Contact Hours: 40
Prerequisite: Data Structures Basics, Algorithms Fundamentals
Course Learning Objective:
• To reduce development time and the resources required to maintain existing applications.
• To increase code reuse and provide a competitive advantage through effective use of data
structures and algorithms.

Course Outcomes:
On successful completion of the course, students will be able to:
Theory
1. To reduce development time and the resources required to maintain existing applications
Describe applications of Schrodinger time independent wave equation using elementary
problems such as infinite potential well, finite potential and potential barrier.
2. To increase code reuse and provide a competitive advantage through effective use of data
structures and algorithms.
Syllabus Hours
Module-1: Search Trees: 08
Two Models of Search Trees. General Properties and Transformations. Height of a Search Tree.
Basic Find, Insert, and Delete. Returning from Leaf to Root. Dealing with Non unique Keys.
Queries for the Keys in an Interval. Building Optimal Search Trees. Converting Trees into Lists.
Removing a Tree. Balanced Search Trees: Height-Balanced Trees. Weight-Balanced Trees. (a,
b)- And B-Trees. Red-Black Trees and Trees of Almost Optimal Height. Top-Down
Rebalancing for Red-Black Trees.
Module-2: Tree Structures 08
Tree Structures for Sets of Intervals. Interval Trees. Segment Trees. Trees for the Union of
Intervals. Trees for Sums of Weighted Interval. Trees for Interval-Restricted Maximum Sum
Queries. Orthogonal Range Trees. Higher-Dimensional Segment Trees. Other Systems of
Building Blocks. Range-Counting and the Semigroup Model. Kd-Trees and Related Structures.
Module-3: Heaps: 08
Balanced Search Trees as Heaps. Array-Based Heaps. Heap-Ordered Trees and Half Ordered
Trees. Leftist Heaps. Skew Heaps. Binomial Heaps. Changing Keys in Heaps. Fibonacci Heaps.
Heaps of Optimal Complexity. Double-Ended Heap Structures and Multidimensional Heaps.
Heap-Related Structures with Constant-Time Updates.
Module-4: Graph Algorithms with Numerical Algorithm 08
Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnson’s Algorithm for
sparse graphs; Flow networks and Ford-Fulkerson method; Maximum bipartite matching.
Polynomials and the FFT: Representation of polynomials; The DFT and FFT; Efficient
implementation of FFT
Module-5: String-Matching Algorithms: 08
Naïve string Matching; Rabin - Karp algorithm; String matching with finite automata; Knuth-
Morris-Pratt algorithm; Boyer – Moore algorithms.
Text Books:
1. Advanced Data Structures, Peter Brass, Cambridge University Press, 2008.
2. Kenneth A. Berman. Algorithms. Cengage Learning. 2002.
3. T. H Cormen, C E Leiserson, R L Rivest and C Stein. Introduction to Algorithms. PHI,
3rd Edition, 2010

Reference Books:
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, 4 th Edition, 2014,
Pearson.
2. Data structures with Java, Ford and Topp, Pearson Education.
3. Ellis Horowitz, Sartaj Sahni, S. Rajasekharan. Fundamentals of Computer Algorithms.
Universities press. 2nd Edition, 2007
4. Data structures and Algorithms in Java, [Link], [Link], 3rd edition, Wiley
India Edition
Web links and Video Lectures (e-Resources):

• [Link]
• [Link]
• [Link]
• [Link]
 EAST WEST INSTITUTE OF TECHNOLOGY
(An Autonomous institute under VTU, Belagavi)

PSCSC105: Internet of Things and Applications

Course Frame Work:
Credits: L-T-P-S: 3– 0 – 2 – 0 Total Credits: 4
Contact Hours/Week: 5 Direct Teaching Hours: 50 Total Contact Hours: 65
Prerequisite: Basic Knowledge of Networking and Communication Protocols, Knowledge
of Wireless Communication Technologies
Course Learning Objective:
Theory
●Explore the knowledge on combination of functionalities and services of networking
● Explain the definition and significance of the Internet of Things.
● Discuss the architecture, operation and business benefits of an IoT solution.
Practical
• Describe what IoT is and how it works today.
• Design and program IoT devices.
• Use real IoT protocols for communication.
Course Outcomes:
On successful completion of the course, students will be able to:
Theory
1. Choose appropriate schemes for the applications of IOT in real time scenarios
2. Manage the Internet resources through different protocols used in each Layer
3. Compare various protocols and algorithms in different layers that facilitate effective
communication mechanisms
4. Identify how IoT differs from traditional data collection systems
Practical
1. Apply key Internet applications and their protocols, and ability to develop their own
applications (e.g. Client Server applications, Web Services) using the sockets API.
2. Design and evaluate application layer protocol.
3. Analyse the vulnerabilities in any computing system and hence be able to design a security
solution.
4. Identify the security issues in the network and resolve it.
5. Evaluate security mechanisms using rigorous approaches, including theoretical Outcomes.
 Syllabus Hours
Module-1: Introduction to The Internet of Things 10
What is The Internet of Things? Overview and Motivations, Examples of Applications, IPV6
Role, Areas of Development and Standardization, Scope of the Present Investigation. Internet
of Things Definitions and frameworks-IoT Definitions, IoT Frameworks, Basic Nodal
Capabilities. Internet of Things Application Examples-Overview, Smart Metering/Advanced
Metering Infrastructure-Health/Body Area Networks, City Automation, Automotive
Applications, Home Automation, Smart Cards, Tracking, OverThe-Air-Passive
Surveillance/Ring of Steel, Control Application Examples, Myriad

Module-2: Fundamental IoT Mechanism and Key Technologies 10

Identification of IoT Object and Services, Structural Aspects of the IoT, Key IoT
Technologies. Evolving IoT Standards- Overview and Approaches, IETF IPV6 Routing
Protocol for RPL Roll, Constrained Application Protocol, Representational State Transfer,
ETSI M2M, Third Generation Partnership Project Service Requirements for Machine-Type
Communications, CENELEC, IETF IPv6 Over Low power WPAN, Zigbee IP(ZIP), IPSO.
Module-3: Layer ½ Connectivity 10
Wireless Technologies for the IoT-WPAN Technologies for IoT/M2M, Cellular and Mobile
Network Technologies for IoT/M2M, Layer 3 Connectivity IPv6 Technologies for the IoT:
Overview and Motivations. Address Capabilities, IPv6 Protocol Overview, IPv6 Tunneling,
IPsec in IPv6, Header Compression Schemes, Quality of Service in IPv6, Migration Strategies
to IPv6
Module-4: Case Studies 10
Illustrating IoT Design-Introduction, Home Automation, Cities, Environment, Agriculture,
Productivity Applications.
Module-5: Data Analytics for IoT 10
Introduction, Apache Hadoop, Using Hadoop MapReduce for Batch Data Analysis, Apache
Oozie, Apache Spark, Apache Storm, Using Apache Storm for Real- time Data Analysis,
Structural Health Monitoring Case Study.
Lab experiments:
1. Transmit a string using UART
2. Point-to-Point communication of two Motes over the radio frequency
3. Multi-point to single point communication of Motes over the radio frequency,
AN(Subnetting).
4. I2C protocol study.
5. Reading Temperature and Relative Humidity value from the sensor.
6. Study of Connectivity and Configuration of Raspberry-Pi/ Beagle Board circuit with
basic peripherals, LEDs, Understanding GPIO and its use in program.
 7. Study of different operating systems for Raspberry Pi / Beagle board. Understanding
the process of OS installation on Raspberry – Pi/ Beagle board.
8. Familiarization with the concept of IOT, Arduino / Raspberry Pi and perform necessary
software installation.
Text Books:
1. Building the Internet of Things with IPv6 and MIPv6: The Evolving World of M2M
Communications Daniel Minoli Wiley 2013
2. Internet of Things: A Hands-on Approach Arshdeep Bahga, Vijay Madisetti Universities
Press 2015.
3. The Internet of Things Michael Miller Pearson 2015 First Edition.

Reference Books:
1. The Internet of Things, Michael Miller, Pearson, 2015 First Edition
2. Designing Connected Products, Claire Rowland, Elizabeth Goodman [Link], O’Reilly,
First Edition, 2015.

Web links and Video Lectures (e-Resources):

• [Link]
• [Link]
• [Link]
• [Link]
 EAST WEST INSTITUTE OF TECHNOLOGY
(An Autonomous institute under VTU, Belagavi)

PSCSL106: Algorithms and Artificial Intelligence Laboratory

Course Frame Work:
Credits: L-T-P-S: 0 – 0 – 2 – 0 Total Credits: 1
Contact Hours/Week: 2 Direct Teaching Hours: 26 Total Contact Hours: 26
Prerequisite: Learning AI Lab requires understanding data structure, mathematics proficiency,
programming skills, continuous learning, collaboration.
Course Learning Objective:
Implement and evaluate Algorithm and AI in Python programming language.

Course Outcomes:
On successful completion of the Lab, students will be able to:
1. Implement and demonstrate AI algorithms.
2. Evaluate different algorithms
Laboratory Experiments:
1. Implement a simple linear regression algorithm to predict a continuous target variable
based on a given dataset.
2. Develop a program to implement a Support Vector Machine for binary classification. Use
a sample dataset and visualize the decision boundary.
3. Develop a simple case-based reasoning system that stores instances of past cases.
Implement a retrieval method to find the most similar cases and make predictions based
on them.
4. Write a program to demonstrate the ID3 decision tree algorithm using an appropriate
dataset.
5. Build an Artificial Neural Network by implementing the Backpropagation algorithm and
test it with suitable datasets.
6. Implement a KNN algorithm for regression tasks instead of classification. Use a small
dataset, and predict continuous values based on the average of the nearest neighbors
7. Create a program that calculates different distance metrics (Euclidean and Manhattan)
 between two points in a dataset. Allow the user to input two points and display the
calculated distances
8. Implement the k-Nearest Neighbor algorithm to classify the Iris dataset, printing both
correct and incorrect predictions
9. Develop a program to implement the non-parametric Locally Weighted Regression
algorithm, fitting data points and visualizing results
10. Implement a Q-learning algorithm to navigate a simple grid environment, defining the
reward structure and analyzing agent performance.
Web links and Video Lectures (e-Resources):
• [Link]
• [Link]
• [Link]
• [Link]