Skip to main content

5 EXAMS APART FROM COLLEGE PLACEMENTS FOR B.TECH( COMPUTER SCIENCE)

To write these exams, you don't need support from the college if you have a courage and desire to achieve something big then pick any and go for better future after college.

1.               NET / JRF- This exam you can take for the admission in P.H.D or Research field. Qualifying this exam also makes a person eligible for applying lectureship in the universities.



2.               GATE-
            This exam you can take to get admission into M. Tech program in prestigious institutes such as IIT/IISC. The score is valid for two years and also helps in getting jobs in Public Service Union sectors.

            http://gate.iitk.ac.in/GATE2015/



3.               PSU-

            There are various PSU's like CIL, BEL, IOCL, SAIL e.t.c. which organize their exams separately or take based on the GATE score. One can simply crack them to complete the desire for working in most sought government engineering sector of the country.
           

           

4.               ELITMUS/AMCAT- Through these exams you can get a chance to sit in the off campus recruitment of the various companies. On getting higher percentile companies will call you further for their recruitment events.

            https://www.elitmus.com/jobs

            https://www.myamcat.com/

5.               CAT- Cracking this exam will open the door for the admission in management programs (MBA) after graduation. 




Comments

.

Popular posts from this blog

Selection Sort in JAVA

What is selection sort?

It is a sorting technique that is based on the partitioning of array into two parts, sorted and unsorted.

The process is:-

1) Find minimum element in unsorted array.
2) Swap the element at the end of sorted array.

when i=0 we don't have any sorted array so element will be replaced from first element later the sorted array end will growas the index.

Steps:-


underline elements are sorted array, the length is increasing with each minimum element added at the end.minimum element11 1125122264 minimum element12 1112252264 minimum element22 1112222564 minimum element25 1112222564 minimum element64 1112222564
Program:-


package sorting;publicclassSelectionSort{//function to print arraypublicstaticvoidprint(int[] arr){for(int i=0;i<=arr.length-1;i++) System.out.print(" "+arr[i]); System.out.println(" ");}//function to swap elementspublicstaticint[]swap(int[] arr,int i,int j){int temp; temp=arr[i]; arr[i]=arr[j]; arr[j]=temp…

Bubble Sort in JAVA

What is bubble sort?

It is a sorting technique that is based on the comparison.Here we compare adjacent element, if the first element is larger than the second we swap each other. We do the same procedure again and again until array do not sort completely.

Example:-
5 1 4 2 8



51428here pass is nothing but iterating the loops equal to number of elements in the array but if it already sorted before then we can break the loop anddo existPASS1 case0 1 //check 0 and first element15428 case1 2 //check 1 and 2 element14528 case2 314258 case3 414258 swap istruePASS2 //first pass completed now do second pass case0 114258 case1 212458 case2 312458 case3 412458 swap istrue PASS3 // third pass case0 112458 case1 212458 case2 312458 case3 412458 swap isfalse since swap is false we break from the loop and do not go for fourth and fifth pass
Program:-

package sorting;publicclassBubbleSort{//function to print arraypublicstaticvoidprint(int[] arr){for(int i=0;i<=arr.length-1;i++) Syst…