Write C++ program to store and search roll numbers of student in array who attended training program in random order

Second Year Computer Engineering Data Structure Programs:

Data Structure Lab:

Practical E32:
Write C++ program to store roll numbers of student in array who attended training program in random order. Write function for-
a) Searching whether particular student attended training program or not using linear search and sentinel search. b) Searching whether particular student attended training program or not using binary search and Fibonacci search

----------------------------------------------------------------------------------------------------------------------------------

#include<iostream>
using namespace std;
class search
{  public:
        int n,i,data[50],son[50],sortdata[50],s;
 void intake()
{     cout<<"Enter No. of Elements=";
 cin>>n;
 cout<<"\nEnter Elements=\n";
 for(i=1;i<=n;i++)
 {   cin>>data[i];
     son[i]=data[i];
 }
}
void search_lini(int item)
{   s=0;
 for(i=1;i<=n;i++)
 {  if(data[i]==item)
    {   s=1;
        break;
    }
 }
 if(s==1)
 cout<<"attended training program:\n";
 else
cout<<"didn't attended training program:\n";
}
void search_senti(int a)
{  int i=0;
 while(data[i]!=a && i<n)
 { i++; }
 if(i<n)
    cout<<a<<" attended Training Program.\n";
 else
    cout<<a<<" didn't attend Training Program.\n";
}
void search_bin(int x)
{   int y=0;
    int left, right,mid;
    left=0;
    right=n-1;
    while(left<=right)
    {   mid=(left+right)/2;
        if(data[mid]==x)
        {   y=1;
            break;
        }
        else if(data[mid]>x)
            right = mid-1;
        else if(data[mid]<x)
            left=mid+1;
    }
    if(y==1)
        { cout<<x<<" attended Training Program.\n"; }
    else
        { cout<<x<<" didn't attend Training Program.\n"; }
}
int fibsearch(int x)
{   int inf = 0, pos, k;
   static int kk= -1, nn = -1;
    static int fib[]={0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 98,
    1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,
    514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817,
    39088169, 63245986, 102334155, 165580141};
    if (nn != n)
    {      k = 0;
        while (fib[k] < n)
            k++;
        kk = k;
        nn = n;
    }
    else
        k = kk;
    while (k > 0)
    {    pos = inf + fib[--k];
        if ((pos >= n) || (x < data[pos]));

        else if (x > data[pos])
        {    inf = pos + 1;
             k--;
        }
        else
           return pos;
    }
    return -1;
}
void sort()
{   int p,j,temp;
for(p=1;p<=n-1;p++)
{   for(j=1;j<=n-1;j++)
   {   if(data[j]>data[j+1])
       {
            temp=data[j];
            data[j]=data[j+1];
            data[j+1]=temp;
       }
   }
    }
}
};
int main()
{ int s,r,pos;
char y='y';
search t;
t.intake();
t.sort();
while(y=='y')
{
   cout<<"\n::Menu::\n"<<"1. Linear Search.\n2. Sentinel Search.\n3. Binary Search.\n4.fibonacci search";
   cin>>s;
   cout<<"Enter Roll no. to search:";
   cin>>r;
switch(s)
{ case 1: cout<<"\tUsing Linear Search :\n";
           t.search_lini(r);
           break;
   case 3: cout<<"\tUsing Binary Search :\n";
           t.search_bin(r);
           break;
   case 2: cout<<"\tUsing Sentinel Search :\n";
           t.search_senti(r);
                break;
   case 4: cout<<"\tUsing fibonacci search:\n";
    pos=t.fibsearch(r);
    if(pos>=0)
 cout<<"attended training program"<<endl;
else
cout<<"didn't attended training program"<<endl;
           break;
}
cout<<"do u want to continue(y/n)";
cin>>y;
   }
return 0;
}

----------------------------------------------------------------------------------------------------------------------------------

/*
************output********************
Enter No. of Elements=5

Enter Elements=
5
4
3
2
1

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search3
Enter Roll no. to search:2
Using Binary Search :
2 attended Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search3
Enter Roll no. to search:6
Using Binary Search :
6 didn't attend Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search2
Enter Roll no. to search:1
Using Sentinel Search :
1 attended Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search1
Enter Roll no. to search:6
Using Linear Search :
didn't attended training programdo u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search2
Enter Roll no. to search:4
Using Sentinel Search :
4 attended Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search2
Enter Roll no. to search:6
Using Sentinel Search :
6 didn't attend Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search3
Enter Roll no. to search:2
Using Binary Search :
2 attended Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search3
Enter Roll no. to search:6
Using Binary Search :
6 didn't attend Training Program.
do u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search4
Enter Roll no. to search:1
Using fibonacci search:
attended training programdo u want to continue(y/n)y

::Menu::
1. Linear Search.
2. Sentinel Search.
3. Binary Search.
4.fibonacci search4
Enter Roll no. to search:6
Using fibonacci search:
didn't attended training programdo u want to continue(y/n)n
*/

Comments

  1. umairNovember 27, 2018 at 6:02 AM

    A number is a concept that arises from the result to have things that are an aggregate or a generalization of this concept.
    numbers

    ReplyDelete
  2. UnknownDecember 19, 2021 at 9:33 PM

    I really enjoy the blog article.Much thanks again.
    dot net online training india
    net coure

    ReplyDelete

Post a Comment

Popular posts from this blog

Implement C++ program for expression conversion as infix to postfix and its evaluation using stack.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical C25: Implement C++ program for expression conversion as infix to postfix and its evaluation using stack based on given conditions i. Operands and operator, both must be single character. ii. Input Postfix expression must be in a desired format. iii. Only '+', '-', '*' and '/ ' operators are expected. ---------------------------------------------------------------------------------------------------------------------------------- #include<iostream> #include<conio.h> using namespace std; class stack {  public:   char stack_array[50];   int top;   stack()   {     top=-1;   } void push(char symbol) {  if(full())       cout<<"\nStack overflow:\n";     else     { top=top+1;       stack_array[top]=symbol;      } } char pop() {   if(empty())        return('#');         // Return value '#' indica
Read more

Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical B14: Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of Second, third and final year of department can be granted membership on request. Similarly one may cancel the membership of club. First node is reserved for president of club and last node is reserved for secretary of club. Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name. Write functions to a) Add and delete the members as well as president or even secretary. b) Compute total number of members of club c) Display members d) Display list in reverse order using recursion e) Two linked lists exists for two divisions. Concatenate two lists. ------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <string.h> usin
Read more

Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick.

Second Year Computer Engineering Computer Graphics Programs: Computer Graphics Lab: Practical B10: Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick. ---------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <stdlib.h> #include <graphics.h> #include <math.h> using namespace std; int xmax,ymax,xmid,ymid; class Line { public: int x1,x2,y1,y2,ch;        void bss(int x1,int y1,int x2,int y2)           {             int dx,dy,x,y,s1,s2,ex,e,i,flag=0,temp;                         dx=abs(x2-x1);             dy=abs(y2-y1);             x=x1;             y=y1;             putpixel(x+xmid,ymid-y,15);                  if(x2>x1)              { s1=1;           }              if(x2==x1)              { s1=0;     }              if(x2
Read more