Pages

Monday 9 January 2012

AM -IV


Subject : Applied Mathematics IV

Module :


1)   Matrices :
1.1  Brief revision of vectors over a real field, inner pr oduct, norm,
       Linear independence and orthogonality of vectors.
1.2 Characteristic  polynomial,  character istic  equation,
       characteristic  roots  and  characteristic  vectors  of  a  square
       matrix, properties of character istic roots and vectors of different
       types of matrices such as orthogonal matrix, Hermitian matrix,
       Skew-Hermitian  matr ix,  Diagonable  matr ix  ,  Cayley
       Hamilton’s  theorem  (  without  proof)  Functions  of  a  square
       matrix, Minimal polynomial and Derogator y matrix.


2)  Complex variables :
2.1 Functions  of  complex  variables,  Analytic  function,  necessary
      f(z)and sufficient conditions forto be analytic (without proof)
2.2 Milne-   Thomson  method  to  determine  analytic  function()
      when  it’s  real  or  imaginary  or  its  combination  is  given.
      Harmonic function, orthogonal trajectories.
2.3 Mapping:  Conformal  mapping,  linear,  bilinear  mapping,  cross
      ratio, fixed points and standard transformations such as Rotation
      and magnification, invertion and reflection, translation.
2.4 line  integral  of  a  function  of  a  complex  variable,  Cauchy’s
      theorem  for  analytic  function,  Cauchy’s  Goursat  theorem(without proof),    
      properties  of   line  integral,  Cauchy’s integral formula and deductions.
2.5 Singular ities and poles:
       Idea of Taylor ’s and Laurent’s ser ies development (without proof)for  Residue
2.6 Residue’s theorem, application to evaluate real integrals of type


3)   FMathematical programming :
3.1 Linear optimization   problem, standard   and canonical  form  of
      LPP, basic and feasible solutions, primal simplex  method (more
      than two variables).
3.2 Artificial variables, Big-M method (method of penalty)
3.3 Dual problem, duality principle Dual simplex method,
      degeneracy andalternative optima, unbounded solution.
3.4 Nonlinear Programming, unconstrained optimization, problem
      with  equality  constraints  Lagranges  Multiplier  Method,  Problem
      with inequality constraints Kuhn-Tucker conditions.


Notes (Reference Book) :

1)  Higher Engineering Mathematics 6th Edition By John Bird
http://rapidlibrary.com/files/teraleech-com-185617767x-rar_ulfmvqcm9mifton.html

Friday 6 January 2012

DBMS

Subject : Database Management System

Module :

1.  Introduction Database Concepts :       
•  Introduction to data processing. Overview of file systems
•  Drawbacks of file system, Concept of a database.
•  Comparison of  Database systems and File system.
•  Data abstraction,3-Layered Architecture and data
   independence.
•  Data models, Database languages.
•  Database users and administrators.
•  Database system structure


2 Entity–Relationship Model :
 
•  Basic concepts
•  Constrains
•  Design issues, Entity–Relationship diagram
•  Strong - Weak entity sets
•  Extended ER features
•  Mapping an ER schema to tables.


3 Relation Model : 
  Concept of a relation   Notion of primary and secondary keys   Structure relation database   The relation algebra and extended algebra operations   Formation of queries, Modification of database, Views

4 SQL : 
•  Background, Basic structure
•  Set operations, Aggregate function, Null values.
•  Nested  queries,  Views,  Complex  queries,  Database
   modification
•  *DDL, embedded SQL, Stored procedures and functions


5 Integrity and Security : 
•  Domain Constraints, Referential integrity
•  Assertions, Triggers
•  *Security and Authorization , Authorization in SQL


6 Relational–Database Design :
•  First Normal form, Pitfalls in relational – database design
•  Function dependencies, Armstrong Axioms
•  2nd, 3rd, BCNF , and 4th normal form
•  Decomposition, Desirable properties of decomposition
•  Overall database design process


7 File structure, Indexing and Hashing: 
•  File  organization,  Organization  of  records  in  files. 
   DataDictionary storage.
•  Basic  Indexing  concepts, Ordered Indices,  B+  Tree and  B Tree
   Index Files
•  Static Hashing, Dynamic hashing
•  Index Definition in SQL, Multiple Key access.


8 Transactions:

•  Transaction concept, Transaction states
•  Implementation of atomicity and durability
•  Concurrent Executions, Serializability, Recoverability
•  Implementation of isolation, Transaction definition in SQL


9 Concurrency Control :• Lock-based protocols
•  Timestamp-based protocols
•  Validation-based protocols
•  Deadlock handling


10 Recovery System :

•  Failure Classification, Storage structure
• Recovery & atomicity
•  Log based recovery, Shadow paging
•  Recovering with concurrent transactions
•  Buffer Management


Notes :

1) DBMS (Sem-IV) Sadguru's - Junaid A. Khateeb.pdf
http://www.mediafire.com/?4bsfracbh528mgf

2) Database Systems-Nilkamal Surve-TachMax Publications.pdf
http://www.mediafire.com/?dmiixtz9yr9tbye


3) Database Management system - (SE-TE) Vidyalankar.pdf
 http://www.mediafire.com/?du97h6avxg8bf9f

AOAD

Subject : Analysis of Algorithm & Design

Module :

1 Introduction to analysis of algorithm
 •  Design and analysis fundamentals.
•  Performance analysis ,space  and  time complexity.
•  Growth of function – Big-Oh, Omega, theta notation.
•  Mathematical background for algorithm analysis.
•  Randomized and recursive algorithm.

2  Divide and Conquer
•  Genaral method , Binary search, finding the min and max.
•  Merge sort analysis.
•  Quick sort,  performance measurement.
•  Randomized version of quick sort and analysis.
•  Partitioned algorithm selection sort, radix sort, efficiency
  considerations.
•  Strassen’s matrix multiplication.

3  Greedy Method
•  General mehod.
•  Knapsack problem.
•  Minimum cost spanning tree- kruskal and primal algo,
   performanance analysis.
•  Single source shorted path .
•  Job sequencing with deadlines.
•  Optimal storage on tapes.

4  Dynamic Programming

•  The general method
•  Multistage graphs, all pair shortest paths, single source
   shortest paths
•  Optimal BST ,0/1 knapsack
•  TSP, flow shop scheduling

5  Backtracking
•  The general method.
•  8 queen problem ,sum of subsets.
•  Graph coloring,hamltonian cycles.
•  Knapsack problem.

6  Branch and Bound

•  The method, LC search.
•  15 puzzle:An example.
•  Bounding and FIFO branch and bound .
•  LC branch and bound .
•  0/1 knapsack problem.
•  TP efficiency considerations.

7  Internet algorithm
•  Strings and patterns matching algorithm .
•  Tries.
•  Text compression.
•  Text similarity testing.

Notes :

1) Analysis of Algorithms-SE (Vidyalankar).pdf
http://www.mediafire.com/?i3zthh374pgznht

2) AOAD part1 (Sem-IV) Comp. Prof.R.V..Sadguru's.pdf
http://www.mediafire.com/?cwvo2tad073rd6i

Tuesday 3 January 2012

CG


Subject : Computer Graphics....

Module :

1  Basic concepts    
1.  Introduction to computer graphics
2.  lines,  line  segments,  vectors,  pixels  and  frame  buffers,
    vector generation
3.  DDA and Bresenham line drawing algorithms.
4.  Mid point and Bresenham’s circle drawing algorithms
5.  mid point ellipse drawing algorithm,
6.  various styles of lines like thick lines,
7.  character generation methods
•Stroke Principle,
•Bit map method
8.  Display file structureDisplay file interpreter,        

2 Polygons      
1.  Introduction,
2.  representation of polygon
3.  entering Polygons in display file,
4.  inside-outside test
5.   Polygon filling methods
•Boundary fill ,
•Flood  fill
•scan line Polygon Fill
•Patterns filling.
Transformations
1.  homogeneous coordinates
2.  Translation
3.  Scaling
4.  Rotation
5.  Rotation about an arbitrary point
6.   inverse transforms
7.   shear transforms
8.  Reflections.

3 Segments    
1.Introduction
2.segment table
3.Operations  segment
•Creation
•Closing
•Deletion
•renaming,
•Visibility
4.other display-file structures
5.Image transformations
6. raster techniques.

Windowing and clipping
1.Introduction
2.viewing transforms
3.2D line clipping
        •Cohen-Sutherland line clipping
        •Midpoint subdivision algorithm
                         •Liang-Barsky Line Clipping algorithm,
                         •Cyrus-Beck algorithm
4.Text Clipping
5.Polygon Clipping
         •Sutherland-Hodgman polygon clipping algorithm
         •Weiler-Arthorton polygon clipping
         •Liang barsky polygon clipping
6.Generalized clipping

4 3-D Transformations    
1.  Introduction
2.  3-D geometry
3.  3-D display methods
4.  3-D object representation methods
5.  3-D transformations
6.   Rotation about an arbitrary axis
7.   Concept of parallel and perspective projections
8.  3-D clipping
9.   3-D viewing transformations

5 Hidden Surfaces and Lines
1.Introduction
2.Back-face removal algorithm
3.Z buffers
4.scan-line
5.Painter’s algorithm
6.Warnock’s algorithm
7.hidden line methods.

Light, Color and Shading
1.Introduction
2.Diffuse illumination
3.Point-source illumination
4.Specular reflection
5.shading algorithms
6.transparency
7.reflections
8.shadows
9.ray tracing
10.Colour models
11.rendering pipeline.

6 Curves and fractals    
1.Introduction
2.Curve generation
•B-Splines
   •Bezier curves
3.Surfaces
  •Bezier Surfaces
  •B spline Surfaces
4.Fractals, fractal lines and surfaces.

Animation
 1.Devices for producing animation
2.Computer assisted animation
3.real time animation
4.frame-by-frame animation
5.method  for  controlling  animation  (fully  explicit  control,
procedural)

Notes :

1) Computer Graphics - Godse (Technical Publications).pdf
http://www.mediafire.com/?ulpz3peintur42v

2)Computer Graphics.pdf
 http://www.mediafire.com/?a4vqadjaifaubrb





OS


Subject : Operating System ....


Module :

1  Operating System Overview          
Operating System Objectives and Functions. Evolution of Operating
Systems,  Characteristics of Modern Operating Systems, Basic Concepts :
Processes,   Files,  System calls,  Shell, Layered structure  v/s Monolithic
Structure of Operating System. Introduction to Distributed OS,  RTOS,
Mobile OS.

2  Process and process scheduling. 
Process description, PCB, Threads, Thread management; process and thread
Process Scheduling : Types,  comparative assessment of different
scheduling algorithms.

3 Process Concurrency:
Principles  of  Concurrency;  Mutual  Exclusion-  Hardware  approaches;
Mutual  Exclusion-  Software  Support;  Semaphores;  Monitors,  Message
Passing; Readers/Writers Problem.
Deadlock  and  Starvation:  Principles  of  Deadlock,  Deadlock  Prevention;
Deadlock  Avoidance,  Deadlock  Detection,  An  Integrated  Deadlock
Strategy; Dining Philosophers Problem;


4  Memory Management  
Memory  management  Requirements.  Memory  Partitioning;  Virtual
memory;  Paging;  Segmentation;  Design  and  implementation  issues  in
paging  and  segmentation;  page  replacement  algorithms;  page  fault
handling; working set model

5  I/O Management and Disk Scheduling. 
I/O  Devices.  Organization  of the  I/O  Function;  Operating  System  Design
Issues;  I/O  Buffering,  Disk  Scheduling  and  disk  scheduling  algorithms;
RAID; Disk cache

6  File Management.  
Overview;  File  Organization;  File  Directories;  File  Sharing;  Record
Blocking; Secondary Storage Management; UNIX File system

7  Case Studies:  
Overview  of  Linux  operating  system,  Process  and  thread  management,
Scheduling,  concurrency  control  mechanisms,  Memory  management  and
I/O management in Linux.
Overview of Windows operating system:  Process and thread  management,
Scheduling,  concurrency  control  mechanisms,  Memory  management  and
I/O management in windows.


Notes :

1) Operating Systems With UNIX (TECH MAX).pdf
http://www.mediafire.com/?58qsau8x8b3roda

2)Operating System.pdf 
http://www.mediafire.com/?ybaqsgu20fq9r7t