Scribd
Upload
330 views

Data Structure Using C Lab (KCS351) : Programming Language/Tool Used: C and Mapple

The document outlines the lab assignments for three courses - Data Structure using C Lab, Computer Organization Lab, and Discrete Structure & Logic Lab. For Data Structure using C Lab, the assignments involve implementing sorting, searching, and various data structures like stacks, queues, trees using arrays and linked lists. For Computer Organization Lab, the assignments involve designing basic logic gates, decoders, multiplexers and various components of a computer. For Discrete Structure & Logic Lab, the assignments involve set operations, Boolean logic, graph algorithms and minimum spanning trees using C programming language and Maple tool.

Uploaded by

Sanjay Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
330 views

Data Structure Using C Lab (KCS351) : Programming Language/Tool Used: C and Mapple

The document outlines the lab assignments for three courses - Data Structure using C Lab, Computer Organization Lab, and Discrete Structure & Logic Lab. For Data Structure using C Lab, the assignments involve implementing sorting, searching, and various data structures like stacks, queues, trees using arrays and linked lists. For Computer Organization Lab, the assignments involve designing basic logic gates, decoders, multiplexers and various components of a computer. For Discrete Structure & Logic Lab, the assignments involve set operations, Boolean logic, graph algorithms and minimum spanning trees using C programming language and Maple tool.

Uploaded by

Sanjay Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structure using C Lab (KCS351)

Write C Programs to illustrate the concept of the following:


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 Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and Deletion in
BST.
11. Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm.
Computer Organization Lab (KCS352)

1. Implementing HALF ADDER, FULL ADDER using basic logic gates


2. Implementing Binary -to -Gray, Gray -to -Binary code conversions.
3. Implementing 3-8 line DECODER.
4. Implementing 4x1 and 8x1 MULTIPLEXERS.
5. Verify the excitation tables of various FLIP-FLOPS.
6. Design of an 8-bit Input/ Output system with four 8-bit Internal Registers.
7. Design of an 8-bit ARITHMETIC LOGIC UNIT.
8. Design the data path of a computer from its register transfer language description.
9. Design the control unit of a computer using either hardwiring or microprogramming based on its register
transfer language description.
10. Implement a simple instruction set computer with a control unit and a data path.
Discrete Structure & Logic Lab (KCS353)

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

You might also like