NJS Consultants Interview Questions and Answers

Q1. About yourself educational background family background
Add your answer

Q1. Accounts and experience related questions
Add your answer

Question was moderate. Good knowledge of dsa needed. CP not mandatory.

Q1. Question on oops principals, complexity analysis of programs, c++ concepts of classes, memory allocation etc.
Add your answer
Q2. How much memory is allocated when a class is declared? How much when instance is created ? And so on...
Ans. 
Memory allocation for class and instance creation in Java
• Memory is allocated for class variables and methods when the class is loaded into memory

• Memory for instance variables is allocated when an instance of the class is created

• The amount of memory allocated depends on the data type and size of the variables

• Static variables are allocated memory only once, while instance variables are allocated memory for each instance

• M...read more
Answered by AI
Add your answer

Q1. What do you understand by distributed systems, multitasking multiprograming etc, overview idea of amazon working etc.
Ans. 
Distributed systems involve multiple computers working together, multitasking allows for multiple tasks to be performed simultaneously, Amazon uses distributed systems for their online services.
• Distributed systems involve multiple computers working together to achieve a common goal

• Multitasking allows for multiple tasks to be performed simultaneously by a single computer

• Multiprogramming allows multiple programs to run o...read more
Answered by AI
Add your answer

Q1. Basic hr questions like relocation, aim etc.
Add your answer

Q1. Tell me about yourself, skills, previous positions
Add your answer
Q2. No questions i have further
Add your answer

Q1. Process synchronisation and threads.
Add your answer

Linked list and sorting. Linux system side programming.

Q1. Thread synchronisation. Locking.
Add your answer

Q1. Managerial discussion. Threading and watchdog related stuff.
Add your answer

Tree, LinkedList, Array

Q1. Find depth of a tree
Ans. 
The depth of a tree is the length of the longest path from the root node to any leaf node.
• Depth of a tree can be found using depth-first search (DFS) algorithm.

• The depth of a tree is equal to the maximum depth of its children plus one.

• For example, in a binary tree, the depth of the tree is the maximum depth of the left and right subtrees plus one.
Answered by AI
Add your answer
Q2. Merge two sorted arrays
Ans. 
Merge two sorted arrays into a single sorted array
• Create a new array to store the merged result

• Use two pointers to iterate through both arrays and compare elements

• Add the smaller element to the new array and move the pointer for that array
Answered by AI
Add your answer

Q1. Ap knowledge
Add your answer
Q2. P2p circle end end question
Add your answer

Q1. Ap knowledge
Add your answer