AllGoVision Technologies
HBSS Interview Questions and Answers
Q1. Define Dynamic memory allocation and the syntax in C. Explain the Memory map in C. Usage of Structures and Unions.
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: struct Person { char name[50]; int age; };
Unions in C allow...read more
Q2. Define the classification performance metrics. ROC-AUC curve. What is the Precision-Recall tradeoff, when will there be no tradeoff.
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 when the model achieves perfect precision and recall simult...read more
Q3. Define Linked list, add, delete and traverse a Linked list. Difference between Singly and Doubly LL.
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 the previous node to skip the node to be deleted
Traverse li...read more
Q4. Define and write a program for Heap using List. (Python)
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.
Q5. Why we should not assign uniform weights in neural network
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 different features.
For example, in image recognition, edge...read more
Q6. Implement stack as a list (Python).
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
Q7. Finding an element in an array. (Python)
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.
Q8. Difference between overfitting and underfitting
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 detected by comparing the performance of the model on the trainin...read more
Q9. Singly Linked List
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.
Interview Process at HBSS
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month