This Blog is very much helpful for the student who reads in BSC computer science and engineering. This blog will give you all the tutorial of theoretical answers of various questions of different subjects, so keep stay and get the information + hand notes you need. This is written for you to get the notes easily and to research with the subjects.
Please select a category of tutorial you need:
COMPUTER FUNDAMENTALS:
http://computer-fundamentals-4-student.blogspot.com
COMPUTER PROGRAMMING:
http://computer-programming-4-student.blogspot.com
PROGRAMMING IN ANSII C:
http://computer-c-programming-4-student.blogspot.com
PROGRAMMING IN C++:
http://computer-cpp-programming-4-student.blogspot.com
HTML AND WEB SITE DESIGN:
http://computer-webdesign-4-student.blogspot.com
COMPUTER ARCHITECTURE:
http://computer-architecture-4-student.blogspot.com
STATISTICS AND PROBABILITY:
http://statistics-probability-4-student.blogspot.com
DATA STRUCTURE:
http://datastructure-4-student.blogspot.com
DEFERENTIAL AND INTEGRAL CALCULUS:
http://calculus-4-student.blogspot.com
BUSINESS COMMUNICATION:
http://business-communication-4-student.blogspot.com
ELECTRONICS:
http://electronics-4-student.blogspot.com
ALGORITHM DESIGN:
http://algorithm-4-student.blogspot.com
OPERATING SYSTEM:
http://operatingsystem-4-student.blogspot.com
SYSTEM ANALYSIS AND DESIGN :
http://system-design-4-student.blogspot.com
DATA BASE MANAGEMENT SYSTEM :
http://dbms-4-student.blogspot.com
DISCRETE MATHEMATICS :
http://math-4-student.blogspot.com
E-COMMERCE :
http://e-commerce-4-student.blogspot.com
COMPILER DESIGN:
http://compilerdesign-4-student.blogspot.com
Monday, July 20, 2009
Monday, July 13, 2009
lacture plan
(CS 301: Algorithm Design)
(1 Unit, 45 lectures, Final exam: 60 marks, 3 credit hours, in course: 40 marks)
Lec: 1 – 4 Introduction:
What is an algorithm
Algorithm specification
Performance Algorithm
Randomized Algorithm
Lec: 5 – 10 Elementary Data Structure:
Stack and Queues
Trees
Dictionaries
Priority Queues
Sets and Disjoint set Union
Graphs
Lec: 11 – 16 Divide and conquer:
General method
Binary search
Finding the maximum and minimum
Quick Sort
Selection
Lec: 17 – 22 The Greedy method:
General method
Knapsack problem
Minimum cost spanning trees
Single source Shortest path
Lec: 23 – 30 Dynamic Programming:
General method
Multistage Graphs
All pairs shortest paths
Single source Shortest path general weights
Optimal binary search tree
Lec: 31 – 33 Basic Traversal &Search technique:
Techniques for Binary trees
Techniques for Graphs
Lec: 34 – 38 Backtracking:
General method
The 8 – Queens problem
Sum of subsets
Graph coloring
Lec: 39 – 42 Branch and Bound:
The method
0/1 Knapsack problem
Traveling salesperson
Lec: 43 – 45 Review Classes
(1 Unit, 45 lectures, Final exam: 60 marks, 3 credit hours, in course: 40 marks)
Lec: 1 – 4 Introduction:
What is an algorithm
Algorithm specification
Performance Algorithm
Randomized Algorithm
Lec: 5 – 10 Elementary Data Structure:
Stack and Queues
Trees
Dictionaries
Priority Queues
Sets and Disjoint set Union
Graphs
Lec: 11 – 16 Divide and conquer:
General method
Binary search
Finding the maximum and minimum
Quick Sort
Selection
Lec: 17 – 22 The Greedy method:
General method
Knapsack problem
Minimum cost spanning trees
Single source Shortest path
Lec: 23 – 30 Dynamic Programming:
General method
Multistage Graphs
All pairs shortest paths
Single source Shortest path general weights
Optimal binary search tree
Lec: 31 – 33 Basic Traversal &Search technique:
Techniques for Binary trees
Techniques for Graphs
Lec: 34 – 38 Backtracking:
General method
The 8 – Queens problem
Sum of subsets
Graph coloring
Lec: 39 – 42 Branch and Bound:
The method
0/1 Knapsack problem
Traveling salesperson
Lec: 43 – 45 Review Classes
Sunday, July 12, 2009
Visite these blogs regularly
This Blog is very much helpful for the student who reads in BSC computer science and engineering. This blog will give you all the tutorial of theoretical answers of various questions of different subjects, so keep stay and get the information + hand notes you need. This is written for you to get the notes easily and to research with the subjects.
Please select a category of tutorial you need:
COMPUTER FUNDAMENTALS: http://computer-fundamentals-4-student.blogspot.com
COMPUTER PROGRAMMING: http://computer-programming-4-student.blogspot.com
PROGRAMMING IN ANSII C: http://computer-c-programming-4-student.blogspot.com
PROGRAMMING IN C++: http://computer-cpp-programming-4-student.blogspot.com
HTML AND WEB SITE DESIGN: http://computer-webdesign-4-student.blogspot.com
COMPUTER ARCHITECTURE: http://computer-architecture-4-student.blogspot.com
STATISTICS AND PROBABILITY: http://statistics-probability-4-student.blogspot.com
DATA STRUCTURE: http://datastructure-4-student.blogspot.com
DEFERENTIAL AND INTEGRAL CALCULUS: http://calculus-4-student.blogspot.com
BUSINESS COMMUNICATION: http://business-communication-4-student.blogspot.com
ELECTRONICS: http://electronics-4-student.blogspot.com
ALGORITHM DESIGN: http://algorithm-4-student.blogspot.com
OPERATING SYSTEM: http://operatingsystem-4-student.blogspot.com
SYSTEM ANALYSIS AND DESIGN : http://system-design-4-student.blogspot.com
DATA BASE MANAGEMENT SYSTEM : http://dbms-4-student.blogspot.com
DISCRETE MATHEMATICS : http://math-4-student.blogspot.com
E-COMMERCE : http://e-commerce-4-student.blogspot.com
COMPILER DESIGN: http://compilerdesign-4-student.blogspot.com
NUMERICAL ANALYSIS
DATA COMMUNICATION
MICROPROCESSORS
COMPUTER NETWORKS
BASIC ACCOUNTING
COMPUTER GRAPHICS
ARTIFICIAL INTELLIGENCE
PERIPHERALS AND INTERFACING
SOFTWARE ENGINEERING
PROGRAMMING ON JAVA
E-COMMERCE MANAGEMENT
ADVANCE DATABASE SYSTEM
PROJECT MANAGEMENT
OOP SOFTWARE ENGINEERING
NETWORK MANAGEMENT
OOP MODELING AND DESIGN
WIRELESS COMMUNICATION
TELECOMMUNICATION.
Wednesday, July 8, 2009
Welcome to MY TUTORIALS
This Blog is very much helpful for the student who reads in BSC computer science and engineering. This blog will give you all the tutorial of theoretical questions of various questions of different subjects, so keep stay and get the information + hand notes you need.
Please select a category of tutorial you need:
COMPUTER FUNDAMENTALS.
COMPUTER PROGRAMMING.
PROGRAMMING IN ANSII C.
PROGRAMMING IN C++.
HTML AND WEB SITE DESIGN.
COMPUTER ARCHITECTURE.
STATISTICS AND PROBABILITY
DATA STRUCTURE.
DEFERENTIAL AND INTEGRAL CALCULUS
BUSINESS COMMUNICATION
ELECTRONICS.
ALGORITHM DESIGN.
OPERATING SYSTEM.
SYSTEM ANALYSIS AND DESIGN
DATA BASE MANAGEMENT SYSTEM
DISCRETE MATHEMATICS
E-COMMERCE
COMPILER DESIGN
NUMERICAL ANALYSIS
DATA COMMUNICATION
MICROPROCESSORS
COMPUTER NETWORKS
BASIC ACCOUNTING
COMPUTER GRAPHICS
ARTIFICIAL INTELLIGENCE
PERIPHERALS AND INTERFACING
SOFTWARE ENGINEERING
PROGRAMMING ON JAVA
E-COMMERCE MANAGEMENT
ADVANCE DATABASE SYSTEM
PROJECT MANAGEMENT
OOP SOFTWARE ENGINEERING
NETWORK MANAGEMENT
OOP MODELING AND DESIGN
WIRELESS COMMUNICATION
TELECOMMUNICATION.
Please select a category of tutorial you need:
COMPUTER FUNDAMENTALS.
COMPUTER PROGRAMMING.
PROGRAMMING IN ANSII C.
PROGRAMMING IN C++.
HTML AND WEB SITE DESIGN.
COMPUTER ARCHITECTURE.
STATISTICS AND PROBABILITY
DATA STRUCTURE.
DEFERENTIAL AND INTEGRAL CALCULUS
BUSINESS COMMUNICATION
ELECTRONICS.
ALGORITHM DESIGN.
OPERATING SYSTEM.
SYSTEM ANALYSIS AND DESIGN
DATA BASE MANAGEMENT SYSTEM
DISCRETE MATHEMATICS
E-COMMERCE
COMPILER DESIGN
NUMERICAL ANALYSIS
DATA COMMUNICATION
MICROPROCESSORS
COMPUTER NETWORKS
BASIC ACCOUNTING
COMPUTER GRAPHICS
ARTIFICIAL INTELLIGENCE
PERIPHERALS AND INTERFACING
SOFTWARE ENGINEERING
PROGRAMMING ON JAVA
E-COMMERCE MANAGEMENT
ADVANCE DATABASE SYSTEM
PROJECT MANAGEMENT
OOP SOFTWARE ENGINEERING
NETWORK MANAGEMENT
OOP MODELING AND DESIGN
WIRELESS COMMUNICATION
TELECOMMUNICATION.
Subscribe to:
Comments (Atom)
Posts
