Page 110 - R2017-REC-ECE-UG Syllabus

Department of ECE, REC

Selection Sort – Bubble Sort – Quick Sort – Merge Sort – Heap Sort – Linear Search – Binary Search.

At the end of the course, the student will be able to:
• Translate the algorithms to C Programs
• Implement conditional branching and iteration
• Decompose a problem into functions and synthesize a complete program using divide and conquer
approach
• Understand and design how information is organized in storage of computer system.
• Provide Optimal Solutions for the given problem.

REFERENCES:

1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, Second
Edition, PHI.
2. Byron Gottfried, “Programming in C”, Second Edition, Schaum Outline Series.
3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2ndEdition, Pearson
Education, 1997.
LABORATORY * 100 Problems to be solved

1. Simple computational problems using arithmetic expressions
2. Problems involving if-then-else structures
3. Iterative problems e.g., sum of series
4. Matrix problems, String operations
5. Programming for solving Numerical methods problems
6. Recursive functions
7. Pointers and structures
8. File operations
9. Stacks and Queues
10. Linked Lists
11. Trees
12. Sorting and Hashing
13. Graph search and traversal algorithms
14. Linear Search and Binary Search

OGE1706 ADVANCED PROGRAMMING LOGIC L T P C
2 0 2 3

UNIT -1: Algorithms

Strings: The Full Counting Sort - Highest Value Palindrome - Super Reduced String– Pangrams– Sherlock
and Anagrams - Maximum Subarray Sum - Sorted Subsegments

UNIT -2: Greedy Algorithm

Reverse Shuffle Merge - The Coin Change Problem - Summing Pieces - Candles Counting - Play with words -
Swap Permutation- Recursive Digit Sum.

UNIT -3: Trees and Graphs

Curriculum and Syllabus | B.E. Electronics and Communication Engineering | R2017 Page 110