ANNA UNIVERSITY PG MATERIALS: November 2010

-> Contains Unit 1 to Unit 5 Important Questions

-> Solved 2mark for each and every unit

-> Also contains Anna University Questions

-> For Question bank and lecture notes go to this media-fire link and download from it

http://www.mediafire.com/?h8l1izsy1xk20da

-> For previous year Anna University question papers download from this media-fire link(FIRST ON NET) (UPDATED UPTO NOV/DEC 2010)

http://www.mediafire.com/?kclytbtwpyx8ao6

241151 DATA STRUCTURES LAB
L T P C
0 0 3 2
1. Min Heap
2. Deaps
3. Leftist Heap
4. AVL Tree
5. B-Tree
6. Tries
7. Quick Sort
8. Convex hull
9. 0/1 Knapsack using Dynamic Programming
10. Graph coloring using backtracking

-> For ds lab programs download from this mediafire link

http://www.mediafire.com/?9rbbrj4rv3ci2ct

M.E COMPUTER SCIENCE AND ENGINEERING
FIRST SEMESTER:
SYLLABUS
MA9219 OPERATIONS RESEARCH
L T P C
3 1 0 4
UNIT I QUEUEING MODELS 9
Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s formula –
Machine Interference Model – Steady State analysis – Self Service Queue.
UNIT II ADVANCED QUEUEING MODELS 9
Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open Queueing
Networks –Closed Queueing networks.
UNIT III SIMULATION 9
Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation – Applications to
Queueing systems.
UNIT IV LINEAR PROGRAMMING 9
Formulation – Graphical solution – Simplex method – Two phase method - Transportation and
Assignment Problems.
UNIT V NON-LINEAR PROGRAMMING 9
Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn - Tucker conditions –
Quadratic Programming.
L + T: 45+15 =60
TEXT BOOKS:
1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole, 2003.
2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson Education
Edition, Asia, New Delhi, 2002.
EBOOK

http://www.ziddu.com/download/2032/MA9219OPERATIONSRESEARCHEBOOKS.rar.html

CS9211 COMPUTER ARCHITECTURE
L T P C
3 0 0 3
UNIT I FUNDAMENTALS OF COMPUTER DESIGN AND PIPELINING 9
Fundamentals of Computer Design – Measuring and reporting performance – Quantitative
principles of computer design. Instruction set principles – Classifying ISA – Design issues.
Pipelining – Basic concepts – Hazards – Implementation – Multicycle operations.
UNIT II INSTRUCTION LEVEL PARALLELISM WITH DYNAMIC APPROACHES 9
Concepts – Dynamic Scheduling – Dynamic hardware prediction – Multiple issue – Hardware
based speculation – Limitations of ILP – Case studies.
UNIT III INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACHES 9
Compiler techniques for exposing ILP – Static branch prediction – VLIW – Advanced compiler
support – Hardware support for exposing more parallelism – Hardware versus software
speculation mechanisms – Case studies.
UNIT IV MULTIPROCESSORS AND MULTICORE ARCHITECTURES 9
Symmetric and distributed shared memory architectures – Performance issues –
Synchronisation issues – Models of memory consistency – Software and hardware
multithreading – SMT and CMP architectures – Design issues – Case studies.
UNIT V MEMORY AND I/O 9
Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main
memory and performance – Memory technology. Types of storage devices – Buses – RAID –
Reliability, availability and dependability – I/O performance measures – Designing an I/O
system.
REFERENCES:
1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A quantitative
approach”, Morgan Kaufmann / Elsevier, 4th. edition, 2007.
2. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A hardware/
software approach” , Morgan Kaufmann / Elsevier, 1997.
3. William Stallings, “ Computer Organization and Architecture – Designing for
Performance”, Pearson Education, Seventh Edition, 2006.
4. Behrooz Parhami, “Computer Architecture”, Oxford University Press, 2006.

EBOOK

http://www.mediafire.com/?ibbzdz1ghjjg2zp

http://www.ziddu.com/download/20320969/CS9211COMPUTERARCHITECTUREEBOOKS.rar.html

http://www.anafile.com/1sig2zucggsj.html

http://uploading.com/1m8964df/Computer-Architecture-Kai-Hwang-by-D-pdf

CS9212 DATA STRUCTURES AND ALGORITHMS
L T P C
3 0 0 3
UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9
Asymptotic notations – Properties of big oh notation – asymptotic notation with several
parameters – conditional asymptotic notation – amortized analysis – NP-completeness – NPhard
– recurrence equations – solving recurrence equations – arrays – linked lists – trees.
7
UNIT II HEAP STRUCTURES 9
Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew heaps -
Lazy-binomial heaps.
UNIT III SEARCH STRUCTURES 9
Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-trees – splay
trees – Tries.
UNIT IV GREEDY & DIVIDE AND CONQUER 9
Quicksort – Strassen’s matrix multiplication – Convex hull - Tree-vertex splitting – Job
sequencing with deadlines – Optimal storage on tapes
UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9
Multistage graphs – 0/1 knapsack using dynamic programming – Flow shop scheduling – 8-
queens problem – graph coloring – knapsack using backtracking
TOTAL = 45
REFERENCES:
1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
Galgotia, 1999.
2. E. Horowitz, S.Sahni and S. Rajasekaran, Computer Algorithms / C++, Galgotia, 1999.
3. Adam Drozdex, Data Structures and algorithms in C++, Second Edition, Thomson
learning – vikas publishing house, 2001.
4. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall, 1988.
5. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to Algorithms”,
Second Edition, PHI 2003.
EBOOK

http://www.mediafire.com/?ie2ts747ox9h759

SE9213 OBJECT ORIENTED SOFTWARE ENGINEERING
L T P C
3 0 0 3
UNIT I INTRODUCTION
System Concepts – Software Engineering Concepts – Development Activities – Managing
Software Development – Unified Modeling Language – Project Organization – Communication
UNIT II ANALYSIS
Requirements Elicitation – Concepts – Activities – Management – Analysis Object Model –
Analysis Dynamic Models
UNIT III SYSTEM DESIGN
Decomposing the system – Overview of System Design – System Design Concepts – System
Design Activities – Addressing Design Goals – Managing System Design
UNIT IV OBJECT DESIGN AND IMPLEMENTATION ISSUES
Reusing Pattern Solutions – Specifying Interfaces – Mapping Models to Code – Testing
UNIT V MANAGING CHANGE
Rationale Management – Configuration Management – Project Management – Software Life
Cycle
REFERENCES:
1. Bernd Bruegge, Alan H Dutoit, Object-Oriented Software Engineering, 2nd ed, Pearson
Education, 2004.
2. Craig Larman, Applying UML and Patterns, 3rd ed, Pearson Education, 2005.
3. Stephen Schach, Software Engineering 7th ed, McGraw-Hill, 2007.
EBOOK

http://www.mediafire.com/?y9xfq7w5fbf9a9h

Sunday, November 28, 2010

241102 DATA STRUCTURES AND ALGORITHMS SOLVED QUESTION BANK

Friday, November 26, 2010

241101 – COMPUTER ARCHITECTURE Solved Question Bank

MA9219 OPERATION RESEARCH SOLVED QUESTION BANK

E BOOKS