CST 201 Data Structures University Question Papers KTU

 

 

 

Comments

Post a Comment

Popular posts from this blog

Data Structures CST 201 KTU Third Semester Syllabus Notes and Solved Questions- Dr Binu V P 984739060

Dr BinuV P -About Me About The Course Syllabus Data Structures Lab CSL 201 ( Do the Programs to Understand the Concept Well) Model Question Paper CST 201 Data Structures University Question Papers CST 201 Data Structures Module-1 Basic Concepts of Data Structures 1.1 System Life Cycle 1.2 Algorithms , Performance Analysis  1.3 Space Complexity, Time Complexity  1.4 Asymptotic Analysis and Notations  1.5 Complexity Calculation of Simple Algorithms Module-2 Arrays and Searching  2.1 Polynomial representation using Arrays  2.2 Sparse matrix  2.3 Stacks  2.4 Queues 2.5 Circular Queues  2.6 Priority Queues 2.7 Double Ended Queues 2.8 Infix to  Postfix Conversion  2.9  Evaluation of Postfix Expression 2.10 Linear Search  2.11 Binary Search Module-3 Linked List and Memory Management 3.1 Linked List -Self Referential Structures  3.2 Dynamic Memory Allocation  3.3 Singly Linked List-Operations on Linked List 3.4...
Read more

Self Refrential Data Structures

Image
A self-referential data structure, also known as a recursive data structure, is a data structure in which each instance of the structure contains a reference to another instance of the same type. This self-referential property allows for the creation of complex and hierarchical structures. Common examples of self-referential data structures include linked lists, trees, and graphs. Let's look at some common examples: 1. Linked List: In a linked list, each node contains data and a reference (or a pointer) to the next node in the sequence. The last node typically has a reference set to NULL to indicate the end of the list. struct Node {     int data;     struct Node* next; }; The next field is a self-reference to another Node structure. 2. Binary Tree: In a binary tree, each node has at most two children, each of which is a node in the same type. Nodes are connected through left and right pointers. struct TreeNode {     int data;     struct TreeNode*...
Read more

Dynamic Memory Allocation

Dynamic memory allocation in programming refers to the ability to allocate memory for variables or data structures during the runtime of a program. Unlike static memory allocation, where memory is assigned at compile time, dynamic memory allocation allows the program to request and release memory as needed while the program is running. In languages like C, C++, and similar low-level languages, dynamic memory allocation is often performed using functions provided by the standard library, such as malloc, calloc, realloc, and free in the <stdlib.h> header. Here's an overview of these functions with examples: malloc (Memory Allocation): Stands for "memory allocation." Allocates a specified number of bytes of memory. Returns a pointer to the first byte of the allocated memory. #include <stdlib.h> main() { int *arr; int size = 5; arr = (int*)malloc(size * sizeof(int)); if (arr == NULL) {     // Memory allocation failed     printf("Memory allocation failed.\n...
Read more