{"id":15049177,"url":"https://github.com/rajjitlai/bca-3rd-sem-c-programs","last_synced_at":"2026-03-01T21:36:11.242Z","repository":{"id":191970786,"uuid":"685772520","full_name":"rajjitlai/BCA-3rd-SEM-C-Programs","owner":"rajjitlai","description":"C programs for BCA 3rd Semester 2023-2024","archived":false,"fork":false,"pushed_at":"2024-09-10T07:58:19.000Z","size":584,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-24T03:23:06.170Z","etag":null,"topics":["arrays","bca","c","c-language","c-programming-language","coding-interviews","cprogramming","data-structrues","data-structures","dsc","linked-list","stack"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rajjitlai.png","metadata":{"files":{"readme":"Readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-09-01T01:21:31.000Z","updated_at":"2024-09-10T07:58:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"a0a39bb8-7afc-4a69-b1fc-8ddbc5ff1f4e","html_url":"https://github.com/rajjitlai/BCA-3rd-SEM-C-Programs","commit_stats":null,"previous_names":["rajjitlai/bca-3rd-sem-c-programs"],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajjitlai%2FBCA-3rd-SEM-C-Programs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajjitlai%2FBCA-3rd-SEM-C-Programs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajjitlai%2FBCA-3rd-SEM-C-Programs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajjitlai%2FBCA-3rd-SEM-C-Programs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rajjitlai","download_url":"https://codeload.github.com/rajjitlai/BCA-3rd-SEM-C-Programs/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248142096,"owners_count":21054592,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["arrays","bca","c","c-language","c-programming-language","coding-interviews","cprogramming","data-structrues","data-structures","dsc","linked-list","stack"],"created_at":"2024-09-24T21:18:45.722Z","updated_at":"2026-03-01T21:36:11.204Z","avatar_url":"https://github.com/rajjitlai.png","language":"C","readme":"# Data Structures Using C Programming\n\nWelcome 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)\n\n---\n\n![Image](https://github.com/rajjitlai/BCA-3rd-SEM-C-Programs/blob/main/image/c-programs.jpg)\n\n---\n\n## Practical Codes\n\n- **P1. Traversing an Array**\n\n  - [Code](./practical-codes/traverseArray.c)\n\n- **P2. Insertion and Traversal in 2D Arrays**\n\n  - (i) Inserting Numbers\n    - [Code](./practical-codes/2DTraverse.c)\n  - (ii) Inserting Characters\n    - [Code](./practical-codes/insert2DTraverse.c)\n  - (iii) Inserting Floating Numbers\n    - [Code](./practical-codes/insert2DFTraverse.c)\n\n- **P3. Linear Search in Arrays**\n\n  - (i) Standard Search\n    - [Code](./practical-codes/linearSearch.c)\n  - (ii) Backward and Forward Search\n    - [Code](./practical-codes/linearSearchBackFor.c)\n\n- **P4. Sparse Matrices**\n\n  - (i) Lower Matrices\n    - [Code](./practical-codes/sparseLower.c)\n  - (ii) Upper Matrices\n    - [Code](./practical-codes/sparseUpper.c)\n  - Diagonal\n    - [Code](./practical-codes/diagonalSparse.c)\n\n- **P5. Bubble Sort**\n\n  - (i) Using Flag\n    - [Code](./practical-codes/bubbleSort.c)\n  - (ii) Options for Ascending/Descending\n    - [Code](./practical-codes/bubbleOption.c)\n\n- **P6. Insertion Sort**\n\n  - [Code](./class-codes/insertionSort.c)\n\n- **P7. Count Occurrence in Arrays**\n\n  - [Code](./practical-codes/checkoccurance.c)\n\n- **P8. Diagonal Matrix in 1D**\n\n  - [Code](./practical-codes/onediDiaMat.c)\n\n- **P9. Lower Triangular Matrix in 1D**\n\n  - [Code](./practical-codes/onediLoTrMat.c)\n\n- **P10. Linked List Operations**\n\n  - Insert at Beginning, End, or Any Position\n    - [Code](./class-codes/link-list-with-3-ins-hard.c)\n\n- **P11. Linked List Deletion**\n\n  - Delete at Beginning, End, Any Position, and Search\n    - [Code](./class-codes/deletion.c)\n\n- **P12. Linked List Searching**\n\n  - [Code](./practical-codes/link-list-item-search.c)\n\n- **P13. Concatenate Linked Lists**\n\n  - [Code](./practical-codes/concat.c)\n\n- **P14. Reverse Linked Lists**\n\n  - Single Linked Lists\n    - [Code](./practical-codes/reverse.c)\n  - Double Linked Lists\n    - [Code](./class-codes/double-rev.c)\n\n- **P15. Linear Queue Operations**\n  \n  - Insertion, Deletion, Peek, and Display\n    - [Code](./class-codes/queue-ins-del.c)\n  \n- **P16. Circular Queue Operations**\n  \n  - Insertion, Deletion, Search, and Display\n    - [Code](./class-codes/queue-ins-del-circular.c)\n\n- **P17. Linked Queue Operations**\n\n  - Insertion, Deletion, Display and Peek using dynamic memory allocation\n    - [Code](./class-codes/linkedQueue.c)\n\n- **P18. Stack Implementation**\n\n  - (i) Push, Pop, Display using array\n    - [Code](./class-codes/stack.c)\n  - (ii) Push, Pop, Display using dynamic memory allocation\n    - [Code](./practical-codes/stack-dynamic.c)\n\n- **P19. Factorial of a number and its factors**\n\n  - (i) Using Recursion\n    - [Code](./practical-codes/recFac.c)\n  - (ii) Using Iteration\n    - [Code](./practical-codes/itFac.c)\n  \n- **P20. Printing Fibonacci series**\n\n  - (i) Using Recursion\n    - [Code](./practical-codes/recFibo.c)\n  - (ii) Using Iteration\n    - [Code](./practical-codes/itFibo.c)\n\n- **P21. Greatest Common Divisor of a number**\n\n  - (i) Using Recursion\n    - [Code](./practical-codes/recGCD.c)\n  - (ii) Using Iteration\n    - [Code](./practical-codes/itGCD.c)\n\n- **P22. Implement Queue using multiple stack**\n  - [Code](./practical-codes/queue-multiple-stack.c)\n  \n- **P23. Implement reverse of stack using another stack**\n  - [Code](./practical-codes/reverse-stack.c)\n\n- **P24. Program to implement binary tree displaying Preorder, Inorder and Postorder notations**\n  - [Code](./practical-codes/binary-tree.c)\n\n- **P25. Program to implement binary search tree (BST) displaying Preorder, Inorder and Postorder notations - with insertion, deletion, searching**\n  - [Code](./practical-codes/BST.c)\n\n- **P26. Program to implement AVL tree**\n  - [Code](./practical-codes/AVL.c)\n\n- **P27. Program to implement Heap Tree (Binary) -  Max Heap**\n  - [Code](./practical-codes/heap-tree.c)\n  \n## Class Codes\n- **Searching an element in an array using Binary Search**\n  - [Code](./class-codes/binarySearch.c)\n\n- **Searching an element in an array using Binary Search from Forward or Backward**\n  - [Code](./class-codes/binarySearchOptions.c)\n\n- **Search a Character in an Array**\n  - [Code](./class-codes/searchChar.c)\n\n- **Swap Two Values without Using a Third Variable**\n  - [Code](./class-codes/swapnoVar.c)\n\n- **Bubble Sort**\n  - [Code](./class-codes/bubSort.c)\n\n- **Insertion Sort**\n  - [Code](./class-codes/insertionSort.c)\n\n- **Sort an Array in Ascending Order**\n  - With Exchanges and Comparisons Count\n    - [Code](./class-codes/sortnprintstep.c)\n\n- **Link List Operations**\n  - Insertion at the Beginning, End, or Any Position\n    - [Code](./class-codes/link_list_switch.c)\n  - Options for Insertion\n    - [Code](./class-codes/link-list-with-3-ins.c)\n  - Options for Insertion with Data Acceptance\n    - [Code](./class-codes/link-list-with-3-ins-hard.c)\n  - Displaying Elements\n    - [Code](./class-codes/inserndisplay.c)\n  - Counting Nodes\n    - [Code](./class-codes/createnCountnode.c)\n  - Double Linked List Operations\n    - [Code](./class-codes/double-all.c)\n  - Printing Double Linked Lists in Reverse\n    - [Code](./class-codes/double-rev.c)\n  \n- **Queue Operations**\n  - Insertion, Deletion, and Display\n    - [Code](./class-codes/queue-ins-del.c)\n  - Linked Queue Using Dynamic Memory Allocation\n    - [Code](./class-codes/linkedQueue.c)\n\n- **Priority Queue**\n  - Program to illustrate Priority Queue\n    - [Code](./class-codes/priority-queue.c)\n\n## Test Codes\n- **Test 1 - 1 - Fibonacci Series and Repetition Check**\n  - [Code](./test-codes/1-check.c)\n\n- **Test 1 - 2 - Multiples of a Number**\n  - [Code](./test-codes/1-check1.c)\n\n- **Test 1 - 3 - Index Multiplication and Repetition Check**\n  - [Code](./test-codes/1-check2.c)\n\n- **Test 1 - 4 - Insert and Calculate Factorial/Multiplication**\n  - [Code](./test-codes/1-check3.c)\n\n- **Test 2 - 1 - Student Roll Numbers with Grade B**\n  - [Code](./test-codes/2-student-link-list.c)\n\n- **Test 2 - 2 - Linked List Insertion**\n  - [Code](./test-codes/2-link-list-insertion.c)\n\n- **Class Test 2 - 1**\n  - [Code](./test-codes/class-test-2-1.c)\n\n- **Class Test 2 - 2**\n  - [Code](./test-codes/class-test-2-2.c)\n\n- **Test 3 - 3 - Ticket Recording with Circular Queue**\n  - [Code](./test-codes/prac-test-3.c)\n\n- **Class Test 3 - 1 - Program to implement circular queue operations**\n  - [Code](./class-codes/queue-ins-del-circular.c)\n  \n- **Class Test 3 - 2 - Program to implement deque (deck) using Linked List**\n  - [Code](./test-codes/deque-linked.c)\n\n---\n\n## Thank you for visiting! Happy Coding! 🎉🎉🎉\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajjitlai%2Fbca-3rd-sem-c-programs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frajjitlai%2Fbca-3rd-sem-c-programs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajjitlai%2Fbca-3rd-sem-c-programs/lists"}