6th Sem, CE

BTCOC606: Competitive Programming-II Syllabus for CE 6th Sem 2019-20 DBATU

Competitive Programming-II detailed syllabus scheme for B.Tech Computer Engineering (CE), 2019-20 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.

For all other DBATU Syllabus for Computer Engineering 6th Sem 2019-20, do visit CE 6th Sem 2019-20 Onwards Scheme. The detailed syllabus scheme for competitive programming-ii is as follows.

Competitive Programming-II Syllabus for Computer Engineering (CE) 3rd Year 6th Sem 2019-20 DBATU

Competitive Programming-II

UNIT 1

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

UNIT 2

Backtracking Backtracking, Constructing All Subsets, Constructing All Permutations, Program Design Example: The Eight-Queens Problem, Pruning Search. Challenging Problems

  1. Little Bishops
  2. 15-Puzzle Problem
  3. Queue
  4. Servicing Stations
  5. Tug of War
  6. Garden of Eden
  7. Color Hash
  8. Bigger Square Please

UNIT 3

Graph Traversal Flavors of Graphs, Data Structures for Graphs, Graph Traversal: Breadth-First, Breadth-First Search, Exploiting Traversal, And Finding Paths Graph Traversal: Depth-First Finding Cycles Connected Components Topological Sorting. Challenging Problems

  1. Bicoloring
  2. Playing With Wheels
  3. The Tourist Guide
  4. Slash Maze
  5. Edit Step Ladders
  6. Tower of Cubes
  7. From Dusk Till Dawn
  8. Hanoi Tower Troubles Again!

UNIT 4

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

UNIT 5

Dynamic Programming Dont Be Greedy, Edit Distance, Reconstructing the Path, Varieties of Edit Distance, Program Design Example: Elevator Optimization Challenging Problems

  1. Is Bigger Smarter?
  2. Distinct Subsequences
  3. Weights and Measures
  4. Unidirectional TSP
  5. Cutting Sticks
  6. Ferry Loading
  7. Chopsticks
  8. Adventures in Moving: Part IV.

UNIT 6

Grids Rectilinear Grids, Traversal, Dual Graphs and Representations, Triangular and Hexagonal Grids, Triangular Lattices, Hexagonal Lattices, Program Design Example: Plate Weight, Circle Packings, Longitude and Latitude.

List of Practical:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Reference Books:

  1. Steven S. Skiena Miguel A. Revilla, Programming Challenges The Programming Contest Training Manual, Springer.
  2. Antti Laaksonen, Competitive Programmers Handbook.
  3. Steven Halim, Competitive Programming 3: The Lower Bounds of Programming Contests.
  4. Gayle Lakaman Cracking the Coding Interview.
  5. The Hitchhikers Guide to the Programming Contests.

For detail syllabus of all other subjects of Computer Engineering (CE) 6th Sem 2019-20 regulation, visit CE 6th Sem Subjects syllabus for 2019-20 regulation.

Leave a Reply

Your email address will not be published. Required fields are marked *

*