Variable Declaration, Definition in C
Parameterized Macros
argc, argv[]
Total Pageviews
Tuesday, March 7, 2023
Tuesday, January 24, 2023
CASE STUDIE - CLOUD
Aneka
CometCloud
Autonomic cloud bridging
GOOGLE APP ENGINE
Google App Engine integrates the following tools:
1. Python runtime.
2. Java runtime.
3. Software Development Kit (SDK): Enables developers to write application code.
4. Web-based Administration Console: Helps developers manage their applications.
5. A Datastore: A software layer that stores a web application’s data.
AMAZON WEB SERVICES (AWS)
EUCALYPTUS
MS Azure,Azure Cache
Cloud computing QUESTION SET 5
The Cloud Security Alliance
ELEMENTS OF CLOUD SECURITY MODEL
The Cloud Cube Model
Security Aspects
Platform-as-a-Service Security Issues
Infrastructure-as-a-Service Security Issues
Software-as-a-Service Security Issues
Disaster Recovery
BENEFITS OF TRUSTED CLOUD
CLOUD DATA ENCRYPTION
CLOUD DATA ENCRYPTION
SIX SURFACE ATTACKS
Cloud computing QUESTION SET 4
Cloud Architecture
several approaches of cloud migration.
pay-as-you-go paradigm
server consolidation
Software-as-a-Service Security Issues
Cloud computing QUESTION SET 3
Cloud Computing Model:
The NIST cloud computing model
On-demand self-service:
Resource pooling:
Public Cloud,Private Cloud,Community Cloud,Hybrid Cloud
■ Infrastructure-as-a-Service (IaaS)
■ Platform-as-a-Service (PaaS)
■ Software-as-a-Service (SaaS)
Security Management-as-a-Service
Identity Management-as-a-Service (IDaaS)
Storage-as-a-Service
Database-as-a-Service
Backup-as-a-Service (BaaS)
OPEN CLOUD SERVICES
5-4-3 Principles of Cloud computing
Cloud computing QUESTION SET 2
1. THREE LAYERS OF COMPUTING
■ Infrastructure ■ Platform ■ Application
2.What is meant by ‘cloud’ in cloud computing?
3.Where do the clouds reside?
4.Cluster Computing:
5.Mainframe Architecture
6.Grid Computing
7. COMPARISON BETWEEN CLUSTER, GRID AND CLOUD COMPUTING
8. ROLE OF WEB SERVICE
■Simple Access Object Protocol (SOAP) based, or ■ Representational State Transfer (REST) compliant.
9.Justify the ‘low initial investment’ philosophy of cloud computing.
Data mining Question set-6
Partitioning Methods
1.k-Means: A Centroid-Based Technique
2.Hierarchical Methods
3.a grid-based clustering
Data mining Question set-5
1. Bayesian Belief Networks
2. Classification by Backpropagation
3. Classification Using Frequent Patterns
4. Lazy Learners (or Learning from Your Neighbors)
5. Semi-Supervised Classification
Data mining Question set-4
1 Briefly outline the major steps of decision tree classification.
2 Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning?
3 Given a decision tree, you have the option of (a) converting the decision tree to rules and then pruning the resulting rules, or (b) pruning the decision tree and then converting the pruned tree to rules. What advantage does (a) have over (b)?
4 It is important to calculate the worst-case computational complexity of the decision tree algorithm. Given data set, D, the number of attributes, n, and the number of training tuples, |D|, show that the computational cost of growing a tree is at most n × |D| × log(|D|).
5.Why is na¨ıve Bayesian classification called “na¨ıve”? Briefly outline the major ideas of na¨ıve Bayesian classification
6.Show that accuracy is a function of sensitivity and specificity
Data mining Question set-3
1. Define each of the following data mining functionalities: characterization, discrimination, association and correlation analysis, classification, regression, clustering, outlier analysis. Give examples of each data mining functionality, using a real-life
database that you are familiar with.
2.Cluster Analysis, Outlier Analysis
3.Machine Learning
Supervised learning
Unsupervised learning
Semi-supervised learning
Active learning
4. Present an example where data mining is crucial to the success of a business. What data
mining functionalities does this business need (e.g., think of the kinds of patterns that
could be mined)? Can such patterns be generated alternatively by data query processing
or simple statistical analysis?
5 Explain the difference and similarity between discrimination and classification, between
characterization and clustering, and between classification and regression.
6 Based on your observations, describe another possible kind of knowledge that needs to
be discovered by data mining methods but has not been listed in this chapter. Does it
require a mining methodology that is quite different from those outlined in this chapter?
7 Outliers are often discarded as noise. However, one person’s garbage could be another’s
treasure. For example, exceptions in credit card transactions can help us detect the
fraudulent use of credit cards. Using fraudulence detection as an example, propose two
methods that can be used to detect outliers and discuss which one is more reliable.
8 Describe three challenges to data mining regarding data mining methodology and user
interaction issues.
9 What are the major challenges of mining a huge amount of data (e.g., billions of tuples)
in comparison with mining a small amount of data (e.g., data set of a few hundred
tuple)?
10 Outline the major research challenges of data mining in one specific application domain,
such as stream/sensor data analysis, spatiotemporal data analysis, or bioinformatics.
Data mining Question set-2
DM techniques
1. Verification Model
2. Discovery
3. SVM
4. Rough Set
5. Web Mining
Data mining Question set-1
1. What is Data Mining?
2. KDD vs Data Mining
3. Stages of KDD.
4. DBMS vs Data Mining.
5. loosely coupled and tightly coupled DBBMS.
6. data warehouse
7. data rich but information poor situation
8. data cube
9. descriptive and predictive Data Mining
10. Class/Concept Description
11. Data characterization
12. Data discrimination
13. Three of the elements defining data quality: accuracy, completeness, and consistency
14. Major Tasks in Data Preprocessing
15.Data Cleaning
16.Data Transformation Strategies
17.Discretization by Cluster, Decision Tree,
and Correlation Analyses
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
10. Check strong number.
PROGRAM:
echo "Enter the number:"
read n
fact=1
if [ $n -eq 0 ]
then
echo "fact = "1
else
for i in `seq 1 $n`
do
fact=`expr $fact \* $i`
done
echo "fact = $fact"
fi
OUTPUT:
[bgc@localhost ~]$ sh 11.sh
Enter a number:
145
145 is a strong number
[bgc@localhost ~]$ sh 11.sh
Enter a number:
2
2 is a strong number
[bgc@localhost ~]$ sh 11.sh
Enter a number:
23
23 is not a strong number
[bgc@localhost ~]$
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
9. Check if a number is prime fibonacci.
PROGRAM:
echo "enter the ending range of the series:"
read n
a=0
b=1
d=0
echo "The series is:"
if [ $n -le 2 ]
then
echo "null"
else
while [ $d -le $n ]
do
d=`expr $a + $b`
c=0
e=1
while [ $e -le $d ]
do
if [ `expr $d \% $e` -eq 0 ]
then
c=`expr $c + 1`
fi
e=`expr $e + 1`
done
if [ $c -eq 2 ]
then
if [ $d -le $n ]
then
echo $d
fi
fi
a=$b
b=$d
done
fi
OUTPUT:
[bgc@localhost ~]$ sh 10.sh
enter the ending range of the series:
100
The series is:
2
3
5
13
89
[bgc@localhost ~]$
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
8.Print twin prime numbers within a range.
PROGRAM:
echo "enter a range:"
read a
read b
n=$a
while [ $n -le $b ]
do
c=0
d=1
while [ $d -le $n ]
do
if [ `expr $n \% $d` -eq 0 ]
then
c=`expr $c + 1`
fi
d=`expr $d + 1`
done
if [ $c -eq 2 ]
then
f=$n
e=`expr $n + 2`
m=$e
c=0
d=1
while [ $d -le $m ]
do
if [ `expr $m \% $d` -eq 0 ]
then
c=`expr $c + 1`
fi
d=`expr $d + 1`
done
if [ $c -eq 2 ]
then
echo "twin prime pair=$f,$e"
fi
fi
n=`expr $n + 1`
done
OUTPUT:
enter a range:
2
10
twin prime pair=3,5
twin prime pair=5,7
[bgc@localhost ~]$ sh 9.sh
enter a range:
3
100
twin prime pair=3,5
twin prime pair=5,7
twin prime pair=11,13
twin prime pair=17,19
twin prime pair=29,31
twin prime pair=41,43
twin prime pair=59,61
twin prime pair=71,73
[bgc@localhost ~]$
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
7. Prime number checking.
PROGRAM:
echo "enter a number:"
read n
c=0
d=1
while [ $d -le $n ]
do
if [ `expr $n \% $d` -eq 0 ]
then
c=`expr $c + 1`
fi
d=`expr $d + 1`
done
if [ $c -eq 2 ]
then
echo "prime number"
else
echo "not a prime number"
fi
OUTPUT:
[bgc@localhost ~]$ sh 8.sh
enter a number:
2
prime number
[bgc@localhost ~]$ sh 8.sh
enter a number:
1
not a prime number
[bgc@localhost ~]$ sh 8.sh
enter a number:
0
not a prime number
[bgc@localhost ~]$ sh 8.sh
enter a number:
5
prime number
[bgc@localhost ~]$ sh 8.sh
enter a number:
4
not a prime number
[bgc@localhost ~]$
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
6. Print fibonacci series.
PROGRAM:
echo "enter number of elements of the fibonacci series:"
read n
a=0
b=1
if [ $n -eq 0 ]
then
echo "no elemnts"
else
if [ $n -eq 1 ]
then
echo 0
else
echo 0
echo 1
c=2
while [ $c -ne $n ]
do
d=`expr $a + $b`
echo $d
a=$b
b=$d
c=`expr $c + 1`
done
fi
fi
OUTPUT:
[bgc@localhost ~]$ sh 7.sh
enter number of elements of the fibonacci series:
6
0
1
1
2
3
5
[bgc@localhost ~]$
Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA
5. Find out the factorial of a number.
PROGRAM:
echo "Enter the number:"
read n
fact=1
if [ $n -eq 0 ]
then
echo "fact = "1
else
for i in `seq 1 $n`
do
fact=`expr $fact \* $i`
done
echo "fact = $fact"
fi
OUTPUT:
[bgc@localhost ~]$ sh 6.sh
Enter the number:
3
fact = 6
[bgc@localhost ~]$ sh 6.sh
Enter the number:
2
fact = 2
[bgc@localhost ~]$ sh 6.sh
Enter the number:
0
fact = 1
[bgc@localhost ~]$
Subscribe to:
Posts (Atom)