Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions app/sem2/dsc/[chapter]/page.tsx
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,7 @@ import { Ch2Content } from "../content/chapter2";
import { Ch3Content } from "../content/chapter3";
import { Ch4Content } from "../content/chapter4";
import { Ch5Content } from "../content/chapter5";
import { Ch6Content } from "../content/chapter6";

import { ArrowBigLeft, ArrowBigRight } from "lucide-react";
import { moduleQuizzes } from "@/lib/quizData";
Expand All @@ -26,6 +27,7 @@ const chapters = [
{ id: "ch3", title: "Stacks", component: Ch3Content },
{ id: "ch4", title: "Queues", component: Ch4Content },
{ id: "ch5", title: "Trees", component: Ch5Content },
{ id: "ch6", title: "Graphs", component: Ch6Content },
];

type ChapterProps = {
Expand Down
1 change: 1 addition & 0 deletions app/sem2/dsc/components/sidebar.tsx
Original file line number Diff line number Diff line change
Expand Up @@ -27,6 +27,7 @@ export default function Sidebar() {
{ id: "ch3", title: "Stacks" },
{ id: "ch4", title: "Queues" },
{ id: "ch5", title: "Trees" },
{ id: "ch6", title: "Graphs" },
];

const quizSlugMap: Record<string, string> = {
Expand Down
43 changes: 26 additions & 17 deletions app/sem2/dsc/content/chapter0.tsx
Original file line number Diff line number Diff line change
Expand Up @@ -65,29 +65,38 @@ export const Ch0Content = () => {
<section>
<h3 className="section-heading">Module V: Trees</h3>
<ul className="section-list">
<li>Introduction to Trees and Terminology</li>
<li>Tree Characteristics and Components</li>
<li>Tree Representation</li>
<li>Types of Trees</li>
<li>Tree Traversal Techniques (DFS and BFS)</li>
<li>Preorder, Inorder, Postorder and Level Order Traversal</li>
<li>Tree Operations (Search, Insert, Delete)</li>
<li>Height, Node Count and Leaf Count</li>
<li>Binary Search Trees (BST)</li>
<li>Tree Implementation in C</li>
<li>BST Implementation in C</li>
<li>Complexity Analysis</li>
<li>Applications and Real-Life Examples</li>
<li>Advantages and Limitations</li>
<li>Introduction to Trees and Terminology</li>
<li>Tree Characteristics and Components</li>
<li>Tree Representation</li>
<li>Types of Trees</li>
<li>Tree Traversal Techniques (DFS and BFS)</li>
<li>Preorder, Inorder, Postorder and Level Order Traversal</li>
<li>Tree Operations (Search, Insert, Delete)</li>
<li>Height, Node Count and Leaf Count</li>
<li>Binary Search Trees (BST)</li>
<li>Tree Implementation in C</li>
<li>BST Implementation in C</li>
<li>Complexity Analysis</li>
<li>Applications and Real-Life Examples</li>
<li>Advantages and Limitations</li>
</ul>
</section>

<section>
<h3 className="section-heading">Module VI: Graphs</h3>
<ul className="section-list">
<li>Graph representation</li>
<li>Breadth First Search</li>
<li>Depth First Search</li>
<li>Introduction to Graphs and Terminology</li>
<li>Characteristics and Components of Graphs</li>
<li>Need for Graphs</li>
<li>Types of Graphs</li>
<li>Graph Representations (Adjacency Matrix and Adjacency List)</li>
<li>Comparison of Graph Representations</li>
<li>Graph Traversal Techniques</li>
<li>Breadth First Search (BFS)</li>
<li>Depth First Search (DFS)</li>
<li>BFS vs DFS Comparison</li>
<li>Applications and Real-Life Examples</li>
<li>Advantages and Limitations</li>
</ul>
</section>

Expand Down
Loading