Digital Logic Design:
*Logic Gates(Functions) and Boolean Algebra
*Minimization ,Simplification and k maps
*Combinational logic circuits
*Sequential logic circuits
*Number representation and Computer arithmatic
>Fixed point and Floating point
Computer Organization and Architecture:
*Memory organization
>Hierarchy
>cachememory
>principles of associate Virtual memory
>Disk and Tape Memories
*Instructions and Addressing modes
>instruction pipeline
*Micro operation
>Control Unit Design
*IO addressing
>Data transferring techniques
Books ..computer architecture -J.P.Hayes
computer organization -Paul chowdary
Operating Systems
*Process management
>Thread management
>Inter Process communication
>Concurrency and synchronization
>Dead lock
>CPU scheduling
*Memory management
>virtual memory
*File Management
*IO management
*Protection and security
Books
Galvin and Stallings
Saturday, April 26, 2014
Databases Syllabus
Database Management Systems:-
*ER Model
*Relational Model(Relational calculus and tuple calculus)
*Database Design(integrity constraints and normal forms)
*Query Languages(SQL)
*File Structures
*Transactions and Concurrency control
*ER Model
*Relational Model(Relational calculus and tuple calculus)
*Database Design(integrity constraints and normal forms)
*Query Languages(SQL)
*File Structures
*Transactions and Concurrency control
Engineering Maths
Discrete maths
*Propositional and predicate Logic
*Sets and Relations
*Functions and Groups
*Lattices and Boolean Algebra
*Graphs and trees
*Induction
Combinatorics
*Permutations and combinations(Counting and summation)
*Generating functions
*Recurrence relations
Probability
*Events(Mutually Exclusive, Dependent and Independent events)
*Kolmogorov Axioms
*Conditional probability and Bayes theorem
*Distributions
>uniform
>Normal
> Exponential,Poisson and Binomial
Calculus
*Limits and Continuty
*Differentiability
*Mean value theorems
*Integral calculus
*Partial and Total derivatives
*Maxima and Minima
Algebra.
*Linear Algebra
>Solution to system of Homogeneous and non homogenous Linear equations
>Eigen values and eigen vectors
*Numerical Methods
>solutions of systems of Linear equations
>solutions of systems of Non linear equations
>Numerical Integration
Some Books to follow..
*Elements of dm -Cl liu
*DMS with CS -Tremblay and Manohar
*DM in cs - Stanat
*DM and its application-Kenneth rosen
*Logic and d mathematics -Grassman
*Introductory combinatorics -Brualdi
*Modern applied algebra -Brikhoff
*Mathematical theory of comp -Manna
*Intro to combinational maths -c liu
*Propositional and predicate Logic
*Sets and Relations
*Functions and Groups
*Lattices and Boolean Algebra
*Graphs and trees
*Induction
Combinatorics
*Permutations and combinations(Counting and summation)
*Generating functions
*Recurrence relations
Probability
*Events(Mutually Exclusive, Dependent and Independent events)
*Kolmogorov Axioms
*Conditional probability and Bayes theorem
*Distributions
>uniform
>Normal
> Exponential,Poisson and Binomial
Calculus
*Limits and Continuty
*Differentiability
*Mean value theorems
*Integral calculus
*Partial and Total derivatives
*Maxima and Minima
Algebra.
*Linear Algebra
>Solution to system of Homogeneous and non homogenous Linear equations
>Eigen values and eigen vectors
*Numerical Methods
>solutions of systems of Linear equations
>solutions of systems of Non linear equations
>Numerical Integration
Some Books to follow..
*Elements of dm -Cl liu
*DMS with CS -Tremblay and Manohar
*DM in cs - Stanat
*DM and its application-Kenneth rosen
*Logic and d mathematics -Grassman
*Introductory combinatorics -Brualdi
*Modern applied algebra -Brikhoff
*Mathematical theory of comp -Manna
*Intro to combinational maths -c liu
Friday, April 25, 2014
Programming Languages -Syllabus
Programming in C:-
*functions
*Storage
*Recurssion
*Pointers
Parameter passing techniques
*Call by Value
*Call by reference
*Call by value result or copy reference
*call by name
*call by need and text
Scope
*Static scope and Dynamic scope
Binding
Books:-
Principle of programming languages -Horowitz
*functions
*Storage
*Recurssion
*Pointers
Parameter passing techniques
*Call by Value
*Call by reference
*Call by value result or copy reference
*call by name
*call by need and text
Scope
*Static scope and Dynamic scope
Binding
Books:-
Principle of programming languages -Horowitz
Data Structures -Syllabus and Ref Books
Syllabus:
1)Arrays
2)Stacks
3)queues
4)pointers and Linked lists
5)Trees
*Traversals
*General Tree,B tree, BST, AVL Tree,Splay trees
6)Graphs
7)Hashing
Books:-
1)Sartaj sahni
2)Kruse and Markel
3)Data Structures & Algorithm Analysis in C++ [Mark A. Weiss]
4)Corman
5)Good rich and tamasia
6)Data structures and algorithms- Adam Drozdek
1)Arrays
2)Stacks
3)queues
4)pointers and Linked lists
5)Trees
*Traversals
*General Tree,B tree, BST, AVL Tree,Splay trees
6)Graphs
7)Hashing
Books:-
1)Sartaj sahni
2)Kruse and Markel
3)Data Structures & Algorithm Analysis in C++ [Mark A. Weiss]
4)Corman
5)Good rich and tamasia
6)Data structures and algorithms- Adam Drozdek
Design and Analysis of Algorithms -Syllabus and ref books
1)Introduction to algorithms and analysis
*Need for Analysis
*Analysis FrameWork.
*Types of analysis
*Asymptotic Notation and Apriory Analysis
*Time and space complexities
2)Design strategies
*Divide and conquer
*Greedy Method
*Dynamic Programming
(Backtracking and branch and bound)
3)Graph techniques
*Traversals
*Components
*Examples
4)Heap Algorithms
6)Sorting Algorithms
7)Intractability/NP completeness(Complexity theory)
Text books:-
1)Fundamentals of Computer Algorithms -Horowitz and Sahni
2)Introduction to Algorithms--Cormen
3)Algorithm Design -Tamasia Wiley publication
*Need for Analysis
*Analysis FrameWork.
*Types of analysis
*Asymptotic Notation and Apriory Analysis
*Time and space complexities
2)Design strategies
*Divide and conquer
*Greedy Method
*Dynamic Programming
(Backtracking and branch and bound)
3)Graph techniques
*Traversals
*Components
*Examples
4)Heap Algorithms
6)Sorting Algorithms
7)Intractability/NP completeness(Complexity theory)
Text books:-
1)Fundamentals of Computer Algorithms -Horowitz and Sahni
2)Introduction to Algorithms--Cormen
3)Algorithm Design -Tamasia Wiley publication
HELLO WORLD!
Welcome to my blog..
here is my notes that i call Vedas notes ...here i am updating each and every fine tech stuff that i learned so far and the the stuff i am learning now in my own words as i interpreted and understood...
hope it helps for someone from the corner of the world
A brief about me:
I am VEDAVYAS btech graduate in computer science and engineering at CVR college of engineering ..acquired degree in Computer science From JNTU Hyderabad in year 2013
Subjects interested in
Engineering Maths and Discrete structures,
Automata Theory
Computational theory
Complexity theory
Algorithms
Databases and data mining
Programming and Data structures
computer architecture and operating systems
Research interests :-
Computational intelligence
..Artificial intelligence
--machine learning
--Semantic web
--Big Data and web mining
--knowledge systems
--Natural language processing
Cloud computing
Distributed computing
Passion..
To make Theoretical computer science more interesting with new up-gradations in teaching..
inspired by how physics made fun by physicist prof .Michio kaku and prof.Neil D Tyson
Aim
..to create a Super Computer as we see in Wall-e movie and other si fi movie
which can possibly answer most of the qns in the world form knowledge mined from the historical data
and high reasoning abilities and Logic induced software...sensing add ons which can process visual aids and sound. highly reliable system for future robotic technology
here is my notes that i call Vedas notes ...here i am updating each and every fine tech stuff that i learned so far and the the stuff i am learning now in my own words as i interpreted and understood...
hope it helps for someone from the corner of the world
A brief about me:
I am VEDAVYAS btech graduate in computer science and engineering at CVR college of engineering ..acquired degree in Computer science From JNTU Hyderabad in year 2013
Subjects interested in
Engineering Maths and Discrete structures,
Automata Theory
Computational theory
Complexity theory
Algorithms
Databases and data mining
Programming and Data structures
computer architecture and operating systems
Research interests :-
Computational intelligence
..Artificial intelligence
--machine learning
--Semantic web
--Big Data and web mining
--knowledge systems
--Natural language processing
Cloud computing
Distributed computing
Passion..
To make Theoretical computer science more interesting with new up-gradations in teaching..
inspired by how physics made fun by physicist prof .Michio kaku and prof.Neil D Tyson
Aim
..to create a Super Computer as we see in Wall-e movie and other si fi movie
which can possibly answer most of the qns in the world form knowledge mined from the historical data
and high reasoning abilities and Logic induced software...sensing add ons which can process visual aids and sound. highly reliable system for future robotic technology
Subscribe to:
Posts (Atom)