Books

Search Books...

Csc Books

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

Introduction to Languages and the Theory of Computation ,4th edition

Author: John Martin

School: University of Ibadan

Department: Science and Technology

Course Code: CSC242

Topics: Computation, languages, Mathematical Tools, Regular Expressions, Nondeterminism, Kleene’s Theorem, Context-Free Languages, Finite Automata, Pushdown Automata, Non-Context-Free Languages, Undecidable Problems, Decision Problems Involving Turing Machines, turing machines, computable functions, Recursively Enumerable Languages, Computational Complexity

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

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

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

A Byte of Python

Author: CH Swaroop

School: University of Ibadan

Department: Science and Technology

Course Code: CSC102

Topics: Python, Python basics, operators, expressions, control flow, functions, modules, data structures, Python problem solving, object oriented programming, standard library

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

Introduction to Logic Circuits & Logic Design with Verilog

Author: Brock LaMeres

School: University of Ilorin

Department: Engineering

Course Code: ELE542, TCS209, PHY457, CSC111

Topics: number system, digital circuitry, interfacing, gate, combinational logic design, Verilog, MSI login, sequential logic design, flip-flop, programmable logic, memory, computer system design, arithmetic circuits

Introduction to Logic Circuits & Logic Design with VHDL, 2nd edition

Author: Brock LaMeres

School: University of Ilorin

Department: Engineering

Course Code: ELE542, TCS209, PHY457, CSC111

Topics: number system, digital circuitry, interfacing, gate, combinational logic design, VHDL, MSI login, sequential logic design, flip-flop, programmable logic, memory, computer system design, arithmetic circuits

Data Mining

Author: Charu Aggarwal

School: University of Ilorin

Department: Science and Technology

Course Code: CSC405, ICS402

Topics: Data mining, data preparation, similarity, distances, association pattern mining, cluster analysis, outlier analysis, data classification, mining data streams, mining text data, mining time series data, mining discrete sequences, mining spatial data, mining graph data, mining web data, social network analysis, privacy-preserving data mining

Principles of Data Mining, 3rd edition

Author: Max Bramer

School: University of Ilorin

Department: Science and Technology

Course Code: CSC405, ICS402

Topics: data mining, classification, Naıve Bayes Classifiers, Nearest Neighbour Classification, decision tree, continuous attributes, entropy, ROC, ensemble classification, comparing classifiers, association rule mining, clustering, text mining, classifying streaming data

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