@technover you can mail team@careerhunt.net to get in touch with any of our mentors

Jayshree Jain

Hello GATE-2016 Aspirants!
I attempted GATE 2015 and Qualified with AIR-852.
I have some general suggestions for you all:

Never Skip any subject , I skipped Software Engg and had suffered a loss of 3 ques. Regularly practice " Mathematics " (Engg+Discrete) , the common mistake that most of the candidate makes is they prepare hard technical subjects and leave Maths for future( the future that is uncertain to come). There is no particular weightage of subjects in GATE, prepare every subject equally. Don't try to solve practice questions without even going through the actual concepts (theory) by your own - This is especially for the students those who have joined some coaching.
[ Remember, there is no shortcut to success. ] Smart work will bring you under AIR-100 , hard work may bring lesser rank. I am saying so because I am a victim.
Thanks for reading this. Prepare hard and be open to new questions and concepts.

How to crack GATE2018 in one month, read this post
http://thecentreforcse.blogspot.in/2017/12/how-to-crack-gate-2018-in-last-one-month.html

Linked List Programming Questions asked in an interview:

Some people find linked list quite a tough topic because of the pointers included, but once you learn the basics well, you can solve any question. Always draw a linked list on a paper with all the addresses of nodes and the next pointers and then find the solution to the problem. It will make your task very easy.
You should know well how to insert at any position, delete at any position, modify a single linked list, double linked list and circular linked list.

Here are some questions asked in interviews:

 Reverse a Linked List
 Check whether the link list contains a loop
 Remove loop in a linked list
 Find the middle element in linked list (in O(n) and in one scan)
 Find the nth element from the last in the given linked list
 Reverse a linked list in groups of given size.
 Rotate a linked list
 Sort a linked list or Merge two sorted linked lists (Merge Sort)
 Check a linked list is palindrome or not.
 Clone a given linked list

If you are able to do these problems on your own, your chances of solving a linked list problem in interview becomes 95%. Start practicing as linked list will serve as a base for you to understand higher data structures like trees and graphs. All the best.

Checkout "HTML, css and JavaScript" course on coursera for front end. If you are interested in backend then check out Udacity's intro to web development course by Steve Huffman.

arvind 14 days ago
What is Apache Spark?
Apache Spark is an open-source data processing framework for Big Data Analytics. It is unified and parallel data processing framework, designed to cover a wide range of big data workloads such as Batch processing, Real-time processing, Stream analytics, Machine learning and Interactive SQL. Apart from supporting all these workloads in a system, Spark lessens the burden of memory and tools management.
Apache Spark was initially developed in UC Berkeley’s AMP Lab in the year 2009 but was open sourced in 2010 under BSD license. It was donated to Apache Software Foundation in 2013 and became an Apache project since 2014. It is now considered as an alternative to all other big data technologies.
Spark has originally been written in Scala programming language and runs on Java Virtual Machine environment (JVM Environment). It supports multiple programming languages for developing applications, these are – Scala, Java, Python, SQL, and R.

Youtube Video

Operating System Concepts:
Operating system is a program that controls both hardware and software on a device.
The major components are,

Process Management
Memory management
File management
Device management

Few questions can be asked in interview

What is marshaling Why paging is used What is virtual memory What is the difference between hard and soft real-time system. What is multi-tasking, multi programming, multi-threading. What is fragmentation? different types of it?

1.http://www.programminglogic.com/introduction-to-probability/
2.The Only Probability Cheatsheet You’ll Ever Need – William Chen
3.Introduction to Probability – Charles M. Grinstead, J. Laurie Snell
4.Introduction to Probability – Dimitri P. Bertsekas, John N. Tsitsiklis (MIT)
5.A Short Introduction to Probability – Dirk P. Kroese (University of Queensland)
6.Probability: Theory and Examples – Rick Durrett
7.Probability and Statistics Cookbook – Matthias Vallentin (UC Berkeley)
8.https://www.khanacademy.org/math/probability/
9.http://athenasc.com/probbook.html
10.https://people.cs.umass.edu/…/240F11…/intro_probability.pdf
11.https://www.probabilitycourse.com/
12.Introductory Probability and Statistical Applications by Paul L. Meyer
13.A Course in Probability Theory, Revised Edition, Second Edition by Kai Lai Chung
14.Probability Theory: The Logic of Science – E. T. Jaynes
15.First Look at Rigorous Probability Theory by Jeffrey S. Rosenthal

One can learn Mongo Database from Mongo Database University(https://university.mongodb.com/). They offer the free courses with certification after completing it successfully.

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-823-computer-system-architecture-fall-2005/lecture-notes/

Youtube Video

The difference between a semi-join and a conventional join is that rows in the first table will be returned at most once. Even if the second table contains two matches for a row in the first table, only one copy of the row will be returned. Semi-joins are written using the EXISTS or IN constructs.

STUDY MATERIALS
https://drive.google.com/drive/folders/0B33aKxI-RH2xQzB0b3FGUHBETzg

ARTICLES
http://www.theserverside.com/definition/J2EE-Java-2-Platform-Enterprise-Edition

BOOKS
http://javarevisited.blogspot.in/2017/05/top-10-free-java-programming-books-ebooks-pdf.html#axzz4hEdpa8Z8

EBOOK
https://drive.google.com/open?id=0B33aKxI-RH2xRGhlSTMyNHdsV1E

Objects are abstract computers. You decouple the notion of a "computer" from the physical hardware on your desk. The paradigm holds from a single object representing "1" right up to the internet (an object orientated network). Its objects all the way up and all the way, which is just another way of saying that it is "computers" all the way up and all the way down. A desktop PC can hold a thousand "computers" just as the internet can hold a million computers (each holding a millions computers).

https://www.youtube.com/playlist?list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab

refer book by Todd Lammle

http://people.cs.ksu.edu/~rhowell/algorithms-text/text/