Lucent Innovation
R C Fertilisers Interview Questions and Answers
Q1. What is hoisting in JS
Hoisting is a JavaScript mechanism where variable and function declarations are moved to the top of their containing scope.
Variable and function declarations are hoisted to the top of their scope during the compilation phase.
Only declarations are hoisted, not initializations.
Function declarations take precedence over variable declarations.
Q2. what is closures
Closures are functions that have access to variables from their outer scope even after the outer function has finished executing.
Closures allow functions to access variables from their parent function even after the parent function has returned.
They help in maintaining state in JavaScript.
Closures are created whenever a function is defined within another function.
Q3. what is promises
Promises in Node.js are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in a more readable and manageable way.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained together using .then() to handle success or failure.
They help avoid callback hell and make code more maintainable.
Example: const myPromise = new Promise((resolve, reject) => { ... });
Q4. what are callbacks
Callbacks are functions passed as arguments to other functions, to be executed later.
Callbacks are commonly used in asynchronous programming in Node.js.
They allow functions to be executed after another function has finished its execution.
Callbacks can be used to handle events, make API calls, or perform other tasks asynchronously.
Example: fs.readFile('file.txt', (err, data) => { console.log(data); });
Q5. Convert decimal to binary without using inbuilt functions.
Convert decimal to binary without using inbuilt functions
Create an empty array to store binary digits
Use a while loop to divide the decimal number by 2 and store the remainder in the array
Reverse the array to get the binary representation
Q6. Find all possible duplicate elements in array
Use a hash map to find duplicate elements in an array of strings.
Create an empty hash map to store elements and their frequencies.
Iterate through the array and for each element, check if it exists in the hash map. If it does, increment its frequency. If not, add it to the hash map.
After iterating through the array, filter out elements with frequency greater than 1 to find duplicates.
More about working at Lucent Innovation
Interview Process at R C Fertilisers
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month