Filter interviews by
2 Coding questions on Google Form
A singly linked list is a data structure where each element points to the next element in the list.
Each element in a singly linked list contains a value and a pointer to the next element.
Traversal in a singly linked list is done sequentially from the head to the tail.
Insertion and deletion operations are efficient in a singly linked list compared to an array.
Uniform weights in neural network can lead to overfitting and slow learning.
Uniform weights can cause all neurons to behave similarly, leading to redundancy and lack of diversity.
It can also cause overfitting, where the network becomes too specialized to the training data and performs poorly on new data.
Non-uniform weights allow the network to learn more efficiently and effectively by assigning different importance to ...
Overfitting is when a model is too complex and fits the training data too well, while underfitting is when a model is too simple and cannot capture the underlying patterns in the data.
Overfitting occurs when a model is trained too well on the training data and cannot generalize well to new data
Underfitting occurs when a model is too simple and cannot capture the underlying patterns in the data
Overfitting can be detecte...
I applied via Recruitment Consulltant and was interviewed before Aug 2022. There were 4 interview rounds.
Dynamic memory allocation in C allows for allocating memory at runtime. Memory map in C shows how memory is organized. Structures and unions are used to group related data.
Dynamic memory allocation in C is done using functions like malloc(), calloc(), realloc().
Memory map in C shows the layout of memory segments like stack, heap, data, and code.
Structures in C allow grouping related data under a single name. Example: s...
A linked list is a data structure where each element points to the next element in the sequence. Adding, deleting, and traversing a linked list involves manipulating these pointers.
Linked list: a data structure where each element (node) has a reference to the next element
Add to linked list: create a new node and update the pointer of the last node to point to the new node
Delete from linked list: update the pointer of t...
Classification performance metrics evaluate the performance of a machine learning model in predicting categorical outcomes.
ROC-AUC curve measures the tradeoff between true positive rate and false positive rate at various thresholds.
Precision-Recall tradeoff involves balancing the precision and recall of a model. Higher precision typically means lower recall and vice versa.
There will be no tradeoff in Precision-Recall w...
A Heap is a binary tree data structure where the key at each node is greater than or equal to the keys at its children.
Create a class for Heap with methods like insert, delete, and heapify.
Use a list to store the elements of the heap.
Implement the heapify function to maintain the heap property after insertions and deletions.
Implement stack using list in Python
Create a list to store the elements of the stack
Use append() to push elements onto the stack
Use pop() to remove elements from the stack
Use Python's built-in 'in' keyword to find an element in an array of strings.
Iterate through the array and check if the element is present using 'in' keyword.
Return True if element is found, False otherwise.
Example: array = ['apple', 'banana', 'cherry'], element = 'banana', return True.
AllGoVision Technologies interview questions for designations
Top trending discussions
Island Perimeter and Number of Provinces. Basic Leetcode question
Strings question asked, baics
I applied via campus placement at Motilal Nehru Institute National Institute of Technology (NIT), Allahabad and was interviewed in May 2022. There were 4 interview rounds.
There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS
Find the longest consecutive subarray.
Iterate through the array and keep track of the current subarray length.
Update the maximum length as you iterate.
Reset the current subarray length when a non-consecutive element is encountered.
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
MST can be found using Prim's algorithm or Kruskal's algorithm.
Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.
Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.
MST has...
I applied via Job Portal and was interviewed in Dec 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2021. There were 4 interview rounds.
Some of the top questions asked at the AllGoVision Technologies Software Engineer interview -
based on 4 interviews
1 Interview rounds
based on 3 reviews
Rating in categories
Software Engineer
32
salaries
| ₹5 L/yr - ₹8 L/yr |
Test Engineer
10
salaries
| ₹2.8 L/yr - ₹4.8 L/yr |
Software Developer
7
salaries
| ₹5.4 L/yr - ₹8 L/yr |
Technical Support Engineer
7
salaries
| ₹2.8 L/yr - ₹7.9 L/yr |
Senior Software Engineer
6
salaries
| ₹8.5 L/yr - ₹10 L/yr |
Vehant Technologies
Cyclops MedTech
Datamatics Global Services
Nihilent