Computer Science Tutorials

MACHINE LEARNING OBJECTIVES: Familiarity with a set of well-known supervised, unsupervised and semi-supervise   Learning algorithms.   The ability to implement some basic machine learning algorithm. Understanding of how machine learning algorithms are evaluated. OUTCOMES: Recognize the characteristics of machine learning that make it useful to real-world Problems. Characterize machine-learning algorithms as supervised, semi-supervised, and unsupervised. Have heard of a few machine learning toolboxes. Be able to use support vector machines. Be able to use regularized regression algorithms. Understand the concept behind neural networks for learning non-linear functions.

MACHINE LEARNING UNIT -I: The ingredients of machine learning, Tasks: the problems that can be solved with machine learning, Models: the output of machine learning, Features, the workhorses of machine learning. Binary classification and related tasks: Classification, Scoring and ranking, Class probability estimation UNIT-II: Beyond binary classification:  Handling more than two classes, Regression, Unsupervised and descriptive learning. Concept learning : The hypothesis space, Paths through the hypothesis space, Beyond conjunctive concepts UNIT- III: Tree models: Decision trees, Ranking and probability estimation trees, Tree learning as variance reduction. Rule models: Learning ordered rule lists, Learning unordered rule sets, Descriptive rule learning, First-order rule learning UNIT-IV: Linear models: The least-squares method, The perceptron: a heuristic learning algorithm for linear classifiers, Support vector machines, obtaining probabilities from linear cla...

Assignment I 1. What is meant by Data mining? Explain with neat sketch of Knowledge Discovery from Data? 2. Discuss about major issues in data mining? 3. Explain what kind of data can be mined? ======================================================================== Assignment II 1. What is meant by data pre-processing? Explain with major Tasks in Data pre-processing? 2. What is lossless and lossy dimensionality reduction? Describe any one technique for lossy dimensionality reduction? 3. Explain the data cleaning Techniques? ======================================================================== Assignment III 1. Define Classification? Explain the General approach to solving a classification problem? 2. Explain the methods for expressing an attribute set conditions? 3. Discuss various measures to selecting the best split.?

DATA WAREHOUSING AND DATA MINING UNIT –I: Introduction: Why Data Mining? What Is Data Mining? What Kinds of Data Can Be Mined? What Kinds of Patterns Can Be Mined? Which Technologies Are Used? Which Kinds of Applications Are Targeted? Major Issues in Data Mining. Data Objects and Attribute Types, Basic Statistical Descriptions of Data, Data Visualization, Measuring Data Similarity and Dissimilarity UNIT –II: Data Pre-processing: Data Preprocessing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation, and Data Discretization UNIT –III: Classification: Basic Concepts, General Approach to solving a classification problem, Decision Tree Induction: Working of Decision Tree, building a decision tree, methods for expressing an attribute test condition, measures for selecting the best split, Algorithm for decision tree induction. UNIT –IV: Classification: Alternative Techniques, Bayes’ Theorem, Naïve Bayesian Classification, Bayesian Belief Networks...

DATA MINING As Per the JNTU Kakinada Syllabus, tutorials will be available here S.No Description Download Links 1. Data Warehousing and Data Mining Syllabus     Click Here 2. DWDM Text Book     Click Here 3. Data Mining  Material Unit -1     Click Here Unit -2      Click Here Unit -3    Click Here Unit -4    Click Here Unit -5    Click Here Unit -6    Click Here 4. Data Mining Previous Question Papers 2016     Click Here   DWDM Powerpoint Presentation             Unit- 1                                                                Click Here             ...

Why is naive Bayesian classification called “naive”? Briefly outline the major ideas of naive Bayesian classification. Naive Bayesian classification is called naive because it assumes class conditional independence. That is, the effect of an attribute value on a given class is independent of the values of the other attributes. This assumption is made to reduce computational costs, and hence is considered “na¨ıve”. The major idea behind na¨ıve Bayesian classification is to try and classify data by maximizing P(X|Ci)P(Ci) (where i is an index of the class) using the Bayes’ theorem of posterior probability.  In general:  We are given a set of unknown data tuples, where each tuple is represented by an n-dimensional vector, X = (x1, x2. . . xn) depicting n measurements made on the tuple from n attributes, respectively A1,A2, ..,An. We are also given a set of m classes, C1,C2, . . .Cm.  Using Bayes theorem, the na¨ıve Bayesian classifier calculates the posterior pr...

Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning? The decision tree built may overfit the training data. There could be too many branches, some of which may reflect anomalies in the training data due to noise or outliers. Tree pruning addresses this issue of overfitting the data by removing the least reliable branches (using statistical measures). This generally results in a more compact and reliable decision tree that is faster and more accurate in its classification of data. The drawback of using a separate set of tuples to evaluate pruning is that it may not be representative of the training tuples used to create the original decision tree. If the separate set of tuples are skewed, then using them to evaluate the pruned tree would not be a good indicator of the pruned tree’s classification accuracy. Furthermore, using a separate set of tuples to evaluate pruning means there are less tuples to use for ...

UNIT-I What is an operating system? Describe the  Operating System functions Explain the Time- shared Operating System  Explain different categories of system calls with suitable example?  With a neat sketch, describe the services that an operating system provides to users, processes and other systems. What is the purpose of interrupts? What are the differences between a trap and an interrupt? Can traps be generated by a user program? Explain the purpose with an example. Explain briefly Layered Operating system structure with neat sketch. UNIT-II What is a process? Explain about various fields of Process Control Block.  Define a Thread? Give the benefits of multithreading. What resources are used when a thread is created? How do they differ from those used when a process is created?  Distinguish between preemptive and non-preemptive scheduling. Explain each type with an example.  What is IPC? Explain in detail the inter process commu...

Scheduling algorithms may use different criteria for selecting process from the ready list. In general,scheduling algorithm may be preemptive or nonpreemptive. Four circumstances are used for making scheduling decisions. 1. When a process switches from running state to the waiting state. 2. When a process switches from the running state to the ready state. 3. When a process switches from the waiting state to the ready state. 4. When a process terminates. Preemptive scheduling takes place for circumstances 2 and 3. Nonpreemptive scheduling takes place under circumstances 1 and 4. For 1 and 4 circumstances, scheduling is not possible and for remaining circumstance, scheduling is possible. In preemptive scheduling, a running process may be replaced by a higher priority process at any time. Preemptive scheduling is more responsive but it imposes higher overhead since each process rescheduling entails a complete process switch. In Nonpreemptive scheduling, once the CPU has been all...

#include<stdio.h> #include<conio.h> void main() { int m,p,s,p1; int m1[4],i,f,f1=0,f2=0,fra1,fra2,s1; clrscr(); printf("Enter the memory size:"); scanf("%d",&m); printf("Enter the no of partitions:"); scanf("%d",&p); s=m/p; printf("Each partn size is:%d",s); printf("\nEnter the no of processes:"); scanf("%d",&p1); for(i=0;i<p1;i++) { printf("\nEnter the memory req for process%d:",i+1); scanf("%d",&m1[i]); if(m1[i]<=s) { printf("\nProcess is allocated in partition%d",i+1); fra1=s-m1[i]; printf("\nInternal fragmentation for process is:%d",fra1); f1=f1+fra1; } else { printf("\nProcess not allocated in partition%d",i+1); s1=m1[i]-s; fra2=s-s1; f2=f2+fra2; printf("\nExternal fragmentation for partition is:%d",fra2); } } printf("\nProcess\tmemory\tallocatedmemory"); for(i=0;i<p1;i++) pr...

#include<stdio.h>  #include<conio.h>  void main()  {  int m=0,m1=0,m2=0,p,count=0,i;  clrscr();  printf("Enter the memory capacity:"); scanf("%d",&m); printf("Enter the no of processes:");  scanf("%d",&p); for(i=0;i<p;i++)  {  printf("\nEnter memory req for process%d: ",i+1);  scanf("%d",&m1); count=count+m1;  if(m1<=m)  {  if(count==m)  {  printf("There is no further memory remaining:");  }  else  {  printf("The memory allocated for process%d is: %d ",i+1,m);  m2=m-m1;  printf("\nRemaining memory is: %d",m2);  m=m2; }  }  else  {  printf("Memory is not allocated for process%d",i+1);  }  printf("\nExternal fragmentation for this process is:%d",m2);  }  getch();  }

#include<stdio.h> #include<conio.h> void main() { int et[30],ts,n,i,x=0,tot=0; char pn[10][10]; clrscr(); printf("Enter the no of processes:"); scanf("%d",&n); printf("Enter the time quantum:"); scanf("%d",&ts); for(i=0;i<n;i++) { printf("enter process name & estimated time:"); scanf("%s %d",pn[i],&et[i]); } printf("The processes are:"); for(i=0;i<n;i++) printf("process %d: %s\n",i+1,pn[i]); for(i=0;i<n;i++) tot=tot+et[i]; while(x!=tot) { for(i=0;i<n;i++) { if(et[i]>ts) { x=x+ts; printf("\n %s -> %d",pn[i],ts); et[i]=et[i]-ts; } else if((et[i]<=ts)&&et[i]!=0) { x=x+et[i]; printf("\n %s -> %d",pn[i],et[i]); et[i]=0;} } } printf("\n Total Estimated Time:%d",x); getch(); } 

#include<stdio.h>  #include<conio.h>  #include<string.h>  void main()  {  int et[20],at[10],n,i,j,temp,p[10],st[10],ft[10],wt[10],ta[10];  int totwt=0,totta=0;  float awt,ata; char pn[10][10],t[10];  clrscr();  printf("Enter the number of process:");  scanf("%d",&n); for(i=0;i<n;i++)  {  printf("Enter process name,arrivaltime,execution time & priority:"); flushall();  scanf("%s%d%d%d",pn[i],&at[i],&et[i],&p[i]); }  for(i=0;i<n;i++)  for(j=0;j<n;j++)  {  if(p[i]<p[j]) {  temp=p[i]; p[i]=p[j]; p[j]=temp;  temp=at[i];  at[i]=at[j]; at[j]=temp; temp=et[i];  et[i]=et[j]; et[j]=temp; strcpy(t,pn[i]);  strcpy(pn[i],pn[j]);  strcpy(pn[j],t);  }  }  for(i=0;i<n;i++)  { if(i==0) { st[i]=at[i]; wt[i]=st[i]-at[i]; ft[i]=st[i]+et[i]; ta[i]=ft[i]-at[i]; } else { st[i]=ft[i-1]; wt[i]=st[i]-at[i]; ft[i]=st[i]+et...

#include<stdio.h> #include<conio.h> #include<string.h> void main() { int et[20],at[10],n,i,j,temp,st[10],ft[10],wt[10],ta[10]; int totwt=0,totta=0; float awt,ata; char pn[10][10],t[10]; clrscr(); printf("Enter the number of process:"); scanf("%d",&n); for(i=0;i<n;i++) { printf("Enter process name, arrival time & execution time:"); flushall(); scanf("%s%d%d",pn[i],&at[i],&et[i]); } for(i=0;i<n;i++) for(j=0;j<n;j++) { if(et[i]<et[j]) { temp=at[i]; at[i]=at[j]; at[j]=temp; temp=et[i]; et[i]=et[j]; et[j]=temp; strcpy(t,pn[i]); strcpy(pn[i],pn[j]); strcpy(pn[j],t); } } for(i=0;i<n;i++) { if(i==0) st[i]=at[i]; else st[i]=ft[i-1]; wt[i]=st[i]-at[i]; ft[i]=st[i]+et[i]; ta[i]=ft[i]-at[i]; totwt+=wt[i]; totta+=ta[i]; } awt=(float)totwt/n; ata=(float)totta/n; printf("\nPname\tarrivaltime\texecutiontime\twaitingtime\ttatime"); for(i=0;i<n;i++) printf("\n%s\t%5d\t\t%5d\t\t%5d\t\t%5d",pn...

#include<stdio.h>  #include<conio.h>  void main()  {  `char pn[10][10];  int arr[10],bur[10],star[10],finish[10],tat[10],wt[10],i,n;  int totwt=0,tottat=0;  clrscr();  printf("Enter the number of processes:");  scanf("%d",&n); for(i=0;i<n;i++)  {  printf("Enter the Process Name, Arrival Time & Burst Time:");  scanf("%s%d%d",&pn[i],&arr[i],&bur[i]);  }  for(i=0;i<n;i++)  {  if(i==0)  {  star[i]=arr[i]; wt[i]=star[i]-arr[i]; finish[i]=star[i]+bur[i]; tat[i]=finish[i]-arr[i];  }  else  {  star[i]=finish[i-1]; wt[i]=star[i]-arr[i]; finish[i]=star[i]+bur[i]; tat[i]=finish[i]-arr[i];  }  }  printf("\nPName Arrtime Burtime Start TAT Finish");&#0; for(i=0;i<n;i++)  {  printf("\n%s\t%6d\t\t%6d\t%6d\t%6d\t%6d",pn[i],arr[i],bur[i],star[i],tat[i],finish[i]);  totwt+=wt[i];  tottat+=tat[i];  }  printf(...