RS_latch using vhdl,
When using static gates as building blocks, the most fundamental latch is the simple SR latch, where S and R stand for set and reset. It can be constructed from a pair of cross-coupled NOR (Not OR) logic gates. The stored bit is present on the output marked Q.
Normally, in stor ...
Basicaly,a chatterbot is a computer program that when you provide it with some inputs in Natural Language (English, French ...) responds with something meaningful in that same language. Which means that the strength of a chatterbot could be directly measured by the quality of the output selected by ...
ADIAL Basis Function (RBF) networks were introduced
into the neural network literature by Broomhead and
Lowe [1], which are motivated by observation on the local
response in biologic neurons. Due to their better
approximation capabilities, simpler network structures and
faster learning algorithms, R ...
To write data to the FIFO, present the data to be written and assert the write enable. At the next rising edge of the clock, the data will be written. For every rising edge of the clock that the write enable is asserted, a piece of data is written into the FIFO.
If the FIFO has data in it, the value ...
Tic tac toe is (exactly what re your thinking) and it s the first game I made. Made it in one whole day in Turbo C. It uses primitive graphics drawing and also demonstrates how to output an image. Written in C, also uses a library I got from the net (included) for image output.
The Open Radar Data Acquisition (ORDA)
subsystem replaces the current WSR-88D Radar
Data Acquisition subsystem with improved
receiver and signal processing hardware and with
improved user interface, signal processing and
diagnostics software. This paper will discuss the
input data from the digital r ...
Calculates if the brackets in a sentence are correctly close.
Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error.
Input:
()[]<>(**)
(*)
(ASA
Output:
YES
NO 2
NO 4
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The n ...
