Strstr char *strstr(const char *s1, const char *s2); strstr scans s1 for the first occurrence of the substring s2 On success, strstr returns a pointer to the element in s1 where s2 begins (points to s2 in s1) If s2 does not occur in s1, st...
Basics Basic idea when using Table of Switching Sequence method is to follow four main steps: - preparing description of working system, means to formulate conditions of working, - preparing and description presentation of working system by the method Table of Successive Connection, - hacking s...
Binary comparators Another type of logic circuit used with binary numbers is a comparator. Fig. 3 presents the logic symbol and the truth table of 1-bit comparator. This circuit sets exactly one of outputs “AB” into state 1 according to compared digits Ai and Bi and input signals “”. Like adder...
Number systems and representations There are many different numbers systems all over the world. Most of them are weight-positional systems, where value of number's each digit depends on both value of digit and it's position in a sequence of symbols. Therefore, during labs there will be implemente...
Overflow detection Overflow is the most important problem that can occur during addition. Example (2's complement representation): Let (A)2=(010011.011)2 then (-A)2=(101100.101)2 One of the possible solutions of detecting overflow is based on testing the carry onto and from sign digit. If both...
Synchronous design process Typical synchronous design process can fit into 6 main steps: • Organize design specification, typically into state diagram, PS/NS table, ASM chart or timing diagram. • Perform state reduction to achieve fewer flip-flops. • Determine minimum number of flip-flops and a...
The Table of Switching Sequence method (SST) (Also known as Table of Successive Connections) The Table of Switching Sequence method, also known as Table of Successive Connections is applicable for asynchronous sequential systems, given by description, time diagram or flow chart. Several steps mu...
MODEL BOHRA (1914) Wyja ś nienie stabilno ś ci atomu wodoru, oraz jego dyskretnej struktury widm emisyjnych poprzez uzupełnienie modelu Rutherforda przez 3 postulaty I postulat: reguła stanów stacjonarnych Elektron w ruchu po orbicie o stałej energii czyli w tzw. tanie stacjonarnym nie generuje p...
Arbitrary Hamming code ( n , k ) fulfills (6.4.3). So, the next Hamming codes are codes (15,11), (31,26), etc. All they have error syndromes, columns of the parity-check matrix, being binary words that encode a column number, position of nonzero bit in z . Parity-check bits are bits: . Problem 6.4...
Binary Markov source of the first order For such source: M =2, L =1, and the source N =2 states are: . The source is defined (modeled) by the original (0 th order) source probability assignment: and conditional probabilities: . The source can be expressed graphically the nodes correspond to sta...
