Books

Search Books...

Petrick's Algorithm Books

Fundamentals of Logic Design, 7th edition

Author: Charle Roth, Larry Kinney

School: Edo University

Department: Engineering

Course Code: EEE314

Topics: Logic Design, number system, Boolean algebra, minterm expansions, maxterm expansions, Karnaugh maps, Quine-McCluskey Method, Multi-Level Gate Circuits, NAND gate, NOR Gate, Combinational Circuit Design, Multiplexers, Decoders, Programmable Logic Devices, Latches, Flip-Flops, VHDL, registers, counters, Clocked Sequential Circuits, Sequential Circuit Design, digital systems, switching circuits, number systems, number conversion, binary arithmetic, Boolean expression, truth tables, De Morgan's laws, Consensus Theorem, Prime Implicant Chart, Petrick’s Method, Three-State Buffers, Read-Only Memories, encoders, Shift Registers

Introduction to computer programming 2

Author: II Umeh

School: Nnamdi Azikiwe University

Department: Science and Technology

Course Code: CSC102

Topics: computer programming, control structures, problem solving process, algorithm, Pseudo code, algorithm discovery, input, output, arrays, subscripts, array manipulations

Discrete mathematics and its applications ,8th edition

Author: Kenneth Rosen

School: University of Ibadan

Department: Science and Technology

Course Code: CSC242

Topics: Discrete mathematics, logic, sets, functions, sequences, matrices, algorithms, Number theory, cryptography, induction, recursion, counting, discrete probability, advanced counting techniques, counting techniques, Linear Recurrence Relations, modelling computation, Finite-State Machines, relations, graphs, trees, boolean algebra, modelling computation, Boolean Functions, Logic Gates, Minimization of Circuits.Tree Traversal, Spanning Trees, Minimum Spanning Trees, Graph Models, Graph Terminology, Graph Isomorphism, Connectivity, Euler path, Hamilton Path, Shortest-Path Problems, Planar Graphs, Graph Coloring, Representing Relations, Equivalence Relations, Probability Theory, Bayes Theorem, variance, Pigeonhole Principle, permutation combination, binomial coefficient, Recursive Algorithms, Program Correctness, Divisibility, Modular Arithmetic, Integer Representations, Set Operations, Cardinality of Sets

Artificial intelligence lecture note

Author: COS454

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS454

Topics: Artificial intelligence, agent communication, knowledge representation, knowledge procession, symbolic reasoning, Artificial intelligence techniques, artificial neural network, expert systems, genetic algorithm, genetic algorithm maximization function

Introduction to Programming

Author: Yetunde Folajimi

School: University of Ibadan

Department: Science and Technology

Course Code: CSC103

Topics: Programming, computer programming, computer languages, programming process, compilation, coding, debugging, syntax, Programming languages, low-Programming languages, high-Programming languages, Modular Programming Languages, Structured Programming Language, Business Oriented Language, Object oriented programming language, Visual Programming Languages, Algorithm, Problem-Solving, Problem Solving Process, Algorithmic Problem Solving, Pseudo-Codes, Pseudocode, Flowcharts, Flowchart Symbols, Flowcharting, Programming Environment, flowchart, Variables, Reserved Words, operators, Data Types, functions, Data Type, Numbers Manipulation, character manipulation, String Manipulation, Decision-Making, Loops, Conditional Statements, arrays, Computer Files, file input, file output, File Operation Modes

Languages and Machines, 3rd edition

Author: Thomas Sudkamp

School: Edo University

Department: Science and Technology

Course Code: CSC314

Topics: Languages, regular expression, text searching, grammars, automata, languages, Chomsky normal form, finite automata, deterministic finite automata, Myhill-Nerode theorem, homky, undecidability, Rice's theorem, Mu-recursive functions, numeric computation, incomputable functions, linear-bounded automata, computational complexity, linear speedup, Hamiltonian circuit problem, polynomial-time reduction, satisfiability problem, complexity class relations, optimization problems, approximation algorithms, approximation schemes, space complexity, deterministic parsing

Communication Systems Engineering, 2nd Edition

Author: John Proakis, Masoud Salehi

School: Edo University

Department: Engineering

Course Code: CPE312

Topics: Communication Systems Engineering, Electrical Communication System, Communication Channel, frequency domain analysis, Fourier series, Fourier transforms, Bandlimited Signals sampling, bandpass signals, analog signal transmission, modulation, amplitude modulation, Conventional Amplitude Modulation, angle modulation, radio broadcasting, television broadcasting, mobile radio systems, random processes, Gaussian Processes, White Processes, Bandlimited Processes, Bandpass Processes, Linear-Modulation Systems, information sources, source coding, source-coding theorem, Source-Coding Algorithms, Rate-Distortion Theory, quantization, Analysis-Synthesis Techniques, waveform coding, Digital Audio Transmission, Digital Audio Recording, Pulse Amplitude Modulation, Two-dimensional Signal Waveforms, Multidimensional Signal Waveforms, White Gaussian Noise, Symbol Synchronization, Bandlimited Channels, Digitally Modulated Signals, channel; capacity, channel coding, linear block code, cyclic codes, Convolutional Codes, wireless communications, Continuous Carrier-Phase Modulation, Spread-Spectrum Communication Systems, Digital Cellular Communication Systems

Advanced Compiler Design and Implementation

Author: Steven Muchnick

School: Edo University

Department: Science and Technology

Course Code: CSC312

Topics: Compiler Design, compiler Implementation, informal compiler algorithm notation, Low-Level Intermediate Languages, Multi-Level Intermediate Languages, run-time support, Data Representations, control-flow analysis, Data-Flow Analysis, Procedure Optimizations, Register Allocation, code scheduling, Memory Hierarchy optimization, Data-Cache Optimization

An Introduction to Formal Languages and Automata, 6th edition

Author: Peter Linz

School: Edo University

Department: Science and Technology

Course Code: CSC314

Topics: finite automata, regular expressions, regular languages, parsing, turing machines, algorithmic computation, recursive functions, computational complexity

Java by Dissection, 2nd edition

Author: Charlie McDowell, Ira Pohl

School: Edo University

Department: Science and Technology

Course Code: CSC314

Topics: Java, algorithms, data types, variable declarations, number types, arithmetic expressions, statements, control flow, Boolean expressions, functional abstraction, recursion, arrays, objects, data abstraction, enumeration operation, inheritance, graphical user interface, dynamic data structures, concurrent programming

Departments

Administration, Social and Management science image

Administration, Social and Management science

Agriculture and Veterinary Medicine image

Agriculture and Veterinary Medicine

Arts and Humanities image

Arts and Humanities

Education image

Education

Engineering image

Engineering

General studies image

General studies

Law image

Law

Medical, Pharmaceutical and Health science image

Medical, Pharmaceutical and Health science

Science and Technology image

Science and Technology