Quora Interview Questions and Answers

It was a combination of mcq and coding questions
mcq: aptitude + c++ + sql question, nothing really tough
Coding question: 3 leetcode question, medium level, of stack, binary search and graph traversal

Q1. Question regarding project
Add your answer
Q2. SQL basic to moderate question
Add your answer
Q3. C++ coding question on strings recursion callback in c, oops medium level question, finding error in code
Add your answer
Q4. Puzzles Q1-> cake cutting ( 3 cuts, 8 slices) Q2 ->9 bottles, 8 same weight bottles, 1 heavy, 2 tries using a balance
Add your answer
Q5. OS question difference bw multi-processing and multi-programming how would u reduce number of page faults. etc
Add your answer

Q1. Once again project explanation
Add your answer
Q2. Basic to high level oops question:( C++) i was asked to write some class and in that these questions were asked 1: different types of access modifiers, but the question was asked indirectly. like why did...read more
Add your answer
Q3. HR questions, since it was a semi technical cum hr round,
Add your answer

Test contains 26 questions for me 13 are java based 13 are c++ based

Q1. Indexing in dbms
Ans. 
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
• Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

• Types of indexes include clustered, non-clustered, unique, and composite indexes.

• Examples of indexing techniques include B-tree, hash, and bitmap indexes.

• Indexing can...read more
Answered by AI
Add your answer
Q2. Find whether two strings are or not anagrams
Ans. 
Check if two strings are anagrams by comparing the sorted characters in each string.
• Sort the characters in both strings and compare if they are equal.

• Ignore spaces and punctuation when comparing the strings.

• Example: 'listen' and 'silent' are anagrams.

• Example: 'hello' and 'world' are not anagrams.
Answered by AI
View 1 more answer

Q1. Inorder traversal without recursion
Ans. 
Use a stack to simulate the recursive inorder traversal process
• Create an empty stack to store nodes

• Start with the root node and push it onto the stack

• While the stack is not empty, keep traversing left and pushing nodes onto the stack

• Once you reach a leaf node, pop it from the stack, print its value, and move to its right child

• Repeat the process until all nodes have been visited
Answered by AI
Add your answer
Q2. How to make a class final
Ans. 
To make a class final, use the 'final' keyword in the class declaration.
• Use the 'final' keyword before the 'class' keyword in the class declaration

• A final class cannot be subclassed or extended

• Final classes are often used for utility classes or classes that should not be modified
Answered by AI
Add your answer