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.

http://www.winentrance.com/ugc_national_eligibility_test_net/ugc-net-computer-science-applications-syllabus.html


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.
           
            https://engistan.com/list-of-psus-for-computer/

           

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. 

            https://iimcat.ac.in/EForms/Mock/Web_App_Template/756/1/index.html?1@@1@@1#!



Labels:

Comments

Post a Comment

.

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 11 25 12 22 64 minimum element12 11 12 25 22 64 minimum element22 11 12 22 25 64 minimum element25 11 12 22 25 64 minimum element64 11 12 22 25 64 Program:- package sorting ; public class SelectionSort { //function to print array public static void print ( int [] arr ) { for ( int i = 0 ; i <= arr . length - 1 ; i ++) System . out . print ( " " + arr [ i ]); System . out . printl...
Post a Comment
Read more

Topics to Start - preparing for Data Structures and Algorithms

Learn in a different way :- Strings stacks and queues heaps searching hash table sorting recursion dynamic programming greedy algorithms graphs tree Binary Search Tree Linked List Array Parallel programming and concurrency design problems system design availability and scalability  Below topics are good to have object oriented programming language details ( java , python) object oriented design tools ( bash , git , maven , jira , jenkins , docker , kubernetes) database
Post a Comment
Read more