String in Java
This document is containing String in Java. Here how to declare string in Java, various string operations....etc. are there with brief discussion and coding.
Sudarshan Nath
APPLICATION OF PARTIAL DERIVATIVES IN COMPUTER GRAPHICS
This document contains Engineering Math Project on APPLICATION OF PARTIAL DERIVATIVES IN COMPUTER GRAPHICS.
Array in Java
This document is containing how to use array in java. How to create array in Java, various operations.....etc.
Algorithm of the bisection method
This document will help to understand the algorithm of Bisection Method.
Calculate the root of the following equation using Bisection Method x3-3x-5=0 and correct up to three decimal places.
This document contains the Numerical Question: Calculate the root of the following equation using Bisection Method x3-3x-5=0 and correct up to three decimal places.
Online Lab Exam Question Paper of Python( JIS COLLEGE OF ENGINEERING)
This Document contains the Online Lab Exam Question Paper of Python( JIS COLLEGE OF ENGINEERING)
Break Failure Indicator
Automobiles have been the primary mode of transportation for most of us and we depend on them for our day to day commute.Brake failure indicator circuit is a circuit that constantly monitor the condition of brake every time when the brake is applied.This mechanism involves a brake wire which runs from the brake lever to the braking mechanism set-up of the vehicle. It is this wire that gets pulled when we apply brakes to stop our vehicle.
Analysis of Root Finding Methods
In mathematics and computing, a root-finding algorithm is an algorithm for finding zeroes, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeroes of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeroes, expressed either as floating point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound). Solving an equation f(x) = g(x) is the same as finding the roots of the function h(x) = f(x) – g(x). Thus root-finding algorithms allow solving any equation defined by continuous functions. However, most root-finding algorithms do not guarantee that they will find all the roots; in particular, if such an algorithm does not find any root that does not mean that no root exists. Most numerical root-finding methods use iteration, producing a sequence of numbers that hopefully converge towards the root as a limit. They require one or more initial guesses of the root as starting values, then each iteration of the algorithm produces a successively more accurate approximation to the root. Since the iteration must be stopped at some point these methods produce an approximation to the root, not an exact solution. Many methods compute subsequent values by evaluating an auxiliary function on the preceding values. The limit is thus a fixed point of the auxiliary function, which is chosen for having the roots of the original equation as fixed points, and for converging rapidly to these fixed points.
Railway Ticket Reservation System using Data Structure
For journey of longer distances most of the people use the railways, which is most convenient, affordable means of transport in India. So keeping this in view, the reservation of railways is a most important task and it must be faster and efficient as the demand is very high. In order to meet this demand it requires an efficient program to implement the online reservation. This program enables us to choose the train even there is no necessary to fill a form at the railway reservation counter.
SR Flip Flop
Flip flop is an electronic circuit with two stable states that can be used to store binary data. The stored data can be changed by applying varying inputs. Flip-flops and latches are fundamental building blocks of digital electronics systems used in computers, communications, and many other types of systems. Flip-flops and latches are used as data storage elements. It is the basic storage element in sequential logic
JK Flip-flop
Flip flop is an electronic circuit with two stable states that can be used to store binary data. The stored data can be changed by applying varying inputs. Flip-flops and latches are fundamental building blocks of digital electronics systems used in computers, communications, and many other types of systems. Flip-flops and latches are used as data storage elements. It is the basic storage element in sequential logic.
Norton's Theorem
This ppt contains details about the Norton's Theorem.There is an example which will help to understand the Norton's Theorem very easily. Here ''DIFFERENCES BETWEEN NORTON’S AND THEVENIN’S THEOREM'' is also added.It will help to understand the difference between Norton's Theorem and Thevenin's Theorem. Circuit Diagrams are also described briefly.