Posts

Data Structures Lab PCCSL307 KTU 2024 Scheme - Dr Binu V P

About Me    Dr Binu V P Scheme and Assessments Experiment List and References Learn the theory well before you try the programs  Data Structures and Algorithms PCCST303 Lab Assignments Format of the Lab Record Lab Cycle ( Mandatory Programs) 1.Polynomial Addition Using Arrays 2.Sparse Matrix- Transpose and Addition 3.Stack    Implement  stack using array    Infix to Postfix Conversion and Evaluation 4.Queue    Queue using array     Circular Queue using array     Double ended Queue using array 5.Singly Linked List      Singly  Linked list and operations     Stack using linked list     Queue using linked list    Polynomial addition using linked list    Polynomial multiplication using linked list     Priority Queue-Post office customers simulation     Circular Queue using Linked List     Count the occurrence of a word   ...
Post a Comment
Read more

Data Structures Lab PCCSL 307 KTU BTech 2024 Scheme and Assessment Methods

  Course  Code PCCSL307 CIE  Marks 50 Teaching  Hours/Week (L:T:P: R) 0:0:3:0 ESE  Marks 50 Credits 2 Exam  Hours 2Hrs.30 Min. Prerequisites(if  any) GXEST 204 Course  Type Lab Course Objectives: To give practical experience for learners on implementing different linear and nonlinear data structures, and algorithms for searching and sorting. Course Assessment Method(CIE: 50 marks, ESE: 50 marks) Continuous Internal Evaluation Marks(CIE):     Attendance Preparation/Pre-Lab Work  experiments, Viva and Timely completion of Lab Reports/Record (Continuous  Assessment)   Internal Examination     Total 5 25 20 50 Continuous Assessment (25 Marks) 1. Prepar...
Post a Comment
Read more

Lab Record Format

  Program/output On The Left Page. Aim, Description ,analysis and results on the Right Page Linear Search // Linear Search in C #include <stdio.h> int main() { int arr[100], n, target, i, found = 0; printf("Enter the number of elements: "); scanf("%d", &n); printf("Enter the elements:\n"); for(i = 0; i < n; i++) { scanf("%d", &arr[i]); } printf("Enter the element to search: "); scanf("%d", &target); for(i = 0; i < n; i++) { if(arr[i] == target) { printf("Element found at position %d\n", i); found = 1; break; } } if(!found) { printf("Element not found\n"); } return 0; } 🧪 Sample Input and Output 🔹 Sample Input 1 (Element Present at Beginning) :Best Case Enter the number of elements: 5 Enter the elements: 10 20 30 40 50 Enter the element to search: 10 🔹 Output : Element found at position 0 🔹 Sample Input 2 (Element...
Post a Comment
Read more