Page 25 - B.E CSE Curriculum and Syllabus R2017 - REC

Department of CSE, REC

UNIT II LINKED LIST 9
Linked List Implementation - Singly Linked List- Circular Linked List - Doubly Linked List – All operation
(Insertion, Deletion, Merge, Traversal) - Applications of lists – Polynomial Manipulation.

UNIT III TREES 9
Basic Tree Terminologies- Binary Tree, Representation of Trees, Tree Traversal, Binary Search Tree –
Operations, Implementation. Binary Heap- Properties, Heap Operations.

UNIT IV GRAPHS 9
Graph Terminologies, Graph ADT, Traversal- BFS, DFS, Directed Acyclic Graph- Topological Sorting, and
Shortest Path- Dijkstra’s Algorithm.

UNIT V SEARCHING AND SORTING 9
Searching- Linear search, Binary search, Hashing- Hash function, Collision resolution techniques- Linear
probing, separate chaining. Sorting- Bubble sort, Selection sort, Insertion sort, Shell sort, Merge sort, Quick
sort.
TOTAL: 45 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
● Analyze the various data structure concepts.
● Apply data structures to solve various problems.
● Understand non-linear data structures.
● Correlate the uses of graphs in real life scenarios
● Apply different Sorting, Searching and Hashing algorithms.

TEXTBOOKS:
1. Bradley N. Miller, David L. Ranum, Problem Solving with Algorithms and Data Structures Using
Python, Franklin, Beedle & Associates, Second Edition, 2013. [Units 1,3,5]
2. Michael T. Goodrich , Roberto Tamassia, Michael H. Goldwasser, Data Structures and Algorithms in
Python Wiley, 2013 . [Units 2, 4]

REFERENCES:
1. Rance D. Necaise, Data Structures and Algorithms using Python, John Wiley & Sons, 2011.
2. David M.Reed and John Zelle, Data Structures and Algorithms using Python and C++, Franklin
Beedle & Associates 2009.

CS 17202 DIGITAL SYSTEM DESIGN L T P C
3 0 0 3
OBJECTIVES:
● To introduce basic postulates of Boolean algebra and shows the correlation between boolean
expressions.
● To introduce the methods for simplifying Boolean expressions.
● To outline the formal procedures for the analysis and design of combinational circuits and sequential
circuits.
● To illustrate the concept of synchronous sequential circuits.
● To demonstrate the perception of asynchronous sequential circuits.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9
Boolean Algebra and Theorems – Boolean Functions - Boolean expressions - Minimization of Boolean
expressions –– Minterm – Maxterm - Sum of Products (SOP) – Product of Sums (POS) – Simplification of
Boolean Functions using Karnaugh map – Don’t care conditions – Quine - McCluskey method – Logic Gates
– NAND and NOR implementations.

Curriculum and Syllabus | B.E. Computer Science and Engineering | R2017 Page 25