Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,2 +1,4 @@
# Autonomous-Tagging-
We present a system that is able to automatically assign tags to questions from the question-answering site StackOverflow.
We present a system that is able to automatically assign tags to questions from the QnA site StackOverflow.
The dataset used is 10% of questions on the Stack Overflow website. <pre> https://www.kaggle.com/stackoverflow/stacksample </pre>
The code is written in python. It uses the <b> Random Forest </b> and <b> SVM </b> classifiers for the classification of tags.
Binary file not shown.
Binary file not shown.
Binary file added Research_Paper/Thapar.pdf
Binary file not shown.
39 changes: 39 additions & 0 deletions linear search
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
/*ARRAYS-LINEAR SEARCH
Take as input N, the size of array. Take N more inputs and store that in an array. Take as input a number M.
Write a function which returns the index on which M is found in the array, in case M is not found -1 is returned.
Print the value returned.*/

#include<iostream>
using namespace std;

int main()
{
int n,x,max=0,a[1000],flag=0;

cout<<"enter the size of the array : ";
cin>>n;

cout<<"enter the elements of the array : ";
for(int i=0;i<n;i++)
{
cin>>a[i];
}

cout<<"enter the number to be searched : ";
cin>>x;

for(int i=0;i<n;i++)
{
if(a[i]==x)
{
cout<<i<<endl;
flag=1;
}
}

if(flag==0)
{
cout<<-1;
}

}
1 change: 1 addition & 0 deletions this.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
does this work ?