Theoretical Paper
- Computer Organization
 - Data Structure
 - Digital Electronics
 - Object Oriented Programming
 - Discrete Mathematics
 - Graph Theory
 - Operating Systems
 - Software Engineering
 - Computer Graphics
 - Database Management System
 - Operation Research
 - Computer Networking
 - Image Processing
 - Internet Technologies
 - Micro Processor
 - E-Commerce & ERP
 
Practical Paper
Industrial Training
Linear search in an unsorted array
/* Linear search in an unsorted array. */
#include <stdio.h>
                      #include <conio.h>
void main( )
                      {
                      int arr[10] = { 11, 2, 9, 13, 57, 25, 17, 1, 90, 3 } ;
                      int i, num ;
clrscr( ) ;
 printf ( "Enter number to search: " ) ;
                      scanf ( "%d", &num ) ;
 for ( i = 0 ; i <= 9 ; i++ )
                      {
                      if ( arr[i] == num )
                      break ;
                      }
 if ( i == 10 )
                      printf ( "Number is not present in the array." ) ;
                      else
                      printf ( "The number is at position %d in the array.", i ) ;
 getch( ) ;
                      }
                    
