Electronics and Computer Software Export Promotion Council Software Engineer2 Interview Questions and Answers

Basic aptitude questions based on profit and loss

Coding test based on c language and python programming

Communication assignment based on English

Q1. Self introduction
Add your answer
Q2. Difine real time operation system
Ans. 
Real-time operating systems are designed to provide guaranteed response times for critical tasks.
• Real-time operating systems prioritize tasks based on their urgency and importance.

• They are commonly used in industries such as aerospace, automotive, and industrial automation.

• Examples include VxWorks, QNX, and FreeRTOS.
Answered by AI
Add your answer

Q1. Self introduction
Add your answer
Q2. Project work questions
Add your answer

Hackerrank was used for test

Q1. Implement BFS to find the nearest neighbour
Ans. 
Implement BFS algorithm to find the nearest neighbour
• Create a queue to store nodes to be visited

• Start with the initial node and add it to the queue

• While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue

• Repeat until the nearest neighbour is found
Answered by AI
Add your answer
Q2. Implement Priority queue using heap.
Ans. 
Priority queue can be implemented using a heap data structure.
• Create a min heap or max heap based on the priority order needed.

• Insert elements into the heap based on their priority level.

• Remove elements from the heap based on their priority level.

• Heapify the heap after each insertion or deletion operation.

• Example: Implementing a min heap for a priority queue where lower values have higher priority.
Answered by AI
Add your answer

Aptitude test on CS subjects like C programming, DBMS, CN, and OS.

There were 2 input-output based questions of easy to moderate level

Every candidate was given an individual topic and was asked to speak on it

Q1. Some typical HR questions
Add your answer

Aptitude, reasoning, English, cloud sections

2 questions in which , one has to complete within an 50 minutes

Q1. Tell me about t Yourself
Add your answer
Q2. What are the previous experiences
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer