Belzabar Recruitment Process

  • Last Updated : 26 Oct, 2017

About Company :

Belzabar Software Design is a Mobile and Web-based software boutique, Headquartered in the US. In India, their development offices are in New Delhi and in Pune, both were started in 2012. They worked with several Fortune 500 companies, various government agencies and universities and startups.

Know more about Belzabar;

Belzabar LOGO

Recruitment Process :

Belzabar conducts 4-6 rounds to select freshers as Assistant System Engineer in their organisation.

  • Written Round
  • Technical Round 1
  • Technical Round 2
  • Technical Round 3
  • HR Round
  • Technical Round with Director

Academic Criteria :

  • 60 percent or above in B.Tech, Class X and XII.
  • No backlogs at the time of interview

Written Round :
The Written round consists of two major sections namely General Aptitude Test and Verbal Ability Test. General Aptitude Test, has mathematical reasoning part and logical reasoning part and verbal ability Test. Sometimes this round is online coding round. You would be expected to solve 3-4 coding problems in a language of your choice.

Technical Rounds :
The students who clear the written round are called for Technical Interview.To clear this round you should be clear with your basics. You should be prepared with Data structures and Algorithms, DBMS, OOPs concepts and a programming language of your choice. CS students will be expected to write codes in the interview. They also ask questions from resume. You may be asked puzzles in this round. To be prepared for puzzles you can practice from our Puzzles section.

HR Round :
Sometimes they only ask HR questions like :
1. Tell me about Yourself
2. Why you want to join Belzabar ?
4. What are your strengths and weaknesses ?
5. Questions form resume

Technical Round with Director
This is an optional round. In this round you are introduced to the director. Also you can aspect some technical as well as HR questions.

Questions Asked in Belzabar :

  1. Find median in a stream
  2. Snake and Ladder Problem
  3. [Mirror Tree (Function Problem)]
  4. Merge two sorted linked lists (Function Problem)
  5. Heap Sort (Function Problem)
  6. Check for Balanced Tree (Function Problem)
  7. What is BST?
  8. What is the resident set and working set of a process?
  9. Does garbage collection guarantee that a program will not run out of memory?
  10. How are Observer and Observable used?
  11. more >>

Interview Experiences

It is always beneficial if you know what it is to be there at that moment. So, to give you an advantage, we provide you Interview Experiences of candidates who have been in your situation earlier. Make the most of it.

Where to Apply ?

This article is contributed by Amit Khandelwal. If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up

Writing code in comment? Please use, generate link and share the link here.