Page 105 - REC :: All Dept Open Electives

10. Linked Lists
11. Trees
12. Sorting and Hashing
13. Graph search and traversal algorithms
14. Linear Search and Binary Search

OGE1705 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

Snakes and Ladders - Minimum Penalty Path - Toll Cost Digits - Tree: Huffman Decoding - Self
Balancing Tree - Binary Search Tree : Lowest Common Ancestor - Swap Nodes.

UNIT -4: Advanced Programming

Longest Increasing Subsequence - Longest Common Subsequence – Knapsack - Matrix-chain
multiplication - Nth Fibonacci Number - K-th Lexicographical Suffix - Palindrome Partitioning -
Longest Arithmetic Progression - Word Wrap Problem - Mobile Numeric Keypad Problem-Case
studies.

UNIT -5: Java APIs

Current Trends in IT-Eclipse IDE-HashSet, HashMap, ArrayList, LinkedList, TreeSet and TreeMap –
Queue API – Stack API – JobStateReasons API.

At the end of the course, the student will be able to:
 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. https://www.hackerrank.com/
2. Kathy Sierra and Bert Bates, “Sun Certified Programmer for Java 6”, Second Edition, McGraw
Hill.
3. Paul Deitel and Harvey Deitel, “ Java How to Program: Early Objects”, 11th Edition, Pearson
Education, 2018.
LABORATORY * 100 Problems to be solved

Curriculum and Syllabus | Open Electives | R 2017 | REC Page 105