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 @@ -5,6 +5,7 @@ import { Ch0Content } from "../content/chapter0";
import { Ch1Content } from "../content/chapter1";
import { Ch2Content } from "../content/chapter2";
import { Ch3Content } from "../content/chapter3";
import { Ch4Content } from "../content/chapter4";

import { ArrowBigLeft, ArrowBigRight } from "lucide-react";
import { moduleQuizzes } from "@/lib/quizData";
Expand All @@ -21,6 +22,7 @@ const chapters = [
{ id: "ch1", title: "Arrays", component: Ch1Content },
{ id: "ch2", title: "Linked Lists", component: Ch2Content },
{ id: "ch3", title: "Stacks", component: Ch3Content },
{ id: "ch4", title: "Queues", component: Ch4Content },
];

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 @@ -25,6 +25,7 @@ export default function Sidebar() {
{ id: "ch1", title: "Arrays" },
{ id: "ch2", title: "Linked Lists" },
{ id: "ch3", title: "Stacks" },
{ id: "ch4", title: "Queues" },
];

const quizSlugMap: Record<string, string> = {
Expand Down
32 changes: 20 additions & 12 deletions app/sem2/dsc/content/chapter0.tsx
Original file line number Diff line number Diff line change
Expand Up @@ -34,23 +34,31 @@ export const Ch0Content = () => {

<section>
<h3 className="section-heading">Module III: Stacks</h3>
<ul className="section-list">
<li>Introduction to stacks and LIFO principle</li>
<li>Stack operations (Push, Pop, Peek, isEmpty, isFull)</li>
<li>Overflow and Underflow</li>
<li>Array and Linked List implementation</li>
<li>Complexity analysis</li>
<li>Applications and real-life examples</li>
<li>Advantages and limitations</li>
</ul>
<ul className="section-list">
<li>Introduction to stacks and LIFO principle</li>
<li>Stack operations (Push, Pop, Peek, isEmpty, isFull)</li>
<li>Overflow and Underflow</li>
<li>Array and Linked List implementation</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 IV: Queues</h3>
<ul className="section-list">
<li>Queue operations</li>
<li>Types of queues</li>
<li>Applications of queues</li>
<li>Introduction to Queues and FIFO principle</li>
<li>Characteristics and components of Queues</li>
<li>Queue representation</li>
<li>Need for Queues</li>
<li>Queue operations (Enqueue, Dequeue, Peek, isEmpty, isFull)</li>
<li>Overflow and Underflow</li>
<li>Types of queues (Simple, Circular, Priority, Deque)</li>
<li>Array and Linked List implementations</li>
<li>Complexity analysis</li>
<li>Applications and practical examples</li>
<li>Advantages and limitations</li>
</ul>
</section>

Expand Down
Loading