Info Edge
10+ VIDEOCON NARMADA ELECTRONICS Interview Questions and Answers
Q1. Write the code for rearranging the array in consecutive pair multiplication. For example consider an array with 10 element A0, A1, A2......A9. The resultant array will be A0*A1, A1*A2, A2*A3, and so on. The fin...
read moreRearrange array in consecutive pair multiplication in descending order.
Create a new array to store the multiplied values
Use a loop to iterate through the original array and multiply consecutive pairs
Write a compare function to sort the new array in descending order
Q2. Q: What is a Transaction in DBMS and ACID properties? Q: What is Thread and how it is different from the Process? Q: What are some Linux commands. Write any 5 commands? Q: Why sudo is used for commands? Q: Linu...
read moreAnswers to common technical questions in a software engineering interview
A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.
A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.
Common Linux commands include ls, cd, mkdir, rm, and grep.
sudo is used to run commands wit...read more
Q3. System design of BookMyShow. Design the algorithm and database for the seat booking system. How this the system will handle the case when the payment gets failed. Again he asked me to write the query for the ti...
read moreDesign algorithm and database for seat booking system of BookMyShow and handle failed payments.
Create a database with tables for movies, theaters, seats, bookings, and payments
Use a locking mechanism to prevent double booking of seats
If payment fails, release the locked seats and notify the user
Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;
Q4. What is stoi function (stoi() function)? Its uses and code to Implement stoi function.
stoi() function converts a string to an integer.
stoi() is a C++ function that takes a string as input and returns an integer.
It is used to convert a string of digits into an integer.
It can also handle negative numbers and ignore leading whitespace.
Example: int num = stoi("123"); // num is now 123
Q5. Write code for Longest Common Substring. (time limit for writing this code was 5-6 minutes)
Code for finding the longest common substring in an array of strings.
Iterate through the first string and check for all possible substrings
Check if the substring is present in all other strings
Keep track of the longest common substring found so far
Return the longest common substring
Q6. What are the SEO standards that one needs to follow?
SEO standards include optimizing website content, using relevant keywords, and building quality backlinks.
Optimize website content with relevant keywords and meta tags
Ensure website is mobile-friendly and has fast loading speed
Build quality backlinks from reputable sources
Use descriptive and unique page titles and URLs
Regularly update website content and add new pages
Avoid duplicate content and keyword stuffing
Utilize social media to promote website and increase visibility
Q7. How is an arrow function different from a normal function?
Arrow functions are shorter syntax for writing function expressions.
Arrow functions do not have their own 'this' keyword.
They cannot be used as constructors.
They cannot be used as methods in objects.
They have implicit return statements.
They have a more concise syntax than normal functions.
Q8. What are higher-order components in React?
Higher-order components are functions that take a component and return a new component with additional functionality.
Higher-order components (HOCs) are a pattern in React for reusing component logic.
They are functions that take a component and return a new component with additional functionality.
HOCs can be used for adding props, state, or lifecycle methods to a component.
Examples of HOCs include connect() from React Redux and withRouter() from React Router.
Q9. Write the code to rearrange the array in maximum-minimum form.
Code to rearrange an array in maximum-minimum form.
Sort the array in descending order.
Create a new array and alternate between adding the maximum and minimum values from the sorted array.
Return the new array.
Time complexity: O(nlogn)
Space complexity: O(n)
Q10. Find the sum of k smallest number in a BST.
Find sum of k smallest numbers in a BST.
Traverse the BST in-order and add the k smallest numbers to a sum variable.
Use a priority queue to keep track of the k smallest numbers.
If k is greater than the number of nodes in the BST, return the sum of all nodes.
If k is 0, return 0.
Q11. What is meant by code splitting?
Code splitting is a technique to split code into smaller chunks to improve performance.
Code is divided into smaller chunks that can be loaded on demand
Reduces initial load time and improves performance
Used in modern web development frameworks like React, Angular, and Vue
Example: splitting a large JavaScript file into smaller modules
Q12. Write the code for the time stamp in C.
Code for time stamp in C
Use the time.h header file
Call the time() function to get the current time in seconds
Convert the time to a string using strftime() function
Use the format string to specify the desired format of the time stamp
Q13. What is tree shaking in React?
Tree shaking is a process of eliminating unused code in React applications.
It is a part of the build process that removes dead code from the final bundle.
It helps in reducing the size of the bundle and improving the performance of the application.
It works by analyzing the code and identifying the parts that are not used.
It is achieved through tools like webpack and babel.
Example: If a component is not used in the application, tree shaking will remove it from the final bundle.
Q14. Linked List reversal in groups of k
Reverses a linked list in groups of k
Break the linked list into groups of k nodes
Reverse each group individually
Connect the reversed groups back together
Q15. Topological Sort Implementation
Topological sort is a linear ordering of vertices in a directed acyclic graph.
Topological sort is used to find a linear ordering of vertices in a directed acyclic graph.
It is commonly implemented using depth-first search (DFS) algorithm.
The algorithm starts by visiting a vertex and then recursively visits all its adjacent vertices before adding it to the result list.
Topological sort is not possible if the graph has cycles.
Q16. Describe about a topic
Topic description
Pointer 1
Pointer 2
Pointer 3
Top HR Questions asked in VIDEOCON NARMADA ELECTRONICS
Interview Process at VIDEOCON NARMADA ELECTRONICS
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month