10+ Sanjivani College of Pharmaceutical Education & Research Interview Questions and Answers

React Js is a JavaScript library for building user interfaces.

• Virtual DOM is a lightweight copy of the actual DOM used for faster rendering.

• State and props are used to manage data in React components.

• Hooks are functions that allow you to use state and other React features in functional components.

• Class and functional components are two ways to create React components.

• Life cycle components are methods that are called at different stages of a component's life cycle.

• Mounting is ...read more

JavaScript is a scripting language used for web development. ES6 is the latest version with new features. Promise and Async await are used for asynchronous programming.

• JavaScript is a high-level, interpreted language used for web development.

• ES6 is the latest version of JavaScript with new features like arrow functions, let and const keywords, and template literals.

• Promise is a way to handle asynchronous operations in JavaScript. It represents a value that may not be availabl...read more

Temporal dead zone is the period between entering scope and being able to access a variable.

• Occurs when trying to access a variable before it has been declared

• Caused by hoisting in JavaScript

• Results in a ReferenceError

• Example: const x = 10; console.log(x); // ReferenceError: Cannot access 'x' before initialization

Angular is a front-end web application framework that allows developers to build dynamic single-page applications.

• Angular uses TypeScript for building applications.

• It follows the MVC (Model-View-Controller) architecture.

• Angular provides two-way data binding, which means changes in the model are automatically reflected in the view and vice versa.

• It uses directives to extend HTML with new attributes and tags.

• Angular has a dependency injection system to make components more reus...read more

Hoisting is a JavaScript mechanism where variable and function declarations are moved to the top of their containing scope during compilation.

• In JavaScript, variable and function declarations are hoisted to the top of their scope.

• This means that you can use a variable or function before it is declared.

• However, only the declarations are hoisted, not the initializations.

Remove duplicate elements from an array of strings

• Create a new empty array to store unique elements

• Iterate through the original array and check if element already exists in the new array

• If not, add the element to the new array

• Return the new array with unique elements

List is an ordered collection of elements, while map is a collection of key-value pairs.

• List maintains the order of elements, while map does not guarantee any specific order.

• List allows duplicate elements, while map does not allow duplicate keys.

• In a list, elements are accessed by their index, while in a map, elements are accessed by their keys.

Iterate through the array to find the largest number

• Iterate through the array and compare each element with a variable to store the largest number

• Update the variable if a larger number is found

• Return the largest number at the end

Design a network for a small office with multiple departments

• Identify the network requirements for each department

• Consider the number of users in each department

• Choose appropriate network devices such as routers, switches, and access points

• Implement VLANs to separate department traffic

• Ensure network security measures are in place

A program to print prime numbers

• Iterate through numbers and check if they are prime

• Use a nested loop to check divisibility by numbers less than the current number

• Print the number if it is prime

Program for binary search

• Binary search is an efficient algorithm to search for an element in a sorted array

• It works by repeatedly dividing the search space in half

• If the middle element is the target, the search is successful

• If the target is smaller, search the left half; if larger, search the right half

• Continue dividing until the target is found or the search space is empty