#1
January 19th, 2017, 10:54 AM
| |||
| |||
UPTU CS Syllabus
I have passed 4th Semester of B.Tech CSE Course of U.P. Technical University (UPTU). I have taken admission in 5th Semester, so please provide detailed syllabus of B.Tech CSE 5th Semester Course of U.P. Technical University (UPTU).
|
#2
January 19th, 2017, 11:21 AM
| |||
| |||
Re: UPTU CS Syllabus
As you are looking for syllabus of B.Tech CSE 5th Semester Course of U.P. Technical University (UPTU), so here I am providing following syllabus; U.P. Technical University (UPTU) B.Tech CSE 5th Semester Syllabus Theory Subjects NCS 501 Design and Analysis of Algorithm NCS 502 Database Management System NCS 503 Principle of Programming Language NCS 504Web Technology NCS 505 Computer Architecture NHU5 01 Engineering Economics Practical Subjects NCS 551 Design and Analysis of Algorithm Lab NCS 552 DBMS Lab NCS 553 Principle of Programming Language NCS 554 Web Technology Lab NGP 501 GP NCS- 501 Design and Analysis of Algorithms I. Introduction : Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions, Performance measurements, Sorting and order Statistics - Shell sort, Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time. II. Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps, Fibonacci Heaps. III. Divide and Conquer with examples such as Sorting, Matrix Multiplication, Convex hull and Searching. Greedy methods with examples such as Optimal Reliability Allocation, Knapsack, Minimum Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest paths - Dijkstra’s and Bellman Ford algorithms. IV. Dynamic programming with examples such as Knapsack. All pair shortest paths – Warshal’s and Floyd’s algorithms, Resource allocation problem. Backtracking, Branch and Bound with examples such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of subsets. Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-completeness, Approximation algorithms and Randomized algorithms |
|