PARUL INSTITUTE OF ENGINEERING &TECHNOLOGY – FIRST SHIFT

6th SEMESTER INFORMATION TECHNOLOGY

P I
ARUL NSTITUTESTUDENTS E
OF NGINEERING &T
HAND-BOOK-2023-24 ECHNOLOGY

STUDENT
INFORMATION
HANDBOOK
2019-20
DEPARTMENT OF INFORMATION TECHNOLOGY

SEMESTER 6

2023-24

1
P.O.LIMDA, TA. WAGHODIA, DIST VADODARA
P H . 02668 - 260338 .
 PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21

Faculty Representative Detail

Sr.
Division Name of Faculty Mobile E-mail ID
No
No
1 6IT-A Prof. Shaleen 9428282968 shaleen.shukla270186@paruluniversity.ac.in
Shukla
2 6IT-B
3 6IT-C Prof. Megha Zala 7874879114 megha.zala25920@paruluniversity.ac.in
4 6IT-D
5 6IT-E Prof. Priyanka 8160600724 priyanka.makwana26688@paruluniversity.ac.in
Makwana
6 6IT-F

Faculty List of BTech IT SEM-6

Sr Alias of Subject Name Subject Code

Name of Mobile No E-mail ID
No Faculty
Faculty
1 ARVIND ROHIT AR arvindbhai.rohit20036@parulu Employability Skills 203193353
niversity.ac.in
2 AXAY PATEL AP Axay@techdefence.com Cyber security 203105326
3 JAYAPRASAD B JP jayaprasadb180@gmail.com MEA(R)N Stack Web 203105379
Development
4 DR. BHUPENDRA BR bhupendra.ramani2817@paruluni Artificial Intelligence 203105322
RAMANI versity.ac.in
5 JAYSHREE PARMAR JP jayshree.parmar2946@parulunive Data Mining and Data
rsity.ac.in Visualization
6 MEHUL MC mehulkumar.chauhan24701@ Employability Skills 203193353
CHAUHAN paruluniversity.ac.in
7 SONAM SHARMA TD10 sonam.sharma@techdefence.com Cyber security 203105326
8 SEMI SONI SS semi.soni28868@paruluniversi Employability Skills 203193353
ty.ac.in
9 DHENUKA PATEL DJP dhenuka.patel2962@parulunivers Data Mining and Data
ity.ac.in Visualization
10 GAURAVKUMAR GK
11 MEGHA ZALA MZ megha.zala25920@paruluniversit Data Mining and Data
y.ac.in Visualization
12 TEJAL PATEL TP tejal.patel@paruluniversity.ac.in Artificial Intelligence 203105322
13 DR. RICHA RM richa.mishra24895@paruluniv Employability Skills 203193353
MISHRA ersity.ac.in
14 DHEERAJ KUMAR DKS dheeraj.singh@paruluniversity.ac. Data Mining and Data
SINGH in Visualization
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
6ITA [CLASS ROOM NO: N-507]
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
6ITB [CLASS ROOM NO: N-508]
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
6ITC [CLASS ROOM NO: N-509]

6ITD [CLASS ROOM NO: N-510]

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
6ITE [CLASS ROOM NO: N-511]

6ITF [CLASS ROOM NO: N-505]

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21

BTech IT SEM-6 Teaching Scheme

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY – FIRST SHIFT
SIXTH SEMESTER INFORMATION TECHNOLOGY STUDENTS
HAND-BOOK 2020-21
 Subject Syllabus
203105323 - Artificial Intelligence Laboratory

Course: BTech Semester: 5

Prerequisite: Data structure, automata, and languages, Mathematics
Rationale: This course provides a broad introduction to Artificial Intelligence. AI techniques for search and knowledge
representation also Apply knowledge of AI planning and machine learning techniques to real-world problems

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 - 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Outcome
After Learning the Course the students shall be able to:
After Learning the course, the students shall be able to:
1. Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent agents.
2. Analyze and formalize the problem as a state space, graph, design heuristics and select amongst different search or game-based
techniques to solve them.
3. Develop intelligent algorithms for constraint satisfaction problems and design intelligent systems for Game Playing.
4. Attain the capability to represent various real-life problem domains using logic-based techniques and use this to perform
inference or planning.
5. Formulate and solve problems with uncertain information using Bayesian approaches.
6. Apply concept Natural Language processing to problems leading to understanding of cognitive computing

Printed on : 26-11-2023 10:40 PM Page 1 of 2

 Subject Syllabus
203105323 - Artificial Intelligence Laboratory

List of Practical
1. Practical-1
Write a program in prolog to implement simple facts and Queries.

2. Practical -2
• Write a python program to print the multiplication table for the given number?
• Write a python program to check whether the given number is prime or not?
• Write a python program to find factorial of the given number?
3. Practical-3
Write a python program to implement simple Chatbot?

4. Practical-4
• Write a python program to implement List operations (Nested List, Length, Concatenation, Membership, Iteration,
Indexing and Slicing)?
• Write a python program to implement List methods (Add, Append, Extend & Delete).
5. Practical-5
• Write a python program to Illustrate Different Set Operations?
• Write a python program to generate Calendar for the given month and year?
• Write a python program to implement Simple Calculator program?
6. Practical-6
• Write a python program to Add Two Matrices.
• Write a python program to Transpose a Matrix.
7. Practical-7
Write a python program to implement Breadth First Search Traversal?

8. Practical-8
Write a python program to implement Water Jug Problem?

9. Practical-9
Write a program to implement Tic-Tac-Toe game using python.

10. Practical-10
• Write a python program to remove stop words for a given passage from a text file using NLTK?
• Write a python program to implement stemming for a given sentence using NLTK?
• Write a python program to POS (Parts of Speech) tagging for the give sentence using NLTK?
11. Practical-11
• Write a python program to implement Lemmatization using NLTK?
• Write a python program to for Text Classification for the give sentence using NLTK?

Miscellaneous
Exam Requirement
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Printed on : 26-11-2023 10:40 PM Page 2 of 2

 Subject Syllabus
203105322 - Artificial Intelligence

Course: BTech Semester: 5

Prerequisite: Data structure, automata, and languages, Mathematics | 203105101 - Fundamentals of Programming
Rationale: This course provides a broad introduction to Artificial Intelligence. AI techniques for search and knowledge
representation also Apply knowledge of AI planning and machine learning techniques to real-world problems

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 - 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Content W - Weightage (%) , T - Teaching hours

Sr. Topics W T
1 Introduction: 15 7
Definition of an AI, Major Areas of Artificial Intelligence, AI Techniques, History, AI problems, Production Systems,
Problem characteristics, Intelligent Agents, Agent Architecture, AI Application (E-Commerce, & Medicine), AI
Representation, Properties of internal representation, Future scope of AI, Issues in the design of search algorithms.
Introduction to AI Problems and Applications, Defining Problems as a State Space Search, Problem Characteristics,
Production Systems.
2 Search techniques: 20 8
Generate-And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-Ends
Analysis. Heuristic search, Hill Climbing, Best first search, mean and end analysis, Constraint Satisfaction, A* and
AO* Algorithm, Knowledge Representation: Basic concepts, Knowledge representation Paradigms, Propositional
Logic, Inference Rules in Propositional Logic, Knowledge representation using Predicate logic, Predicate Calculus,
Predicate and arguments, ISA hierarchy, Frame notation, Resolution, Natural Deduction
3 Knowledge Representation: 15 8
Knowledge Representation –
Representation and Mappings, Different Approaches, Issues in knowledge representation.
Predicate Logic - Representation Simple Facts in Logic, Representing Instance and Isa Relationships, Computable
Functions and Predicates, Resolution.
Propositional Logic: Representation, Inference, Reasoning Patterns, Resolution, First-order Logic: Representation,
Inference, Reasoning Patterns, Resolution
4 Uncertainty: 15 4
Non-Monotonic Reasoning, Logics for Non-Monotonic Reasoning, Forward rules, and Backward rules, Justification
based Truth Maintenance Systems, Semantic Nets Statistical Reasoning, Probability and Bayes’ theorem, Bayesian
Network, Markov Networks, Hidden Markov Model, Basis of Utility Theory, Utility Functions.
5 Fuzzy Sets and Fuzzy Logic: 10 4
Fuzzy Set Operations, Membership Functions, Fuzzy Logic, Hedges, Fuzzy Proposition and Inference Rules, Fuzzy
Systems.
6 Natural Language Processing: 10 4
Introduction, Syntactic Processing, Semantic Analysis, Semantic Analysis, Discourse and Pragmatic Processing, Spell
Checking.
7 Neural Networks and Expert systems: 15 7
Introduction to neural networks and perception-qualitative Analysis, Neural net architecture and applications,
Utilization and functionality, the architecture of the expert system, knowledge representation, two case studies on
expert systems

Printed on : 26-11-2023 10:40 PM Page 1 of 2

 Subject Syllabus
203105322 - Artificial Intelligence

Reference Books
1. Artificial Intelligence: A New Synthesis, Harcourt Publishers (TextBook)
By N. J. Nilsson | Harcourt Publishers
2. Artificial Intelligence (TextBook)
By Elaine Rich and Kevin Knight | TMH
3. Artificial Intelligence-Structures and Strategies For Complex Problem Solving
By George F. Luger | Pearson Education / PHI
4. Artificial Intelligence-A Modern Approach
By Stewart Russell and Peter Norvig | Pearson Education/ Prentice Hall of India | 2
5. Artificial Intelligence – A Practical Approach
By Patterson | Tata McGraw Hill | 3

Course Outcome
After Learning the Course the students shall be able to:
After Learning the course, the students shall be able to:
1. Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent agents.
2. Analyze and formalize the problem as a state space, graph, design heuristics and select amongst different search or game-based
techniques to solve them.
3. Develop intelligent algorithms for constraint satisfaction problems and design intelligent systems for Game Playing.
4. Attain the capability to represent various real-life problem domains using logic-based techniques and use this to perform
inference or planning.
5. Formulate and solve problems with uncertain information using Bayesian approaches.
6. Apply concept Natural Language processing to problems leading to understanding of cognitive computing

Printed on : 26-11-2023 10:40 PM Page 2 of 2

 Subject Syllabus
203108484 - web development & Framework Laboratory

Course: BTech Semester: 8

Prerequisite:
Rationale: -

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/ Hrs/Week Hrs/Week Hrs/ T CE P T P
- 0 2 - 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Printed on : 26-11-2023 10:45 PM Page 1 of 1

 Subject Syllabus
203108483 - web development & Framework

Course: BTech Semester: 8

Prerequisite:
Rationale: -

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/ Hrs/ Hrs/ T CE P T P
3 - - - 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Printed on : 26-11-2023 10:45 PM Page 1 of 1

 Subject Syllabus
203105327 - Cyber Security Laboratory

Course: BTech Semester: 5

Prerequisite: Fundamental of Programming, Computer Network | 203105215 - Computer Networks
Rationale: Cyber security is the application of technologies, processes, and controls to protect systems, networks, programs,
devices, and data from cyber-attacks. It aims to reduce the risk of cyber-attacks and protect against the unauthorized exploitation
of systems, networks, and technologies.

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 0 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Outcome
After Learning the Course the students shall be able to:
After learning the course, the students should be able to:
1. Explain the features and characteristics of the Linux Operating System and Windows Operating
System.
2. Apply network monitoring tools to identify attacks against network protocols and services.
3. Apply various methods to prevent malicious access to computer networks, hosts, and data.
4. Explain how to investigate endpoint vulnerabilities and attacks.
5. Analyze network intrusion data to verify potential exploits.
6. Apply incident response models to manage network security incidents

Printed on : 26-11-2023 10:45 PM Page 1 of 2

 Subject Syllabus
203105327 - Cyber Security Laboratory

List of Practical
1. Practical-1
Implementation to gather information from any PC’s connected to the LAN using whois, port scanners, network scanning,
Angry IP scanners etc.
2. Practical-2
Experiments with open source firewall/proxy packages like iptables, squid etc.
3. Practical-3
Implementation of Steganography.
4. Practical-4
Implementation of MITM- attack using wireshark / network sniffers.
5. Practical-5
Implementation of Windows security using firewalls and other tools.
6. Practical-6
Implementation to identify web vulnerabilities, using OWASP project.
7. Practical-7
Implementation of IT Audit, malware analysis and Vulnerability assessment and generate the report.
8. Practical-8
Implementation of OS hardening and RAM dump analysis to collect the Artifacts and other Information.
9. Practical-9
Implementation of Mobile Audit and generate the report of the existing Artifacts.
10. Practical-10
Implementation of Cyber Forensics tools for Disk Imaging, Data acquisition, Data extraction and Data Analysis and recovery.

Printed on : 26-11-2023 10:45 PM Page 2 of 2

 Subject Syllabus
203105326 - Cyber Security

Course: BTech Semester: 5

Prerequisite: Fundamental of Programming, Computer Network
Rationale: Cyber security is the application of technologies, processes, and controls to protect systems, networks, programs,
devices, and data from cyber-attacks. It aims to reduce the risk of cyber-attacks and protect against the unauthorized exploitation
of systems, networks, and technologies.

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 0 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Content W - Weightage (%) , T - Teaching hours

Sr. Topics W T
1 Information Security 15 8
Introduction to information system, Types of information Systems, Development of Information Systems,
Introduction to Information Security, Need for Information Security, Threats to Information Systems, Information
Assurance, Cyber Security and Security Risk Analysis.
2 Systems Vulnerability Scanning 25 13
Overview of vulnerability scanning, Open Port/Service Identification, Banner/ Version Check, Traffic Probe,
Vulnerability Probe, Vulnerability Examples. Networks Vulnerability Scanning - Netcat, Understanding Port and
Services tools, Network Reconnaissance–Nmap. Network Sniffers and Injection tools–Wireshark.
3 Network Defense tools 20 11
Firewalls and Packet Filters: Firewall Basics, Packet Filter Vs Firewall, Firewall Protects a Network, Packet
Characteristic to Filter, Stateless Vs Stateful Firewalls, Network Address Translation(NAT) and Port Forwarding, the
basic of Virtual Private Networks, Linux Firewall, Windows Firewall, Snort: Introduction Detection System
4 Introduction to Cyber Crime and law 20 5
Cyber Crimes, Types of Cybercrime, Hacking, Attack vectors, Cyberspace and Criminal Behavior, Clarification of
Terms, Traditional Problems Associated with Computer Crime, Introduction to Incident Response, Digital Forensics
,Computer Language, Network Language, Realms of the Cyber world, A Brief History of the Internet, Recognizing and
Defining Computer Crime, Contemporary Crimes, Computers as Targets, Contaminants and Destruction of Data,
Indian ITACT 2000.
5 Introduction to Cyber Crime Investigation 20 5
Firewalls and Packet Filters, password Cracking, Key loggers and Spyware, Virus And Warms, Trojan and backdoors,
Steganography, DOS and DDOS attack, SQL injection, Buffer Overflow, Attack on wireless Networks.

Printed on : 26-11-2023 10:44 PM Page 1 of 2

 Subject Syllabus
203105326 - Cyber Security

Reference Books
1. Cryptography and Network Security (TextBook)
By William Stallings | Pearson Education
2. Cryptography and Network Security (TextBook)
By V.K. Jain | Khanna Publishing House
3. Information and Cyber Security (TextBook)
By Gupta Sarika | Khanna Publishing House
4. Cryptography and Network Security (TextBook)
By Atul Kahate | TMH
5. Cryptography and Information Security (TextBook)
By V.K. Pachghare | PHI Learning
6. Anti-Hacker Tool Kit
By Mike Shema | McGrawHill
7. Cyber Security understanding Cyber Crimes, Computer forensics and Legal Perspectives
By Nina Godbole and Sunit Belapure | WILEY

Course Outcome
After Learning the Course the students shall be able to:
After learning the course, the students should be able to:
1. Explain the features and characteristics of the Linux Operating System and Windows Operating
System.
2. Apply network monitoring tools to identify attacks against network protocols and services.
3. Apply various methods to prevent malicious access to computer networks, hosts, and data.
4. Explain how to investigate endpoint vulnerabilities and attacks.
5. Analyze network intrusion data to verify potential exploits.
6. Apply incident response models to manage network security incidents

Printed on : 26-11-2023 10:44 PM Page 2 of 2

 Subject Syllabus
203193353 - Employbility Skills

Course: BTech Semester: 6

Prerequisite:
Rationale: -

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
- 1 - - 1 - 100 - - - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Printed on : 26-11-2023 10:44 PM Page 1 of 1

 Subject Syllabus
203108362 - Data Mining and Data Visualization
Laboratory

Course: BTech Semester: 6

Prerequisite: Database Management System, Linear algebra & Statistics
Rationale: This course helps the students to understand different data mining models and data visualization techniques.

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
1 0 2 - 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Outcome
After Learning the Course the students shall be able to:
1. Extract knowledge using data mining techniques
2. Adapt to new data mining tools.
3. Apply the techniques of clustering, classification, association finding, feature selection and visualization to real world data
4. Analyze the dataset and perform Descriptive Statistics.
5. Analyze the dataset and perform an Inferential Statistics.

Printed on : 26-11-2023 10:44 PM Page 1 of 2

 Subject Syllabus
203108362 - Data Mining and Data Visualization
Laboratory

List of Practical
1. Practical-1
Design and Create cube by identifying measures and dimensions for Star Schema, Snowflake schema and fact Constellation
Schema.
2. Practical-2
Create calculated member using arithmetic operators and member property of dimension member.
3. Practical-3
Perform Pre-processing on a dataset. Apply various Filters and discuss the effect of each filter applied.
a. Handle Missing Values
b. Handle Infrequent Nominal Values
c. Derive an attribute from the existing attribute
d. Sampling
e. Discretization
1)Use Weka Tool 2) Use XL Miner Tool
4. Practical-4
Use MS-Excel to create pivot table & apply statistical measures to it, Also generate different charts.
5. Practical-5
Perform the Histogram Analysis of given dataset using Data Analysis Toolbox of Excel.
6. Practical-6
Use python libraries to generate chart from data stored in Excel.
7. Practical-7
Perform Association rule mining using WEKA tool.
8. Practical-8
Perform classification with WEKA tool.
a. using Decision Tree Classifier
b. using Naïve Bayes Classifier
using Multilayer Perceptron
9. Practical-9
Perform Clustering using WEKA tool
10. Practical-10
Given a case study: Interactive Data Analytics with Power BI

Printed on : 26-11-2023 10:44 PM Page 2 of 2

 Subject Syllabus
203108361 - Data Mining and Data Visualization

Course: BTech Semester: 6

Prerequisite: Database Management System, Linear algebra & Statistics
Rationale: This course helps the students to understand different data mining models and data visualization techniques.

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
1 0 2 - 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Content W - Weightage (%) , T - Teaching hours

Sr. Topics W T
1 Introduction to data mining (DM)Importance of Data Mining, Data Mining-Definition and Functionalities, 21 9
Classification of Data mining systems, Data mining Architecture, KDD, DM task primitives, Major Issues in Data
Mining, Data mining Technologies, Applications of Data Mining.
2 Mining Frequent PatternsEfficient and scalable frequent itemset mining methods, Association Rules, 16 7
Multidimensional & Multilevel association rules, Generating Association Rules from Frequent Item sets, Interesting
Pattern Evaluation Methods.
3 Statistical Representation of DataData Quality, Data Objects and Attribute Types, Basic Statistical Descriptions of 10 6
Data, Reasons of Missing Values & Noisy Data
4 Data Pre-processingTasks in Data Preprocessing, Cleaning, Integration, Reduction, Transformation and 16 7
Discretization, Concept Hierarchy Generation.
5 Fundamental of Data VisualizationIntroduction to data visualization & analytics, Info-graphic representation of 16 7
terminologies, DIKW (Data, Information, Knowledge, wisdom) Pyramid, Difference between Analysis and Analytics,
Applications of Data Visualization, Applications of Data Analytics
6 Classification & ClusteringClassification vs. prediction, Supervised learning, Approach to Classification: Decision Tree 21 9
Induction, Unsupervised learning, Cluster Analysis: Partitioning Methods, Hierarchical Methods, Density-Based
Methods, Evaluation of Clustering, Outlier Detection. Introduction to analytics tools like Power BI.

Reference Books
1. Data Mining concepts and Techniques By Jiawei Han, Micheline Kamber | Elsevier

2. Data Mining Techniques By Arun K. Pujari | Universities Press

3. Principles of Statistics
By M. G. Bulmer, Dover Publications Inc.
4. Beautiful Visualization
By Noah Iliinsky, Julie Steele Publisher(s): O'Reilly Media, Inc. ISBN: 9781449379865
5. Statistics 101: From Data Analysis and Predictive Modeling to Measuring Distribution and Determining Probability, Your
Essential Guide to Statistics
By David Borman, Adams Media

Printed on : 26-11-2023 10:44 PM Page 1 of 2

 Subject Syllabus
203108361 - Data Mining and Data Visualization

Course Outcome
After Learning the Course the students shall be able to:
1. Extract knowledge using data mining techniques
2. Adapt to new data mining tools.
3. Apply the techniques of clustering, classification, association finding, feature selection and visualization to real world data
4. Analyze the dataset and perform Descriptive Statistics.
5. Analyze the dataset and perform an Inferential Statistics.

Printed on : 26-11-2023 10:44 PM Page 2 of 2

 Subject Syllabus
203108360 - Project I

Course: BTech Semester: 6

Prerequisite:
Rationale: -

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 0 1 - - 50 - 50 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Printed on : 26-11-2023 10:43 PM Page 1 of 1

 Subject Syllabus
203105380 - MEA(R)N Stack Web Development
Laboratory

Course: BTech Semester: 6

Prerequisite: Database Management system, SQL, Basics of Javascript and web development
Rationale: 1. Understanding the basics of web development and JavaScript programming 2. Learning how to use MongoDB, a
popular NoSQL database, to store and retrieve data 3. Learning how to use Node.js, a server-side JavaScript runtime, to create APIs
and handle server-side logic 4. Learning how to use Express.js, a lightweight web application framework for Node.js, to build web
applications 5. Learning how to use AngularJS, a powerful front-end JavaScript framework, to create dynamic user interfaces and
connect with APIs 6. Building a full-stack web application from scratch using the MEAN stack 7. Understanding best practices for
deploying, testing, and maintaining MEAN stack applications

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 - 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Outcome
After Learning the Course the students shall be able to:
1. Have a comprehensive understanding of the technologies and frameworks that make up the MEAN stack, including MongoDB,
Expíess.js, AngularJS, and Node.js.
2. Build full-stack web applications.
3. Understand web development best practices:
4. Work on real-world projects using the MEAN stack. This could include developing a portfolio of projects of contributing to
opensource projects.

Printed on : 26-11-2023 10:43 PM Page 1 of 2

 Subject Syllabus
203105380 - MEA(R)N Stack Web Development
Laboratory

List of Practical
1. Practical-1
1. Introduction to MEAN stack
2. Setting up the development environment
3. Overview of MongoDB, Express.js, Angular, and Node.js
2. Practical-2
1. Creating and configuring MongoDB
2. Creating and configuring Express.js
3. Building RESTful APIs with Express.js

3. Practical-3
1. Introduction to Angular
2. Building basic UI components with Angular
3. Creating a Single-Page Application (SPA) with Angular
4. Practical-4
1. Introduction to Node.js
2. Creating and configuring Node.js
3. Building server-side applications with Node.js
5. Practical-5
1. Integrating all components to build a full-stack application
2. Testing and debugging the application
3. Deploying the application on a cloud platform

Printed on : 26-11-2023 10:43 PM Page 2 of 2

 Subject Syllabus
203105379 - MEA(R)N Stack Web Development

Course: BTech Semester: 6

Prerequisite: Database Management system, SQL, Basics of Javascript and web development
Rationale: 1. Understanding the basics of web development and JavaScript programming 2. Learning how to use MongoDB, a
popular NoSQL database, to store and retrieve data 3. Learning how to use Node.js, a server-side JavaScript runtime, to create APIs
and handle server-side logic 4. Learning how to use Express.js, a lightweight web application framework for Node.js, to build web
applications 5. Learning how to use AngularJS, a powerful front-end JavaScript framework, to create dynamic user interfaces and
connect with APIs 6. Building a full-stack web application from scratch using the MEAN stack 7. Understanding best practices for
deploying, testing, and maintaining MEAN stack applications

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 - 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Content W - Weightage (%) , T - Teaching hours

Sr. Topics W T
1 Introduction to Web Development and the MEAN Stack: 4 2
Overview of web development, Introduction to the MEAN stack, Setting up the development environment
2 MongoDB: 20 10
Introduction to NoSQL databases, Installation and configuration of MongoDB, CRUD operations in MongoDB,
Indexing and querying in MongoDB, Schema design and data modeling
3 Node.JS & Express JS: 20 10
Introduction to Node.js and Express.js, Introduction to Node.js and Express.js, Middleware and routing,
Authentication and security with Passport.js,
Error handling and logging
4 Angular: 30 13
Introduction to Angular, Setting up an Angular application, Components, modules, and services, Data binding and
templates, Forms and validation, Routing and navigation, HTTP and observables, Building a complete frontend for
the MEAN stack application
5 Integration: 10 3
Integrating the Angular frontend with the Express.js API, Authentication and user management integration ,
Handling real-time data with WebSockets, Error handling and testing
6 Deployment and Best Practices: 6 3
Preparing the application for deployment, Hosting and server setup options, Security best practices, Performance
optimization and testing, Version control and continuous integration.
7 Final Project:Project 10 4

Printed on : 26-11-2023 10:43 PM Page 1 of 2

 Subject Syllabus
203105379 - MEA(R)N Stack Web Development

Reference Books
1. MEAN Web Development" by Amos Q. Haviv (Publisher: Packt Publishing) (TextBook)

2. "Learning Node.js: A Hands-On Guide to Building Web Applications in JavaScript" by Marc Wandschneider (Publisher:
Addison-Wesley Professional)

3. "AngularJS: Up and Running: Enhanced Productivity with Structured Web Apps" by Shyam Seshadri and Brad Green
(Publisher: O'Reilly Media)

4. "MongoDB: The Definitive Guide: Powerful and Scalable Data Storage" by Shannon Bradshaw, Kristina Chodorow, and
Eoin Brazil (Publisher: O'Reilly Media)

Course Outcome
After Learning the Course the students shall be able to:
After Learning the course, students shall be able to:
1. Have a comprehensive understanding of the technologies and frameworks that make up the MEAN stack, including MongoDB,
Expíess.js, AngularJS, and Node.js.
2. Build full-stack web applications.
3. Understand web development best practices:
4. Work on real-world projects using the MEAN stack. This could include developing a portfolio of projects of contributing to open-
source projects.

Printed on : 26-11-2023 10:43 PM Page 2 of 2

 Subject Syllabus
203105323 - Artificial Intelligence Laboratory

Course: BTech Semester: 5

Prerequisite: Data structure, automata, and languages, Mathematics
Rationale: This course provides a broad introduction to Artificial Intelligence. AI techniques for search and knowledge
representation also Apply knowledge of AI planning and machine learning techniques to real-world problems

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 - 1 - - 20 - 30 50
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Outcome
After Learning the Course the students shall be able to:
After Learning the course, the students shall be able to:
1. Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent agents.
2. Analyze and formalize the problem as a state space, graph, design heuristics and select amongst different search or game-based
techniques to solve them.
3. Develop intelligent algorithms for constraint satisfaction problems and design intelligent systems for Game Playing.
4. Attain the capability to represent various real-life problem domains using logic-based techniques and use this to perform
inference or planning.
5. Formulate and solve problems with uncertain information using Bayesian approaches.
6. Apply concept Natural Language processing to problems leading to understanding of cognitive computing

Printed on : 26-11-2023 10:40 PM Page 1 of 2

 Subject Syllabus
203105323 - Artificial Intelligence Laboratory

List of Practical
1. Practical-1
Write a program in prolog to implement simple facts and Queries.

2. Practical -2
• Write a python program to print the multiplication table for the given number?
• Write a python program to check whether the given number is prime or not?
• Write a python program to find factorial of the given number?
3. Practical-3
Write a python program to implement simple Chatbot?

4. Practical-4
• Write a python program to implement List operations (Nested List, Length, Concatenation, Membership, Iteration,
Indexing and Slicing)?
• Write a python program to implement List methods (Add, Append, Extend & Delete).
5. Practical-5
• Write a python program to Illustrate Different Set Operations?
• Write a python program to generate Calendar for the given month and year?
• Write a python program to implement Simple Calculator program?
6. Practical-6
• Write a python program to Add Two Matrices.
• Write a python program to Transpose a Matrix.
7. Practical-7
Write a python program to implement Breadth First Search Traversal?

8. Practical-8
Write a python program to implement Water Jug Problem?

9. Practical-9
Write a program to implement Tic-Tac-Toe game using python.

10. Practical-10
• Write a python program to remove stop words for a given passage from a text file using NLTK?
• Write a python program to implement stemming for a given sentence using NLTK?
• Write a python program to POS (Parts of Speech) tagging for the give sentence using NLTK?
11. Practical-11
• Write a python program to implement Lemmatization using NLTK?
• Write a python program to for Text Classification for the give sentence using NLTK?

Miscellaneous
Exam Requirement
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Printed on : 26-11-2023 10:40 PM Page 2 of 2

 Subject Syllabus
203105322 - Artificial Intelligence

Course: BTech Semester: 5

Prerequisite: Data structure, automata, and languages, Mathematics | 203105101 - Fundamentals of Programming
Rationale: This course provides a broad introduction to Artificial Intelligence. AI techniques for search and knowledge
representation also Apply knowledge of AI planning and machine learning techniques to real-world problems

Teaching and Examination Scheme

Teaching Scheme Examination Scheme

Lecture Tutorial Lab Internal Marks External Marks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 - 3 20 20 - 60 - 100
SEE - Semester End Examination, CIA - Continuous Internal Assessment (It consists of Assignments/Seminars/Presentations/MCQ Tests, etc.)

Course Content W - Weightage (%) , T - Teaching hours

Sr. Topics W T
1 Introduction: 15 7
Definition of an AI, Major Areas of Artificial Intelligence, AI Techniques, History, AI problems, Production Systems,
Problem characteristics, Intelligent Agents, Agent Architecture, AI Application (E-Commerce, & Medicine), AI
Representation, Properties of internal representation, Future scope of AI, Issues in the design of search algorithms.
Introduction to AI Problems and Applications, Defining Problems as a State Space Search, Problem Characteristics,
Production Systems.
2 Search techniques: 20 8
Generate-And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-Ends
Analysis. Heuristic search, Hill Climbing, Best first search, mean and end analysis, Constraint Satisfaction, A* and
AO* Algorithm, Knowledge Representation: Basic concepts, Knowledge representation Paradigms, Propositional
Logic, Inference Rules in Propositional Logic, Knowledge representation using Predicate logic, Predicate Calculus,
Predicate and arguments, ISA hierarchy, Frame notation, Resolution, Natural Deduction
3 Knowledge Representation: 15 8
Knowledge Representation –
Representation and Mappings, Different Approaches, Issues in knowledge representation.
Predicate Logic - Representation Simple Facts in Logic, Representing Instance and Isa Relationships, Computable
Functions and Predicates, Resolution.
Propositional Logic: Representation, Inference, Reasoning Patterns, Resolution, First-order Logic: Representation,
Inference, Reasoning Patterns, Resolution
4 Uncertainty: 15 4
Non-Monotonic Reasoning, Logics for Non-Monotonic Reasoning, Forward rules, and Backward rules, Justification
based Truth Maintenance Systems, Semantic Nets Statistical Reasoning, Probability and Bayes’ theorem, Bayesian
Network, Markov Networks, Hidden Markov Model, Basis of Utility Theory, Utility Functions.
5 Fuzzy Sets and Fuzzy Logic: 10 4
Fuzzy Set Operations, Membership Functions, Fuzzy Logic, Hedges, Fuzzy Proposition and Inference Rules, Fuzzy
Systems.
6 Natural Language Processing: 10 4
Introduction, Syntactic Processing, Semantic Analysis, Semantic Analysis, Discourse and Pragmatic Processing, Spell
Checking.
7 Neural Networks and Expert systems: 15 7
Introduction to neural networks and perception-qualitative Analysis, Neural net architecture and applications,
Utilization and functionality, the architecture of the expert system, knowledge representation, two case studies on
expert systems

Printed on : 26-11-2023 10:40 PM Page 1 of 2

 Subject Syllabus
203105322 - Artificial Intelligence

Reference Books
1. Artificial Intelligence: A New Synthesis, Harcourt Publishers (TextBook)
By N. J. Nilsson | Harcourt Publishers
2. Artificial Intelligence (TextBook)
By Elaine Rich and Kevin Knight | TMH
3. Artificial Intelligence-Structures and Strategies For Complex Problem Solving
By George F. Luger | Pearson Education / PHI
4. Artificial Intelligence-A Modern Approach
By Stewart Russell and Peter Norvig | Pearson Education/ Prentice Hall of India | 2
5. Artificial Intelligence – A Practical Approach
By Patterson | Tata McGraw Hill | 3

Course Outcome
After Learning the Course the students shall be able to:
After Learning the course, the students shall be able to:
1. Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent agents.
2. Analyze and formalize the problem as a state space, graph, design heuristics and select amongst different search or game-based
techniques to solve them.
3. Develop intelligent algorithms for constraint satisfaction problems and design intelligent systems for Game Playing.
4. Attain the capability to represent various real-life problem domains using logic-based techniques and use this to perform
inference or planning.
5. Formulate and solve problems with uncertain information using Bayesian approaches.
6. Apply concept Natural Language processing to problems leading to understanding of cognitive computing

Printed on : 26-11-2023 10:40 PM Page 2 of 2

 A B C D E F G H I J K L M N
1
2
3
4
5 Subject :DMDV
6 Sr. Planned Date
Name of Practical
No. A1 A2 B1 B2 C1 C2 D1 D2 E1 E2 F1 F2
7
Design and Create cube by identifying measures and
8 dimensions for Star Schema, Snowflake schema and fact 29-11-2023 29-11-2023 28-11-2023 28-11-2023 30-11-2023 30-11-2023 28-11-2023 28-11-2023 30-11-2023 30-11-2023 27-11-2023 27-11-2023
1
Constellation
9 Schema. 06-12-2023 06-12-2023 05-12-2023 05-12-2023 07-12-2023 07-12-2023 05-12-2023 05-12-2023 07-12-2023 07-12-2023 04-12-2023 04-12-2023
Create calculated member using arithmetic operators
2
10 and member property of dimension member. 13-12-2023 13-12-2023 12-12-2023 12-12-2023 14-12-2023 14-12-2023 12-12-2023 12-12-2023 14-12-2023 14-12-2023 11-12-2023 11-12-2023

Perform Pre-processing on a dataset. Apply various

Filters and discuss the effect of each filter applied.
a. Handle Missing Values
b. Handle Infrequent Nominal Values
3
c. Derive an attribute from the existing attribute
d. Sampling
11 e. Discretization 20-12-2023 20-12-2023 19-12-2023 19-12-2023 21-12-2023 21-12-2023 19-12-2023 19-12-2023 21-12-2023 21-12-2023 18-12-2023 18-12-2023
1)Use Weka Tool 2) Use XL Miner Tool
12 27-12-2023 27-12-2023 26-12-2023 26-12-2023 28-12-2023 28-12-2023 26-12-2023 26-12-2023 28-12-2023 28-12-2023 01-01-2024 01-01-2024
Use MS-Excel to create pivot table & apply statistical
4
13 measures to it, Also generate different charts. 03-01-2024 03-01-2024 02-01-2024 02-01-2024 04-01-2024 04-01-2024 02-01-2024 02-01-2024 04-01-2024 04-01-2024 08-01-2024 08-01-2024
Perform the Histogram Analysis of given dataset using
5
14 Data Analysis Toolbox of Excel. 10-01-2024 10-01-2024 09-01-2024 09-01-2024 11-01-2024 11-01-2024 09-01-2024 09-01-2024 11-01-2024 11-01-2024 22-01-2024 22-01-2024

Use python libraries to generate chart from data stored

6
15 in Excel. 17-01-2024 17-01-2024 16-01-2024 16-01-2024 18-01-2024 18-01-2024 16-01-2024 16-01-2024 18-01-2024 18-01-2024 05-02-2024 05-02-2024

16 24-01-2024 24-01-2024 23-01-2024 23-01-2024 25-01-2024 25-01-2024 23-01-2024 23-01-2024 25-01-2024 25-01-2024 12-02-2024 12-02-2024
7 Perform Association rule mining using WEKA tool

17 07-02-2024 07-02-2024 06-02-2024 06-02-2024 08-02-2024 08-02-2024 06-02-2024 06-02-2024 08-02-2024 08-02-2024 19-02-2024 19-02-2024

Perform classification with WEKA tool.

a. using Decision Tree Classifier
18 14-02-2024 14-02-2024 13-02-2024 13-02-2024 15-02-2024 15-02-2024 13-02-2024 13-02-2024 15-02-2024 15-02-2024
8 b. using Naïve Bayes Classifier 26-02-2024 26-02-2024
using Multilayer Perceptron

19 21-02-2024 21-02-2024 20-02-2024 20-02-2024 22-02-2024 22-02-2024 20-02-2024 20-02-2024 22-02-2024 22-02-2024

Perform Clustering using WEKA tool

9

20 28-02-2024 28-02-2024 27-02-2024 27-02-2024 29-02-2024 29-02-2024 27-02-2024 27-02-2024 29-02-2024 29-02-2024 04-03-2024 04-03-2024

Given a case study: Interactive Data Analytics with

10
Power BI
21 06-03-2024 06-03-2024 05-03-2024 05-03-2024 07-03-2024 07-03-2024 05-03-2024 05-03-2024 07-03-2024 07-03-2024 11-03-2024 11-03-2024
Academic Year : 2023-24
Name of Lecturer : Dhenuka Patel
Subject DMDV
Sr. No. Name of Topic
1 Introduction to data mining
Importance of Data Mining
Data Mining-Definition and Functionalities
Classification of Data mining systems
Data mining Architecture
KDD
KDD
DM task primitives
Major Issues in Data Mining
Data mining Technologies, Applications of Data Mining
2 Mining Frequent Patterns
Efficient and scalable frequent itemset mining methods,
Association Rules,
Multidimensional & Multilevel association rules,
Multidimensional & Multilevel association rules,
Generating Association Rules from Frequent Item sets,
Generating Association Rules from Frequent Item sets,
Interesting Pattern Evaluation Methods
3 Statistical Representation of Data
Data Quality,
Data Objects and Attribute Types,
Data Objects and Attribute Types,
Basic Statistical Descriptions of Data,
Basic Statistical Descriptions of Data,
Reasons of Missing Values & Noisy Data
4 Data Pre-processing :
Tasks in Data Preprocessing,
Tasks in Data Preprocessing,
Cleaning,
Integration,
Reduction,
Transformation and Discretization,
Concept Hierarchy Generation
5 Fundamental of Data Visualization
Introduction to data visualization & analytics,
Info-graphic representation of terminologies,
DIKW (Data, Information, Knowledge, wisdom) Pyramid,
DIKW (Data, Information, Knowledge, wisdom) Pyramid,
Difference between Analysis and Analytics,
Applications of Data Visualization,
Applications of Data Analytics
6 Classification & Clustering
Classification vs. prediction,
Supervised learning,
Approach to Classification: Decision Tree Induction,
Unsupervised learning,
Sem:6th
Name of Department: IT
Hrs./Week:4/1
Hrs. Alloted A B C D E F
9
1 28-11-2023 27-11-2023 28-11-2023 27-11-2023 28-11-2023 27-11-2023
1 29-11-2023 28-11-2023 30-11-2023 28-11-2023 30-11-2023 28-11-2023
1 01-12-2023 30-11-2023 01-12-2023 29-11-2023 01-12-2023 01-12-2023
1 05-12-2023 04-12-2023 05-12-2023 04-12-2023 05-12-2023 04-12-2023
1 06-12-2023 05-12-2023 07-12-2023 05-12-2023 07-12-2023 05-12-2023
1 08-12-2023 07-12-2023 08-12-2023 06-12-2023 08-12-2023 08-12-2023
1 12-12-2023 11-12-2023 12-12-2023 11-12-2023 12-12-2023 11-12-2023
1 13-12-2023 12-12-2023 14-12-2023 12-12-2023 14-12-2023 12-12-2023
1 15-12-2023 14-12-2023 15-12-2023 13-12-2023 15-12-2023 15-12-2023
7
1 19-12-2023 18-12-2023 19-12-2023 18-12-2023 19-12-2023 18-12-2023
1 20-12-2023 19-12-2023 21-12-2023 19-12-2023 21-12-2023 19-12-2023
1 22-12-2023 21-12-2023 22-12-2023 20-12-2023 22-12-2023 22-12-2023
1 26-12-2023 26-12-2023 26-12-2023 26-12-2023 26-12-2023 26-12-2023
1 27-12-2023 28-12-2023 28-12-2023 27-12-2023 28-12-2023 29-12-2023
1 29-12-2023 01-01-2024 29-12-2023 01-01-2024 29-12-2023 01-01-2024
1 02-01-2024 02-01-2024 02-01-2024 02-01-2024 02-01-2024 02-01-2024
6
1 03-01-2024 04-01-2024 04-01-2024 03-01-2024 04-01-2024 05-01-2024
1 05-01-2024 08-01-2024 05-01-2024 08-01-2024 05-01-2024 08-01-2024
1 09-01-2024 09-01-2024 09-01-2024 09-01-2024 09-01-2024 09-01-2024
1 10-01-2024 11-01-2024 11-01-2024 10-01-2024 11-01-2024 12-01-2024
1 12-01-2024 16-01-2024 12-01-2024 16-01-2024 12-01-2024 16-01-2024
1 16-01-2024 18-01-2024 16-01-2024 17-01-2024 16-01-2024 19-01-2024
7
1 17-01-2024 22-01-2024 18-01-2024 22-01-2024 18-01-2024 22-01-2024
1 19-01-2024 23-01-2024 19-01-2024 23-01-2024 19-01-2024 23-01-2024
1 23-01-2024 25-01-2024 23-01-2024 24-01-2024 23-01-2024 05-02-2024
1 24-01-2024 05-02-2024 25-01-2024 05-02-2024 25-01-2024 06-02-2024
1 06-02-2024 06-02-2024 06-02-2024 06-02-2024 06-02-2024 09-02-2024
1 07-02-2024 08-02-2024 08-02-2024 07-02-2024 08-02-2024 12-02-2024
1 09-02-2024 12-02-2024 09-02-2024 12-02-2024 09-02-2024 13-02-2024
7
1 13-02-2024 13-02-2024 13-02-2024 13-02-2024 13-02-2024 16-02-2024
1 14-02-2024 15-02-2024 15-02-2024 14-02-2024 15-02-2024 19-02-2024
1 16-02-2024 19-02-2024 16-02-2024 19-02-2024 16-02-2024 20-02-2024
1 20-02-2024 20-02-2024 20-02-2024 20-02-2024 20-02-2024 23-02-2024
1 21-02-2024 22-02-2024 22-02-2024 21-02-2024 22-02-2024 26-02-2024
1 23-02-2024 26-02-2024 23-02-2024 26-02-2024 23-02-2024 27-02-2024
1 27-02-2024 27-02-2024 27-02-2024 27-02-2024 27-02-2024 01-03-2024
9
1 28-02-2024 29-02-2024 29-02-2024 28-02-2024 29-02-2024 04-03-2024
1 01-03-2024 04-03-2024 01-03-2024 04-03-2024 01-03-2024 05-03-2024
1 05-03-2024 05-03-2024 05-03-2024 05-03-2024 05-03-2024 11-03-2024
1 06-03-2024 07-03-2024 07-03-2024 06-03-2024 07-03-2024 12-03-2024
Cluster Analysis: Partitioning Methods, 1 12-03-2024 11-03-2024 12-03-2024 11-03-2024 12-03-2024 15-03-2024
Hierarchical Methods, 1 13-03-2024 12-03-2024 14-03-2024 12-03-2024 14-03-2024 18-03-2024
Density-Based Methods, 1 15-03-2024 14-03-2024 15-03-2024 13-03-2024 15-03-2024 19-03-2024
Evaluation of Clustering, 1 19-03-2024 18-03-2024 19-03-2024 18-03-2024 19-03-2024 22-03-2024
Outlier Detection. Introduction to analytics tools like Power BI 1 20-03-2024 19-03-2024 21-03-2024 19-03-2024 21-03-2024 26-03-2024
22-03-2024 21-03-2024 22-03-2024 20-03-2024 22-03-2024 29-03-2024
26-03-2024 26-03-2024 26-03-2024 26-03-2024 26-03-2024 01-04-2024
27-03-2024 28-03-2024 28-03-2024 27-03-2024 28-03-2024 02-04-2024
Revision 29-03-2024 01-04-2024 29-03-2024 01-04-2024 29-03-2024 05-04-2024
02-04-2024 02-04-2024 02-04-2024 02-04-2024 02-04-2024
03-04-2024 04-04-2024 04-04-2024 03-04-2024 04-04-2024
05-04-2024 05-04-2024 05-04-2024