Page 111 - R2017-REC-ECE-UG Syllabus
P. 111
Department of ECE, REC
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 | B.E. Electronics and Communication Engineering | R2017 Page 111

