Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
Mtech1stsem-syllabus

Mtech1stsem-syllabus

Ratings: (0)|Views: 55|Likes:
Published by api-3782519

More info:

Published by: api-3782519 on Oct 16, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

10/31/2014

pdf

text

original

1
M.Tech (CE) 1st Semester
Syllabus
MARKING SCHEME
Subject
Internal
Marks
External
Marks
Total
Marks
Semester I
Computer system software
50
100
150
Mathematical foundation of computer science
50
100
150
Analysis and design of algorithms
50
100
150
Elective I
50
100
150
OOPS lab
50
50
100
Internet lab
50
50
100
Seminar
50
--
50
Semester II
Soft Computing
50
100
150
Resource management in computer systems
50
100
150
Mobile & Wireless communication
50
100
150
Elective II
50
100
150
Operating system lab
50
50
100
Soft computing lab
50
50
100
Seminar
100
--
100
Semester III
Knowledge based system design
50
100
150
Advanced database management system
50
100
150
System & Network Administration
50
100
150
Elective III
50
100
150
Minor Project
100
100
200
AI lab
50
50
100
Seminar
100
--
100
Semester IV
Dissertation and Viva
100
400
500
Elective I
\ue000
Internet & Web Technology
\ue000
Embedded Systems
Elective II
\ue000
Software Verification, validation and testing
\ue000
Advanced Microprocessors
Elective III
\ue000
Software Project Management
\ue000
Security Of Information Systems
2
TIMING SCHEME
Subject
Lectures
Tutorials
Total
Semester I
Computer system software
3
1
4
Mathematical foundation of computer science
3
1
4
Analysis and design of algorithms
3
1
4
Elective I
3
1
4
OOPS lab
--
4
4
Internet lab
--
4
4
Seminar
--
2
2
Semester II
Soft Computing
3
1
4
Resource management in computer systems
3
1
4
Mobile & Wireless communication
3
1
4
Elective II
3
1
4
Operating system lab
--
4
4
Soft computing lab
--
4
4
Seminar
--
2
2
Semester III
Knowledge based system design
3
1
4
Advanced database management system
3
1
4
System & Network Administration
3
1
4
Elective III
3
1
4
Minor Project
--
4
4
AI lab
--
4
4
Seminar
--
2
2
Semester IV
Dissertation and Viva
16
16
Elective I
\ue000
Internet & Web Technology
\ue000
Embedded Systems
Elective II
\ue000
Software Verification, validation and testing
\ue000
Advanced Microprocessor
Elective III
\ue000
Software Project Management
\ue000
Security Of Information Systems
3
M.Tech (CSE) 1st Semester
Syllabus
COMPUTER SYSTEM SOFTWARE
Introduction to object oriented programming and object oriented design. System software design
issues. Language translators, assemblers, linkers and loaders. Run-time environment management.
MATHEMATICAL FOUNDATIONS OF COMPUTER SC.

Deterministic and non-deterministic computation, Turing machines, post machines, RAMs and their equivalence, universal Turing machine, halting problem, solvability and undecidability, Rice's theorem, equivalence of general recursive and Turing computable function;(introduction to theory of formal languages and their relation to automata, introduction to complexity theory.

ANALYSIS & DESIGN OF ALGORITHMS
Unit 1: Analyzing Algorithms & Problems

Introduction to algorithms, Time, and Space Complexity, Basic elements of data structures like linked lists, stacks and queues, trees, graphs, recursion. Different types of sorting algorithms and their complexities

Unit 2: Dynamic Sets, Searching and Graphs

Introduction, Array, amortized time analysis, red black trees, hashing, heaps, dynamic equivalence relations and union-find programs, priority queues with decrease key operations, traversing graphs, DFS, strongly connected components, bioconnected complaints, minimum spanning tree algo., single source shortest paths,all pair shortest paths.

Unit 3: Greedy and Dynamic methods
Introduction to greedy and dynamic methods, their algorithms and comparative study.
Unit 4: Backtracking and Branch-and-Bound
General backtracking and Branch and Bound Methods, 8 queen, sum of subset, graph coloring,
Hamilton cycles, 0/1 knapsack problem
Unit 5: NP Hard and NP Complete problems
Basic Concepts, cooks theorem, NP - Hard graph problems, NP hard Scheduling
Unit 6 : Parallel Algorithms
Intro., Parallelism, PRAM and other models, some simple PRAM algorithms, handling write conflicts.
Merging and Sorting, Finding Connected Components.
Unit 7: Approximation Algorithms
Intro.,Absolute Approximation, e-approximation, polynomial time approximation schemes, fully
polynomial time approximation schemes. String matching algorithms.

Activity (2)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->