Sign in
Information Bulletin
Question Submission
Student Space
More
Live class
Now Home (Computer Science ), DSA (Data structures & Algorithms), Theory of Computation & Compilers, Machine Learning, and UGC NET Webpages, Discrete Structures and Optimization are available || Click on Student Space to Submit & View Question Answer || ICC WORLD CUP PREDICTION ||

Discrete Structures and Optimization

Discrete Structures and Optimization is a field of study that deals with mathematical structures that are discrete rather than continuous. These structures include graphs, integers, logic-based statements, and more. Discrete optimization is a subfield of optimization that deals with discrete variables. It involves finding the best solution from a finite set of possible solutions.

There are many topics covered in Discrete Structures and Optimization. Some of the topics include set theory, recurrence relation, group theory, graph theory, mathematical logic, probability theory, Boolean algebra, linear programming, and more.


Content Video

  • Discrete Structures and Optimization
    • Theory of Computation
    • Compilers

Discrete Structures and Optimization

Unit Details Contents
Unit -I
Unit -II
Unit -III
Unit -IV
Unit -V
Unit -VI
Unit -VII

INTRODUCTION


ONLINE TOPICS

Stack vs Heap Memory

17 Aug 2023

Data Structure

29 Jul 2023

How to use OnlineGDB

30 Jul 2023


23 Mar 2023
Weather

23 Mar 2023
Mail


RANDOM QUESTION & ANSWER :
IDQuestionAnswer
5 What is double hashing?Double hashing is a technique used in hash tables to resolve collisions, which occur when two different keys hash to the same index. It employs two distinct hash functions to calculate two hash values for a given key: the initial hash value and the step size for probing.