Convin Interview Questions, Process, and Tips

Q1. What is your experience in sales?
Add your answer
Q2. What was your target, and how frequently did you achieve it?
Add your answer
Q3. What are your expectations for working here at the company?
Add your answer

The assignment round consisted of two parts: the first part involved researching their company, writing a pitch, and identifying the appropriate personas, while the second part required me to pitch a product from my previous company and record the presentation.

Q1. How was your interview so far?
Add your answer
Q2. What are your salary expectations?
Add your answer

Q1. Self introduction
Add your answer
Q2. Technical questions
Add your answer

Q1. Technical questions
Add your answer
Q2. Technical questions
Add your answer

Q1. Behavioural questions
Add your answer
Q2. Work environment
Add your answer

Assignment was to create an API for an expenses sharing application where users can input the total amount and the people to be shared the amount with and each individual amount in terms of either actual amount, percentage or split equally

Q1. Difference between process and threads
Ans. 
Processes are independent instances of a program, while threads are smaller units within a process sharing resources.
• Processes have their own memory space, while threads share the same memory space within a process.

• Processes are heavyweight, requiring more resources, while threads are lightweight.

• Processes communicate with each other through inter-process communication mechanisms, while threads can communicate directly...read more
Answered by AI
Add your answer
Q2. What is indexing in DBMS
Ans. 
Indexing in DBMS is a technique used to improve the performance of queries by allowing faster retrieval of data.
• Indexes are data structures that store a small portion of the table data in an optimized format for quick retrieval.

• They help in speeding up data retrieval operations like SELECT, UPDATE, DELETE queries.

• Examples of indexes include primary keys, unique keys, and composite keys.
Answered by AI
Add your answer
Q3. Examples and description of asymmetric encryption alogorithms
Ans. 
Asymmetric encryption algorithms use a pair of keys to encrypt and decrypt data, providing secure communication.
• RSA (Rivest-Shamir-Adleman) is a popular asymmetric encryption algorithm.

• Elliptic Curve Cryptography (ECC) is another commonly used asymmetric encryption algorithm.

• Asymmetric encryption is slower than symmetric encryption but provides better security.

• Public key is used for encryption and private key is used f
Answered by AI
Add your answer
Q4. Which sorting method is beneficial in which scenario
Ans. 
Different sorting methods are beneficial in different scenarios based on factors like time complexity, space complexity, and input size.
• Quick Sort: Best for large datasets due to its average time complexity of O(n log n)

• Bubble Sort: Simple and easy to implement, but inefficient for large datasets with its time complexity of O(n^2)

• Merge Sort: Stable and efficient for large datasets with its time complexity of O(n log n)

• ...read more
Answered by AI
Add your answer

Q1. What are ACID properties in DBMS
Ans. 
ACID properties are a set of properties that guarantee reliability and consistency in database transactions.
• Atomicity: Ensures that either all operations in a transaction are completed successfully or none at all.

• Consistency: Ensures that the database remains in a consistent state before and after the transaction.

• Isolation: Ensures that the execution of multiple transactions concurrently does not interfere with each ot...read more
Answered by AI
Add your answer
Q2. Underlying data structure in Indexing and its time complexity
Ans. 
Indexing typically uses data structures like B-trees or hash tables for efficient retrieval, with time complexity of O(log n) or O(1) respectively.
• Common data structures for indexing include B-trees and hash tables

• B-trees are typically used for indexing in databases due to their balanced nature and efficient search operations

• Hash tables are used for indexing in scenarios where constant time lookup is desired, but may h
Answered by AI
Add your answer
Q3. Time complexity of a recursive fibonacci code
Ans. 
Time complexity of recursive fibonacci code is O(2^n)
• The time complexity of a recursive fibonacci code is exponential, O(2^n)

• This is because each call branches into two recursive calls, leading to exponential growth

• For example, calculating fibonacci(5) would result in 15 function calls
Answered by AI
Add your answer
Q4. The protocol behind Web Sockets (because it was in my resume)
Ans. 
Web Sockets is a communication protocol that provides full-duplex communication channels over a single TCP connection.
• Web Sockets allow for real-time, bi-directional communication between a client and a server.

• They are commonly used in chat applications, online gaming, and live data streaming.

• Web Sockets use the ws:// or wss:// protocol scheme in URLs.

• The protocol is initiated with a handshake between the client and se...read more
Answered by AI
Add your answer

Case study interview questions are designed to assess problem solving, analytical, and critical thinking skills. These questions typically present a business scenario or challenge, requiring to analyze the situation, propose solutions and justify their approach.

Q1. Professional background questionaries.
Add your answer
Q2. Education details questionaries.
Add your answer