KEKA TECHNOLOGIES Business Development Executive Interview Questions and Answers

Q1. Previous Comp. work
Add your answer
Q2. Why are need change job
Add your answer

Sales and reasoning. Use youtube to prepare and practice well.

Q1. Introduction and questions related to job descriptions and your achievements and worthiness.
Add your answer
Q2. About your background.
Add your answer

Q1. Career background
Add your answer

Q1. Not very hard.. badic knowledge of yr padt experience
Add your answer
Q2. Abot youyrself nd experience
Add your answer

Q1. Previous Comp. work
Add your answer
Q2. Why are need change job
Add your answer

Sales and reasoning. Use youtube to prepare and practice well.

Q1. Introduction and questions related to job descriptions and your achievements and worthiness.
Add your answer
Q2. About your background.
Add your answer

Medium level coding questions were asked

Q1. Implementation of Breadth First Search
Ans. 
Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
• Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.

• Use a queue data structure to keep track of the nodes to be visited.

• Mark each node as visited to avoid re...read more
Answered by AI
Add your answer
Q2. Implementation of Depth First Search
Ans. 
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Start at a node and explore as far as possible along each branch before backtracking

• Use a stack to keep track of nodes to visit

• Mark visited nodes to avoid revisiting them

• Can be implemented recursively or iteratively
Answered by AI
Add your answer
Q3. Implementation of Inorder Traversal of a Binary Tree
Ans. 
Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.
• Start at the root node

• Recursively traverse the left subtree

• Visit the current node

• Recursively traverse the right subtree

• Repeat until all nodes are visited
Answered by AI
Add your answer

Q1. Swap Alternative nodes of a Linked list
Ans. 
Swap alternative nodes of a linked list
• Iterate through the linked list and swap the data of alternate nodes

• Use temporary variables to store data during swapping

• Ensure to handle cases where the linked list has an odd number of nodes
Answered by AI
Add your answer
Q2. Reverse a Linked list
Ans. 
Reverse a linked list by changing the next pointers of each node
• Start with three pointers: current, prev, and next

• Iterate through the linked list, updating the next pointer of each node to point to the previous node

• Update prev, current, and next pointers for each iteration

• Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
Answered by AI
Add your answer