Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/rajjitlai/bca-3rd-sem-c-programs

C programs for BCA 3rd Semester 2023-2024
https://github.com/rajjitlai/bca-3rd-sem-c-programs

arrays bca c c-language c-programming-language coding-interviews cprogramming data-structrues data-structures dsc linked-list stack

Last synced: about 1 month ago
JSON representation

C programs for BCA 3rd Semester 2023-2024

Host: GitHub
URL: https://github.com/rajjitlai/bca-3rd-sem-c-programs
Owner: rajjitlai
Created: 2023-09-01T01:21:31.000Z (about 1 year ago)
Default Branch: main
Last Pushed: 2024-09-10T07:58:19.000Z (2 months ago)
Last Synced: 2024-10-12T17:04:19.303Z (about 1 month ago)
Topics: arrays, bca, c, c-language, c-programming-language, coding-interviews, cprogramming, data-structrues, data-structures, dsc, linked-list, stack
Language: C
Homepage:
Size: 570 KB
Stars: 2
Watchers: 1
Forks: 1
Open Issues: 0
Metadata Files:
- Readme: Readme.md

Awesome Lists containing this project

README

        # Data Structures Using C Programming

Welcome to the repository for Data Structures using C programming. Here, you will find practical, class, and test codes that will help you learn and practice data structures - by [Rajjit Laishram](https://mypersonalportfolio-rl.netlify.app/) and [Oinam Akash Khuman](https://github.com/AkashOinam)

---

![Image](https://github.com/rajjitlai/BCA-3rd-SEM-C-Programs/blob/main/image/c-programs.jpg)

---

## Practical Codes

- **P1. Traversing an Array**

  - [Code](./practical-codes/traverseArray.c)

- **P2. Insertion and Traversal in 2D Arrays**

  - (i) Inserting Numbers

    - [Code](./practical-codes/2DTraverse.c)

  - (ii) Inserting Characters

    - [Code](./practical-codes/insert2DTraverse.c)

  - (iii) Inserting Floating Numbers

    - [Code](./practical-codes/insert2DFTraverse.c)

- **P3. Linear Search in Arrays**

  - (i) Standard Search

    - [Code](./practical-codes/linearSearch.c)

  - (ii) Backward and Forward Search

    - [Code](./practical-codes/linearSearchBackFor.c)

- **P4. Sparse Matrices**

  - (i) Lower Matrices

    - [Code](./practical-codes/sparseLower.c)

  - (ii) Upper Matrices

    - [Code](./practical-codes/sparseUpper.c)

  - Diagonal

    - [Code](./practical-codes/diagonalSparse.c)

- **P5. Bubble Sort**

  - (i) Using Flag

    - [Code](./practical-codes/bubbleSort.c)

  - (ii) Options for Ascending/Descending

    - [Code](./practical-codes/bubbleOption.c)

- **P6. Insertion Sort**

  - [Code](./class-codes/insertionSort.c)

- **P7. Count Occurrence in Arrays**

  - [Code](./practical-codes/checkoccurance.c)

- **P8. Diagonal Matrix in 1D**

  - [Code](./practical-codes/onediDiaMat.c)

- **P9. Lower Triangular Matrix in 1D**

  - [Code](./practical-codes/onediLoTrMat.c)

- **P10. Linked List Operations**

  - Insert at Beginning, End, or Any Position

    - [Code](./class-codes/link-list-with-3-ins-hard.c)

- **P11. Linked List Deletion**

  - Delete at Beginning, End, Any Position, and Search

    - [Code](./class-codes/deletion.c)

- **P12. Linked List Searching**

  - [Code](./practical-codes/link-list-item-search.c)

- **P13. Concatenate Linked Lists**

  - [Code](./practical-codes/concat.c)

- **P14. Reverse Linked Lists**

  - Single Linked Lists

    - [Code](./practical-codes/reverse.c)

  - Double Linked Lists

    - [Code](./class-codes/double-rev.c)

- **P15. Linear Queue Operations**

  

  - Insertion, Deletion, Peek, and Display

    - [Code](./class-codes/queue-ins-del.c)

  

- **P16. Circular Queue Operations**

  

  - Insertion, Deletion, Search, and Display

    - [Code](./class-codes/queue-ins-del-circular.c)

- **P17. Linked Queue Operations**

  - Insertion, Deletion, Display and Peek using dynamic memory allocation

    - [Code](./class-codes/linkedQueue.c)

- **P18. Stack Implementation**

  - (i) Push, Pop, Display using array

    - [Code](./class-codes/stack.c)

  - (ii) Push, Pop, Display using dynamic memory allocation

    - [Code](./practical-codes/stack-dynamic.c)

- **P19. Factorial of a number and its factors**

  - (i) Using Recursion

    - [Code](./practical-codes/recFac.c)

  - (ii) Using Iteration

    - [Code](./practical-codes/itFac.c)

  

- **P20. Printing Fibonacci series**

  - (i) Using Recursion

    - [Code](./practical-codes/recFibo.c)

  - (ii) Using Iteration

    - [Code](./practical-codes/itFibo.c)

- **P21. Greatest Common Divisor of a number**

  - (i) Using Recursion

    - [Code](./practical-codes/recGCD.c)

  - (ii) Using Iteration

    - [Code](./practical-codes/itGCD.c)

- **P22. Implement Queue using multiple stack**

  - [Code](./practical-codes/queue-multiple-stack.c)

  

- **P23. Implement reverse of stack using another stack**

  - [Code](./practical-codes/reverse-stack.c)

- **P24. Program to implement binary tree displaying Preorder, Inorder and Postorder notations**

  - [Code](./practical-codes/binary-tree.c)

- **P25. Program to implement binary search tree (BST) displaying Preorder, Inorder and Postorder notations - with insertion, deletion, searching**

  - [Code](./practical-codes/BST.c)

- **P26. Program to implement AVL tree**

  - [Code](./practical-codes/AVL.c)

- **P27. Program to implement Heap Tree (Binary) -  Max Heap**

  - [Code](./practical-codes/heap-tree.c)

  

## Class Codes

- **Searching an element in an array using Binary Search**

  - [Code](./class-codes/binarySearch.c)

- **Searching an element in an array using Binary Search from Forward or Backward**

  - [Code](./class-codes/binarySearchOptions.c)

- **Search a Character in an Array**

  - [Code](./class-codes/searchChar.c)

- **Swap Two Values without Using a Third Variable**

  - [Code](./class-codes/swapnoVar.c)

- **Bubble Sort**

  - [Code](./class-codes/bubSort.c)

- **Insertion Sort**

  - [Code](./class-codes/insertionSort.c)

- **Sort an Array in Ascending Order**

  - With Exchanges and Comparisons Count

    - [Code](./class-codes/sortnprintstep.c)

- **Link List Operations**

  - Insertion at the Beginning, End, or Any Position

    - [Code](./class-codes/link_list_switch.c)

  - Options for Insertion

    - [Code](./class-codes/link-list-with-3-ins.c)

  - Options for Insertion with Data Acceptance

    - [Code](./class-codes/link-list-with-3-ins-hard.c)

  - Displaying Elements

    - [Code](./class-codes/inserndisplay.c)

  - Counting Nodes

    - [Code](./class-codes/createnCountnode.c)

  - Double Linked List Operations

    - [Code](./class-codes/double-all.c)

  - Printing Double Linked Lists in Reverse

    - [Code](./class-codes/double-rev.c)

  

- **Queue Operations**

  - Insertion, Deletion, and Display

    - [Code](./class-codes/queue-ins-del.c)

  - Linked Queue Using Dynamic Memory Allocation

    - [Code](./class-codes/linkedQueue.c)

- **Priority Queue**

  - Program to illustrate Priority Queue

    - [Code](./class-codes/priority-queue.c)

## Test Codes

- **Test 1 - 1 - Fibonacci Series and Repetition Check**

  - [Code](./test-codes/1-check.c)

- **Test 1 - 2 - Multiples of a Number**

  - [Code](./test-codes/1-check1.c)

- **Test 1 - 3 - Index Multiplication and Repetition Check**

  - [Code](./test-codes/1-check2.c)

- **Test 1 - 4 - Insert and Calculate Factorial/Multiplication**

  - [Code](./test-codes/1-check3.c)

- **Test 2 - 1 - Student Roll Numbers with Grade B**

  - [Code](./test-codes/2-student-link-list.c)

- **Test 2 - 2 - Linked List Insertion**

  - [Code](./test-codes/2-link-list-insertion.c)

- **Class Test 2 - 1**

  - [Code](./test-codes/class-test-2-1.c)

- **Class Test 2 - 2**

  - [Code](./test-codes/class-test-2-2.c)

- **Test 3 - 3 - Ticket Recording with Circular Queue**

  - [Code](./test-codes/prac-test-3.c)

- **Class Test 3 - 1 - Program to implement circular queue operations**

  - [Code](./class-codes/queue-ins-del-circular.c)

  

- **Class Test 3 - 2 - Program to implement deque (deck) using Linked List**

  - [Code](./test-codes/deque-linked.c)

---

## Thank you for visiting! Happy Coding! 🎉🎉🎉