Free AKTU notes, question banks, previous year papers & syllabus — new material added regularly. Browse free resources
Cover of AKTU Discrete Structure & Logic Lab (BCS353) Syllabus PDF – B.Tech 2nd Year
FREE

AKTU Discrete Structure & Logic Lab (BCS353) Syllabus PDF – B.Tech 2nd Year

Discrete Structure & Logic Lab BCS353

All syllabus, notes, question bank & PYQ for this subject

  • English
  • Semester 3
  • 0 downloads
  • 0 views
Official AKTU syllabus of Discrete Structure & Logic Lab (BCS353) for B.Tech 2nd Year – 1 credits, L-T-P 0-0-2. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.

Syllabus — Discrete Structure & Logic Lab

Download PDF

BCS353 · 1 credits · L-T-P 0-0-2

Programming Language/Tool Used: C and Mapple

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

Ratings & Reviews

No reviews yet — share your experience with this item.

Write a review

CAPTCHA — solve the equation shown

Reviews are checked by our team before appearing publicly.