letsbug Solutions

Posts

Showing posts from March, 2022

Show all

C language MCQs - letsbug

March 28, 2022

MCQs On C Language | Arrays, Loops, I/O and more

Introduction To machine Learning | letsbug

March 28, 2022

R Language R is a programming language and software environment for statistical analysis, graphics representation and reporting. R is freely available under the GNU General Public License, and pre-compiled binary version are provided for various operating systems like Linux, Window and Mac. R was created by Ross Ihaka and Robert Gentleman at the University of Auckland, New Zealand, and is currently developed by the R Development Core Team. Machine Learning Machine Learning must be one of the fastest growing fields in computer science. It is not only the data is continuously getting "bigger" but also the theory to process it and turn it into knowledge. There are several ways to implement machine learning techniques, however the most commonly used ones are supervised and unsupervised learning. Supervised Learning And Unsupervised Learning Supervised Learning is all about operating to a known expectation and in this case, what needs to as "labeled" datasets. It inclu

Software Engineering | Software Testing And Maintenance MCQ | letsbug

March 27, 2022

MCQs On Software Testing | Software Maintenance and Software Re-engineering

Breadth First Search Algorithm In Javascript | letsbug

March 25, 2022

In this article we are looking at how we can implement the Breadth First Search in Javascript with recursion . We are not going to waste time so let's just start. Breadth First Search In Javascript In the below code first we have declared a graph. And this representation of graph is called adjacency matrix . We have represented the nodes with the key in the graph and connection to other nodes is represented with the value array of the graph object. Then we have the traverse arrow function which takes in two parameter one is the graph object itself and a starting node. And the function start with creating a visited empty object and a array called queue with the connection of the first node of graph. And then we initialize the visited object with the first node of the and set it to true. So that we know that we have visited it and do not fall into a infinite cycle. We then have a helper function inside of our main function. Which will do the recursion for u

MCQs On Big Data | Data Analytics With R | Weka Machine Learning | letsbug

March 23, 2022

MCQs On Big Data | Data Analytics With R | Weka Machine Learning

MCQs On Digital Marketing | Social Media Marketing | Digital Marketing Budgeting | Letsbug

March 22, 2022

MCQs On Social Media Marketing | Digital Marketing Budgeting

MCQs On Basics - PHP | letsbug

March 22, 2022

MCQs On Basics - PHP

Data Structure GRAPH Definitions And Terminology | letsbug

March 12, 2022

1. What is a Graph? - A graph G is a set of two tuples G = ( V, E ), where V is finite non-empty set of vertices and E is the set of pairs of vertices called edges. 2. Adjacent Vertex - When there is an edge from one vertex to another then these vertices are called adjacent vertices. 3. Cycle - A path from a vertex to itself is called a cycle. Thus, a cycle is a path in which the initial and final vertices are same. 4. Complete Graph - A graph G is said to be complete if every vertex in a graph is adjacent to every other vertex. In this graph, number of edges = n ( n - 1 ) / 2, where n = Number of vertices. 5. Connected Graph - An undirected graph F is said to be connected if for every pair of distinct vertices Vi, Vj in V(G) there is a path from Vi to Vj. 6. Degree of a Vertex - It is the number of edges incident to a vertex. It is written as deg(U), where U is a vertex. 7. In-degree of a Vertex - In directed graph, in-degree of a vertex '

Data Structure TREE Definitions And Terminology | letsbug

March 12, 2022

1. What is tree? - A Tree is a finite set of one or more nodes such that : There is a specially designated node called the root. Remaining nodes are partitioned into (n >= 0) disjoint sets T1, T2, ..., Tn where each of these sets is a tree. Each T1, T2, T3 .... Tn are called sbu trees of the root. 2. Leaf Node - In a tree data structure, the node which does not have a child is called as Leaf Node. 3. Height of tree - In a tree data structure , the total number of edges from leaf node to a particular node in the longest path is called as height of the Node. In a tree, height of the root node is said to be height of the tree. 4. Depth of tree - In a tree data structure, the total number of edges from root node to a particular node is called as DEPTH of that Node. In a tree, the total number of edges from root node a to a leaf node in the longest path is said to be Depth of the tree. 5. Node - In tree data structure, every individual element is called as Nod

Lowest Common Ancestor Of Binary Tree In Python | letsbug

March 03, 2022

Hey in the article we are looking at a coding challenge problem. You might have come across this it is called finding the lowest common ancestor in a binary tree. So we will find the solution to this problem in python. Let's start. The answer is simple we have to visit every node and check if its child is same as it is asked if so then you return the node and we repeat this process for subtrees of the tree and then if left and right node exit we return it. to the top. code: class Node : def __init__ (self,data): self . data = data self . left = None self . right = None class binaryTree : def __init__ (self): self . root = None #inserts a node in binary tree def insert (self,data): if ( self . root == None ): self . root = Node (data) else : self . insertNode (data, self . root ) Above is boilerplate code for the binary tree we are not focused on that now lets s

Text Recognition Web App In Javascript | letsbug

March 03, 2022

Today we are making a text recognition web app with javascript . So in this app what we will do is that when you open it you will see it asks you for camera permission so you allow it. Then you see you face on the screen. Now you hold a book or something which has some text on it. And when the text is perfectly aligned on the screen you can click anywhere on the screen. Then it will scan it and display the text on the screen and it will also speak those text for you. Now to make it happen we need some special thing like 'tesseract.js' . Tesseract js is a javascript library that will help us make this work. Basically it's the backbone of the app. And to make things a little bit simpler we are using vite to make this javascript app. Vite is a javascript module bundler like webpack if you have used it then you can say vite is faster alternative to webpack. Text Recognition App In Javascript Now following these steps you can make this app. Step 1: C

Making Video Player In HTML With Custom Controls In Javascript | letsbug

March 01, 2022

Today we are making a simple video player in HTML with the help of javascript . We have default controls in HTML while adding a video in HTML with the controls attribute. But those default controls are default and we want customization we are creating our own control box. To make it you need to know HTML and HTML5 and javascript. We are going to implement following functions in our player. Play Pause Repeat Seek Mute You are not limited to this only you can also add more functionality to it like progress bar. Or you can also add a explorer window to change the video. But for now let's focus on this. Custom Video Player In HTML and Javascript For this we need three files linked with the html file which is style.css for a little styling and main.js for javascript which is going to be the backbone of this little project. So you have to create index.html, style.css, main.js in you project folder. Then you can link that in index.html file. And open it

Search This Blog