FREE E LEARNING PLATFORM
☰ HOMEEXCEPTIONSOOPSJVMINTRO
SYLLABUS TUTORIALS FORUM
 

AKTU DSTL Laboratory (Discrete Structures and Theory of Logic Lab)



⌂ Home    Next ❯

The Discrete Structures and Theory of Logic Laboratory (DSTL Lab) introduces students to the practical implementation of Set Theory, Graph Theory, Boolean Algebra, Recursion, Counting Techniques, Binary Relations, Data Structures, Searching, Sorting and Graph Algorithms. The laboratory follows the latest AKTU syllabus. Each experiment contains:

  • Objective
  • Theory
  • Algorithm
  • Flowchart
  • C Program
  • C Output
  • Python Program
  • Python Output
  • Dry Run
  • Complexity Analysis
  • Applications
  • Viva Questions
  • Interview Questions
  • Practice Questions

AKTU DSTL Laboratory Syllabus

Download the latest AKTU DSTL Laboratory syllabus in PDF format.

Download AKTU DSTL Lab Syllabus (PDF)

Programming Language / Tool Used : C and Maple

Experiment No. Experiment
1 Write a program in C to create two sets and perform the Union operation on sets.
2 Write a program in C to create two sets and perform the Intersection operation on sets.
3 Write a program in C to create two sets and perform the Difference operation on sets.
4 Write a program in C to create two sets and perform the Symmetric Difference operation.
5 Write a program in C to perform the Power Set operation on a set.
6 Write a program in C to display the Boolean Truth Table for AND, OR and NOT.
7 Write a program in C to find the Cartesian Product of two sets.
8 Write a program in C for Minimum Cost Spanning Tree.
9 Write a program in C for finding the Shortest Path in a Graph.

Maple Experiments (Experiment 10 - 25)

  1. Working of Computation Software Maple
  2. Discover a closed formula for a given recursive sequence and vice-versa.
  3. Recursion and Induction.
  4. Practice of various set operations.
  5. Counting.
  6. Combinatorial Equivalence.
  7. Permutations and Combinations.
  8. Difference between structures, permutations and sets.
  9. Implementation of a recursive counting technique.
  10. The Birthday Problem.
  11. Poker Hands Problem.
  12. Baseball Best-of-5 Series: Experimental Probabilities.
  13. Baseball: Binomial Probability.
  14. Expected Value Problems.
  15. Basketball: One and One.
  16. Binary Relations: Influence.

Data Structure Programs

Experiment No. Experiment
1 Sorting Algorithms (Non-Recursive)
2 Sorting Algorithms (Recursive)
3 Searching Algorithm
4 Implementation of Stack using Array
5 Implementation of Queue using Array
6 Implementation of Circular Queue using Array
7 Implementation of Stack using Linked List
8 Implementation of Queue using Linked List
9 Implementation of Circular Queue using Linked List
10 Implementation of Binary Search Tree (Insertion, Deletion and Traversal)
11 Graph Implementation, BFS, DFS, Minimum Cost Spanning Tree and Shortest Path Algorithm.

Key Features of NoidaTut DSTL Lab

  • Complete Theory
  • C Programs
  • Python Programs
  • Sample Outputs
  • Algorithms
  • Flowcharts
  • Complexity Analysis
  • Dry Run
  • Viva Questions
  • Interview Questions
  • Practice Questions
  • AKTU Examination Focus




⌂ Home    Next ❯





Copyright 2020 by Noidatut. All Rights Reserved.

Noidatut.com