Atrenta On-Campus interview experience

I am writing this post to help other people aspiring for a job at Atrenta. At this point I am typing in a little hurry, so please expect and ignore grammatical mistakes.

Written Round:
Time : 1 hour
3 sections- CSE based + ECE based + general puzzle
Priority: 1st: CSE, 2nd: Puzzle, 3rd: ECE
1. CSE based: Questions based on C/C++. "C programming concepts" by Jitender Chabra Sir should suffice. Around 12-13 problems were there in this section. Problems were like "find the output", "complete the code", "write the code" etc.
2. Puzzle section: General puzzles. If you know the answer, you can ace otherwise there is little time to think. Around 10 questions.
3. ECE section: Around 10 questions. Based on simple ece concepts like flip-flops, boolean expressions, decoder etc.

I attempted all problems from CSE section (in around 30 minutes), 6-7 questions from puzzle section (around 15-20 minutes), and around 5 questions from ece part (last 10-15 minutes).

-> Make sure you are comfortable with pointers.

Interview: 
1st round:
He,
* Asked two puzzles.
* Asked me to write a vhdl program as I had mentioned it in my resume.
* Asked me to write a class for library management system (complete class, yes, destructor too).
* Asked me the minimum spanning tree algorithms, indirectly.
* 1-2 other stack-queue problems that I don't remember.

2nd round:
* Long discussion on finding connected components in a graph forest, along with full code and complexity analysis.
* Another discussion on hash tables.

3rd round:
The interviewer asked me about my academic projects. Few simple problems on data structures, like finding loop in a linked list.

Later after all the interviews, they announced the result and I was selected.

For any clarification, please either comment, or contact me at sanjay.verma.nitk@gmail.com or facebook.com/sanjay.verma.nitk

Comments

Post a Comment

Popular posts from this blog

C Graph implementation with adjacency list representation using structures: Data Structure Tutorial 1

Image
This is a quick tutorial for implementing graph data structure with adjacency list representation. Once I was  looking on the web to have a simple introductory tutorial on graphs, but unfortunately couldn’t find one  simple enough. So I decided to write this. In the adjacency list representation, è All the vertices are stored in an array of structure containing ‘data’ and ‘link’ fields. è The linked chains represent the edges of a vertex with its neighbors. In the figure, there are 6 vertices, represented by the array of length 6, and the chains represent the edges. Below is another example: Let us first define the structure of a vertex in a graph. struct vertex {     int vertexKey;     struct edge *edgePtr; }vertex; The vertexKey is the data field of the vertex, and edgePtr is the edge pointer, declared next. The graph can be declared as: struct vertex graph[10]; int vertexCount=0; Here...
Read more

Roadies X Winner is Palak Johal!!

Image
Palak Johal, claimed the title of 10th season of famous MTV reality show Roadies, Battle For Glory. Palak, who proved himself the strongest contestant, defeated 15 contestants  and took home a cheque of Rs 4,50,000 and a Hero bike. The other Hero Roadies X Contestants of the finale were Raman Deep, Mohit and Anirudh. Palak- Winner of Roadies X The final  episode of Roadies X began with all the eliminated Roadies entering the location where they clashed with the final four. These four were the finalites: The two boys got eliminated in the rope task. So the ultimate battle was between Ramandeep and Palak. Too bad, isn't it.. most of us wanted Mohit or Anirudh to claim the title. So, the final battle concluded to between Ramandeep and Palak! And finally, Palak Claimed the title of Roadies X, battle for glory !!! Like always Raghu Ram, his twin brother Rajiv Laxman and Rannvijay were the judges. How did you like the 10th s...
Read more

Interview Of An Indian Top Coder : Rudradev Basak

When I (Anil Kishore) started taking part in algorithmic programming contests, for more than two years, it was just me, lot of problems, very few algorithms, my ideas and my Java codes. With that, I would have probably been still a green rated coder, working for a software company in Bangalore after moving between two or three places, still in search of the right things to do. But why ? Problems, Algorithms, my Ideas and my Codes.. what else I need ? This is where many Indian coders make mistake. Almost two years after joining TopCoder (TC), I started interacting with fellow coders, knowing more about them, reading lots of others codes, being active in forums and part of the wonderful community. That was the crucial part of my career so far. TC has some interviews of foreign coders and they are very interesting to read. Knowing more about our own Indian coders will be more fun, especially for beginners to get inspired. This is the least I can contribute to the wonderful community tha...
Read more