Kiya.ai Angular Developer Interview Questions and Answers

Os,c,ds,aptitude(quants and logical)

It was easy to crack.questions were quants and logical..amd some technical mcqs

Technical gd..questions were asked from cs fundamentals

Again a technical gd

Easy question. There are many similar questions.

There was writing also in the second round. Coding was like series printing, pattern printing etc.

Easy one basic aptitude questions same models from prev yrs

Its a little bit tough cant solve it

Q1. A a a a a a
Add your answer

It's logical Attitude test was conducted and there is No MCQ type Questions. its Like Fill In the Blank and we can have Accesses to the Calculator and workout sheet

Logical, speed , Numbers ,age ,

Q1. Introduce yourself ?
Add your answer
Q2. Why should I Hire you for this role?
Add your answer

It is not an MCQ type interview but it is not proctored

They asked 4 questions of Coding. you can choose whatever language to code

Array duplicates and burn binary tree

Q1. Project specific
Add your answer

Apti round took place in online mode but it is not proctored

This one is technical GD and shortlisted people will be divided into batches and will asked technical qns for which ppl has to answer

People who got shortlisted will be having another technical GD and the same process will be continued

Q1. 1.What is paging? Ans: it is used by Operating system to page the process
Ans. 
Paging is a memory management technique used by the operating system to store and retrieve data from secondary storage.
• Paging divides the memory into fixed-size pages and stores them in secondary storage.

• When a process needs a page, the operating system retrieves it from secondary storage and loads it into memory.

• Paging allows for efficient use of memory and helps prevent fragmentation.

• Examples of operating systems tha
Answered by AI
Add your answer
Q2. 2.what is the best sorting algorithm? Ans: Quick sort since it will be using the address of the variable,no additional memory is needed
Add your answer
Q3. 3.what are all the various searching methods? Ans: BFS,DFS,binary search,linear search
Ans. 
Various searching methods include BFS, DFS, binary search, and linear search.
• BFS (Breadth-First Search) explores all the vertices at the same level before moving to the next level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking.

• Binary search is a divide and conquer algorithm that searches a sorted array by repeatedly dividing the search interval in half.

• Linear search checks ea...read more
Answered by AI
Add your answer
Q4. 4.How does quick sort works? Ans: Quick sort works by having a pivot element and sorts by divide and conquer
Ans. 
Quick sort works by selecting a pivot element and sorting the array by divide and conquer.
• Select a pivot element from the array

• Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot

• Recursively apply the above steps to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer
Q5. 5.What is Min heap and Max heap Ans: Heap in which the root element or parent node is larger than the child it is called Max heap and vice viresa is called Min heap
Ans. 
Max heap has the largest element at the root while Min heap has the smallest element at the root.
• Max heap is a complete binary tree where the parent node is greater than or equal to its child nodes.

• Min heap is a complete binary tree where the parent node is less than or equal to its child nodes.

• Heaps are commonly used in sorting algorithms like Heap Sort and Priority Queues.

• Insertion and deletion operations in heaps ta
Answered by AI
Add your answer