1. IP/MDU/B.TECHCOACHINGA
COMPUTER ORGANIZATION
DATA BASE MANAGEMENT SYSTEM ALGORITHM ANALYSIS &
DESIGN
THEORY OF COMPUTATION COMPUTER GRAPHICS
Course Duration : 1.5 Month
Fees: Rs 5000/-
A1/17, Top Floor, Opposite Metro Pillar no: 636, Main Najafgarh ,Road, Janakpuri New
Delhi – 110058
Phone no-011-4166-8088, 90155-96280, 9313565406, website-www.balujalabs.in
2. Unit-I Representation of Information and Basic
Building Blocks
• Introduction to Computer,
• Computer hardware generation,
• Number System: Binary, Octal,
• Hexadecimal,
• Character Codes (BCD, ASCII, EBCDIC),
• Logic gates,
• Boolean Algebra,
Unit-II (Basic Organization)
• Von Neumann Machine (IAS Computer)
• Operational flow chart (Fetch, Execute)
• Instruction Cycle,
• Organization of Central Processing Unit
• Hardwired & micro programmed
Unit-III (Memory Organization)
• Memory Hierarchy,
• Main memory (RAM/ROM chips)
• Auxiliary memory, Associative
• memory, Cache memory,
• Virtual Memory
Unit-IV (I/O Organization)
• Peripheral devices
• I/O interface
• Priority Interrupt
• Direct Memory
Computer Organization
• Unit-V (Process Organization)
• Basic Concept of 8-bit micro Processor and 16-bit
• AssemblyInstruction Set
DATABASE MANAGEMENT SYSTEM
• Unit- I Introduction: An overview of DMBS
• system concepts and architecture,
• language and interfaces,
• Data Modeling using the Entity Relationship Model
• mapping constraints, keys
• aggregation, reduction of an ER diagrams to tables
Unit- II Relational data Model and Language
• Relational data model concepts
• integrity,
• Introduction to SQL: Characteristics of SQL.
• SQL commands. SQL operators and their
procedure.
• Aggregate functions. Insert
• SQL.
Unit- III Data Base Design & Normalization:
• Functional dependencies
• forms, BCNF
• JDs
Unit- IVTransaction Processing Concepts
• Transaction system, Testing of serializability,
Serializability of
• Schedules, conflict & view serializable schedule,
recoverability
• Recovery from transaction failures, log
• based recovery, checkpoints, deadlock handling.
3. Unit- V Concurrency Control Techniques
• Concurrency control, locking Techniques for
concurrency control
• Time stamping protocols for concurrency
control,
• Validation based protocol
• Multiple granularity, Multi
• Version schemes, Recovery with concurrent
transaction.
ALGORITHM ANALYSIS & DESIGN
UNIT – IPreliminaries
• Review of growth of functions
• Recurrences: The substitution method
• The iteration method
• The master method
• Data Structures for Disjoint Sets.
• Divide and Conquer Approach: Merge Sort
• Quick sort
UNIT – II Dynamic Programming
• Elements of Dynamic Programming
• Matrix Chain Multiplication
• Longest common subsequence and optimal
• binary search trees
• Greedy Algorithms: Elements of Greedy
• strategy
• An activity selection problem
• Huffman Codes
UNIT – III Graph Algorithms
• Representation of Graphs
• Breadth First Search
• Depth First Search
• Topological Sort
• Strongly Connected Components
• Algorithm for Kruskal’s and Prim’s
UNIT – IV String matching
• The naïve String Matching algorithm
• The Rabin-Karp Algorithm
• String Matching with finite automata
• The Knuth-Morris Pratt algorithm.
ALGORITHM ANALYSIS & DESIGN UNIT –
IPreliminaries
• Review of growth of functions
• Recurrences: The substitution method
• The iteration method
• The master method
• Data Structures for Disjoint Sets.
• Divide and Conquer Approach: Merge Sort
• Quick sort
UNIT – II Dynamic Programming
• Elements of Dynamic Programming
• Matrix Chain Multiplication
• Longest common subsequence and optimal
• binary search trees
• Greedy Algorithms: Elements of Greedy
• strategy
• An activity selection problem
• Huffman Codes
4. UNIT – III Graph Algorithms
• Representation of Graphs
• Breadth First Search
• Depth First Search
• Topological Sort
• Strongly Connected Components
• Algorithm for Kruskal’s and Prim’s
UNIT – IV String matching
• The naïve String Matching algorithm
• The Rabin-Karp Algorithm
• String Matching with finite automata
• The Knuth-Morris Pratt algorithm.
THEORY OF COMPUTATION
• Module I Proving techniques
• Mathematical induction
• Diagonalization principle
• Pigeonhole principleFunctions
• Primitive recursive and partial recursive functions
• Computable and non
• computable functions
• Formal representation of languages
• Chomsky Classification.
Module II Introduction to Automata theory
• Definition of Automation
• Finite Automata
• Language
• Acceptability by Finite Automata
• Deterministic and Nondeterministic
• Expressions
• Finite Automation with ?-
• Transitions
Module III Context Free Grammar
• Simplification of CFG-
• Normal forms
• Chomsky Normal form and
• Turing Machines
• Formal definition
COMPUTER GRAPHICS
• Module I Applications of Computer Graphics
• Raster scan and Random scan displays
• Video Display Devices
• Display files
• graphical input & output devices
• Flat panel displays,
• Hardcopy Output Devices, Physical Interactive
Devices , Data generation devices
Module II 2D Graphics
• Output primitives
• Line drawing algorithms
• DDA, Bresenham’s
• Bresenham’s
• Circle drawing algorithm
• polynomials and spline curves-2D viewing
• transformation-clipping
• Cohen-Sutherland line clipping
• polygon clipping-2D
• Transformations
Module III 3D Graphics
• 3D Transformations
• 3D display methods
• 3D Object Representation
• Polygon Surfaces
6. A1/17, Top Floor, Opposite Metro Pillar no: 636, Main Najafgarh
Road, Janakpuri New Delhi – 110058
011-4166-8088, 90155-96280, 9313565406
www.balujalabs.in
Course Highlight
1.Consistent Classroom Guidance
2.Meticulously designed Study Material
3.Review of Previous years question papers
4.Regular model Mock tests on exam patterns
5.One on One attention
6.Time Bound Completion
7. Experienced full time faculty
8.Small batches
9.5 days a weekend batches
10.Weekly test
11.Accommodation for outstation students(PG)
