Scribd
Upload
39 views

Dr. Radha Krishnan Institue of Technology, Jaipur Lecture Plan

The document outlines a lecture plan for a course on Data Structures in C, listing 5 units covering topics such as linear lists, arrays and matrices, stacks and queues, trees, graphs, and sorting algorithms. It provides the number of lectures required for each topic and records the actual lecture dates and any remarks. The plan is for a semester starting in 2012-2013 for a B.Tech third year course at Dr. RADHA KRISHNAN INSTITUE OF TECHNOLOGY in Jaipur, India.

Uploaded by

Vijay Sharma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
39 views

Dr. Radha Krishnan Institue of Technology, Jaipur Lecture Plan

The document outlines a lecture plan for a course on Data Structures in C, listing 5 units covering topics such as linear lists, arrays and matrices, stacks and queues, trees, graphs, and sorting algorithms. It provides the number of lectures required for each topic and records the actual lecture dates and any remarks. The plan is for a semester starting in 2012-2013 for a B.Tech third year course at Dr. RADHA KRISHNAN INSTITUE OF TECHNOLOGY in Jaipur, India.

Uploaded by

Vijay Sharma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Dr.

RADHA KRISHNAN INSTITUE OF TECHNOLOGY, JAIPUR LECTURE PLAN


Lecturer: Subhash Pannu Sub. & Code:Data Structures in C (6EE5) No. of Lecture Req./(Avl): 40 Semester Strating:
Unit no/Total Lect. Req.

B.Tech. III Yr. VI Sem. Session : 2012-2013 Semester Ending:


Lect. No. Date of Delivery Remarks/A ctual Lect. Taken

Topic

Lect. Req.

Performance Measurement Space complexity and Time complexity 1 Unit 1 (6) Linear Lists - Array and linked representation
singly linked lists. Concept of circular linked lists doubly linked lists big oh, omega and theta notations and their significance

1 1 1 1 1

Array & Matrices


Row and Column Major mapping & representation Unit 2 irregular 2D array. (6) Matrix operations Special matrices: diagonal, tri-diagonal, triangular and symmetric. Sparse matrices representation and its transpose

1 1 1 1 2 1 1 1 1 1 1 1 1

Stacks
Representation in array & linked lists basic operation Applications of stacks in Unit 3 parenthesis matching towers of Hanoi (8) Queues Representation in array & linked lists applications circular queues.

Unit no/Total Lect. Req.

Topic

Lect. Req.

Lect. No.

Date of Delivery

Remarks/A ctual Lect. Taken

Trees
Binary Tree representation in array & linked lists basic operation on binary trees Unit 4 binary tree traversal (preorder, post order, in order) (9) Search Trees - Binary search tree indexed-binary search tree basic operation AVL tree B-tree & Heap Tree.

1 1 1 1 1 1 1 1 1 1 1 2 2 1 1 1 1 1

Graphs
Representation of unweighted graphs BFS, DFS Minimum cost spanning trees

Unit 5 Single source shortest path (11)


Sorting - Bubble sort insertion sort, merge sort selection sort quick sort, heap sort

Recommended Books:1. Data structures, Seymour lipschutz

You might also like