KTU 2024 Scheme · Semester 6 · Open Elective I — Computer Science and Engineering
Data Structures (OECST611) Syllabus
Official KTU 2024 Scheme syllabus for Data Structures, Semester 6, Open Elective I — Computer Science and Engineering (Computer Science and Engineering).
Course Code
OECST611
Credits
3
Teaching Hours
3:0:0:0 (L:T:P:R)
CIE Marks
40
ESE Marks
60
Exam Duration
2 Hrs 30 Min
Prerequisites
None
Semester
Semester 6
Course Objective
To provide the learner a comprehensive understanding of data structures and algorithms, and to prepare them for advanced studies or professional work in computer science and related fields.
Module-wise Syllabus
Module 1
9 contact hoursBasic concepts of data structures: definitions, data abstraction, performance analysis - time and space complexity, asymptotic notations; polynomial representation using arrays, sparse matrix (tuple representation); stacks and queues - stacks, multi-stacks, queues, circular queues.
Module 2
9 contact hoursLinked list and memory management: singly linked list - operations on a linked list, stacks and queues using a linked list, polynomial representation using a linked list; doubly linked list.
Module 3
9 contact hoursTrees and graphs: representation of trees; binary trees - types and properties, binary tree representation, tree operations, tree traversals; binary search trees and their operations; graphs - definitions, representation of graphs, depth first search and breadth first search.
Module 4
9 contact hoursSorting and searching: sorting techniques - selection sort, insertion sort, quick sort, merge sort; searching techniques - linear search, binary search; hashing - hash functions (division), collision resolution - linear probing, open hashing.
Course Outcomes
- CO1Identify appropriate data structures for solving real-world problems.
- CO2Describe and implement linear data structures such as arrays, linked lists, stacks and queues.
- CO3Describe and implement non-linear data structures such as trees and graphs.
- CO4Select appropriate searching and sorting algorithms to be used in specific circumstances.
Assessment Pattern (CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation (CIE)
| Attendance | 5 |
| Assignment / Microproject | 15 |
| Internal Examination 1 (Written) | 10 |
| Internal Examination 2 (Written) | 10 |
End Semester Examination (ESE)
Total 60 marks, 2 Hrs 30 Min. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.
Textbooks & Reference Books
Textbooks
- Fundamentals of Data Structures in C — Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed (Universities Press, 2nd edition, 2007)
- Introduction to Algorithms — Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein (PHI, 3rd edition, 2009)
Reference Books
- Classic Data Structures — D. Samanta (Prentice Hall India, 2nd edition, 2018)
- Data Structures and Algorithms — A. V. Aho, J. E. Hopcroft, J. D. Ullman (Pearson, 1st edition, 2003)
- Introduction to Data Structures with Applications — J. P. Tremblay, P. G. Sorenson (Tata McGraw Hill, 2nd edition, 2017)
- Theory and Problems of Data Structures — S. Lipschutz (Schaum's Series, 2nd edition, 2014)
Frequently Asked Questions
How many credits is KTU Data Structures (OECST611)?
3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.
How many modules are in the OECST611 syllabus?
4 modules, 36 total contact hours.
What is the CIE and ESE mark split for this course?
CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs 30 Min. Total: 100 marks.
What are the recommended textbooks for OECST611?
Fundamentals of Data Structures in C (Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed); Introduction to Algorithms (Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein).
Is this syllabus specific to one branch, or common to others too?
This Semester 6 course is listed under Open Elective I — Computer Science and Engineering at KTU under the 2024 Scheme — check the course header above for which branches it's common to.
Need help with KTU Data Structures?
Learnizo offers live, 1-on-1 online tuition for KTU CSE subjects — matched to your exact module and semester.