What is facicon and How to add a Favicon to a website❓
▪️ Favicon is a small image that appears beside the website name.
▪️ It is known by many names like tab icon, bookmark icon because it is displayed on a browser's tab, bookmark bar etc.
▪️ Most famous & widely used format for favicon is .ico
▪️ It is known by many names like tab icon, bookmark icon because it is displayed on a browser's tab, bookmark bar etc.
▪️ Most famous & widely used format for favicon is .ico
1. How to create a Favicon?
▪️ Any image can work but it should be small & simple with high contrast
▪️ Normally preferred sizes are 16 x 16 and 32 x 32.
▪️ You can also create & download a favicon using these sites →
• favicon.cc
• favicon.io
▪️ Any image can work but it should be small & simple with high contrast
▪️ Normally preferred sizes are 16 x 16 and 32 x 32.
▪️ You can also create & download a favicon using these sites →
• favicon.cc
• favicon.io
2. Adding Favicon to Website
▪️ a favicon is added via <link> tag
▪️ Just add the <link> tag inside <head> with the path to the favicon.
⬇️
▪️ a favicon is added via <link> tag
▪️ Just add the <link> tag inside <head> with the path to the favicon.
⬇️
Forwarded from Learn Python with Python Video Tutorial Python Course Python Note Python Book Python PDF Django Flask Python
Book shared in resources channel
Name: Web Design Playground - HTML and CSS the Interactive Way - Paul McFedries (Manning, 2019)
https://t.me/c/2109572262/888
Name: Web Design Playground - HTML and CSS the Interactive Way - Paul McFedries (Manning, 2019)
https://t.me/c/2109572262/888
What will be the output of the following JavaScript code
Undefined.
This is due to hoisting. The code behaves like this 👇
var a; //the variable got hoisted
console.log(a); // Outputs: undefined
a = 5;
[We know when a declare a variable the initial value is "undefined" until we assign a value]
This is due to hoisting. The code behaves like this 👇
var a; //the variable got hoisted
console.log(a); // Outputs: undefined
a = 5;
[We know when a declare a variable the initial value is "undefined" until we assign a value]
👍1
Forwarded from Learn Python with Python Video Tutorial Python Course Python Note Python Book Python PDF Django Flask Python
Answer: Exception
Solution:
class TV:
pass
creates a new data type called TV.
pass is just a no-operation statement, it doesn't add any data or functionality to the class.
Hence, this data type does not contain any attributes or functionality
obj = TV()
creates a new object named obj, of the data type TV.
obj.price = 200
creates a new variable named
The value of this variable is set to 200.
Finally, we have
print(self.price)
But there is no object named
Hence, we get an Exception stating that there is nothing called
But you'd have seen
It is simply a convention to use
the first parameter of the method.
The first parameter of a method is is the object through which the method was invoked.
Eg.
a = [1,2,3]
then
a.append(5)
is equivalent to
list.append(a, 5)
So here,
The name
conventionally used to refer to the implicit argument passed in methods.
Otherwise, the word
Hence, the code in the question gives an error, because
I hope this helped!
@python_assets
@javascript_resources
Solution:
class TV:
pass
creates a new data type called TV.
pass is just a no-operation statement, it doesn't add any data or functionality to the class.
Hence, this data type does not contain any attributes or functionality
obj = TV()
creates a new object named obj, of the data type TV.
obj.price = 200
creates a new variable named
price, within obj.The value of this variable is set to 200.
Finally, we have
print(self.price)
But there is no object named
self here!Hence, we get an Exception stating that there is nothing called
self.But you'd have seen
self in other programs elsewhere.self is not a keyword or pre-defined variable in Python.It is simply a convention to use
self WITHIN methods to denotethe first parameter of the method.
The first parameter of a method is is the object through which the method was invoked.
Eg.
a = [1,2,3]
then
a.append(5)
is equivalent to
list.append(a, 5)
So here,
a is implicitly passed to the method append.The name
self isconventionally used to refer to the implicit argument passed in methods.
Otherwise, the word
self has no special meaning in Python.Hence, the code in the question gives an error, because
self is not defined before use.I hope this helped!
@python_assets
@javascript_resources
❤4👍2
Practice these 125+ Algorithms in
@javascript_resources
@python_assets
❍ C++
❍ Java
❍ Python
❍ JavaScript
Or, any language of your choice
Stay in top 5% of programmers.
⇩
➊ Array - Algorithms
➀ Creating an Array
➁ Iterate through Array
➂ Get an Element
➃ Search an Element
➄ Insert Element(s)
➅ Delete Element(s)
➆ Filter an Array
➇ Fetch a Sub-Array
➈ Merging Arrays
➉ Reverse Array
➀➀ Rotate Array
➋ Linked List - Algorithms [1]
➀ Creating a Linked List
➁ Iterate through Linked List
➂ Get an Element
➃ Find an Element
➤ Insert Element(s)
➄ At Start
➅ At End
➆ At Anywhere
➋ Linked List - Algorithms [2]
➤ Delete Element(s)
➇ From Start
➈ From End
➉ From Anywhere
➀➀ IsEmpty
➀➁ Merging Linked Lists
➀➂ Reverse Linked List
➀➃ Check for Cycles
➌ Stack - Algorithms
➀ Push
➁ Pop
➂ IsEmpty
➃ IsFull
➄ Peek
➍ Queue - Algorithms
➀ Enqueue
➁ Dequeue
➂ IsEmpty
➃ IsFull
➄ Peek
➎ Hash Table - Algorithms
➤ Hash Function
➀ Division Method
➁ Multiplication Method
➂ Universal Hashing
➤ Hash Collision
➃ Collision Resolution
➤ Open Addressing
➄ Linear Probing
➅ Quadratic Probing
➆ Double Hashing
➏ Tree - Algorithms
➀ Traversal
➁ Height of a Node/Tree
➂ Depth of a Node
➃ Degree of a Node
➤ Traversal
➄ In Order
➅ Pre Order
➆ Post Order
➇ Level Order
➈ Insert
➉ Delete
➐ Heap - Algorithms
@javascript_resources
@python_assets
➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)
➑ Graph - Algorithms [1]
➤ Adjacency Matrix
➀ Add Edge
➁ Remove Edge
➤ Adjacency List
➂ Add Edge
➃ Remove Edge
➤ Traverse Nodes
➄ Depth First Search
➅ Breadth First Search
➑ Graph - Algorithms [2]
➤ Shortest Path
➆ Dijkstra's Algorithm
➇ Floyd-Warshall Algorithm
➈ Bellman Ford Algorithm
➤ Minimum Spanning Tree
➉ Kruskal's Algorithm
➀➀ Prim's Algorithm
➑ Graph - Algorithms [3]
➤ Connectivity
➀➁ Check connectivity b/w nodes
➀➂ Find all paths
➀➃ Articulation points
➀➄ Bridges
➀➅ Hamiltonian Path
➀➆ Hamiltonian Cycle
➀➇ Eulerian Path
➀➈ Eulerian Cycle
20. Find # of islands
➁➀ Transitive Closure
➑ Graph - Algorithms [4]
@javascript_resources
@python_assets
➁➁ Graph Cycle
➤ Topological Sorting
➁➂ Find all topological sorting
➁➃ Kahn's Algorithm
➁➄ Longest Path
➤ Flow Network
➁➅ Ford-Fulkerson Algorithm
➁➆ Edmonds–Karp algorithm
➁➇ Dinic's Algorithm
➒ Search Algorithms
➀ Linear Search
➁ Jump Search
➂ Binary Search
➃ Interpolation Search
➄ Exponential Search
➅ Ternary Search
➓ Sorting Algorithms [1]
➀ Bubble Sort
➁ Selection Sort
➂ Insertion Sort
➃ Merge Sort
➄ Quick Sort
And, a few advanced ones,
➅ Binary Insertion Sort
➆ 3-way Merge Sort
➇ 3-way Quick Sort
➈ Counting Sort
➉ Radix Sort
➀➀ Bucket Sort
➀➁ Heap Sort
➀➂ Shell Sort
➓ Sorting Algorithms [2]
➀➃ Tim Sort
➀➄ Odd-Even Sort
➀➅ Comb Sort
➀➆ Cocktail Sort
➀➇ Tree Sort
➀➈ Cartesian Sort
20. Pigeonhole Sort
➁➀ Cycle Sort
➁➁ Strand Sort
➁➂ Pancake Sort
➁➃ Permutation Sort
➁➄ Gnome Sort
➁➅ Bitonic Sort
➁➆ Sleep Sort
@javascript_resources
@python_assets
@javascript_resources
@python_assets
❍ C++
❍ Java
❍ Python
❍ JavaScript
Or, any language of your choice
Stay in top 5% of programmers.
⇩
➊ Array - Algorithms
➀ Creating an Array
➁ Iterate through Array
➂ Get an Element
➃ Search an Element
➄ Insert Element(s)
➅ Delete Element(s)
➆ Filter an Array
➇ Fetch a Sub-Array
➈ Merging Arrays
➉ Reverse Array
➀➀ Rotate Array
➋ Linked List - Algorithms [1]
➀ Creating a Linked List
➁ Iterate through Linked List
➂ Get an Element
➃ Find an Element
➤ Insert Element(s)
➄ At Start
➅ At End
➆ At Anywhere
➋ Linked List - Algorithms [2]
➤ Delete Element(s)
➇ From Start
➈ From End
➉ From Anywhere
➀➀ IsEmpty
➀➁ Merging Linked Lists
➀➂ Reverse Linked List
➀➃ Check for Cycles
➌ Stack - Algorithms
➀ Push
➁ Pop
➂ IsEmpty
➃ IsFull
➄ Peek
➍ Queue - Algorithms
➀ Enqueue
➁ Dequeue
➂ IsEmpty
➃ IsFull
➄ Peek
➎ Hash Table - Algorithms
➤ Hash Function
➀ Division Method
➁ Multiplication Method
➂ Universal Hashing
➤ Hash Collision
➃ Collision Resolution
➤ Open Addressing
➄ Linear Probing
➅ Quadratic Probing
➆ Double Hashing
➏ Tree - Algorithms
➀ Traversal
➁ Height of a Node/Tree
➂ Depth of a Node
➃ Degree of a Node
➤ Traversal
➄ In Order
➅ Pre Order
➆ Post Order
➇ Level Order
➈ Insert
➉ Delete
➐ Heap - Algorithms
@javascript_resources
@python_assets
➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)
➑ Graph - Algorithms [1]
➤ Adjacency Matrix
➀ Add Edge
➁ Remove Edge
➤ Adjacency List
➂ Add Edge
➃ Remove Edge
➤ Traverse Nodes
➄ Depth First Search
➅ Breadth First Search
➑ Graph - Algorithms [2]
➤ Shortest Path
➆ Dijkstra's Algorithm
➇ Floyd-Warshall Algorithm
➈ Bellman Ford Algorithm
➤ Minimum Spanning Tree
➉ Kruskal's Algorithm
➀➀ Prim's Algorithm
➑ Graph - Algorithms [3]
➤ Connectivity
➀➁ Check connectivity b/w nodes
➀➂ Find all paths
➀➃ Articulation points
➀➄ Bridges
➀➅ Hamiltonian Path
➀➆ Hamiltonian Cycle
➀➇ Eulerian Path
➀➈ Eulerian Cycle
20. Find # of islands
➁➀ Transitive Closure
➑ Graph - Algorithms [4]
@javascript_resources
@python_assets
➁➁ Graph Cycle
➤ Topological Sorting
➁➂ Find all topological sorting
➁➃ Kahn's Algorithm
➁➄ Longest Path
➤ Flow Network
➁➅ Ford-Fulkerson Algorithm
➁➆ Edmonds–Karp algorithm
➁➇ Dinic's Algorithm
➒ Search Algorithms
➀ Linear Search
➁ Jump Search
➂ Binary Search
➃ Interpolation Search
➄ Exponential Search
➅ Ternary Search
➓ Sorting Algorithms [1]
➀ Bubble Sort
➁ Selection Sort
➂ Insertion Sort
➃ Merge Sort
➄ Quick Sort
And, a few advanced ones,
➅ Binary Insertion Sort
➆ 3-way Merge Sort
➇ 3-way Quick Sort
➈ Counting Sort
➉ Radix Sort
➀➀ Bucket Sort
➀➁ Heap Sort
➀➂ Shell Sort
➓ Sorting Algorithms [2]
➀➃ Tim Sort
➀➄ Odd-Even Sort
➀➅ Comb Sort
➀➆ Cocktail Sort
➀➇ Tree Sort
➀➈ Cartesian Sort
20. Pigeonhole Sort
➁➀ Cycle Sort
➁➁ Strand Sort
➁➂ Pancake Sort
➁➃ Permutation Sort
➁➄ Gnome Sort
➁➅ Bitonic Sort
➁➆ Sleep Sort
@javascript_resources
@python_assets
👍2❤1🔥1😁1
JavaScript Operators cheatsheet