Page 47 - B.Tech IT Curriculum and Syllabus R2017 - REC

Department of IT, REC

 Use data and pulse communication techniques.
 Analyze Source and channel coding theorem.
 Demonstrate the various error control coding

TEXT BOOK:
1. Wayne Tomasi, ―Advanced Electronic Communication Systems‖, 6th Edition, Pearson Education,
2009.

REFERENCES:
1. Simon Haykin, ―Communication Systems‖, 4th Edition, John Wiley & Sons, 2004
2. Rappaport T.S, "Wireless Communications: Principles and Practice", 2nd Edition, Pearson
Education, 2007
3. H.Taub, D L Schilling and G Saha, ―Principles of Communication‖, 3rd Edition, Pearson
Education, 2007.
4. B. P.Lathi, ―Modern Analog and Digital Communication Systems‖, 3rd Edition, Oxford
University Press, 2007.
5. Blake, ―Electronic Communication Systems‖, Thomson Delmar Publications, 2002.
6. Martin S.Roden, ―Analog and Digital Communication System‖, 3 rd Edition, Prentice Hall of India,
2002.
nd
7. B.Sklar, ―Digital Communication Fundamentals and Applications‖ 2 Edition Pearson
Education 2007.

CS17301 DESIGN AND ANALYSIS OF ALGORITHMS L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
 Learn the basic ideas of algorithm and analysis techniques.
 Understand the behaviour of various computer algorithms.
 Become familiar with the different algorithm design techniques.
 Learn to apply the design techniques in solving various kinds of problems.
 Understand the limitations of Algorithm power.

UNIT I ANALYSIS OF ALGORITHMS 9
Introduction - Algorithm Specification - Performance Analysis: Space Complexity - Time Complexity
- Asymptotic Notations - Practical Complexities - Solving Recurrence Relations.

UNITII BRUTE FORCE AND DIVIDE-AND-CONQUER 9
Brute Force: Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment
problem - Divide and Conquer: General Method - Binary search - Finding Minimum and Maximum
Problem - Merge sort - Quick sort - Strassen‘s Matrix Multiplication.

UNIT III GREEDY TECHNIQUE AND DYNAMIC PROGRAMMING 9
Greedy: General Method - Container Loading - Knapsack - Huffman Codes - Dynamic Programming:
General Method - OBST - String Editing - 0/1 Knapsack - Travelling Salesman Problem.

UNIT IV BACKTRACKING AND BRANCH & BOUND 9
Backtracking: General Method - 8 Queen's Problem - Sum of Subsets Problem - Graph Colouring -
Hamiltonian Circuit Problem - Branch and Bound: FIFO - LC branch and bound - 0/1 Knapsack -
Travelling Salesman Problem - Assignment Problem.

UNIT V STRING MATCHING AND NP COMPLETE & NP HARD PROBLEMS 9

Curriculum and Syllabus | B.Tech. Information Technology | R2017 Page 47