Data Structures and Algorithms PCCST303 KTU 2024 Scheme- Dr Binu V P

About Me - Dr Binu V PModel Question Paper and Answers PCCST303 Data Structures and Algorithms
Data Structures and Algorithms PCCST303 University Question Paper Nov-2025 and Answer Scheme
Data Structures and Algorithms PCCST303 University Question Paper May-2026 and Answer Scheme

1.Basic Concepts of Data Structures Stacks and Queues

    
    Array as a Data Structure
    Polynomial Representation using arrays
    Stacks
  

Trees

    

Binary Search Tree ( BST )



4.Sorting and Searching , Hash Tables


Comments

Post a Comment

Popular posts from this blog

Dijikstra's Algorithm for Shortest Path

Image
  Dijkstra’s Algorithm — Concept Purpose: To find the shortest path from a source vertex to all other vertices in a weighted graph (with non-negative edge weights ). Key Idea: We repeatedly pick the vertex with the minimum tentative distance (using a priority queue or min-heap ), and then update (relax) the distances to its neighboring vertices. ⚙️ Data Structures Used Array / Min-heap → to store and find the vertex with the minimum distance. Adjacency Matrix or Adjacency List → to represent the graph. Visited Set → to keep track of vertices whose shortest distance is finalized. 🧠 Algorithm Steps  Initialize the distance of all vertices to ∞ , and the source vertex to 0 . Mark all vertices as unvisited . Choose the unvisited vertex with the smallest distance (call it u ). For each neighbor v of u , check if the path through u gives a shorter distance : if dist [u] + weight (u, v) < dist [v] : dist[v] = dist[u] + weight (...
Read more

Introduction to Graphs and Definitions

Image
  Introduction to Graphs In our daily life, we often deal with objects and the relationships between them. For example: Cities and Roads: Each city is a point, and the road connecting two cities is a link. Social Networks: Each person is a point, and friendship or a “follow” is a link. Computer Networks / Internet: Each computer is a point, and the cable or wireless connection is a link. Electric Circuits: Each junction is a point, and wires are the links. All of these situations can be modeled using a Graph . What is a Graph? A graph is a way to represent objects and the connections between them. The objects are called vertices (or nodes) . The connections are called edges (or links) . 👉 Example: If we have 4 cities {A, B, C, D} and roads between them: A ↔ B, B ↔ C, A ↔ D This can be drawn as a graph diagram where cities are circles and roads are lines connecting them. Why Graphs? Graphs help us to: Visualize relationships between...
Read more