IG Group Technical Architect Interview Questions and Answers

Q1. Recursion program
Ans. 
Recursion is a programming technique where a function calls itself to solve smaller instances of a problem.
• Recursion involves a base case and a recursive case. Example: Factorial function.

• Base case stops recursion. Example: factorial(0) = 1.

• Recursive case breaks problem into smaller parts. Example: factorial(n) = n * factorial(n-1).

• Recursion can lead to elegant solutions but may cause stack overflow if too deep.

• Tail re...read more
Answered by AI
Add your answer
Q2. System Design questions based on current project
Add your answer
Q3. Micro service design patterns
Ans. 
Micro service design patterns are architectural patterns used to design and implement microservices.
• Service discovery

• Circuit breaker

• API gateway

• Event sourcing

• Saga pattern
Answered by AI
Add your answer

Q1. General Discussion around Architecture
Add your answer

Q1. General Discussion around Architecture
Add your answer

Q1. General HR related Questions
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

Q1. 
Zigzag Traversal of Binary Tree
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
Note:
In zigzag order, level 1 is printed from left to right...read more
Ans. 
Implement a function to print the zigzag traversal of a binary tree.
• Traverse the tree level by level, alternating the direction of traversal for each level.

• Use a queue to keep track of nodes at each level.

• Print the nodes in zigzag order as per the given pattern.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. 
Identify all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime

• Use the Sieve of Eratosthenes algorithm for better efficiency

• Optimize by only checking up to the square root of N for divisors
Answered by AI
Add your answer
Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
Ans. 
DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.
• Used DBMS to store and manage project data efficiently

• Optimized queries for better performance

• Designed database schema to handle data effectively

• Resolved concurrency issues by implementing proper locking mechanisms
Answered by AI
Add your answer

Q1. Pl sql Unix api configuration
Add your answer
Q2. Routing how to use proxy
Ans. 
Routing through a proxy involves configuring the proxy server to forward requests to the destination server.
• Configure the proxy server to listen for incoming requests

• Configure the proxy server to forward requests to the destination server

• Configure the client to use the proxy server for outgoing requests

• Use a proxy server to bypass network restrictions or improve performance

• Examples: Nginx, Apache, Squid
Answered by AI
Add your answer