ICICI Securities Intern Interview Questions and Answers

Q1. About your knowledge of finance
Add your answer

Data structure and sql mcq with one coding question

Q1. Implementation of stack and queue
Ans. 
Stack and queue are data structures used to store and retrieve data in a specific order.
• Stack is a Last In First Out (LIFO) data structure, while queue is a First In First Out (FIFO) data structure.

• Stack operations include push (add element) and pop (remove element), while queue operations include enqueue (add element) and dequeue (remove element).

• Example of stack: Undo feature in text editors. Example of queue: Print
Answered by AI
Add your answer

Q1. JAVA oop, design pattern
Add your answer
Q2. JWT Token
Add your answer

Q1. Information about company, sector of company
Add your answer

Round duration - 100 minutes
Round difficulty - Medium

The test was conducted on the AMCAT platform, with webcam and tab-switch monitoring. All questions were mandatory to answer. Coding questions were 2, one being difficult and another's the one given below.

Q1.  Number of Mismatching Bits
Given two integers "first" and "second". Find the number of bits that do not match in the binary representation of the given numbers.
For example, let &quo...read more
Ans. 
Step 1 : I used bitwise shift operators here. I first ran a loop for 'i' from 0 to 32 (as 32 bits is maximum)
Step 2 : Then right shifted the bits of both numbers by 'i' places.
Step 3 : Checked whether the bit at 0th position is different, if yes then increase the counter variable.
Step 4 : Using bitwise AND by 1 for both numbers to get the 1st bit.
Step 5 : Displayed the count.
Answered by CodingNinjas
View 2 more answers

Round duration - 50 minutes
Round difficulty - Medium

This technical interview was scheduled at 9 AM for me.

Q1. BST Delete
You are given a binary search tree (BST) and a key value 'K'. You need to delete the node with value 'K'. It is guaranteed that a node has the value 'K'.
A binary searc...read more
Ans. 
Step 1 : I used Java to code the given problem for all three cases of node deletions.
Step 2 : For the time complexity, the worst case time complexity of delete operation is O(h) where h is height of Binary Search Tree. In worst case, we may have to travel from root to the deepest leaf node. The height of a skewed tree may become n and the time complexity of delete operation may become O(n).
Step 3 : In case of code opti...read more
Answered by CodingNinjas
View 2 more answers
Q2. What is process synchronization? 
Ans. 
Tip 1 : Go through the concepts and their implementation.
Tip 2 : Be thorough with the working of various algorithms.
Answered by CodingNinjas
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Took place in the evening, this round assessed the overall personality. Followed by a discussion on the resume; the international accolades I had received in Computer Science and in extracurriculars, my experiences, future goals and so on.
Lastly, I was asked if I had any questions and about the preferred locations.

Q1. Behavioural Questions
Ans. 
Tip 1: Don’t be afraid to be candid and assertive because those are the precise qualities the HR recruiter is looking to assess in you.
Tip 2: Prepare yourself to discuss and provide lots of examples to back up your experience.
Answered by CodingNinjas
Add your answer