0% found this document useful (0 votes)
3 views45 pages

Syllabus

The document outlines the structure and syllabus for Semester VII of the Bachelor of Computer Applications (BCA) program at Gujarat University for the academic year 2026-2027, in accordance with the NEP 2020 curriculum. It details major and minor courses, including Artificial Intelligence, Machine Learning, and various electives, along with their respective credits and course outcomes. Additionally, it emphasizes the integration of Indian Knowledge Systems with modern AI principles and provides a comprehensive overview of course content and evaluation methods.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views45 pages

Syllabus

The document outlines the structure and syllabus for Semester VII of the Bachelor of Computer Applications (BCA) program at Gujarat University for the academic year 2026-2027, in accordance with the NEP 2020 curriculum. It details major and minor courses, including Artificial Intelligence, Machine Learning, and various electives, along with their respective credits and course outcomes. Additionally, it emphasizes the integration of Indian Knowledge Systems with modern AI principles and provides a comprehensive overview of course content and evaluation methods.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Structure & Syllabus for Semester-VII

BACHELOR OF COMPUTER APPLICATIONS (BCA)


Programme

(Honours With Research/ Honours With OJT/ Honours Without OJT)

Gujarat University
2026 – 2027

As per NEP 2020 CURRICULUM AND CREDIT FRAMEWORK FOR


UNDERGRADUATE PROGRAMMES, UGC
&
Resolution No. KCG/admin/2023-24/0607/kh.1 of
Education Department, Govt. of Gujarat
STRUCTURE FOR SEMESTER - 7
GUJARAT UNIVERSITY
Bachelor of Computer Applications -B.S.(BCA)
(as per NEP 2020)
COURSE: Bachelor Of Computer Applications (B.C.A.)
MAJOR: COMPUTER APPLICATIONS
1. COGNITIVE MATHS
MINOR: 2. DATA SECURITY
3. WEB TECHNOLOGIES
SEMESTER – 7
MAJOR
CODE COURSE CREDITS
DSC-C-BCA 471T Fundamentals of Artificial Intelligence 4
DSC-C-BCA 472T Machine Learning 4
DSC-C-BCA 473P Machine Learning with Python 4
MINOR
CODE COURSE CREDITS
DSC-M-BCA 471T Computer Oriented Numerical Methods 4
OR
DSC-M-BCA 471T Ethical Hacking 4
OR
DSC-M-BCA 471P Full Stack Web Development Project Using [Link] Core 4

Honours With Research


DSC-C-BCA-RP-471 Research Project 6
OR
Honours With On Job Training
DSC-C-BCA-OJT-471 On Job Training 6
OR
Honours Without On Job Training
DSC-C-BCA-474 Data Base Administration 4
DSC-C-BCA-475 Research Methodologies - I 2

TOTAL CREDITS 22
Semester – VII
Major
(Honours With Research/ Honours With OJT/ Honours Without OJT)

BACHELOR OF COMPUTER
APPLICATIONS

MAJOR : COMPUTER APPLICATIONS


Course Name: Fundamentals of Artificial Intelligence

Course Code: DSC-C-BCA -471 T

Credits: 4

Course Outcomes:
The aim of this course is to enable students
 To understand the fundamental concepts, goals, and techniques of Artificial Intelligence.
 To understand and differentiate between Human intelligence and AI.
 To choose the appropriate representation of knowledge and utilize NLP applications.
 To integrate Indian Knowledge Systems (IKS) concepts such as logic, linguistics, cognition, and ethics
with modern Artificial Intelligence.
Prerequisites:
 Basic Programming Concepts.
Contents:

Unit Particulars Hour Credits


No. s
1. Unit Title: Foundations of Artificial Intelligence 15 1

Introduction
What is AI? - Acting humanly: The Turing Test approach, Acting rationally:
The rational agent approach, The State of the Art

Intelligent Agents
Agents And Environments, Good Behavior: The Concept of Rationality:
Rationality, The Nature of Environments: Specifying the task environment,
Properties of task environments, Structure of agents: Simple reflex agents,
Model-based agents, Goal-based agents, Utility-based agents

Case Studies:
Autonomous Vehicle as an Intelligent Agent
Students study how autonomous vehicles use AI to sense their environment,
analyze inputs, and make driving decisions as rational agents, illustrating
agents, environments, and task properties.

Smart Home Automation Systems


Students explore how AI‑enabled smart home systems use intelligent agents
to monitor user behavior and environmental conditions, optimizing comfort
and energy use in dynamic environments.

2. Unit Title: Problem Solving and Search Techniques 15 1

Solving Problems by Searching


Problem-solving agents: Well-defined problems and solutions, Formulating
problems, Example Problems: Toy problems: 8-puzzle, 8-queens problem,
Searching for Solutions: Introduction, Measuring problem-solving
performance, Uninformed search strategies: Breadth First Search (BFS),
Depth First Search (DFS), Informed search strategies: Greedy Best-First
Search, A* Search algorithm
Case Studies:
Route Optimization in Food Delivery Systems
Students study how food delivery platforms use AI search algorithms on
road‑network graphs to find optimal delivery routes, illustrating
problem‑solving agents and algorithms such as BFS, DFS, Greedy Search,
and A*.

Puzzle Solving Using Artificial Intelligence


Students analyze how AI explores possible states in the 8‑Puzzle problem to
reach the goal, demonstrating state space representation and
problem‑solving agents.

3. Unit Title: Knowledge Representation and Logic 15 1


Logical Agents
Knowledge-based agents, Propositional Logic: A Very Simple Logic:
Syntax, Semantics

First Order Logic


Syntax and Semantics of First-Order Logic: Symbols and interpretations,
Terms, Atomic sentences, Quantifiers (Overview): (Universal quantification
(∀), Existential quantification (∃), Nested quantifiers, Connections between ∀
and ∃)

Inference in First Order Logic


Forward Chaining: First-order definite clauses, 9.3.2 A simple forward-
chaining algorithm, Backward Chaining: A backward-chaining algorithm.

Case Studies:
AI Chatbots for Customer Support
Students analyze how AI chatbots use knowledge bases and rule‑based logic
to understand customer queries and provide appropriate responses
automatically.

Intelligent Fraud Detection Systems


Students study how banks use AI‑based rules and logical inference to detect
suspicious transactions by identifying abnormal patterns in financial data.

4 Unit Title: Learning, Communication, and Indian Knowledge Systems 15 1


(IKS) in Artificial Intelligence
Learning From Examples: Introduction to Machine Learning concept (Only
Overview of types)

Natural Language Processing


Language Models: N-gram character models, N-gram word models, Text
classification (Only Introduction), Information retrieval: The page rank
algorithm, Information extraction: Finite state automata for information
extraction, Applications of Natural language Processing

Cognitive, Responsible, and Human-Centric AI: Insights from IKS


Cognitive AI and Indian Models of Cognition: Core Principles of IKS,
Convergence of Indian Knowledge System and AI, Challenges in Integrating
IKS and AI, Proposed Framework for IKS with AI, Responsible and
Human-Centric AI from an IKS Perspective- Concepts of Ahimsa (non-
violence), Dharma (moral duty/responsibility), and Karma (consequences of
actions), Framework Development for Integrating IKS Principles in AI.
Case Studies:
Email Spam Filtering Using Machine Learning
Students examine how email systems use machine learning to identify
patterns and classify messages as spam or legitimate, illustrating text
classification concepts.

Search Engine Ranking Algorithms


Students explore how search engines use algorithms such as PageRank and
HITS to rank web pages and retrieve relevant information from large volumes
of web data.

AI Systems for Healthcare with IKS principle


Ahimsa: A bias-aware clinical decision-support AI was developed using
diverse datasets to reduce diagnostic errors and minimize patient harm.
Dharma: Transparency features that allow clinicians to understand and
review AI recommendations have improved trust in AI‑driven healthcare
systems. Karma: The system’s fairness and accuracy were continuously
evaluated and updated using real‑world data to ensure accountability for
patient outcomes and support long‑term ethical impact.

Textbook:
1. Artificial Intelligence: A Modern Approach – Stuart Russell and Peter Norvig, 3rd Edition, Pearson.

References:
1. Artificial Intelligence, 2nd Edition, Rich and Knight
2. “A Classical Approach to Artificial Intelligence”, Trivedi, M.C.
3. Kulshreshtha, M. et al., Indian Knowledge System: Bridging Ancient Roots with Modern Perspectives,
Kunal Books.
4. Russell, S., Human Compatible: AI and the Problem of Control, Penguin.

Web References:
1. [Link]
2. [Link]
3. P. Singh, "Indian Knowledge System and Artificial Intelligence: Towards Ethical, Sustainable, and Human-
Centric Innovation," Edumania-An International Multidisciplinary Journal, vol. 4, no. 1, pp. 251-256, 2026.
[Link]
ethical-sustainable-and-human-centric-innovation/
4. U. P. R. K. T. B. K. Abhishek Kumar, "Applying Ethical Ideas from Indian Knowledge Systems to AI
Development," The Asian Thinker, A Quarterly Bilingual Peer-Reviewed Journal for Social Sciences and
Humanities, vol. IV, no. 28, pp. 57-72, October-December, 2025.
[Link]
[Link]

Accomplishments of the student after completing the Course:


After completion of this course, Students would be able to
 Apply basic AI principles and techniques to solve problems involving perception, reasoning, and learning.
 Examine the scope of AI and its societal implications.
 Connect Indian linguistic and cognitive knowledge with AI systems
 Apply Indian ethical principles for responsible and human‑centric Artificial Intelligence
---------------------------------
Course Name: Machine Learning

Course Code: DSC-C-BCA-472T

Credits: 4

Course Outcomes:
On completion of the course, students will:
• Understand fundamental concepts and types of Machine Learning
• Perform data preparation, preprocessing, and feature engineering
• Apply modeling techniques and evaluate model performance
• Implement supervised and unsupervised learning algorithms

Prerequisites:
Basics of Python Programming, Basic knowledge of Mathematics and Statistics, Fundamental understanding of Data
Handling

UNIT TOPIC/SUBTOPIC TEACHING Credits


HOURS
1 Introduction to Machine Learning & Data Preparation 15 01
Introduction to Machine Learning: What is Machine Learning?, Types
of Machine Learning, Applications of Machine Learning, Tools used
for Machine Learning – Why Python?, Overview of Scikit-Learn,
Essential Libraries& Tools: Jupyter Notebook, NumPy, Pandas,
Matplotlib, Preparing to Model: Machine Learning Activities, Basic
Types of Data in Machine Learning, Exploring Structure of Data:
Exploring Numerical Data, Exploring Categorical Data: Exploring
relationship between variables, Data Quality and Remediation, Data
Pre-Processing.

2 Modeling, Evaluation and Feature Engineering 15 01


Modeling & Evaluation
Selecting a Model: Predictive Models, Descriptive Models, Training a
Model, Hold-out Method, k-Fold Cross-Validation, Model
Representation and Interpretability: Underfitting, Overfitting, Bias-
variance tradeoff, Basics of Feature Engineering: Introduction, What
is Feature?, Feature Transformation: Feature Construction, Feature
Extraction, Feature subset Selection: Issues in High dimensional data.

3 Supervised Machine Learning: Classification and Regression Techniques 15 01


Supervised Learning – Classification: Introduction, Classification
Model, Classification Learning Steps, Common Classification
Algorithms: K-Nearest Neighbor (KNN) (numerical), Decision Tree
(numerical), SVM, Naïve Bayes (numerical), Random forest,
Supervised Learning – Regression: Introduction to Regression,
Simple Linear Regression (numerical), Multivariate Linear
Regression

4 Unsupervised Machine Learning: Clustering and Association Rule 15 01


Mining
Introduction to Unsupervised Learning: Unsupervised vs
supervised learning, Applications of unsupervised learning,
Clustering: Different types of clustering technique, Partitioning
method: K-Means (numerical), K-Medoids (numerical), Density
based methods: DBSCAN, Finding Patterns using Association
Rule: Definition of common terms, Association Rule, Apriori
Algorithm (numerical).

By the end of this course, students will have:


 Learned core Machine Learning concepts and workflow
 Worked with Python libraries such as NumPy, Pandas, Matplotlib, and Scikit-learn
 Performed data analysis, preprocessing, and feature engineering
 Built and evaluated machine learning models (classification & regression)
 Applied clustering and association rule mining techniques on real datasets

Text Book:
1. Saikat Dutt, Subramanian Chandramouli, Amit Kumar Das, “Machine Learning”, Pearson Education
2. Andreas. C. Müller and S. Guido, "Introduction to Machine Learning with Python," O'Reilly .
Reference Books:
1. A. Géron, "Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow," O'Reilly
2. Tom [Link], Machine Learning, McGraw Hill Education, Indian Edition
Course Name: Machine Learning System Design & Implementation

Course Code: DSC-C-BCA-473P

Credits: 4

Course Outcomes:
On completion of the course, students will:
• Understand basic Machine Learning concepts
• Perform data preprocessing and analysis
• Apply evaluation metrics for model performance
• Implement supervised and unsupervised learning algorithms

Prerequisites:
Basics of Python, Basic Statistics and Mathematics

UNIT TOPIC/SUBTOPIC TEACHING Credits


HOURS
1 Data Handling, Exploration and Visualization Techniques 15 01

1. Perform data loading and basic exploration on the Iris Dataset


([Link] including shape,
columns, data types, and summary statistics.

2. Perform data visualization using Matplotlib on the Wine Dataset


([Link] by plotting histogram,
bar chart, and scatter plot.

3. Visualize relationships between variables using Seaborn on the


Titanic Dataset ([Link]
dataset) using pairplot and heatmap.

4. Perform univariate analysis on the Diabetes Dataset


([Link] using
histogram and boxplot.

5. Perform bivariate analysis on the Tips Dataset


([Link] using
scatter plot and Seaborn pairplot.
6. Analyze correlation between features using heatmap on the
Boston Housing Dataset
([Link]
houseprice-data).

7. Perform data visualization using Seaborn on the Penguins Dataset


([Link]
using countplot, boxplot, and pairplot.

8. Create different plots (line, bar, scatter) using Matplotlib on the Air
Quality Dataset ([Link]
9. Analyze feature distribution using histogram and density plots on
the Heart Disease Dataset
([Link]
dataset).

10. Perform exploratory data analysis (EDA) on the Student


Performance Dataset
([Link]
performance-dataset) using summary statistics and visualization
techniques.

2 Model Evaluation and Performance Metrics 15 01

1. Given actual and predicted values in the Iris Dataset


([Link] compute confusion
matrix and accuracy.

2. Using the Titanic Dataset


([Link]
calculate accuracy, precision, recall, and F1-score from given actual
and predicted labels.

3. Compute confusion matrix and visualize it using Seaborn heatmap


for the Breast Cancer Dataset
([Link]
data) using predefined predictions.

4. Calculate precision, recall, and F1-score for classification results in


the Spam Email Dataset
([Link]
dataset).

5. Using the Wine Dataset


([Link] compute
classification report from given predicted values.

6. Plot ROC curve and compute AUC score using given prediction
probabilities in the Credit Card Fraud Dataset
([Link]

7. Analyze confusion matrix and calculate performance metrics for


the Heart Disease Dataset
([Link]
dataset).

8. Compare performance metrics (accuracy, precision, recall) for two


different sets of predicted values in the Adult Income Dataset
([Link]

9. Compute macro and micro averaged precision and recall for the
Penguins Dataset
([Link]

10. Given actual and predicted outputs in the Diabetes Dataset


([Link]
evaluate model performance using confusion matrix and F1-score.
3 Supervised Machine Learning: Classification and Regression 15 01
Techniques
1. Implement K-Nearest Neighbors (KNN) classifier on the Iris Dataset
([Link] using train-test split
and evaluate accuracy.

2. Apply Support Vector Machine (SVM) for classification on the


Breast Cancer Dataset
([Link]
data) and evaluate performance.

3. Implement Naive Bayes classifier on the Spam Email Dataset


([Link]
dataset) and analyze classification results.

4. Build a Decision Tree classifier (ID3) on the Titanic Dataset


([Link] and
evaluate model accuracy.

5. Compare KNN and SVM classifiers on the Wine Dataset


([Link] using accuracy and
confusion matrix.

6. Implement Decision Tree (ID3) on the Heart Disease Dataset


([Link]
dataset) and analyze feature importance.

7. Apply Naive Bayes classifier on the Adult Income Dataset


([Link] and
evaluate precision and recall.

8. Implement Linear Regression on the Boston Housing Dataset


([Link]
houseprice-data) and evaluate using mean squared error.

9. Apply Linear Regression on the Salary Dataset


([Link]
simple-linear-regression) and plot regression line using Matplotlib.

10. Compare performance of KNN, Decision Tree, and Naive Bayes


classifiers on the Diabetes Dataset
([Link] using
accuracy metric.
4 Unsupervised Machine Learning: Clustering and Association Rule 15 01
Mining
1. Implement K-Means clustering on the Mall Customers
Dataset
([Link]
segmentation-tutorial-in-python) and visualize clusters using
scatter plot.

2. Apply K-Means clustering on the Iris Dataset


([Link] and compare
clusters with actual class labels.

3. Determine optimal number of clusters using Elbow Method


on the Wholesale Customers Dataset
([Link]
customers-data-set).

4. Implement DBSCAN clustering on the Mall Customers


Dataset
([Link]
segmentation-tutorial-in-python) and identify noise points.

5. Compare K-Means and DBSCAN clustering results on the


Wine Dataset ([Link]
using visualization.

6. Perform clustering using K-Means on the Customer


Personality Dataset
([Link]
personality-analysis) and analyze customer segments.

7. Implement Apriori algorithm on the Market Basket Dataset


([Link]
basket-analysis) to generate frequent itemsets.

8. Generate association rules using Apriori on the Groceries


Dataset
([Link]
dataset) and analyze support, confidence, and lift.

9. Apply Apriori algorithm on the Online Retail Dataset


([Link]
and identify frequently purchased item combinations.

10. Perform clustering using DBSCAN on the Penguins Dataset


([Link]
dataset) and visualize clusters.

Expected Outcome of this project:


Course Structure (Project-Based Learning Approach)
Students will develop a single Major Project throughout the semester, divided into four progressive
phases aligned with the units. Each student/group (max 2 students) must select a real-world problem
and implement a complete ML pipeline.

UNIT 1: Problem Definition & Data Exploration (EDA)


Objective: To understand the dataset and extract meaningful insights through visualization and
preprocessing.
Project Tasks:
 Selection of problem statement and dataset (Kaggle/UCI/custom)
 Data loading using Pandas
 Data cleaning (missing values, duplicates, outliers)
 Feature understanding and transformation
 Exploratory Data Analysis (EDA)
 Visualization using Matplotlib and Seaborn
Deliverables:
 Phase 1 Report (Problem Definition + EDA)
 Jupyter Notebook with code and visualizations

UNIT 2: Model Evaluation & Performance Metrics


Objective: To evaluate machine learning models using appropriate performance metrics.
Project Tasks:
 Identify problem type (classification/regression)
 Selection of evaluation metrics: Accuracy, Precision, Recall, F1-score, ROC-AUC
 Train-test split
 Baseline model implementation
 Confusion matrix generation and visualization
Deliverables:
 Phase 2 Report (Evaluation Strategy)
 Notebook with metric calculations and justification

UNIT 3: Supervised Machine Learning Models


Objective: To implement and compare multiple supervised learning algorithms.
Project Tasks:
 Implementation of at least three algorithms (KNN, SVM/Naive Bayes, Decision Tree, Linear
Regression)
 Model training and testing
 Hyperparameter tuning (basic level)
 Performance comparison and best model selection
Deliverables:
 Phase 3 Report (Model Building & Comparison)
 Code with results and evaluation

UNIT 4: Unsupervised Learning & Pattern Discovery


Objective: To discover hidden patterns in data using clustering or association techniques.
Project Tasks:
 Implementation of at least one technique (K-Means, DBSCAN, or Apriori)
 Visualization of clusters/patterns
 Interpretation of results and insights
Deliverables:
 Phase 4 Report (Advanced Analysis)
 Visual outputs and explanation

Final Project Submission


 Final Project Report (15–25 pages)
 Complete Jupyter Notebook
 Presentation (PPT)
 Viva/Project Demonstration
Evaluation Scheme (100 Marks)
Component Marks
Phase 1: EDA & Problem Definition 15
Phase 2: Evaluation Metrics 15
Phase 3: Model Building 25
Phase 4: Advanced Techniques 15
Final Report 10
Presentation 10
Viva 10
Total 100

By the end of this course, students will have:


 Installed and configured Python environment with required libraries (NumPy, Pandas,
Matplotlib, Seaborn, Scikit-learn)
 Performed data preprocessing and exploratory data analysis (EDA)
 Applied performance evaluation metrics (accuracy, precision, recall, F1-score)
 Implemented supervised learning algorithms such as KNN, SVM, Naive Bayes, Decision Tree,
and Linear Regression
 Implemented unsupervised learning techniques such as K-Means, DBSCAN, and Apriori
Algorithm
 Gained practical understanding of building Machine Learning models and solving real-world
problems

Text Book:
Machine Learning by Saikat Dutt, Pearson Education India
Software or Tools to be used:
Jupyter Notebook (preferable), Spyder

Reference Books:
Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow, O'Reilly
Introduction to Machine Learning with Python, O'Reilly

Web Resources:
Scikit-learn Documentation
[Link]
Pandas Documentation
[Link]
Matplotlib Documentation
[Link]
Kaggle (Datasets & Practice)
[Link]
UCI Machine Learning Repository
[Link]
Structure & Syllabus for Semester-VII
BACHELOR OF COMPUTER APPLICATIONS (BCA)
Programme

Minor
(Honours With Research/ Honours With OJT/ Honours Without OJT)

Gujarat University
2026 – 2027

As per NEP 2020 CURRICULUM AND CREDIT FRAMEWORK FOR


UNDERGRADUATE PROGRAMMES, UGC
&
Resolution No. KCG/admin/2023-24/0607/kh.1 of
Education Department, Govt. of Gujarat
STRUCTURE FOR SEMESTER - 7
GUJARAT UNIVERSITY
Bachelor of Computer Applications -B.S.(BCA)
(as per NEP 2020)
COURSE: Bachelor Of Computer Applications (B.C.A.)
MAJOR: COMPUTER APPLICATIONS
1. COGNITIVE MATHS
MINOR: 2. DATA SECURITY
3. WEB TECHNOLOGIES
SEMESTER – 7
MAJOR
CODE COURSE CREDITS
DSC-C-BCA 471T Fundamentals of Artificial Intelligence 4
DSC-C-BCA 472T Machine Learning 4
DSC-C-BCA 473P Machine Learning with Python 4
MINOR
CODE COURSE CREDITS
DSC-M-BCA 471 Computer Oriented Numerical Methods 4
OR
DSC-M-BCA 471 Ethical Hacking 4
OR
DSC-M-BCA 471P Full Stack Web Development Project Using [Link] Core 4

Honours With Research


DSC-C-BCA-RP-471 Research Project 6
OR
Honours With On Job Training
DSC-C-BCA-OJT-471 On Job Training 6
OR
Honours Without On Job Training
DSC-C-BCA-474 Data Base Administration 4
DSC-C-BCA-475 Research Methodologies - I 2

TOTAL CREDITS 22
Semester – VII

Minor
(Honours With Research/ Honours With OJT/ Honours Without OJT)

BACHELOR OF COMPUTER
APPLICATIONS

MINORS
1. COGNITIVE MATHEMATICS (CG)
2. DATA SECURITY (DS)
3. WEB TECHNOLOGIES (WTECH)
Course Name: Computer Oriented Numerical Methods
Course Code: DSC-C-BCA-471T

Credits: 4

Course Outcomes:
After successful completion of this course, students will be able to:
1. Understand the fundamentals of numerical computation and error analysis.
2. Apply numerical techniques for solving algebraic and transcendental equations.
3. Use interpolation and numerical differentiation methods for data analysis.
4. Apply numerical integration techniques for solving practical problems.
5. Solve systems of linear equations using numerical approaches.

Prerequisites:
Basic Mathematics, Elementary Algebra, Fundamental Knowledge of Computers

UNIT TOPIC/SUBTOPIC TEACHING Credits


HOURS
1 Introduction to Numerical Methods and Error Analysis 15 01
Introduction to Numerical Methods, Need and Importance of
Numerical Methods, Applications of Numerical Methods in Computer
Science, Characteristics of Numerical Computation, Computer-
Oriented Problem Solving, Algorithm Concepts, Flowchart Concepts,
Types of Errors in Numerical Computation, Absolute Error, Relative
Error, Percentage Error, Truncation Error, Round-Off Error,
Significant Digits and Their Importance, Accuracy and Precision in
Numerical Computation, Fundamentals of Computer Arithmetic,
Introduction to Mathematical Modeling, Role of Mathematical
Models in Scientific and Engineering Problems, Steps Involved in
Numerical Problem Solving.
Solution of Algebraic and Transcendental Equations
Introduction to Equation Solving, Graphical Method, Bisection
Method, Regula-Falsi Method, Newton-Raphson Method, Newton-
Raphson Formula, Secant Method, Convergence and Divergence
Concepts, Comparison of Root-Finding Methods, Advantages and
Limitations of Numerical Approaches, Applications in Scientific and
Engineering Problems.

2 Interpolation and Numerical Differentiation 15 01


Introduction to Interpolation, Finite Difference Operators,
Newton's Forward Interpolation Formula, Newton's Backward
Interpolation Formula, Lagrange Interpolation Formula, Central
Difference Formula, Numerical Differentiation, First-Order
Derivative Approximation, Second-Order Derivative
Approximation, Error Analysis in Interpolation, Applications of
Interpolation in Data Estimation, Introduction to Curve Fitting.
Numerical Integration and Solution of Linear Equations
Introduction to Numerical Integration, Trapezoidal Rule,
Simpson's 1/3 Rule, Simpson's 3/8 Rule, Error Estimation in
Numerical Integration, Applications of Numerical Integration,
Introduction to Systems of Linear Equations, Matrix
Representation of Linear Systems, Gauss Elimination Method,
Gauss-Jordan Method, Advantages and Limitations of Matrix
Methods, Applications in Engineering, Science, and Business
Computing.
3 Error Analysis and Computational Applications 15 01
1. Program to calculate Absolute Error, Relative Error, and
Percentage Error.
2. Program to demonstrate Round-Off and Truncation Errors.
3. Program to evaluate mathematical functions using user-
defined functions.
4. Program to calculate compound interest using numerical
computation.
5. Program to calculate depreciation of assets using numerical
formulas.

Case Study:
Comparison of exact and numerical solutions for business
calculations.

Mini Application:
Scientific Calculator using C Programming.

Applications of Root-Finding Methods


1. Program to find roots using Bisection Method.
2. Program to find roots using Regula-Falsi Method.
3. Program to find roots using Newton-Raphson Method.
4. Program to find roots using Secant Method.

Application:
Break-even Point Analysis using numerical methods.
Application:
Loan Interest and Investment Equation Solver.

Case Study:
Population Growth Estimation using root-finding techniques.
4 Applications of Interpolation and Numerical Differentiation 15 1
1. Program for Newton's Forward Interpolation.
2. Program for Newton's Backward Interpolation.
3. Program for Lagrange Interpolation.
4. Program for Numerical Differentiation.

Application:
Estimation of Missing Student Marks using Interpolation.

Application:
Temperature Prediction from Historical Data.

Application:
Sales Forecasting using Interpolation Techniques.
Case Study:
Analysis of Experimental Scientific Data.

Applications of Numerical Integration and Linear Equations


1. Program for Trapezoidal Rule.
2. Program for Simpson's 1/3 Rule.
3. Program for Simpson's 3/8 Rule.
4. Program for Gauss Elimination Method.
5. Program for Gauss-Jordan Method.

Application:
Area Calculation under Curves using Numerical Integration.

Application:
Business Profit Prediction using Linear Equation Systems.

Application:
Electrical Circuit Analysis using Simultaneous Equations.

Application:
Resource Allocation Problem using Matrix Methods.

Case Study:
Engineering and Scientific Computing Problems.

By the end of this course, students will have:


 To introduce students to computer-oriented approaches for solving mathematical problems.
 To understand numerical techniques used in scientific and business applications.
 To develop problem-solving skills using numerical methods.
 To study algorithms for solving algebraic equations and computational problems.
 To understand the role of numerical methods in modern computing.

Text Book:
Computer Oriented Numerical Methods
Introductory Methods of Numerical Analysis
Numerical Methods for Scientific and Engineering Computation
Course Name: Ethical Hacking

Course Code: DSC-M-BCA-471

Credits: 4

Course Outcomes:

The aim of the course is to enable students to:

 Students can gain knowledge of Ethical Hacking.


 Students can explore different security aspects Vulnerability and it’s related domain
 Students can explore different attacking methods for Ethical Hacking
 Students can gain knowledge of different security tools and techniques of different types of
testing
 Students will be able to navigate the legal and ethical implications of hacking activities, ensuring
that ethical hacking is performed within legal boundaries and with permission.

Prerequisites:
Basic Knowledge of Coding, Database Management, Networking and OS Concepts

Contents:

Unit Particulars Hours Credits


No.
1. Introduction of Ethical Hacking (EH) 15 01
1. Overview of Hacking
2. Types of Hacking (Red Team & Blue Team)
3. Types of Hackers (Black, White & Grey)
4. How to be Ethical & Legal Issues in Hacking
5. How Ethical hacking relates with strengthening the security
Ethical Hacking Fundamentals
1. Phases of Ethical Hacking (In depth study of each phase)
2. CIA Triad importance in Ethical Hacking
3. Difference between Information security & Cyber security
4. Vulnerability, Threat & Risk
5. Types of Pen-Testing in EH (Grey, Black, White box testing)
6. Types of Pen-Testing in EH (Internal, External)
7. Operating System
 Types of OS
 Windows OS basic commands
 Linux Terminal overview
 Linux OS basic commands
2. Cyber Threats and Attacks 15 01
1. Types of cyber threats
1.1 Active and Passive attacks
2. Malware Attacks
2.1 Viruses, Worms, Trojans, Ransomware, Spyware, Adware
3. Social-Engineering Attacks
3.1 Pretexting, Email phishing, Spear phishing, Vishing,
Smishing
4. Denial-of-Service (DoS) Attacks
4.1 Distributed Denial-of-Service (DDoS) attacks
4.2 SYN flood attacks
4.3 UDP flood attacks
5. Man-in-the-Middle (MitM) Attacks
5.1 Session hijacking
5.2 Wi-Fi eavesdropping
6. Insider Threats
6.1 Data theft (financial, reputational, legal)
6.2 Unauthorized access
6.3 Social engineering by insiders
Cyber Defensive techniques

1. Overview of Security mechanisms


2. Overview of IDS/IPS and VPN
3. Firewalls and types
4. Authentication Mechanisms
5. Identity and Access management
5.1 Definition, Purpose, Key benefits and Role of IAM in
Cybersecurity
5.2 Attribute-based Access Control
5.3 Policy-based Access Control
5.4 Relationship-based Access Control
5.5 Role-based Access Control
5.6 Identity Lifecycle Management
3. 1. Perform Basic Command for Windows Command prompt (cmd) 15 01
(ping, ipconfig,system info).
2. Perform Basic Kali Linux Commands (ls , cd , ifconfig , sudo , mkdir ,
pwd , rm , cp , mv , cat , grep , head , tail , chmod , man ,wget and
touch).
3. Perform Google Dorking for advanced web search using different
types of operators.
4. Gather information of any domain in order to understand passive
information gathering using OSINT (Open Source Intelligence).
5. Gather information of any ip and username inorder to understand
passive information gathering using OSINT.
6. Gather information of any domain in order to understand the active
information gathering concept.
7. Gather and Analyze Email Information Using OSINT in Order to
understand the E-mail Architecture and Working.
Do malware analysis using OSINT to understand the concept of file and URL.
4. 1. Create a Simulate Phishing Email and Test it on Classmate with 15 1
Permission to understand how to Identify Phishing Attempt and
Discuss Red Flag best practices for avoiding them using Zphisher
Tool.
2. Use Mitaka Tool in order to understand link, EmailID and
Information Gathering and analysis.
3. Create Worm in C language in order to understand how Worm works
and Replicates itself without any Human Interference.
4. Use Camphish tool to exploit mobile device inorder to understand
phishing scan.
5. Perform web server vulnerability scan with various options of nikto
tool.
6. Utilising the functionalities of various Symmetric Key Cryptography
Algorithms using cryptii.
7. Utilising the functionalities of various Asymmetric Key Cryptography
Algorithms using anycript.

Textbook & References:


1. "The Web Application Hacker's Handbook: Finding and Exploiting Security Flaws" by Dafydd
Stuttard and Marcus Pinto.
2. "OWASP Testing Guide" by The Open Web Application Security Project
3. "The Browser Hacker's Handbook" by Wade Alcorn, Christian Frichot, and Michele Orru
4. “Ethical Hacking: A Hands-On Introduction to Breaking in” by Daniel G. Graham
5. “Gray Hat Hacking: The Ethical Hacker’s Handbook” by Allen Harper Ryan Linn, Stephen Sims,
Michael Baucom, Huascar Tejeda, Daniel Fernandez, Moses Frost

Accomplishments of the student after completing the Course:

After completion of this course, students will be able to

 Understand and differentiate various types of hacking, including Red Team, Blue Team, and different
hacker categories (Black, White, Grey).Familiar with the advanced database concepts such as
Distributed Database.
 Apply knowledge of the phases of ethical hacking to identify and assess vulnerabilities, threats,
and risks in a system.
 Analyze the legal and ethical issues involved in ethical hacking, ensuring compliance with relevant
laws and ethical standards.
 Demonstrate proficiency in key ethical hacking techniques, including information gathering, scanning,
and exploitation, using tools such as OWASP, Metasploit, and Wireshark.
 Evaluate and implement security measures to mitigate risks through practical exercises, strengthening
security in web, mobile, and network domains.
 Design and implement effective countermeasures for common vulnerabilities in web applications,
mobile applications, and other systems using principles from the OWASP Top 10.
Full Stack Web Development Project using [Link] Core
Course Code: DSC-M-BCA-471P
Credits: 4

Course Objectives

• To understand [Link] Core MVC architecture and Razor View Engine


• To develop web applications using [Link] Core MVC framework
• To integrate databases using Entity Framework Core
• To develop REST APIs using [Link] Core Web API
• To build and deploy complete [Link] Core web applications

Prerequisites
• Knowledge of HTML, CSS and JavaScript
• Working knowledge of C# programming language
• Understanding of database concepts
• Basic understanding of web application development

UNIT TOPIC / SUBTOPIC TEACHING HOURS Credits


1 Introduction to [Link] Core and MVC 15 1
2 Forms, Validation and Razor Development 15 1
3 Entity Framework Core and Database Integration 15 1
4 Web API and Full Stack Application Development 15 1

UNIT 1: Introduction to [Link] Core and MVC

Topics

Introduction to [Link] Core, Features of [Link] Core, Cross-platform applications, [Link] Core
project structure: [Link], Middleware pipeline, MVC architecture, Controllers, Views, Models, ViewBag
and ViewData, Routing basics, Razor syntax, Layout pages, Dependency Injection (basic idea)

Lab Experiments

1. Write a program to create an [Link] Core application displaying “Welcome to [Link] Core
Development.”
2. Write a program demonstrating [Link] Core project structure and explain project files.
3. Write a program to create HomeController and display information using ViewBag.
4. Write a program using ViewData to pass data from controller to view.
5. Write a program to create Razor View and display student details.
6. Write a program demonstrating routing in [Link] Core.
7. Write a program implementing middleware components.
8. Write a program creating multiple pages using layout page.
9. Write a program to design Student Information Page.
UNIT 2: Forms, Validation and Razor Development

Topics

Forms handling in [Link] Core, Model binding, Form submission process, Validation concepts, Required
validation, Range validation, Regular Expression validation, Compare validation, Custom validation, Razor
forms, User input processing, Layout management, Navigation design.

Lab Experiments

1. Write a program creating registration form using Razor View.


2. Write a program accepting user inputs and displaying entered information.
3. Write a program implementing Required Field validation.
4. Write a program implementing Range validation.
5. Write a program implementing Regular Expression validation.
6. Write a program implementing Compare validator.
7. Write a program creating Student Admission Form.
8. Write a program implementing custom validation.
9. Write a program creating student profile management form.
10. Write a program designing Faculty Registration Form.
11. Write a program creating Product Entry Form.
12. Write a program designing dashboard UI.

UNIT 3: Entity Framework Core and Database Integration

Topics

Introduction to Entity Framework Core, Code-first approach, Database migrations, DbContext, Database
models, CRUD operations, SQL Server integration, Table relationships, Data retrieval techniques, Database
update operations.

Lab Experiments

1. Write a program to install and configure Entity Framework Core.


2. Write a program creating Student model.
3. Write a program creating Faculty model.
4. Write a program implementing migrations.
5. Write a program creating database using migration.
6. Write a program implementing Insert operation.
7. Write a program implementing Update operation.
8. Write a program implementing Delete operation.
9. Write a program implementing Search functionality.
10. Write a program developing Student CRUD system.
11. Write a program connecting SQL Server with [Link] Core.
12. Write a program displaying database records.
UNIT 4: Web API and Full Stack Application Development

Topics

Introduction to Web API, REST API concepts, HTTP methods, GET API, POST API, PUT API, DELETE
API, JSON response handling, API testing, Application integration, Authentication basics, Deployment basics.

Lab Experiments

1. Write a program creating [Link] Core Web API.


2. Write a program implementing GET API.
3. Write a program implementing POST API.
4. Write a program implementing PUT API.
5. Write a program implementing DELETE API.
6. Write a program developing Temperature Converter API.
7. Write a program retrieving student details using API.
8. Write a program creating Student CRUD API.
9. Write a program integrating MVC application with API.
10. Write a program implementing authentication concept.
11. Write a program deploying [Link] Core application.
12. Write a program developing mini full-stack application.

Expected Outcome of this Project

Course Structure (Project-Based Learning Approach)

Students will develop one [Link] Core Project throughout the semester divided into four phases aligned
with course units.

Students may select domains such as:

• Student Management System


• Admission Management System
• Hospital System
• Library System
• Inventory System
• Course Portal
• E-Commerce System

Phase 1: Project Initialization and MVC Development

Objective

To understand [Link] Core architecture and develop project structure using MVC.

Project Tasks

• Project selection and problem identification


• [Link] Core project setup
• MVC structure development
• Controller creation
• Razor Views creation
• Routing implementation
• Layout design
Deliverables

• Phase 1 Report (Problem Definition + UI Design)


• [Link] Core MVC Project Structure

Phase 2: User Interaction and Validation

Objective

To develop user forms and validation mechanisms.

Project Tasks

• Registration module development


• Admission form implementation
• Validation implementation
• Dashboard development
• Navigation system creation
• User interaction handling

Deliverables

• Phase 2 Report (Forms + Validation)


• Functional User Interface

Phase 3: Database Integration and CRUD Development

Objective

To integrate SQL Server and Entity Framework Core.

Project Tasks

• Database design
• Entity Framework setup
• Migration creation
• CRUD implementation
• Search functionality
• Database testing

Deliverables

• Phase 3 Report (Database Design + CRUD)

• Database Scripts
• Working CRUD Module

Phase 4: API Integration and Deployment

Objective

To build complete [Link] Core application with APIs.


Project Tasks

• REST API development


• API integration
• Authentication implementation
• Error handling
• Deployment

Deliverables

• Phase 4 Report (System Integration)


• Deployed Application Link
• Complete Source Code

Final Project Submission


• Final Project Report (15–25 pages)
• Complete Source Code
• GitHub Repository (recommended)
• Presentation (PPT)
• Project Demonstration (Live / Recorded)

Evaluation Scheme (100 Marks)

Component Marks
Phase 1: MVC Setup and UI 15
Phase 2: Forms and Validation 15
Phase 3: Database and CRUD 25
Phase 4: API and Deployment 15
Final Report 10
Presentation 10
Viva / Demonstration 10
Total 100

By the End of this Project, Students will:


• Develop complete [Link] Core applications
• Implement MVC architecture
• Integrate SQL Server using Entity Framework Core
• Develop REST APIs
• Build full-stack database-driven systems
• Gain industry-oriented web development experience

Text Book

Pro [Link] Core MVC – Adam Freeman

Reference Books

[Link] Core Application Development – Microsoft Press

Beginning Entity Framework Core – Eric Vogel

Learn [Link] Core MVC – Arnaud Weil


Structure & Syllabus for Semester-VII
BACHELOR OF COMPUTER APPLICATIONS (BCA)
Programme

(Honours With Research)

Gujarat University
2026 – 2027

As per NEP 2020 CURRICULUM AND CREDIT FRAMEWORK FOR


UNDERGRADUATE PROGRAMMES, UGC
&
Resolution No. KCG/admin/2023-24/0607/kh.1 of
Education Department, Govt. of Gujarat
STRUCTURE FOR SEMESTER - 7
GUJARAT UNIVERSITY
Bachelor of Computer Applications -B.S.(BCA)
(as per NEP 2020)

COURSE: Bachelor Of Computer Applications (B.C.A.)

MAJOR: COMPUTER APPLICATIONS

1. COGNITIVE MATHS
MINOR:
2. DATA SECURITY
3. WEB TECHNOLOGIES

SEMESTER – 7 (HONOURS WITH RESEARCH)


MAJOR
CODE COURSE CREDITS
DSC-C-BCA 471T Fundamentals of Artificial Intelligence 4
DSC-C-BCA 472T Machine Learning 4

DSC-C-BCA 473P Machine Learning System Design & Implementation 4


MINOR
CODE COURSE CREDITS

DSC-M-BCA 471 Computer Oriented Numerical Methods 4


OR
DSC-M-BCA 471T Ethical Hacking 4
OR
DSC-M-BCA 471P Full Stack Web Development Project Using [Link] Core 4
Research project
DSC-C-BCA-RP-471 Research Project 6

TOTAL CREDITS 22
Semester – VII
(Honours With Research)

BACHELOR OF COMPUTER
APPLICATIONS

Research Project
Course Name: Research Project

Course Code: DSC-C-BCA -RP-471

Credits: 6

Aim:
The Honours with Research pathway is designed for academically strong students
who wish to engage in original scholarly inquiry and pursue a career in research or
academia. This track provides a structured bridge between undergraduate study and
doctoral programmes. Students enrolled in Honours with Research receive dedicated
guidance from an assigned Research Supervisor

Course Outcomes:
 Students are required to take up research Projects under the guidance of a
faculty member. Thorough research work should be done by the students by
applying their technical knowledge and skills. The students are required to
complete the entire research project in the 8th semester. The research outcomes
of their project work may be published in peer-reviewed journals or may be
presented in conferences/seminars or may be patented.
 In the 7th semester the research will focus on advanced level disciplinary course
related topic and research methodology. An initial stage of research will be
conducted in this semester, like :
 determining the definition of the information needed
 determining the methods of collection of qualitative and quantitative data
 conducting secondary data analysis

Gujarat University Guidelines for Research Project to be followed


Structure & Syllabus for Semester-VII
BACHELOR OF COMPUTER APPLICATIONS (BCA)
Programme

(Honours With On Job Training)

Gujarat University
2026 – 2027

As per NEP 2020 CURRICULUM AND CREDIT FRAMEWORK FOR


UNDERGRADUATE PROGRAMMES, UGC
&
Resolution No. KCG/admin/2023-24/0607/kh.1 of
Education Department, Govt. of Gujarat
STRUCTURE FOR SEMESTER - 7
GUJARAT UNIVERSITY
Bachelor of Computer Applications -B.S.(BCA)
(as per NEP 2020)
COURSE: Bachelor Of Computer Applications (B.C.A.)
MAJOR: COMPUTER APPLICATIONS
1. COGNITIVE MATHS
MINOR:
2. DATA SECURITY
3. WEB TECHNOLOGIES

SEMESTER – 7 (HONOURS WITH ON JOB TRAINING)


MAJOR
CODE COURSE CREDITS
DSC-C-BCA 471T Fundamentals of Artificial Intelligence 4
DSC-C-BCA 472T Machine Learning 4
Machine Learning System Design &
DSC-C-BCA 473P Implementation 4
MINOR
CODE COURSE CREDITS
DSC-M-BCA 471 Computer Oriented Numerical Methods 4
OR
DSC-M-BCA 471 Ethical Hacking 4
OR
DSC-M-BCA 471P Full Stack Web Development Project Using [Link] Core 4
On Job Training

DSC-C-BCA-OJT-471 On Job Training 6

TOTAL CREDITS 22
Semester – VII
(Honours With On Job Training)

BACHELOR OF COMPUTER
APPLICATIONS

ON JOB TRAINING
Course Name: On Job Training
Course Code: DSC-C-BCA-OJT-471
Credits: 6

On Job Training
On Job Training as a partial fulfillment in the 7th Semester of B.S.(BCA) course focusses on
the students getting a real-world experience.

Gujarat University Guidelines for On Job Training to be followed


Structure & Syllabus for Semester-VII
BACHELOR OF COMPUTER APPLICATIONS (BCA)
Programme

(Honours Without On Job Training/


Research Project)

Gujarat University
2026 – 2027

As per NEP 2020 CURRICULUM AND CREDIT FRAMEWORK FOR


UNDERGRADUATE PROGRAMMES, UGC
&
Resolution No. KCG/admin/2023-24/0607/kh.1 of
Education Department, Govt. of Gujarat
STRUCTURE FOR SEMESTER - 7
GUJARAT UNIVERSITY
Bachelor of Computer Applications -B.S.(BCA)
(as per NEP 2020)
COURSE: Bachelor Of Computer Applications (B.C.A.)
MAJOR: COMPUTER APPLICATIONS
1. COGNITIVE MATHS
MINOR:
2. DATA SECURITY
3. WEB TECHNOLOGIES

SEMESTER – 7 (HONOURS WITHOUT ON JOB TRAINING/RP)


MAJOR
CODE COURSE CREDITS
DSC-C-BCA 471T Fundamentals of Artificial Intelligence 4
DSC-C-BCA 472T Machine Learning 4
DSC-C-BCA 473P Machine Learning with Python 4
MINOR
CODE COURSE CREDITS
DSC-M-BCA 471 Computer Oriented Numerical Methods 4
OR
DSC-M-BCA 471 Ethical Hacking 4
OR
DSC-M-BCA 471P Full Stack Web Development Project Using [Link] Core 4
Subjects to be offered Without On Job Training
DSC-C-BCA-474 Data Base Administration 4
DSC-C-BCA-475 Research Methodologies - I 2

TOTAL CREDITS 22
Semester – VII
(Honours Without On Job Training/Research
project)

BACHELOR OF COMPUTER
APPLICATIONS

Subjects offered Without On Job


Training/Research Project
Course Name: Database Administration
Course Code: DSC-C-BCA-474 T

Credits: 4

Course Outcomes:
The aim of this course is to enable students to

1) To obtain knowledge about the basics of database administration.


2) To understand how to maintain a database quickly & accurately.
3) To design, manage and solve the issues related to the database server.

Prerequisites:
 Student should have knowledge about database management system and structured query language.

Contents:

Unit Particulars Hours Credits


1 Understanding Oracle Architecture , Administering Databases and
Tablespace , Creating Database
 Oracle Database Structure 15 1
o Logical Database Structure
o Physical database structure
o Oracle Instance
▪ Memory Structures
• The SGA
• The PGA
o Oracle Processes
▪ The DBWR
▪ LGWR
▪ CKPT
▪ SMON and PMON
▪ ARCH and RECO
▪ LCNn and Dnnn
o Types of Database Architecture
▪ Client/Server Architecture
▪ Multi-tier Architecture
o Database users and administrators
▪ Types of Oracle Users
▪ Responsibilities of database Administrator
▪ Database Administrator Privileges

 Creating Databases
o Using the CREATE DATABASE Statement
o Creating Tablespaces
o Building Data Dictionary views
o Tablespaces
▪ Considerations for managing tablespaces
▪ Types of tablespaces
▪ Altering and dropping tablespaces
▪ Moving tablespaces between databases
▪ Retrieving Tablespace Information

2 Managing Physical Files


 Control Files 15 1
o Considerations for managing Control Files
o Creating and Dropping Control Files
o Backing up and Recovering Control Files
o Retrieving Control Files Information
▪ Online Redo log files
▪ Creating online redo log groups
▪ Relocating, renaming and dropping redo log
files
▪ Retrieving online redo log files information
o Archieved redo log files
▪ Managing archieved redo log files
▪ Defining the location and mode of archieved
redo log files
▪ Retreiving archieved redo log file
o Data files
▪ Considerations for managing datafiles
▪ Renaming, relocating and dropping datafiles
▪ Retrieving datafiles information

 Administering Users, Privileges and Roles


o Managing profiles and users
▪ Prerequisites to work with profile
▪ Creating profiles
▪ Altering and dropping profiles
▪ Creating Users
▪ Altering and dropping users
▪ Retrieving information about profiles and users
o Managing Privileges
▪ Granting and revoking system level privileges
▪ Granting and revoking object level privileges
▪ Retrieving information about privileges
o Managing Roles
▪ System level roles
▪ Creating roles
▪ Granting and revoking roles from users
▪ Enabling and disabling roles
▪ Altering and dropping roles
▪ Retrieving information about roles
3 Indexes and Cluster
 Overview of Indexes 15 1
o Need for indexes
o Guidelines for creating, dropping or disabling Indexes
o Creating Indexes
▪ Unique and non-unique Indexes
▪ Composite Indexes
▪ Function based Indexes
▪ B-tree Indexes
▪ Bitmap Indexes
▪ Reverse key Indexes
▪ Index organized tables
o Administering Indexes
▪ Partitioning Indexes
▪ Rebuilding Indexes
▪ Coalescing Indexes
▪ Checking validity of Indexes
▪ Dropping Indexes
▪ Retrieving information about Indexes
 Clusters
o Creating Clusters
o Creating clusters tables
o Creating clustered indexes
o Altering Clusters
o Dropping Clusters
o Hash Clusters

4 Optimizing Database Performance & Backup and Recovery


 Overview of an Optimizer 15 1
o Types of optimizers
o Optimizer Operations
o Generating Statistics
o Tuning SQL statements
o Explain_plan statement
o Creating the Plan_table output table
o Executing the Explain_Plan statement
o Querying the Plan_table output table
o Tuning oracle databases
o Tuning memory usage
o Tuning data storage
o Tuning physical storage
o Tuning logical storage
 Backup and Recovering Data
o Backing up data
o Planning data backup
o Types of backup
o Using Export Utility
o Using Import Utility
o Using Offline Backup
o Using online backups
 Recovering Data
o Planning Data Recovery
o Types of Recovery
o Data Structures for Recovering Data
o Recovery Manager Commands
o Recovery using RMAN commands

Textbook:
Administering Oracle (First Edition 2004) Publisher:
BPB Publications
By Ivan Byross

Reference Books:
1. Beginning Oracle Database 11g Administration
Publisher: Apress Publications
By Iggy Fernandez

2. Database Administration: Implementation and Administrator


Publisher: Cengage Publications
By Gavin Powell, Carol McCullough-Dieter

3. Oracle 11g Administration in Simple Steps


Publisher: Dreamtech Publications
By Kogent Learning Solutions Inc.
Course Name: Research Methodologies - I
Course Code: DSC-C-BCA-475

Credits: 2

Course Outcomes:
The aim of this course is to enable students to

 Understand the fundamentals of research


 Identify research problems
 Understand different research designs
 Understand Data collection and analysis methods

Prerequisites:
 Basic Knowledge of the Subject Area
 Basic Understanding of Research Concepts
Unit Particulars Hours Credits
1  Introduction to RM 15 1
 Meaning, objective, types of research
 Research methods vs methodology
 Research process
 Techniques of defining research problem
 Different research designs
(1) Research design in case of exploratory
research studies;
(2) Research design in case of descriptive and
diagnostic research studies,
(3) Research design in case of hypothesis-
testing research studies.
 Experimental designs

2 Research Problem and Sampling Design 15 1


 Definition(Research problem), Techniques for
defining a problem
 Definition, Steps in sample design,
Characteristics of good sample design,
 Different types of sample designs
 Complex random sampling designs
(Systematic, Stratified, Cluster, Area,
Multistage, sequential
 Case study method for data collection
 Sampling Distribution:
(1) sampling distribution of mean;
(2) sampling distribution of proportion;
(3) student’s ‘t’ distribution;
(4) F distribution;
(5) Chi-square distribution

Textbook:

1. Research Methodology Methods and Techniques (SECOND REVISED EDITION)


Newage international publishers
By C.R. Kothari

Web References:

[Link]
[Link]
[Link]

Accomplishments of the student after completing the Course:


After completion of this course Student would be able to

1. Understand the fundamentals of research and its importance in computing.


2. Identify research problems in Computer Applications.
3. Apply qualitative and quantitative research methods.
4. Collect, analyze, and interpret data.
5. Write research reports and technical papers.
6. Understand ethical practices in research.
***

You might also like