Dynamic Binding 

Binding refers to the linking of a proc«lure call to the code to be executed in response to the call. Dynamic binding (also known as late binding) means that the code associated with a given procedure call is not known until the time of tho call at run-time. It is associated with polymorphism and inheritance. A func.-tion call associated with a polymorphic reference depends on the dynamic type of that reference. , 

Comments

Post a Comment

Popular posts from this blog

Covid-19 Analysis and Visualization using Plotly Express

Image
  Introduction : This project deals with creating dozens of bar charts, line graphs, bubble charts, scatter, and plots. The graph that will be made in this project will be of excellent quality. Envisioning COVID-19 will primarily be using Plotly Express for this project. The analysis and visualization enable people to understand complex scenarios and make predictions about the future from the current situation. This analysis summarizes the modeling, simulation, and analytics work around the COVID-19 outbreak around the world from the perspective of data science and visual analytics. It examines the impact of best practices and preventive measures in various sectors and enables outbreaks to be managed with available health resources. Tools and Technologies Used in the Project:    Google Colab(Runtime type - GPU). Requirements to Build the Project:   Basic knowledge of Python , Basic understanding of graphs and charts,  Data Visualization ,  Pandas ,  Nu...
Read more

Artificial Intelligence (Problem Solving)

  The term Artificial Intelligence was coined by John McCarthy (1927-2011) – who is often also referred to as the Father of AI. The term became established when it was chosen as the topic of a summer seminar, known as the  Dartmouth conference , which was organized by McCarthy and others in 1956 at Dartmouth College in New Hampshire. In the proposal to organize the seminar, McCarthy continued with Turing's argument about automated computation. The proposal contains the following crucial statement: “The study is to proceed on the basis of the conjecture that every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it.” In other words, any element of intelligence can be broken down into small steps so that each of the steps is as such so simple and “mechanical” that it can be written down as a computer program. This statement was, and is still today, a conjecture, which means that we can’t re...
Read more

Linear Regression

Linear Regression is the most basic algorithm in Machine Learning. It is a regression algorithm which means that it is useful when we are required to predict continuous values, that is, the output variable  ‘y’ is continuous in nature. A few examples of the regression problem can be the following- 1.“What is the market value of the house?” 2.“Stock price prediction” 3.“Sales of a shop” 4.“Predicting height of a person” Terms to be used here: 1. Features -These are the independent variables in any dataset represented by x1 , x2 , x3, x4,... xn for ‘n’ features. 2. Target / Output Variable -This is the dependent variable whose value depends the independent variable by a relation (given below) and is represented by ‘y’. 3 .Function or Hypothesis of Linear Regression is represented by -y = m1.x1 + m2.x2 + m3.x3 + ... + mn.xn + b  Note: Hypothesis is a function that tries to fit the data. 4. Intercept -Here b is the intercept of the line. We usually include this ‘b’ in the equatio...
Read more