i
Ignitarium Technology Solutions
Filter interviews by
I applied via Company Website and was interviewed in Jul 2024. There was 1 interview round.
C program to find address of pointer
Top trending discussions
posted on 10 May 2015
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto
To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.
Check if the point's x-coordinate is greater than the left edge of the rectangle
Check if the point's x-coordinate is less than the right edge of the rectangle
Check if the point's y-coordinate is greater than the top edge of the rectangle
Check if the point's y-coordinate is less than the b...
To find line that divides rectangle into 2 equal halves through a point inside it.
Find the center of the rectangle
Draw a line from the center to the given point
Extend the line to the opposite side of the rectangle
The extended line will divide the rectangle into 2 equal halves
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 +
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
Start at the head of the linked list
Iterate through each node by following the 'next' pointer
Compare the value of each node with the target value
Return the node if found, otherwise return null
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If there is a loop, the two pointers will eventually meet.
Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Implement a stack using a singly linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer pointing to the top of the stack
Implement push, pop, and peek operations by manipulating the linked list
Example: Node class - Node { int data; Node next; }
Round duration - 40 minutes
Round difficulty - Easy
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.
Nodes at the same horizontal distance from the root are considered at the same level in the top view.
If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
Identify the node to be deleted by traversing the list
Update the previous node's next pointer to skip the node to be deleted
Free the memory allocated to the node to be deleted
Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Application resume tips for other job seekersKeep your resume short and up to mark and check spellings before submitting it for the interview process.
Final outcome of the interviewSelectedposted on 8 May 2021
posted on 13 Jul 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 2 interview rounds.
1 easy, 1 medium and 1 hard LC
To access files in a different server, use protocols like FTP or SSH. To identify similar key value pairs in multiple files, compare values using a script or tool.
Use FTP or SSH protocols to access files in a different server
Write a script or use a tool to compare key value pairs in multiple files
Identify values that are the same and different across files
Example: Use Python script to read files and compare key value p
posted on 8 Aug 2024
Object-oriented programming concepts include encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: bundling data and methods that operate on the data into a single unit (class). Example: class Car with properties like make, model, and methods like start(), stop().
Inheritance: creating new classes based on existing classes, inheriting their attributes and methods. Example: class SUV inheriting from cl...
Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.
Types of data structures include arrays, linked lists, stacks, queues, trees, graphs, and hash tables.
Arrays are a collection of elements stored in contiguous memory locations, accessed using an index.
Linked lists are a series of nodes where each node contains data and a reference to the next node.
Stack...
A class is a blueprint for creating objects in object-oriented programming. Objects are instances of classes.
A class defines the properties and behaviors of objects. For example, a 'Car' class may have properties like 'color' and 'model', and behaviors like 'drive' and 'stop'.
An object is an instance of a class. For example, 'myCar' can be an object of the 'Car' class with specific values for 'color' and 'model'.
Code e...
Virtual functions are functions in a base class that are overridden in derived classes, while static functions belong to the class itself rather than instances.
Virtual functions allow for dynamic binding and polymorphism in object-oriented programming.
Static functions are associated with the class itself and can be called without creating an instance of the class.
Example: virtual void display() = 0; // pure virtual fun...
Developed a web-based project management tool for tracking tasks and deadlines.
Used AngularJS for front-end development
Implemented RESTful APIs for communication between front-end and back-end
Utilized MySQL database for storing project data
Write a function over loading and friend class with example?
posted on 4 Mar 2025
I appeared for an interview in Feb 2025.
Virtual round for fundamental coding.
Physical round for coding assignment given on a paper.
Twisted cables reduce electromagnetic interference and CAN voltage levels can be observed using an oscilloscope.
Twisted cables consist of pairs of wires twisted together to cancel out electromagnetic interference.
The twisting helps maintain a consistent impedance, reducing signal degradation over distance.
To see CAN voltage levels, connect the oscilloscope probes to the CAN High and CAN Low lines.
Set the oscilloscope t...
Swapping bits in a byte involves exchanging the positions of bits within an 8-bit binary number.
A byte consists of 8 bits, indexed from 0 to 7.
To swap bits, you can exchange pairs: (0, 7), (1, 6), (2, 5), (3, 4).
Example: For byte 10110010, swapping gives 01011001.
Use bitwise operations: AND, OR, and XOR to manipulate bits efficiently.
In programming, you can use masks to isolate and swap bits.
I am excited to join the company for its innovative projects, collaborative culture, and opportunities for professional growth.
The company's commitment to cutting-edge technology aligns with my passion for innovation, as seen in my previous work on AI-driven applications.
I admire the collaborative culture here, which fosters teamwork and knowledge sharing, similar to my experience in agile development teams.
The opportu...
I can join the company in two weeks, allowing time for a smooth transition from my current role.
I need to provide my current employer with a two-week notice period.
This timeframe ensures I can wrap up ongoing projects and hand over responsibilities.
If needed, I can negotiate a quicker start date if my current employer agrees.
posted on 30 Oct 2023
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Senior Engineer
60
salaries
| ₹6.5 L/yr - ₹18.8 L/yr |
Engineer
41
salaries
| ₹4 L/yr - ₹10.8 L/yr |
Senior Software Engineer
33
salaries
| ₹8.5 L/yr - ₹22.2 L/yr |
AI Engineer
29
salaries
| ₹5 L/yr - ₹11 L/yr |
Staff Engineer
29
salaries
| ₹14.4 L/yr - ₹32 L/yr |
Infineon Technologies
Cadence Design Systems
GLOBALFOUNDRIES
Lam Research