Skip to main content


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.


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.



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



Popular posts from this blog

Breadth First Search Implementation in Java

Breadth First Search Implementation in Java For Graph Class Design and DFS implementation please refer to below link:- depth-first-search-implementation-in-java /* 1. Pick a vertex. 2. Get Adjacent Vertex. 3. Insert in queue ( at tail) 4. Remove vertex from queue( head) 5. Do until no vertex left in a queue. */ void searchBFS () { //this is how we define queue using LinkedList Queue < Character > queue = new LinkedList < Character >(); queue . add ( vertexlist [ 0 ]. label ); while (! queue . isEmpty ()) { //element at head (Function in main graph class please use above link) ArrayList adjvertex = getNeighbours ( queue . peek ()); System . out . println ( queue . peek ()); //element removed at head queue . remove (); if ( adjvertex != null ) { for ( int i = 0 ; i < adjvertex . size (); i ++) { //element added at tail queue . add