Computer Programming
Computer Programming If anyone wants to share their notes then you can mail us on- quicklearnology@gmail.com
Electrical Engineering
Electrical Engineering Notes If anyone wants to share their notes then you can mail us on- quicklearnology@gmail.com
Engineering Physics
CONTEXT : Polarisation and Solid State Wave Optics Part – 1 Wave Optics Part – 2 If anyone wants to share their notes then you can mail us on- quicklearnology@gmail.com
Bootstrap Interview Questions and Answers
1. What is Bootstrap? Answer: Bootstrap is a free and open-source front-end web development framework that helps to create responsive and mobile-first websites. 2. What are the advantages of using Bootstrap? Answer: The advantages of using Bootstrap are: • Saves development time • Provides a consistent and uniform look and feel across the website • …
Javascript Interview Questions
1. What is JavaScript, and what are its primary features? JavaScript is a programming language that is used to create interactive web pages. Its primary features include a syntax that is similar to C and Java, dynamic typing, and support for functional and object-oriented programming paradigms. 2. What is the difference between let and var …
Perceptron Model
FEATURED IMAGE REFERENCE :
https://www.pyimagedata.com/how-to-create-a-single-layer-perceptron/
McCulloch-Pitts Neuron Model
Image Reference :https://towardsdatascience.com/mcculloch-pitts-model-5fdf65ac5dd1
Time Complexity of different types of Data Structures :
Data structures are how we organize and store data in a computer. The time complexity of a data structure is how long it takes to insert, delete, or find an element in the data structure. The time complexity of a data structure is important to consider when choosing which data structure to use for a …
Time Complexity of different types of Data Structures : Read More »
Important Questions of ML
Solution : In order to use KNN (k-nearest neighbors) to predict the values of X1 and X2 in the Result column, we need to first determine which of the given data points are the nearest neighbors of the unknown values. Assuming we use k=3 (i.e., we will look at the three nearest neighbors), we can …
