BCS353

Discrete Structure & Theory of Logic lab

L-T-P0-0-2 Credits1 Session2023-24 TypeLab / Practical
Appears in 1 semester

B.Tech Electronics & Computer Engineering · Sem 3 (Lab)

List of Experiments / Activities

  1. Programming Language/Tool Used: C and Mapple
  2. 1Write a program in C to create two sets and perform the Union operation on sets.
  3. 2Write a program in C to create two sets and perform the Intersectison operation on sets.
  4. 3Write a program in C to create two sets and perform the Difference operation on sets.
  5. 4Write a program in C to create two sets and perform the Symmetric Difference operation.
  6. 5Write a program in C to perform the Power Set operation on a set.
  7. 6Write a program in C to Display the Boolean Truth Table for AND, OR , NOT .
  8. 7Write a C Program to find Cartesian Product of two sets
  9. 8Write a program in C for minimum cost spanning tree.
  10. 9Write a program in C for finding shortest path in a Graph
  11. Note: Understanding of mathematical computation software Mapple to experiment the followings (Exp. 10 to 25):
  12. 10Working of Computation software
  13. 11Discover a closed formula for a given recursive sequence vice-versa
  14. 12Recursion and Induction
  15. 13Practice of various set operations
  16. 14Counting
  17. 15Combinatorial equivalence
  18. 16Permutations and combinations
  19. 17Difference between structures, permutations and sets
  20. 18Implementation of a recursive counting technique
  21. 19The Birthday problem
  22. 20Poker Hands problem
  23. 21Baseball best-of-5 series: Experimental probabilities
  24. 22Baseball: Binomial Probability
  25. 23Expected Value Problems
  26. 24Basketball: One and One
  27. 25Binary Relations: Influence Write C Programs to illustrate the concept of the following:
  28. 1Sorting Algorithms-Non-Recursive.
  29. 2Sorting Algorithms-Recursive.
  30. 3Searching Algorithm.
  31. 4Implementation of Stack using Array.
  32. 5Implementation of Queue using Array.
  33. 6Implementation of Circular Queue using Array.
  34. 7Implementation of Stack using Linked List.
  35. 8Implementation of Queue using Linked List.
  36. 9Implementation of Circular Queue using Linked List.
  37. 10Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and Deletion in BST.
  38. 11Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm.

Official AKTU syllabus

This subject is on page 10 of the original AKTU PDF.

Official AKTU syllabus PDF ↗