Discrete math, also known as “math for computer science” is usually a required course for students of computer science. The material typically covered in this class for CS students overlaps with fields such as cryptography, logic, information theory, theoretical computer science, artificial intelligence, design of algorithms, and others, and teaches the basic language and structures used by computer scientists. Sometimes discrete math is listed as a mathematics course. As a math class, it mainly deals with other abstract concepts (algebra, groups, or combinatorics) with a correspondingly heavier focus on proofs. A common characteristic of these classes is that for most students this is their first encounter with mathematical structures and proof. Unlike, for example, calculus classes, there is no commonly accepted definition or syllabus for this course and its content varies by school. The goal of this topic is to provide important representation models for data sets. This class provides ways for refining the original data model to something more easily understandable in respect to 1) representation format and 2) operations that can be executed on discrete data.  

Most discrete math – computer science classes cover the following topics in some order and with varying degree of depth:

  • Basics of logic and mathematical proof (proof by contradiction, proof by induction)
  • Set theory and notation
  • Representation of integers (bits, bitstring Boolean algebra)
  • Basic number theory, computing modules and integer definitions of relations (what is a relational data base? A hash table?), and functions
  • Basics of graph theory – directed and undirected graphs, useful to understand networking and telecommunications
  • Introduction to methods of counting – permutations, combinations etc.
  • Combinatorics
  • Algorithms – for example sorting algorithms
  • Algorithm complexity and estimation of run time – Big O Notation
  • Computational Models, finite state machines, pseudocode – basic principles of programming
  • Methods of encryption and secure communication – for example RSA algorithms- an introduction to cryptography

 

To fulfill our tutoring mission of online education, our college homework help and online tutoring centers are standing by 24/7, ready to assist college students who need homework help with all aspects of discrete math - computer science. Our computer science tutors can help with all your projects, large or small, and we challenge you to find better online discrete math tutoring anywhere.

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Decision:
Upload a file
Continue without uploading

SUBMIT YOUR HOMEWORK
We couldn't find that subject.
Please select the best match from the list below.
For faster response, you may skip assigning directly to a tutor to receive the first tutor available.
That tutor may not be available for several hours. Please try another tutor if you're in a hurry.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Get help from a qualified tutor

Latest News

Read All News
September 16, 2019

Question of the Week

If an address bus needs to be able to address four devices, how many conductors will be required?  What if each of those devices also needs to be able to talk back to the I/O control device? The solution of the previous question of the week can be seen below. The maximum aggregate I/O transfer rate of the system is equal to: 700Kbystes/s + 700 Kbytes...
READ MORE
August 16, 2019

Machine Learning

24HourAnswers now offers college homework help and online tutoring in Machine Learning. To learn more about the subject or request a session with one of our tutors, please view our subject page Machine Learning  
READ MORE
Live Chats