Syllabus EC212

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

R.V.R. & J.C. College of Engineering (Autonomous), Guntur-522019, A.P.

R-20

EC212 DATA STRUCTURES USING PYTHON L T P C Int Ext


3 1 - 4 30 70

COURSE OBJECTIVES:
The students are able to
1. introduce object-oriented concepts in Python language.
2. familiarize linear and nonlinear data structures and their applications
3. provide knowledge of various searching, sorting and hashing techniques

COURSE OUTCOMES:
After successful completion of the course, the students are able to
1. define object oriented features for solving real world problems.
2. analyze algorithms and efficiency of Python’s sequence types.
3. Construct various linear data structures and applications
4. Select Sorting, Searching and Hashing techniques, Solve problems using non-linear data structures

UNIT I [CO:1] (10)

Python Primer : Python Overview - Objects in Python - Expressions, Operators and Precedence -
Control Flow - Functions - Simple Input and Output - Exception Handling - Iterators and Generators -
Additional Python Conveniences - Scopes and Namespaces - Modules and the Import Statement.

Object-Oriented Programming : Goals, Principles and Patterns - Software Development - Class


Definitions - Inheritance - Namespaces and Object Orientation - Shallow and Deep Copying.

UNIT II [CO:2] (10)

Algorithm Analysis : Asymptotic Analysis.

Array-Based Sequences : Python`s Sequence Types - Low Level Arrays - Dynamic Arrays and
Amortization - Efficiency of Python`s Sequence Types - Using Array Based Sequences -
Multidimensional Data Sets.

Stacks, Queues and Deques : Stacks - Queues - Double Ended Queues.

Priority Queues : Implementing a Priority Queue.

UNIT III [CO:3] (10)

Linked Lists : Singly Linked Lists - Circularly Linked Lists - Doubly Linked Lists - Link Based vs Array
Based Sequences.

Sorting and Selection : Why Study Sorting Algorithms? - Linear Search -Binary search - Bubble sort -
Selection Sort - Insertion Sort - Merge-Sort - Quick-Sort - Heap sort.

UNIT IV [CO:4] (10)

Trees : General Trees- Binary Trees - Implementing Trees - Tree Traversal Algorithms - Binary Search
Trees.

Graphs : Graphs - Graph Traversals.

Hash Tables : Hash Functions - Collision Handling Schemes.

LEARNING RESOURCES:

B.Tech.(EC)/R-20/2020-2021 Printed through web on 10-05-2024 17:12:02 Page 1/ 2


R.V.R. & J.C. College of Engineering (Autonomous), Guntur-522019, A.P. R-20

TEXT BOOK:
Michael T.Goodrich, Roberto Tamassia, Michael H. Goldwasser, "Data Structures and Algorithms in
Python", John Wiley & Sons, 2013.

REFERENCE BOOK(s):
1. Rance D. Necaise, "Data Structures and Algorithms using Python", John Wiley & Sons, 2011.
2. Narasimha Karumanchi, "Data Structures and Algorithmic Thinking with Python", CareerMonk
Publications, 2016.

WEB RESOURCES:
1. https://www.tutorialspoint.com/python_data_structure/index.htm
2. https://www.edureka.co/blog/data-structures-in-python/

B.Tech.(EC)/R-20/2020-2021 Printed through web on 10-05-2024 17:12:02 Page 2/ 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy