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

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md

DECODE WAYS - LEETCODE PROBLEM 91

  A message containing letters from   A-Z   is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given a  non-empty  string containing only digits, determine the total number of ways to decode it. Example 1: Input: "12" Output: 2 Explanation:  It could be decoded as "AB" (1 2) or "L" (12). Example 2: Input: "226" Output: 3 Explanation:  It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6). class Solution { public int numDecodings(String s) { int ways=0; ways=countDecoding(s.toCharArray(),s.length()); return ways; } int countDecoding(char[] digits, int n){ // System.out.println(" digits "+disgits[0]); // for base condition "01123" should return 0 // base cases if (n == 0 || (n == 1 && digits[0]!='...