Mitsogo Inc Software Engineer Intern Interview Questions and Answers for Freshers

It included mcqs and multiple coding questions.

Q1. Yours technical skillls related questions
Add your answer
Q2. Managerial questions
Add your answer

Basic aptitude with logical and verbal and reasoning.also microprocessor and micro controller.

We were divided into 10 and ques were asked from dbms,ds,os,cn

Aptitude questions from communication engineering, c , linux , microcontroller microprocessor,..

GD to test our knowledge and communication

Q1. Digital electronics, electrical machines, c programming, microcontroller microprocessor
Add your answer
Q2. Difference between malloc and c alloc
Ans. 
malloc and calloc are functions in C programming used for dynamic memory allocation, with the main difference being how they initialize memory.
• malloc() allocates uninitialized memory, while calloc() allocates zero-initialized memory

• malloc() takes a single argument for the number of bytes to allocate, while calloc() takes two arguments for the number of elements and size of each element

• Example: int *ptr = (int*)malloc(5...read more
Answered by AI
Add your answer

Q1. Tech 1 vs 3 . Questions from round 3
Add your answer

Q1. Negotiation, work culture, company expectations
Add your answer

Apti round took place in online mode but it is not proctored

This one is technical GD and shortlisted people will be divided into batches and will asked technical qns for which ppl has to answer

People who got shortlisted will be having another technical GD and the same process will be continued

Q1. 1.What is paging? Ans: it is used by Operating system to page the process
Ans. 
Paging is a memory management technique used by the operating system to store and retrieve data from secondary storage.
• Paging divides the memory into fixed-size pages and stores them in secondary storage.

• When a process needs a page, the operating system retrieves it from secondary storage and loads it into memory.

• Paging allows for efficient use of memory and helps prevent fragmentation.

• Examples of operating systems tha
Answered by AI
Add your answer
Q2. 2.what is the best sorting algorithm? Ans: Quick sort since it will be using the address of the variable,no additional memory is needed
Add your answer
Q3. 3.what are all the various searching methods? Ans: BFS,DFS,binary search,linear search
Ans. 
Various searching methods include BFS, DFS, binary search, and linear search.
• BFS (Breadth-First Search) explores all the vertices at the same level before moving to the next level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking.

• Binary search is a divide and conquer algorithm that searches a sorted array by repeatedly dividing the search interval in half.

• Linear search checks ea...read more
Answered by AI
Add your answer
Q4. 4.How does quick sort works? Ans: Quick sort works by having a pivot element and sorts by divide and conquer
Ans. 
Quick sort works by selecting a pivot element and sorting the array by divide and conquer.
• Select a pivot element from the array

• Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot

• Recursively apply the above steps to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer
Q5. 5.What is Min heap and Max heap Ans: Heap in which the root element or parent node is larger than the child it is called Max heap and vice viresa is called Min heap
Ans. 
Max heap has the largest element at the root while Min heap has the smallest element at the root.
• Max heap is a complete binary tree where the parent node is greater than or equal to its child nodes.

• Min heap is a complete binary tree where the parent node is less than or equal to its child nodes.

• Heaps are commonly used in sorting algorithms like Heap Sort and Priority Queues.

• Insertion and deletion operations in heaps ta
Answered by AI
Add your answer