as part of tao course psk sir asked us to practice hands on
XML,XQuery.
RDF or OWL editor. Protege .5.0
vedasnotes
Tuesday, January 20, 2015
Start of new sem on 12th jan 2015
I chose to take remaining all 4 courses related to KnowLedge Engineering field which is a Branch of Artificial Intelligence and which is further a branch of cognitive science field
my area of interest.
thereby am making one step towards my dream.
as i did not enrolled to Intro to AI , NLP or Pattern recognition or Machine Learning,
I have to take those courses either online or through textbooks.
ha ..the courses that am taking this sem are..
1.Planning and constraint satisfaction.-Prof Narayana Swamy
2.Memory Based reasoning in AI.-Prof.Suthanu
3.Theory and Application of ontologies.-Prof.Sreenivasa Kumar
4.Knowledge representation and Reasoning -Prof.Deepak khemani
my area of interest.
thereby am making one step towards my dream.
as i did not enrolled to Intro to AI , NLP or Pattern recognition or Machine Learning,
I have to take those courses either online or through textbooks.
ha ..the courses that am taking this sem are..
1.Planning and constraint satisfaction.-Prof Narayana Swamy
2.Memory Based reasoning in AI.-Prof.Suthanu
3.Theory and Application of ontologies.-Prof.Sreenivasa Kumar
4.Knowledge representation and Reasoning -Prof.Deepak khemani
Saturday, April 26, 2014
Digital Logic ,Computer Organization and Architecture, Operating systems
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
*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
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
Subscribe to:
Posts (Atom)