Ignitarium Technology Solutions Senior Engineer Interview Questions and Answers

Q1. Asked about last experience and sales network in PSU's
Add your answer

Q1. Location preference and relocation timing.
Add your answer

Q1. They asked about technical
Add your answer
Q2. Provide answers for the same
Add your answer

Q1. They asked about technical
Add your answer
Q2. Answers according to question
Add your answer

Q1. Add two linked list
Ans. 
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
• Create a dummy node to hold the result.

• Initialize current node to dummy node.

• Iterate through both lists, adding values and carry from previous addition.

• Move to next nodes in both lists.

• Handle cases where one list is longer than the other.

• Handle final carry if present.
Answered by AI
Add your answer
Q2. Find shortest path in graph
Ans. 
Use Dijkstra's algorithm to find the shortest path in a graph
• Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

• Maintain a priority queue to keep track of the shortest distance to each node

• Update the shortest distance to each node as you traverse the graph

• Track the path by storing the previous node for each node visited
Answered by AI
Add your answer

Q1. Check tree is BST
Ans. 
Check if a binary tree is a Binary Search Tree (BST)
• Perform an in-order traversal of the tree and check if the resulting array is sorted

• Keep track of the previous node value during traversal to compare with the current node value

• Ensure that each node's value is greater than the previous node's value in the in-order traversal
Answered by AI
Add your answer
Q2. Check substring palindrome or not
Ans. 
Check if a substring in an array of strings is a palindrome or not.
• Iterate through each string in the array

• For each string, check if any of its substrings are palindromes

• Return true if a palindrome substring is found, false otherwise
Answered by AI
Add your answer

Q1. Delete a node in a single linked list
Ans. 
To delete a node in a single linked list, update the previous node's next pointer to skip over the node to be deleted.
• Traverse the linked list to find the node to be deleted

• Update the previous node's next pointer to skip over the node to be deleted

• Free the memory allocated to the node to be deleted
Answered by AI
Add your answer
Q2. Delete duplicate elements in a sorted singly linked list
Ans. 
Use two pointers to iterate through the list and remove duplicates by updating next pointers
• Initialize two pointers, current and next, to iterate through the list

• Compare current and next node values, if equal, update next pointer to skip duplicate node

• Repeat until end of list is reached
Answered by AI
Add your answer
Q3. What is volatile and extern keywords in C ? What are local and external linkages ? What are SW and HW interrupts ? What are the different scheduling algorithms ?
Ans. 
Volatile and extern are keywords in C for memory management. Local and external linkages determine scope. SW and HW interrupts handle events. Different scheduling algorithms manage task priorities.
• Volatile keyword is used to indicate that a variable may be changed unexpectedly, typically by hardware. Example: volatile int x;

• Extern keyword is used to declare a variable that is defined in another file. Example: extern in...read more
Answered by AI
Add your answer

Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.

Q1. 1. Find the smallestMissingNumber in given array using Bitwise OR operation alone 2. Based on Array data Manipulation.
Ans. 
Using Bitwise OR operation to find the smallest missing number in an array.
• Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask

• Iterate through the bitmask to find the first unset bit, which represents the smallest missing number

• Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Answered by AI
Add your answer
Q2. Q2: Customized Data Extraction From Given Dynamic Array & Perform Some Math Operations On the Extracted Data
Add your answer

Q1. Write a Pseudo code for given scenario?
Ans. 
Pseudo code for a scenario
• Define variables and data structures needed

• Write the main logic using conditional statements and loops

• Handle edge cases and error conditions

• Test the pseudo code with sample inputs
Answered by AI
Add your answer

Q1. System Design & Design Pattern based questions
Add your answer

Q1. Not Applicable (Yet to be scheduled)
Add your answer

C Programming, OS Concepts, RTOS, Project Explanation.

Q1. Introduction. General awareness questions.
Add your answer
Q2. Introduction. General talk.
Add your answer

OOPS Principle.
SQL
Java Coding Round - with easy level of questions