Teaching Scheme For 5th Sem Vnsgu
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Teaching Scheme For 5th Sem Vnsgu as PDF for free.
More details
- Words: 315
- Pages: 3
Teaching Scheme
Examination Scheme
B.E.III (Computer)
L
T
P
Theory Exam
5th Semester
Hrs.
Hrs.
Hrs.
University Exam.
Course
Course No.
Practical/Quiz/Viva/T.W. etc. University Tutorial Exam.
Cont. Eval
Total Marks
Hrs. Marks Hrs. Marks
Algorithm Analysis & Design
ECC 501 CO
3
0
0
3
100
Computer Graphics
ECC 502 CO
3
1
2
3
100
3
30
25
20
75
Microprocessors & Interfacing Techniques
ECC 503 CO
3
0
2
3
100
3
30
20
50
Principles of Prog Lang.
ECC 504 CO
3
1
2
3
100
3
30
25
20
75
Communication Systems
ECE 505 CO
3
0
2
3
100
3
30
20
50
Pulse & Waveform Circuits
ECE 506 CO
3
0
2
3
100
3
30
20
50
18
5
10
600
150
50
100
300
Total Contact Hours : 30 Total Marks : 900
ALGORITHM ANALYSIS & DESIGN
CC 501 CO : ALGORITHM ANALYSIS & DESIGN B E III (Computer Engineering) 5th Semester (New Scheme)
Teaching Hours Examination Scheme Marks
Lecture
Tutorial
Practical
3
0
0
100
0
Cont. Evaluation : 0 Examination : 0
1.
Introduction : Concept of an algorithm, program, problem; Reveiw of elementary data structures; Asymptotic Complexity, Notation Priori, Posteori analysis .
2.
Divide & Conquer : General method Control abstraction MAxMin recurring relations; Sorting : Merge Sort, Quick Sort, Selection sort; Computing time.
3.
Greedy method : General details, Optional Storage on tapes; Knapsack problem Job Sequencing with deadlines Merge patterns Minimum Spanning trees Shortest path.
4.
Dynamic Programming : General details, Multistage graphs; All pair shortest paths, Optimal bin; Search trees; 0/1 knapsack, Traveling Salesman problem.
5.
Backtracking : General details, Eight Queens problem, Sum of Subsets Graph Coloring, Hamiltonian Cycles; Knapsack.
6.
Branch & Bound : Method; 0/1 Knapsack problem TSP.
Examination Scheme
B.E.III (Computer)
L
T
P
Theory Exam
5th Semester
Hrs.
Hrs.
Hrs.
University Exam.
Course
Course No.
Practical/Quiz/Viva/T.W. etc. University Tutorial Exam.
Cont. Eval
Total Marks
Hrs. Marks Hrs. Marks
Algorithm Analysis & Design
ECC 501 CO
3
0
0
3
100
Computer Graphics
ECC 502 CO
3
1
2
3
100
3
30
25
20
75
Microprocessors & Interfacing Techniques
ECC 503 CO
3
0
2
3
100
3
30
20
50
Principles of Prog Lang.
ECC 504 CO
3
1
2
3
100
3
30
25
20
75
Communication Systems
ECE 505 CO
3
0
2
3
100
3
30
20
50
Pulse & Waveform Circuits
ECE 506 CO
3
0
2
3
100
3
30
20
50
18
5
10
600
150
50
100
300
Total Contact Hours : 30 Total Marks : 900
ALGORITHM ANALYSIS & DESIGN
CC 501 CO : ALGORITHM ANALYSIS & DESIGN B E III (Computer Engineering) 5th Semester (New Scheme)
Teaching Hours Examination Scheme Marks
Lecture
Tutorial
Practical
3
0
0
100
0
Cont. Evaluation : 0 Examination : 0
1.
Introduction : Concept of an algorithm, program, problem; Reveiw of elementary data structures; Asymptotic Complexity, Notation Priori, Posteori analysis .
2.
Divide & Conquer : General method Control abstraction MAxMin recurring relations; Sorting : Merge Sort, Quick Sort, Selection sort; Computing time.
3.
Greedy method : General details, Optional Storage on tapes; Knapsack problem Job Sequencing with deadlines Merge patterns Minimum Spanning trees Shortest path.
4.
Dynamic Programming : General details, Multistage graphs; All pair shortest paths, Optimal bin; Search trees; 0/1 knapsack, Traveling Salesman problem.
5.
Backtracking : General details, Eight Queens problem, Sum of Subsets Graph Coloring, Hamiltonian Cycles; Knapsack.
6.
Branch & Bound : Method; 0/1 Knapsack problem TSP.
Related Documents
Teaching Scheme For 5th Sem Vnsgu
May 2020 4
Teaching Scheme For 7th Sem Vnsgu
May 2020 3
Teaching Scheme For 8th Sem Vnsgu
May 2020 1
Syallus For 5th Sem
November 2019 25
5th Sem
November 2019 45