Octro Interview Questions and Answers

There were two coding questions; one was related to linked lists, and the other was linked to binary trees.

Q1. Can you elaborate on the project discussion you mentioned in your resume?
Ans. 
Developed a web application for tracking inventory and sales data
• Used React for front-end development

• Implemented RESTful APIs using Node.js and Express for back-end

• Utilized MongoDB for database management

• Integrated authentication and authorization features for secure access

• Implemented data visualization using Chart.js
Answered by AI
Add your answer
Q2. Can you provide the code to reverse a linked list?
Ans. 
Reversing a linked list involves changing the direction of pointers to go from the end to the beginning.
• Start by initializing three pointers: current, previous, and next.

• Iterate through the linked list, updating the pointers to reverse the direction of the links.

• Update the head of the linked list to point to the new first node, which was the original last node.
Answered by AI
Add your answer
Q3. Some questions were asked regarding the four pillars of Object-Oriented Programming (OOP)?
Add your answer
Q4. Questions related to pointers, dangling pointers.
Add your answer

Q1. Program for finding the perfect squares between two numbers.
Add your answer
Q2. What are smart pointers in C++?
Add your answer
Q3. What is mutual exclusion in the context of concurrent programming?
Ans. 
Mutual exclusion is a concept in concurrent programming where only one thread can access a shared resource at a time.
• Ensures that only one thread can access a critical section of code at a time

• Prevents race conditions and data corruption

• Commonly implemented using locks, semaphores, or mutexes

• Example: Using a mutex to protect a shared variable in a multi-threaded application
Answered by AI
Add your answer
Q4. What is the process for implementing multithreading?
Ans. 
Implementing multithreading involves creating and managing multiple threads to execute tasks concurrently.
• Identify the tasks that can be executed concurrently

• Create and manage multiple threads to execute these tasks simultaneously

• Use synchronization techniques like locks and semaphores to prevent race conditions

• Handle communication and coordination between threads

• Consider thread safety and resource sharing issues
Answered by AI
Add your answer

70 Technical and Aptitude mcqs to solve in 50 minutes

Q1. What is overloading and overriding?
Ans. 
Overloading is having multiple methods with the same name but different parameters. Overriding is implementing a method in a subclass that is already defined in the parent class.
• Overloading allows a class to have multiple methods with the same name but different parameters.

• Overriding occurs when a subclass provides a specific implementation of a method that is already provided by its parent class.

• Overloading is resolve...read more
Answered by AI
Add your answer
Q2. What is difference between Primary and unique key in dbms?
Ans. 
Primary key uniquely identifies a record in a table, while unique key ensures all values in a column are distinct.
• Primary key does not allow NULL values, while unique key allows one NULL value.

• A table can have only one primary key, but multiple unique keys.

• Primary key is a combination of unique and not null constraints.

• Primary key is used to establish relationships between tables, while unique key is used to enforce un...read more
Answered by AI
Add your answer

Different question were asked on sql python java

General aptitude test and coding test on some website

Q1. Find sum of digits using recursion
Ans. 
Recursively find the sum of digits in a given number
• Create a recursive function that takes in a number as input

• Base case: if the number is less than 10, return the number

• Recursive case: return the last digit of the number added to the result of calling the function with the number divided by 10

• Example: For input 123, the sum of digits would be 1 + 2 + 3 = 6
Answered by AI
Add your answer
Q2. Find some of each level in a tree
Ans. 
To find some of each level in a tree, traverse the tree level by level and sum the values at each level.
• Traverse the tree level by level using BFS (Breadth First Search)

• At each level, sum the values of the nodes

• Store the sum of each level in an array of strings
Answered by AI
Add your answer