SEMESTER-4

Testingof Hypothesis
B. Sc. (Data Science) Semester – IV
Course Name: Testing of Hypothesis Course Code: USDS401
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives:
1. To impart statistical significance in solving complex problems.
2. To critically test in developing robust, extensible and highly maintainable solutions to
simple and complex problems.
3. To implement various statistical functions using suitable programming languages and
packages.
4. To scientifically test the unknown and unlock possibilities in different dimensions of the
system.
5. To write the reports of analytical results generated by the system.

Unit Details Lectures

I Introduction to Hypothesis Testing: Hypothesis Tests, Stating a
Hypothesis, Types of Errors and Level of Significance, Statistical Tests
and P-Values, Making a Decision and Interpreting the Decision,
Strategies for Hypothesis Testing, Characteristics of a good hypothesis,
Steps for hypothesis testing
Hypothesis Testing for the Mean (σ Known): Using P-Values to Make
Decisions, Using P-Values for a z-Test, Rejection Regions and Critical 12
Values, Using Rejection Regions for a z-Test, Critical Values in a t-
Distribution, The t-Test for a Mean µ, Using P-Values with t-Tests, Sums
and case studies
Packages used for Hypothesis testing: Introduction to statistical
functions in R / Python / Excel, Packages used for finding P-value to
make decision and hypothesis testing.
II Goodness of fit tests:Anderson-Darling, Chi-square test, Kolmogorov-
Smirnov, Ryan-Joiner,Shapiro-Wilk ,Jarque-Bera, Lilliefors
Variance tests: Chi-square test of a single variance, F-tests of two
variances,Tests of homogeneity
Wilcoxon rank-sum/Mann-Whitney U test,Sign test
Contingency tables: Chi-square contingency table test, G contingency 12
table test, Fisher's exact test, Measures of association, McNemar's test

Packages used for Hypothesis testing: Packages used for finding

goodness of fit test, variance test, Wilcoxon rank-sum / Mann-Whitney U
test and sign test, Using Contingency table in R / Python / Excel.
 III Analysis of variance and covariance:ANOVA, Single factor or one-
way ANOVA, Two factor or two-way and higher-way ANOVA ,
MANOVA, ANCOVA
Non-Parametric ANOVA: Kruskal-Wallis ANOVA, Friedman ANOVA
test, Mood's Median 12
Packages used for Hypothesis testing: Packages used for finding
Anova, Manova, Ancova and Non-Parametric Anova in R / Python /
Excel.

IV Regression and smoothing:Least squares, Ridge regression, Simple and

multiple linear regression, Polynomial regression, Generalized Linear
Models (GLIM), Logistic regression for proportion data, Poisson
regression for count data, Non-linear regression, Smoothing and
Generalized Additive Models (GAM), Geographically weighted
12
regression (GWR), Spatial series and spatial autoregression- SAR
models, CAR models, Spatial filtering models
Time series analysis and temporal autoregression: Moving averages,
Trend Analysis, ARMA and ARIMA (Box-Jenkins) models, Spectral
analysis
V Communicating and Documenting the Results of Analyses:
Introduction, The Difficulty of Good Communication, Communication
Hurdles: Graphical Distortions, Communication Hurdles: Biased Samples
& Sample Size, Preparing Data for Statistical Analysis, Guidelines for a
Statistical Analysis and Report, Documentation and Storage of Results
,Supplementary Exercise
Data Storytelling: What is a Data Story?, The Art and Science of
12
Storytelling, Planning the Data Story, Elements of the Data Story, Parts
of the Data Story, Framing and Formatting of the Data Story, False
Narratives and Data Storytelling
Infographics: What is an Infographic?, Why are Infographics Useful?
Types of Infographics, Infographic Design Elements, Steps in Designing
an Infographic, Best Practices in Designing an Infographic

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1 Hypothesis Testing --- Pearson --- ---
Higher
Education
2 Statistical Analysis Dr. Michael J de The 2018 2018
Handbook Smith Winchelsea Ed
Press,
Drumlin
Security
Ltd,
 Edinburgh
3 An Introduction to R. Lyman Ott& Thomson --- ---
Statistical Methods Michael Learning
and Data Analysis Longnecker

Course Outcome:
CO 1: Learner is developing null and alternative hypotheses to test for a given situation.
CO 2:Learner is able to differentiateone- and two-tailed hypothesis tests.
CO 3: Learner is able to do samplinga normal distribution and random sampling.
CO 4: Learner is using statistical models and their associations in performing hypothesis
testing.
CO 5: Lerner is writing the reports and interpreting the data using the various
programming languages and packages.
 Testing of Hypothesis Practical
B. Sc. (Data Science) Semester – IV
Course Name: Testing of Hypothesis Practical Course Code: USDS4P1
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
Practical can be performed using R / Python / scilab / matlab / SPSS / MS Excel
1 Hypothesis Testing for the Mean
a Perform testing of hypothesis using one sample t-test.
b Perform testing of hypothesis using two sample t-test.
c Perform testing of hypothesis using paired t-test.
d Perform testing of hypothesis using Z-test.
2 Goodness-of-fit test
a Perform goodness-of-fit test using chi-squared test.
b Perform goodness-of-fit test using KS-test.
c Perform testing of hypothesis using chi-squared Test of Independence
3 Variance Testing
a. Using Chi-square test of a single variance
b. Using F-tests of two variances
c. Testing of homogeneity
4 Analysis of variance and covariance
a. Perform testing of hypothesis using one-way ANOVA.
b. Perform testing of hypothesis using two-way ANOVA.
c. Perform testing of hypothesis using Multivariate ANOVA (MANOVA)
d. Perform testing of hypothesis using one-way ANOVA.
5 Regression
a. Perform simple linear regression
b. Perform multiple linear regression
c. Perform polynomial regression
6 Perform spatial series and spatial auto-regression

7 Perform time series analysis using Moving averages

8 Perform time series analysis using Trend Analysis

9 Perform Spectral analysis

10 Creating ―Infographics‖ using secondary data available on internet. (Use Canva /

Adobe Spark / Prezi / Vennage
 Big Data
B. Sc. (Data Science) Semester – IV
Course Name: Big Data Course Code: USDS402
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25
Course Objectives
1. To develop core abilities to make data-driven decisions through big data.
2. To provide an overview of an exciting growing field of big data analytics.
3. To introduce the tools required to manage and analyze big data like Hadoop, NoSql
MapReduce.
4. To teach the fundamental techniques and principles in achieving big data analytics with
scalability and streaming capability.

Unit Details Lectures

I Introduction to Big Data Analytics: 12
Defining Big Data analytics: Discovering value from large data
sets, Exploiting data to optimize decision-making
Planning your analytics life cycle project: Outlining steps in the life
cycle,Contrasting traditional analytics with Big Data analytics
Representing Big Data with R and Rattle:
Preparing the data: Loading data for knowledge discovery,Spotting
outliers in the data,Transforming and summarizing data
Visualizing data characteristics: Revealing changes over
time,Displaying proportions within your data,Leveraging charts to
display relationships,Displaying relationships across categories
II Modeling and Predictive Data Analysis:Categorizing analytic 12
approaches: Predictive vs. descriptive analytics, Supervised vs.
unsupervised learning
Applying appropriate mining techniques: Discovering unknown
groups through clustering, Detecting relationships with association
rules, Uncovering decision tree classifications, Identifying patterns
with time series analysis
III Leveraging Analytics with RHadoop 12
Expanding the analytic capabilities of your organization
 Exploring the MapReduce and Hadooparchitecture,Creating and
executing HadoopMapReducejobs,Integrating R and Hadoop
with RHadoop,Examining the components of RHadoop,Creating
modules for RHadoopjobs,ExecutingRHadoopjobs,Monitoring
job execution flow
 Building a Recommendation Framework: Streamlining business decisions
 Considering motivations for a recommender engine,Leveraging
recommendations based on collaborative filtering, Exploring the
architecture of the recommendation framework, Building
programming components, Executing the recommendation
model, Performing tradeoff analysis
IV Mining Unstructured Data 12
Investigating business value within unstructured data
 Making a business case for unstructured data mining, Extending
business intelligence with mining tools
Implementing text mining and social network analysis
 Analyzing the structure of text mining, Evaluating mining
approaches, Building a text mining framework, Inspecting social
network interactions
V Planning and Implementing a Complete Data Analytics Solution 12
Transforming business objectives to analytic projects
 Arguing your business case for analytics, Mapping analytics
models to business objectives, Identifying performance metrics
targets
Implementing the analytics life cycle
 Finding core data sets, Preparing the data for analysis, Modeling
the data, Executing the model, Communicating results
Ensuring a Successful Data Analytics Solution
 Identifying barriers to Big Data analytics, Managing and
mitigating risks, Employing an implementation checklist
Reference Books:
1. VigneshPrajapati, “Big Data Analytics with R and Hadoop”, Packt
Publishing House.
2. Bart Baesens, Analytics in a Big Data World: The Essential Guide to Data
Science and its Applications (Wiley and SAS Business Series), Wiley
3. ArvindSathi, Big Data Analytics Disruptive Technologies For Changing The
Game, MC Press LLC
4. Viktor Mayer Schonberger, Kenneth Cukier, Big Data,
5. Adam Jorgensen, James Rowland-Jones, John Welch and Dan Clark,
“Microsoft Big Data Solutions”, Wiley
6. http://www.bigdatauniversity.com

Course Outcome:
CO 1: Learner understands the key issues in big data management and its associated applications
in intelligent business and scientific computing.
CO 2: Lerner is acquiring fundamental techniques and algorithms like Hadoop, Map Reduce and
NO SQL in big data analytics.
CO 3: Learner is able to interpret business models and scientific computing paradigms, and
apply software tools for big data analytics.
CO 4: Learner understands adequate perspectives of big data analytics in various applications
like recommender systems, social media applications etc.
 Big Data Practical
B. Sc. (Data Science) Semester – IV
Course Name: Big Data Practical Course Code: USDS4P2
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1a Install, configure and run Hadoop and HDFS
b Implement word count/ frequency program using MapReduce

2 Implement an Mapreduce program that process a weather dataset

3 Exploring Hadoop Distributed File System (HDFS)

4 Implement an application that store big data in Hbase/ Mongodb/ Pig using
Hadoop/R

5 Implement a program in Pig

6 Configure the Hive and implement the application in Hive

7 Illustrate the working of Jaql

8a Implement Decision tree classification technique

b Implement SVM Classification technique

9a Regression Model: Import a data from web storage.

Name the dataset and do Logistic Regression to find out relation between
variables that are affecting the admission of a student in an institute based on his
or her GRE score, GPA obtained and rank of the student. Also check the model is
fit or not require (foreign), require (Mass)
b MULTIPLE REGRESSION MODEL: Apply multiple regressions, if data have a
continuous independent variable. Apply on above dataset.

10 a CLASSIFICATION MODEL:
a. Install relevant package for classification.
b. Choose classifier for classification problem.
c. Evaluate the performance of classifier.
b CLUSTERING MODEL
a. Clustering algorithms for unsupervised classification. b. Plot the cluster data
using R visualizations.
 Fundamentals of Accounting
B. Sc. (Data Science) Semester – IV
Course Name: Fundamentals of Accounting Course Code: USDS403
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives
1: To be able to track a company‘s finances in their numerous forms, from credits, debits, and
profitability to payroll and tax filing.
2: To analyzing the organization‘s financial health and apply data science principles/practices
on that information to plot current and future strategies for growth.
Unit Details Lectures
I Accounting in Action: Identify the activities and users associated with
accounting, Explain the building blocks of accounting: ethics, principles,
and assumptions, State the accounting equation, and define its
components, Analyze the effects of business transactions on the
accounting equation, Describe the four financial statements and how they
are prepared 12
The Recording Process: Describe how accounts, debits, and credits are
used to record business transactions, Indicate how a journal is used in the
recording process, Explain how a ledger and posting help in the recording
process, Prepare a trial balance

II Adjusting the Accounts: Explain the accrual basis of accounting and the
reasons for adjusting entries, Prepare adjusting entries for deferrals,
Prepare adjusting entries for accruals, Describe the nature and purpose of
an adjusted trial balance
Completing the Accounting Cycle: Prepare a worksheet, Prepare 12
closing entries and a post-closing trial balance, Explain the steps in the
accounting cycle and how to prepare correcting entries, Identify the
sections of a classified balance sheet

III Accounting for Merchandising Operations: Describe merchandising

operations and inventory systems, Record purchases under a perpetual
inventory system, Record sales under a perpetual inventory system,
Apply the steps in the accounting cycle to a merchandising company, 12
Compare a multiple-step with a single-step income statement
Inventories: Discuss how to classify and determine inventory, Apply
inventory cost flow methods and discuss their financial effects, Indicate
 the effects of inventory errors on the financial statements, Explain the
statement presentation and analysis of inventory
Accounting Information Systems: Explain the basic concepts of an
accounting information system, Describe the nature and purpose of a
subsidiary ledger, Record transactions in special journals

IV Fraud, Internal Control, and Cash: Discuss fraud and the principles of
internal control, Apply internal control principles to cash, Identify the
control features of a bank account, Explain the reporting of cash.
Accounting for Receivables: Explain how companies recognize
accounts receivable, Describe how companies value accounts receivable
and record their disposition, Explain how companies recognize notes
receivable, Describe how companies value notes receivable, record their
12
disposition, and present and analyze receivables
Plant Assets, Natural Resources, and Intangible Assets: Explain the
accounting for plant asset expenditures, Apply depreciation methods to
plant assets, Explain how to account for the disposal of plant assets,
Describe how to account for natural resources and intangible assets,
Discuss how plant assets, natural resources, and intangible assets are
reported and analyzed
V Current Liabilities and Payroll Accounting: Explain how to account
for current liabilities, Discuss how current liabilities are reported and
analyzed, Explain how to account for payroll
12
Accounting for Partnerships: Discuss and account for the formation of
a partnership, Explain how to account for net income or net loss of a
partnership, Explain how to account for the liquidation of a partnership

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1 ACCOUNTING Jerry J. Weygandt WILEY 12th
PRINCIPLES Paul D. Kimmel
Donald E. Kieso
2 MS-EXCEL FOR CA SUNIL B WIRC - ---- ----
CHARTERED GABHAWALLA ICAI
ACCOUNTANTS

Course Outcome:
CO 1:Lerner understands the laws governing the business, typical business administration
schemes, and the ethics of accountancy, statistics, and accounting theory.
CO 2: Learner understands the record keeping of financial transactions and further
implementations in relevant area.
 Fundamentals of Accounting Practical
B. Sc. (Data Science) Semester – IV
Course Name: Fundamentals of Accounting Practical Course Code: USDS4P3
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
Practical can be performed using MS Excel / Google Sheet / WPS Office
1 Introduction to Spreadsheet
a Data entry using spreadsheet :
Text, Number, Formula, Function, Auto fill, Auto Correct and Data Validation
b Using Total and Subtotal:
+, sum() , Quick sum, subtotal(), sumif(), conditional sums, sorting of data

2 Advance functions
a Lookup(), HLOOKUP(), VLOOKUP(), date functions, numeric functions, string
functions, Index(), Match()
b Financial Functions

3 Using paste special

a To demonstrate different types of paste options available in paste special.

4 Analysing Data
a Data tables
b Scenarios
c Goal Seek

5 Pivot Table
a Creating a Pivot Table
b Layout of the PivotTable

6 Auditing Tools
a Auditing Toolbar
b Documenting a Sheet
c Migrating Data from Other Software
d Common Audit Techniques

7 Application of spreadsheet
a Creating Balance Sheet and Balance Sheet Summary
b Creating Income Statement and Income Statement Summary
c Creating Cash Flow Statement and Cash Flow Statement Summary

8 Creating a General Ledger

9 Create a Loan Amortization table using the PMT function

10 Automate common tasks using Macros

a Using Global Macros
( download and use Currency conversion, Number to Word conversion etc)
b Creating own Macros (Income tax & GST Macros)
 Artificial Intelligence

B. Sc. (Data Science) Semester – IV

Course Name: Artificial Intelligence Course Code: USDS404
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives:
1. To introduce and appreciate use of AI and the theory underlying for solving problems.
2. To Learn about Rational Intelligent Agent and Agent types to solve problems
3. To learn about representing difficult real life problems as state space representation and
solving them using AI techniques.
4. To understand the basic issues of knowledge representation and develop skills for
reasoning and handling uncertainty
5. To introduce advanced topics of AI for solving complex problems.

Unit Details Lectures

I Intelligent Systems and Intelligent Agents:
Introduction to AI, AI Problems and AI techniques, Solving problems
by searching, Problem Formulation. State Space Representation 12
Structure of Intelligent agents, Types of Agents, Agent Environments
PEAS representation for an Agent.
II Searching Techniques:
Uninformed Search: DFS, BFS, Uniform cost search, Depth Limited
Search, Iterative Deepening.
Informed Search: Heuristic functions, Hill Climbing, Simulated 12
Annealing, Best First Search, A*
Constraint Satisfaction Programming: Crypto Arithmetic, Map Coloring,
N-Queens.
Adversarial Search: Game Playing, Min-Max Search, Alpha Beta Pruning
III Knowledge and Reasoning:
Knowledge Based Agent, Overview of Propositional Logic, First Order
Predicate Logic, Inference in First Order Predicate Logic: Forward and 12
Backward Chaining, Resolution.
IV Uncertainity and Reasoning: Uncertainly, Representing Knowledge in
an Uncertain Domain, Bayesian Network, Conditional Probability, Joint
Probability, Bayes‘ theorem, Belief Networks, Simple Inference in 12
BeliefNetworks. Sequential decsion problems.
V Machine Learning: Forms of Learning, Supervised Learning, Learning
Decision Trees, Evaluating and Choosing the Best Hypothesis, Theory of
Learning, Regression and Classification with Linear Models, Artificial
12
Neural Networks, Nonparametric Models, Support Vector Machines,
Ensemble Learning, Statistical Learning, Introduction to deep learning
concepts
Books and References:
Sr. No. Title Author/s Publisher Edition Year
1 Artificial Intelligence: A Stuart J. Russell Pearson Fourth 2020
Modern Approach and Peter Norvig Edition
2 Artificial Intelligence: David L Cambridge Second 2017
Foundations of Poole,Alan K. University Edition
Computational Agents Mackworth Press
3 Artificial Intelligence Kevin Knight McGraw 3rd 2017
and Elaine Rich Hill Edition
4 The Elements of Statistical Trevor Hastie, 2013
Learning Robert Springer
Tibshirani and
Jerome
Friedman
5 A First Course in Deepak TMH 1st 2017
Artificial Intelligence Khemani Edition

Course Outcome:
CO 1: Leaner understands building blocks of AI.
CO 2:Learner is analyzing problem and solving it by implementing suitable techniques.
CO 3:Learner is applying logic based techniques to solve examples.
CO 4:Learner is able to implement Bayesian approaches.
CO 5: Learner is using machine learning concepts for solving problems
 Artificial Intelligence Practical
B. Sc. (Data Science) Semester – IV
Course Name:Artificial Intelligence Practical Course Code: USDS4P4
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1. Generate the state-space possiblities for the folling problems
a. Water Jug Problem
b. Number Puzzel

2. Write the program to compute the following Uninformed SearchSearch

Algorithms for suitable problem
a. Depth First Search
b. Breadth First Search

3. Write the program to compute the following Informed SearchSearch

Algorithms for suitable problem
a. Hill Climbing
b. Simulated Annealing
c. A* Algorithm

4. Write the program to compute the following Algorithms for suitable

problem
a. Simulate solution for 4-Queen / N-Queen problem
b. Constraint satisfaction problem: Map Coloring

5. Write the program to compute the following Search Algorithms for suitable
problem
a. simulation of tic – tac – toe game using Min-Max Search
b. Alpha Beta Pruning
c. Water Jug Problem

6. Write the program to compute the following Algorithms for suitable

problem
a. Missionaries and Cannibals
b. Simple Inferencing

7. Write the program to implement decsion tree for suitable problem.

a. Two Class decsion
b. Multi class decsion

8. Write the program to compute the following Algorithms for suitable

problem
a. Linear Regression
b. Classification Problems

9. Write the program to solve the following problems using suitable AI

method.
a. Traveling salesman problem
b. Number Puzzel Problem

10. Write the program to demonstrate the following

a. Simple neural network
b. Support Vector Machine
 Numerical Methods
B. Sc. (Data Science) Semester – IV
Course Name: Numerical Methods Course Code: USDS405
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives
1. To be able to precisely solve problems using mathematical modeling.
2. To be able to find solution for a solvable to unsolvable problems.
3. To find an answer or solution close to answer, without even knowing what the answer is.

Unit Details Lectures

I Background and Introduction: Differential Equations, Matrix Analysis,
Matrix Eigenvalue Problem, Errors and Approximations, Iterative
Methods
Numerical Solution of Equations of a Single Variable:Numerical
12
Solution of Equations, Bisection Method, RegulaFalsi Method, Fixed-
Point Method, Newton‘s Method, Secant Method, Equations with Several
Roots

II Numerical Solution of Systems of Equations: Linear Systems of

Equations, Numerical Solution of Linear Systems, Gauss Elimination
Method, LU Factorization Methods, Iterative Solution of Linear Systems, 12
Ill-Conditioning and Error Analysis, Systems of Nonlinear Equations

III Curve Fitting and Interpolation:Least-Squares Regression, Linear

Regression, Linearization of Nonlinear Data, Polynomial Regression,
Polynomial Interpolation, Spline Interpolation, Fourier Approximation
and Interpolation
Numerical Differentiation and Integration: Numerical Differentiation,
12
Finite-Difference Formulas for Numerical Differentiation, Numerical
Integration: Newton–Cotes Formulas, Numerical Integration of
Analytical Functions:
Romberg Integration, Gaussian Quadrature, Improper Integrals

IV Numerical Solution of Initial-Value Problems: Introduction, One-Step

Methods, Euler‘s Method, Runge–Kutta Methods, Multistep Methods,
12
Systems of Ordinary Differential Equations, Stability, Stiff Differential
Equations
 V Numerical Solution of Boundary-Value Problems: Second-Order
BVP, Boundary Conditions, Higher-Order BVP, Shooting Method,
Finite-Difference Method
Matrix Eigenvalue Problem:Matrix Eigenvalue Problem, Power
Method: Estimation of the Dominant Eigenvalue, Inverse Power Method:
Estimation of the Smallest Eigenvalue, Shifted Inverse Power Method:
12
Estimation of theEigenvalue Nearest a Specified Value, Shifted Power
Method, Deflation Methods, Householder Tridiagonalization and QR
Factorization Methods, A Note on the Terminating Condition Used in
HouseholderQR, Transformation to Hessenberg Form (Nonsymmetric
Matrices)

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. 1 Numerical Methods for Ramin S. CRC Press Second 2017
Engineers and Esfandiari Edition
Scientists
Using MATLAB

Course Outcome:
CO 1: Learner implementingNumerical Methodsto solve the problems.
CO 2:Learner is computing the numerical results using raw data.
CO 3: Learner will learn numerical different and integration .
CO 4: Learner will learn Numerical Solution of Initial-Value
CO 5: Learner will learn Matrix Eigenvalue
 Numerical MethodsPractical
B. Sc. (Data Science) Semester – IV
Course Name:Numerical MethodsPractical Course Code: USDS4P5
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1 Write a program using R/Python/Scilab/Matlab
a Bisection Method
b Regula Falsi Method
c Newton‘s Method
2 Write a program using R/Python/Scilab/Matlab
a Gauss Elimination Method
b LU Factorization Methods
3 Write a program using R/Python/Scilab/Matlab
a Numerical Differentiation
b Newton–Cotes Formulas

4 Write a program using R/Python/Scilab/Matlab

a Romberg Integration
b Gaussian Quadrature

5 Write a program using R/Python/Scilab/Matlab

a Euler‘s Method
b Runge–Kutta Methods
6 Write a program using R/Python/Scilab/Matlab
a Second-Order BVP
b Higher-Order BVP
7 Write a program using R/Python/Scilab/Matlab for Finite difference method
8 Write a program using R/Python/Scilab/Matlabfor Estimation of the
Dominant Eigenvalue
9 Write a program using R/Python/Scilab/Matlab for Estimation of the
Smallest Eigenvalue
10 Write a program using R/Python/Scilab/Matlab for Estimation of the
Eigenvalue Nearest a Specified Value