Scribd
Upload
39 views3 pages

C4 LCA Statements 2021-22

The document outlines multiple problem statements for implementing C programs, including operations on circular and linear queues, simulating a pizza parlor order system, creating and traversing Binary Search Trees (BST), and constructing adjacency matrices for graphs with BFS and DFS algorithms. Each problem specifies the required operations and data types to be used. The focus is on fundamental data structures and algorithms in C programming.

Uploaded by

harsh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
39 views3 pages

C4 LCA Statements 2021-22

The document outlines multiple problem statements for implementing C programs, including operations on circular and linear queues, simulating a pizza parlor order system, creating and traversing Binary Search Trees (BST), and constructing adjacency matrices for graphs with BFS and DFS algorithms. Each problem specifies the required operations and data types to be used. The focus is on fundamental data structures and algorithms in C programming.

Uploaded by

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

Problem Statement 1.

Implement a C program to perform following operations on


circular queue using array-i) enqueue 8 integer elements ii)
Display queue values iii) deque 3 elements

Problem Statement 2. Implement a C program to perform following operations on linear


queue using array-i) enqueue 6 integer elements ii) Display queue
values iii) deque 3 elements

Problem Statement 3. Implement a C program to perform following operations on linear


queue using array-i) enqueue 5 characters ii) Display queue
values iii) deque 3 characters

Problem Statement 4. Pizza parlor accepting maximum N orders. Orders are served in
first come first served basis. Write a C program to simulate the
system with simple linear queue using array.

Problem Statement 5. Pizza parlor accepting maximum N orders. Orders are served in
first come first served basis. Write a C program to simulate the
system with circular queue using array.

Problem Statement 6. Implement a C program to create Binary Search Tree (BST) and
display its values using inorder traversing algorithm.

Problem Statement 7. Implement a C program to create Binary Search Tree (BST) and
display its values using preorder traversing algorithm.

Problem Statement 8. Implement a C program to create Binary Search Tree (BST) and
display its values using postorder traversing algorithm.

Problem Statement 9. Implement a C program to create Binary Search Tree (BST) and
write a function to search an element.

Problem Statement 10. Implement a C program to create Binary Search Tree (BST) to
store characters and display its values using postorder traversing
algorithm.
Problem Statement 11. Implement a C program to create adjacency matrix of a graph and
display graph the node values using Breadth First Search
algorithm (BFS)
0 2

1 3

Problem Statement 12. Implement a C program to create adjacency matrix of a graph and
display graph the node values using Breadth First Search
algorithm (BFS)

0 2

1 3

Problem Statement 13. Implement a C program to create adjacency matrix of a graph and
display graph the node values using Breadth First Search
algorithm (BFS)

0 2

1 3

4
Problem Statement 14. Implement a C program to create adjacency matrix of a graph and
display graph the node values using Depth First Search algorithm
(DFS)
0 2

1 3

Problem Statement 15. Implement a C program to create adjacency matrix of a graph and
display graph the node values using Depth First Search algorithm
(DFS)

0 2

1 3

You might also like