Foundations of computer science by Olufade Falade Williams Onifade PDF free download

Olufade Falade Williams Onifade Foundations of computer science PDF, was published in 2017 and uploaded for 200-level Science and Technology students of University of Ibadan (UI), offering CSC242 course. This ebook can be downloaded for FREE online on this page.

Foundations of computer science ebook can be used to learn computer science, logic, sets, loops, recursion, Program Correctness, Loop invariant, Hoare’s Axiom, Discrete Probability, Randomized Algorithms, lists, graphs, Cryptography, Mathematical induction.

Technical Details
Updated at:
Size: 4.6 MB
Number of points needed for download: 19
Number of downloads: 5

Books related to Foundations of computer science

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

Introduction to Algorithms, 3rd Edition

Author: Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein

School: University of Ibadan

Department: Science and Technology

Course Code: CSC242

Topics: Algorithms, Insertion sort, analyzing Algorithms, designing Algorithms, growth of functions, asymptotic notation, maximum-subarray problem, Strassen’s algorithm, Probabilistic Analysis, Randomized Algorithms, hiring problem, Indicator random variables, Heapsort, heaps, heapsort algorithm, Priority queues, quicksort, Radix sort, Counting sort, Bucket sort, Data Structures, Hash Tables, has function, open addressing, Perfect hashing, Data Structures, sorting order statistics, Binary Search Trees, Red-Black Trees, Augmenting Data Structures, Dynamic Programming, Greedy Algorithms, Amortized Analysis, B-Trees, Fibonacci Heaps, van Emde Boas Trees, Graph Algorithms, Minimum Spanning Trees, Single-Source Shortest Paths, All-Pairs Shortest Path, maximum flow, Multithreaded Algorithms, Matrix Operations, linear programming, polynomials, Number-Theoretic Algorithms, String Matching, Computational Geometry, NP-Completeness, Polynomial time, Approximation Algorithms

Digital Logic Circuit Analysis and Design

Author: Victor Nelson, Troy Nagle, Bill Carroll, David Irwin

School: Edo University

Department: Engineering

Course Code: EEE314

Topics: Digital Logic Circuit Analysis, Digital Logic Circuit Design, computing, digital systems, number systems, positional notation, arithmetic, binary arithmetic, octal arithmetic, hexadecimal arithmetic, base conversions, signed number representation, computer codes, numeric codes, error detection codes, correction codes, Boolean algebra, Venn diagram, Duality, switching functions, truth tables, switching circuits, electronic logic gates, combinational circuits, algebraic methods, combinational logic circuits, computer aided design, design cycle, digital circuit modelling, design synthesis, logic simulation, Karnaugh maps, Quine-McCluskey tabular minimization method, Petrick's algorithm, computer aided minimization of switching functions. Modular combinational logic, Decodes, encoders, decoder circuit structures, encoders, multiplexers, demultiplexers, data distributors, adder circuits, comparators, semi custom logic devices, logic array circuits, field-programmable logic arrays, programmable read-only memory, programmable array logic, sequential devices, sequential circuits, memory devices, latches, flip-flops, timing circuits, modular sequential logic shift registers, counters, serial adder unit, serial accumulators, parallel accumulators, multiple-sequence counters, digital fractional rate multipliers, synchronous sequential circuit models, synchronous sequential circuits, registered programmable logic device, programmable gate arrays, sequential circuit design, logic circuit testing, digital logic circuit testing, combinational logic circuit testing, sequential logic circuit testing, electronic slot machine, keyless auto entry system

Computer Algorithms

Author: Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran

School: Edo University

Department: Science and Technology

Course Code: CMP315

Topics: Computer Algorithms, pseudocode conventions, recursive algorithms, performance analysis, randomized algorithms, primality testing, elementary data structures, binary search trees, cost amortization, prority queues, sets, graphs, graph representation, merge sort, quick sort, Strassen's matrix multiplication, convex hull, greedy method, knapsack problem, tree vertex splitting, prim's algorithm, dynamic programming, reliability design, backtracking, graph coloring, least cost search, algebraic problems, fast Fourier transform, lower bound theory, comparison trees, ordered searching, Cook's theorem, approximation algorithms, absolute algorithms, polynomial time approximation schemes, mesh algorithms, packet routing, hyper algorithms, PPR routing

Introduction to the design and analysis of algorithms ,3rd edition

Author: Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee

School: University of Ibadan

Department: Science and Technology

Course Code: CSC242

Topics: algorithm design, algorithm analysis, Algorithm Efficiency, Algorithm Efficiency analysis, Brute Force, Exhaustive Search, Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer, Space and Time Trade-Offs, Dynamic Programming, Greedy Technique, Iterative Improvement, Algorithm Power, Algorithmic Problem Solving, Nonrecursive Algorithms mathematical analysis, recursive Algorithms mathematical analysis, Selection Sort, Bubble Sort, Sequential Search, Brute-Force String Matching, Closest-Pair Problems, Convex-Hull Problems, depth-First Search, Breadth-First Search, Insertion Sort, Topological Sorting, Variable-Size-Decrease Algorithms, Decrease-by-a-Constant-Factor Algorithms, binary search, Mergesort, quicksort, Binary Tree Traversals, Strassen’s Matrix Multiplication, Gaussian Elimination, presorting, Balanced Search Trees, Heaps, Heapsort, Horner’s Rule, Binary Exponentiation, Problem Reduction, B-Trees, hashing, Knapsack Problem, Optimal Binary Search Trees, Warshall’s Algorithm, Floyd’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees, huffman Codes, Simplex Method, Maximum-Flow Problem, Stable Marriage Problem, Lower-Bound Arguments, Decision Trees, Numerical Algorithms, Backtracking, Approximation Algorithms

Digital Logic Design

Author: Nancy Woods

School: University of Ibadan

Department: Science and Technology

Course Code: CSC213

Topics: Digital Logic Design, Kirchhoff's law, Thevenin's theorem, Norton's theorem, circuit theory, semiconductors, transistors, digital logic, integrated circuits, digital logic gates, logic gates, combinational logic design, logic circuit diagram, truth table, Boolean expression, Boolean Algebra, Karnaugh Maps, Quine-McCluckskey, standard combinational logic circuits, ombinational logic circuits, combinational logic, binary adder, binary subtractor, digital comparator, multiplexer, digital encoder, binary decoder, sequential logic circuit, Flip-Flop, S-R Flip-Flop, JK Flip-Flop, T Flip-Flop, D-type Flip-Flop, registers, counters, computer codes, binary codes, binary-coded decimal, excess-3 code, gray code, error detection, error correction, digital error, parity bit, Hamming codes, Cyclic redundancy check

Cambridge IGCSE and O level Computer Science, 2nd Edition

Author: David Watson, Helen Williams

School: International Exams

Department:

Course Code: IGCSE

Topics: Data representation, computer, Number systems, data storage, file compression, Data transmission, error detection, symmetric encryption, asymmetric encryption, Hardware, computer architecture, input devices, output devices, network hardware, software, programming language, translators, internet, digital currency, cyber security, automated systems, robotics, artificial intelligence, Algorithm design, problem solving, program development life cycle, computer systems, computer decomposition, test data, identifying errors in algorithm, writing algorithms, amending algorithms, programming, arrays, file handling, Database, Boolean logic, standard logic gate symbols, logic circuits, logic expression, truth tables, problem statements

Introduction to computer science

Author: Computer Science Department (FUTMinna)

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: CPT111

Topics: Computing, computer software, machine level representation of data, logic, programming, internet

Introduction to computer science

Author: OE Ojo

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: CSC101

Topics: computer, generations of computer, computer, computer classes, computing origin, hybrid computer, input devices, output devices, computer storage, arithmetic logic unit, memory, computer software, system software, language translator, application software, data processing, data processing technique, Microsoft windows

Logic & philosophy A modern introduction, 13th edition

Author: Alan Hausman, Frank Boardman, Howard Kahane

School: Edo University

Department: General studies

Course Code: GST112

Topics: Logic, philosophy, argument, deduction, induction, deductive argument forms, truth, validity, sentential logic, atomic sentences, compound sentences, truth tables, Logical Form, Tautologies, Contradictions, Contingent Sentences, Logical Equivalences, Argument forms, Disjunctive Syllogism, Hypothetical Syllogism, Simplification, Conjunction, Constructive Dilemma, proofs, Sentential Logic Truth Trees, Sentential Logic Truth Tree Method, predicate logic, Predicate Logic Symbolization, Predicate Logic Semantics, Proving Invalidity, Predicate Logic Proofs, Relational Predicate Logic, Predicate Logic Truth Trees, modal logic, Modal Logic Semantics, Syllogistic Logic

Computer Science and Programming

Author: Ezeani Majesty Ignatius

School: Nnamdi Azikiwe University

Department: Science and Technology

Course Code: CSC101

Topics: Computer Science, computer Programming, computer, computer networks, number systems, base operations, base complements, Boolean algebra, algorithms, pseudo codes, flowchart, Visual basic programming language, programming language

Notes on Discrete Mathematics

Author: James Aspnes

School: Edo University

Department: Science and Technology

Course Code: MTH214

Topics: discrete mathematics, mathematical logic, functions, proofs, set theory, set operations, axiomatic set theory, real numbers, arithmetic, induction, recursion, summation notation, Asymptotic notation, number theory, graphs, multiplication, exponentiation, binomial coefficients, generating functions, probability theory, random variables, Markov's inequality, probability generating functions, linear algebra, abstract vector spaces, finite fields

Introduction to computer science

Author: Monica Agu, FS Bakpo, OE Chinwuko, SC Echezona, Modesta Ezema

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: computer structure, computer system, input, output, computer storage, number systems, computer software, problem solving, language programming, BASIC program, JAVA Language programming, computer networking

Introduction to Computer Science Continuous assessment filler

Author: 1st John

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: Computer Science, computer, computer system, hardware, software, output device, input device, peripheral device, output interface, memory device, handshaking, monitor, printer, RAM, data storage, number system, binary, decimal, computer software, BASIC, QBASIC, pseudocode, flowchart, JAVA, Computer generations

Introduction to Computer Science Continuous assessment filler 2

Author: COS101

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: Computer Science, computer, computer system, hardware, software, output device, input device, peripheral device, output interface, memory device, handshaking, monitor, printer, RAM, data storage, number system, binary, decimal, computer software, BASIC, QBASIC, pseudocode, flowchart, JAVA, Computer generations

Introduction to Computer Science summary

Author: Ufele Chris

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: hardware, software, types of computer, input, output, computer monitor, computer storage, history of computer, computer software, problem solving, algorithm, Programming, programming language, BASIC, JAVA, computer networking, networking

Computer Science

Author: Elango, Jothi, Malaiarasu, Ramachandran, Rhymend Uthariaraj

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: CPT111

Topics: History of Computers, Data, Information, Program, Hardware, Software, Number system, computer organization, digital logic, operating system, computer communication

Parallel programming, 2nd edition

Author: Barry Wilkinson, Michael Allen

School: Edo University

Department: Science and Technology

Course Code: CMP221

Topics: Parallel programming, parallel computers, cluster computing, message-passing computing, message-passing programming, parallel programs, Partitioning, synchronous computations, synchronous iteration program, load balancing, Distributed Termination Detection Algorithms, Shared Memory Multiprocessors, Parallel Programming Languages, distributed shared memory, distributed shared memory programming, algorithms, sorting algorithms, numerical algorithms, matrices, image processing, Hough transform, branch-and-bound search, genetic algorithms

Foundations of Mathematical Analysis

Author: CE Chidume, Chukwudi Chidume

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH301

Topics: real number system, order relation, natural numbers, countable sets, uncountable sets, bounded sets, limits, Monotone Sequences, Sandwich Theorem, limit theorems, Bolzano-Weierstrass Theorem, Limit Superior, Limit Inferior, Cauchy Sequences, continuity, topological notions, One-sided Continuity, Continuity Theorems, Uniform Continuity, Uniform Continuity Theorems, closed sets, compact sets, continuous maps, differentiability, derivative, Rolle’s Theorem, Mean Value Theorem, L’Hospital’s Rule, Nonnegative Real Numbers series, Integral Test, Comparison Test, Limit Comparison Test, Cauchy’s Root Test, D’Alembert’s Ratio Test, Alternating Series, Absolute Convergence, Conditional Convergence, Riemann Integral, Integration, Uniform convergence, Power Series, Equicontinuity, Arzela-Ascoli Theorem

Introduction to logic ,14th edition

Author: Irving Copi, Carl Cohen, Kenneth McMahon

School: University of Ibadan

Department: Arts and Humanities

Course Code: PHI102

Topics: Logic, analyzing arguments, informal logic, language, fallacies, classical logic, Categorical Propositions, Categorical Syllogisms, Syllogisms, modern logic, symbolic logic, deduction, Quantification Theory, induction, analogy, causation, causal reasoning, science, probability

Past Questions related to Foundations of computer science

Sets, binary operation, partial fractions, mathematical induction

Year: 2020

School: University of Benin

Department: Science and Technology

Course Code: MTH110

Topics: Sets, binary operation, partial fractions, mathematical induction, real numbers, remainder theorem, factor theorem, polynomial, mapping, complex number, Argand diagram, trigonometric function, sequence, series, recurrency, D'Alembert ratio test, permutation, combination

Introduction to computer science 2007-2017

Year: 2017

School: Nnamdi Azikiwe University

Department: Science and Technology

Course Code: CSC101

Topics: Computer science, BASIC programming, binary system, logic gate, flow chart, compilers, storage device, input device, memory, number system, CPU, computer generation

Introduction to computer science, workshop practive

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: CPT111, WKS110, GST110, BIO111, STA117, PHY113, MAT111, CHM1111, CHM112

Topics: reserve words, program statements, pseudo code, flowchart, programming language, algorithm, plant location, plant layout, accident, electrical hazards, zero error, communication skills, communication, essay writing, technical report writing, essay, cell biology, organelles, cell membrane, microscopy, microscope, biodiversity, hereditary, inheritance, monocotyledons, dicotyledons, frequency distribution, questionnaire, force, tension, pressure, vector, scalar, linear motion, random motion, rotational motion, oscillatory motion, gravitational field strength, escape velocity, logarithm, surd, geometric progression, sets, Bohr postulate, Raoults's law, LeChatelier's principle, chemical bonding, electronic configuration, inorganic chemistry, Dalton atomic theory Avogadro's number

554 likely questions on Introduction to Computer Science by casrich

Year: 2021

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: Computer Science, Hardware, Software, Central Processing Unit, networking, memory, computer classification, input device, output device

Introduction to Computer Science Possible question and answers by Ndukwe chimezirim Joseph

Year: 2019

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: Algorithm, history of computer, Network, Algorithm design, data design, BASIC, computer, JAVA, Memory, operating system, optical disk

Introduction to Computer Science E-Test solution by dy'howner

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: CPT111

Topics: Data, information, UNIVAC, VLSI, Generation of computers, Machine language, logic circuit

Introduction to Computer Science 1 study questions

Year: 2017

School: University of Ilorin

Department: Science and Technology

Course Code: CSC111

Topics: data, information, storage device, memory, flowchart, pseudo code, number system, boolean algebra, Karnaugh map, logic gate, operating system, system software, application software

Introduction to Computer Science E Test Questions and solution By Sir Lake

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CPT111

Topics: database management, Generations of computer, data, operating system

Set,Logic and algebra

Year: 2018

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: MTH211

Topics: Sets, logic, Algebra

Computer Hardware design

Year: 2020

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC403

Topics: Computer hardware, arithmetic logic unit, registers, data path, logic gate, adder, keyboard, keyboard encoder, keyboard buffer, monitors, interface, data transfer

Partial automatic labouratory

Year: 2020

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: MCE513

Topics: Partial automatic laboratory, Programmable Logic Controller internal architecture, Programmable Logic Controller address bus, Programmable Logic Controller input processing, Programmable Logic Controller output processing, Programmable Logic Controller output channels, Programmable Logic Controller program scan, latching, latched circuits, reed switch, incremental shaft encoder, photoelectric transmissive switch, diaphragm pressure switch, field bus, OSI model, repeater, bridge, router, SCADA system, SCADA architecture, batch mixing system

NETWORK TOPOLOGY 1

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH403

Topics: topology, set, topological space, metric space, open function, discrete topology, discrete space, subspace topology, topological space

Discrete Structures

Year: 2021

School: Air Force Institute of Technology

Department: Science and Technology

Course Code: CSC208

Topics: Discrete Structures, Venn diagram, set, Hasse diagram, De Morgan's law, truth table, diagraph, subgraph, Hasse diagram, Poset diagram

Computer and applications TEST &EXAM

Year: 2014

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC201

Topics: DOS, RAM, GUI, BASIC, Algorithm, pseudo code, concatenation, ALU, SDRAM, VDU, EEPROM, Program loop