ACKO Java Developer Interview Questions and Answers

Q1. Difference b/w map and array in CPP. What are generators in Python. What is Polynomial Regression? Normalisation in DBMS.
Ans. 
Map and array in CPP are both data structures, but map is a key-value pair container while array is a collection of elements with a fixed size.
• Map in CPP is a container that stores elements in key-value pairs, allowing fast lookups based on keys.

• Array in CPP is a collection of elements of the same data type, stored in contiguous memory locations.

• Generators in Python are functions that allow you to iterate over a sequen...read more
Answered by AI
Add your answer
Q2. Realtional Algebra in DBMS
Ans. 
Relational Algebra is a procedural query language used to query databases in DBMS.
• Relational Algebra is used to perform basic operations like selection, projection, join, etc. on relations.

• It helps in retrieving specific information from databases based on certain conditions.

• Examples of operations in Relational Algebra include Union, Intersection, Difference, Cartesian Product, etc.
Answered by AI
Add your answer

Duration 1Hr
2 coding questions

Q1. Don't remember the questions
Add your answer
Q2. Don't remember the questions.
Add your answer

Profit loss , number system, code decode

Q1. What is DDL, DML, DQL
Ans. 
DDL stands for Data Definition Language, DML stands for Data Manipulation Language, and DQL stands for Data Query Language.
• DDL is used to define the structure of database objects such as tables, indexes, and views.

• DML is used to manipulate data in the database, such as inserting, updating, and deleting records.

• DQL is used to retrieve data from the database using queries.

• Examples: CREATE TABLE is a DDL statement, INSERT...read more
Answered by AI
Add your answer

All aptitude type questions as well as core computer science subject questions comes

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

Q1. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure the traversal starts from vertex 0 and follows the BFS order.

• Output the BFS traversal sequence for each test case in a separate line.

• Handle disconnected components by checking for unvisited nodes.

• Consider t...read more
Answered by AI
Add your answer
Q2. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Answered by AI
Add your answer
Q3. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

• Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

• Optimize the solution to avoid redundant calculations by storing intermediate results.

• Time complexity can be reduced to O(N) using dynamic programming.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

Q1. 
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...read more
Ans. 
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
• Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.

• Use a queue to perform level order traversal of the binary tree.

• Store the leftmost node at each level in the result array.

• Return the result array containing the left view of the binary
Answered by AI
Add your answer
Q2. 
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...read more
Ans. 
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
• Perform level order traversal of the binary tree.

• For each level, add the rightmost node to the result.

• Print the result as the right view of the binary tree.

• Handle null nodes represented by -1 in the input.
Answered by AI
Add your answer
Q3. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
• Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

• The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

• Consider edge cases like a single node tree or empty tree while calculating the height.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.

Q1. Tell me About yourself
Add your answer

Basic aptitude questions to

Basic coding questions

Q1. Thanks tougfh roubd was there
Add your answer
Q2. What type of round was conducted during the interview?
Add your answer