0% found this document useful (0 votes)
157 views3 pages

S. No Date Name of The Experiment NO Marks Signature

This document contains a list of 22 experiments related to programming concepts like data structures, algorithms, functions, strings, pointers, and more. The experiments include topics like addition of numbers, area of a circle, printing numbers using arrays, matrix operations, dynamic memory allocation, linked lists, stacks, queues, trees, sorting algorithms, and hashing techniques. Each experiment is numbered and will be completed on separate pages with marks and signatures.

Uploaded by

Karthik Kumar M
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
0% found this document useful (0 votes)
157 views3 pages

S. No Date Name of The Experiment NO Marks Signature

This document contains a list of 22 experiments related to programming concepts like data structures, algorithms, functions, strings, pointers, and more. The experiments include topics like addition of numbers, area of a circle, printing numbers using arrays, matrix operations, dynamic memory allocation, linked lists, stacks, queues, trees, sorting algorithms, and hashing techniques. Each experiment is numbered and will be completed on separate pages with marks and signatures.

Uploaded by

Karthik Kumar M
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

S.

DATE NAME OF THE EXPERIMENT PAGE MARKS SIGNATURE


No NO​.
1.a Addition Of Two Numbers

1.b Area Of Circle

1.c Odd Or Even

1.d Print ‘N’ Natural Numbers

1.e Sum Of “N” Numbers

1.f Factorial Of A Number

2.a Sum Of Digits Of A Number

2.b Calculator Using Switch Case

2.c Odd Or Even Using Switch And For Loop

3 Data Manipulation In C

4.a Printing Numbers Using Array

4.b Sum Of Numbers Using Array

5 Sorting

6.a Matrix Addition

6.b Matrix Multiplication

7 Dynamic Memory Allocation

8.a Functions With Return Type And With Arguments

8.b Functions With Return Type Without Arguments

8.c Functions Without Return Type With Arguments

8.d Functions Without Return Type Without


Arguments
9.a String Length And String Copy

9.b String Compare And Concatenate

10 Students Details Using Structure

11 Addition Using Pointers

12 Singly Linked List

13 Doubly Linked List

14.a Linked List Implementation Of Stack

14.b Linked List Implementation Of Queue

15.a Array Implementation Of Stack

15,b Array Implementation Of Queue

16 Application Of Stack

17 Convert Infix To Postfix Expression

18 Binary Search Tree

19 Binary Tree Traversal

20.a Binary Search

20.b Linear SEARCH

21.a Bubble Sort

21.b Insertion Sort

21.c Selection Sort

21.d Quick Sort

21.e Merge Sort

22 Implementation Of Hashing Techniques

You might also like