B.

TECH 2nd YEAR

1. BOE301/BOE401 Electric and Hybrid Vehicles Any Engg. Branch except ME and allied branches
BOE301H/BOE401H
2. BOE302/ BOE402 Automation and Robotics Any Engg. Branch except ME and allied branches
BOE302H/BOE402H
3. BOE303/ BOE403 Material Science Any Engg. Branch except ME/CE/AG and
BOE303H/BOE403H alliedbranches
4. BOE304/ BOE404 Energy Science & Engineering Any Engg. Branch except EE and allied branches
BOE304H/BOE404H
5. BOE305/ BOE405 Sensor & Instrumentation Any Engg. Branch except EE and allied branches
BOE305H/BOE405H
6. BOE306/ BOE406 Basics Data Structure &Algorithms Any Engg. Branch except CSE and allied branches
BOE306H/BOE406H
7. BOE307/ BOE407 Basics of Database Management Any Engg. Branch except CSE and allied branches
BOE307H/BOE407H Systems
8. BOE308/ BOE408 Analog Electronics Circuits Any Engg. Branch except EC and allied branches
BOE308H/BOE408H
9. BOE309/ BOE409 Electronics Engineering Any Engg. Branch except EC and allied branches
BOE309H/BOE409H
10. BOE310/ BOE410 Digital Electronics Any Engg. Branch except EC and allied branches
BOE310H/BOE410H
11. BOE311/ BOE411 Polymer Science and Technology Any Engg. Branch except Chemical Engg and Chemical
BOE311H/BOE411H Technology and allied branches
12. BOE312/ BOE412 Laser System and Applications Any Engg. Branch
BOE312H/BOE412H
13. BOE313/ BOE413 Food Science and Nutrition Any Engg. Branch except Food Technology/ Chemical
BOE313H/BOE413H Technology and allied branches
14. BOE314/ BOE414 Building Science and Engineering Any Engg. Branch except CE and allied branches
BOE314H/BOE414H

Important Note: Students of BT/TX Engg. and allied branches can be offered any of the above listed courses.
 BOE306/ BOE406/BOE306H/ BOE406H BASICS DATA STRUCTURES AND ALGORITHM
Course Outcome ( CO) Bloom’s Level (KL)
At the end of course , the student will be able to understand
CO 1 Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by K1, K2
the algorithms and their common applications.

CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K2

CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K3

CO 4 Understanding the concept of recursion, application of recursion and its implementation and removal of K4
recursion.
CO 5 Identify the alternative implementations of data structures with respect to its performance to solve a real K5, K6
world problem.

DETAILED SYLLABUS
Unit Topic Lecture
I Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C, 08
Efficiency of an Algorithm, Asymptotic notations, Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major
Order, and Column Major Order.

Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly
Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal,
Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two
variables Polynomial.

II Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked 08
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of
postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Fibonacci
numbers, and Hanoi towers, Tradeoffs between iteration and recursion.

Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and
linked implementation of queues in C, Dequeue and Priority Queue.

III Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. 08
Concept of Hashing & Collision resolution Techniques used in Hashing.

Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

IV Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Binary Search 08
Tree, Strictly Binary Tree, Complete Binary Tree, Extended Binary Trees, Tree Traversal
algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal,
Insertion , Deletion, Searching & Modification of data in Binary Search tree.

V Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency 08
Matrices, Adjacency List, Graph Traversal: Depth First Search and Breadth First Search, Minimum
Spanning Trees, Prims and Kruskal algorithm.