CPU Scheduling Algorithms
In a simple system running a single process, the time spent waiting for I/O is wasted, and those CPU cycles are lost forever. A scheduling system allows one process to use the CPU while another is waiting for I/O, thereby making full use of otherwise lost CPU cycles. The following subsections will explain several common scheduling strategies, looking at only a single CPU burst each for a small number of processes. Obviously real systems have to deal with a lot more simultaneous processes executing their CPU-I/O burst cycles.1. First-Come First-Serve Scheduling (FCFS) 2. Shortest Job First ( Non Primitive) 3. Priority Scheduling algorithm 4. Round Robin Scheduling algorithm 5. FIFO Page Replacement algorithm 6. Optimal Page Replacement Algorithm 7. Least Recently Use(LRU) Page Replacement Algorithm 8. Banker's Algorithm
C plus plus Programming
BASIC C++ PROGRAMS :
1. Print "Hello" in C++
2. If - else Condition
3. Factorial Number Using Recursive Function
4. Switch Case Using C++
5. Create Class and Object
6. Making A Constructor
7. Function Overloading
8. Operator Overloading
9. Simgle Inheritance
10. Polymorphism in C++
11. Exception Handling
12. Template Using in C++
JAVA Programming
Java is a simple and yet powerful object oriented programming language and it is in many respects similar to C++. Java originated at Sun Microsystems, Inc. in 1991. It was conceived by James Gosling, Patrick Naughton, Chris Warth, Ed Frank, and Mike Sheridan at Sun Microsystems, Inc. It was developed to provide a platform-independent programming language. This site gives you an Introduction to Java Programming accompanied with many java examples. Its a complete course in java programming for beginners to advanced java.
BASIC JAVA PROGRAMS :
1. Hello Print in java
2. Addition of Two Number
3. Swapping of Two Number Without Three Variable
4. Swapping of Two Number With Three Variable
5. Check number is even and odd by if-else condition
6. Count 1 to 10 by using while loop
7. Count 1 to 10 by using do-while loop
8. Find factorial number by using for loop
9. Arithmatic operation using switch case
10. Print Default Value
11. Addition of Two Matrix
12. Multiplicatin of Two Matrix
13. Check Prime Number
14. Marksheet Design in java
15. String Case Change
3. Swapping of Two Number Without Three Variable
4. Swapping of Two Number With Three Variable
5. Check number is even and odd by if-else condition
6. Count 1 to 10 by using while loop
7. Count 1 to 10 by using do-while loop
8. Find factorial number by using for loop
9. Arithmatic operation using switch case
10. Print Default Value
11. Addition of Two Matrix
12. Multiplicatin of Two Matrix
13. Check Prime Number
14. Marksheet Design in java
15. String Case Change
OOPs Concept's Using JAVA :
1. Object and Class concept
2. Inheritance concept
3. Constructor conecpt
4. This keyword concept
1. Simple Inheritance
2. Abstract Classes
3. Abstract Class Using Inheritance
4. Interface
5. Exception Handling
APPLET Concept's Using JAVA :
1. Print Hello in Applet
2. Factorial Number
3. Font and Color using Applet
4. Draw Smile (Face) Using Applet
5 Creating CheckBox in Applet
6. Arithmetic Operators
7. Create Simple Calculator
8. Create Application Form
9. Insert Image in Applet
NETWORKING Concept's Using JAVA :
1. Show The Localhost Address
2. Retrieve the content form the given URL
3. Using NetworkInterface Class
4. Given URL To Find Protocol, Authority, Host, Port, Path, Query, File, Reference
5. Compare Two URL Check Its Similar
6. Find Localhost Information
7. Simple Client-Server Concepts
DATA STRUCTURE
1. Data structures are used in almost every program or software system.
2. Specific data structures are essential ingredients of many
Many algorithms apply directly to a specific data structures. When working with certain data structures you need to know how to insert new data, search for a specified item, and deleting a specific item.
Commonly used algorithms include are useful for:
- Searching for a particular data item (or record).
- Sorting the data. There are many ways to sort data. Simple sorting, Advanced sorting
- Iterating through all the items in a data structure. (Visiting each item in turn so as to display it or perform some other action on these items)
BASIC DATA STRUCTURE PROGRAMS :
1 . Stack Implementatio Using Array
2. Stack Implementation (All operations)
3. Stack Using Linked List
4. Queue Implementation Using Array
5. Queue Implementation (All Operation)
6. Queue Using Linked List
7. Singly Linear Link List (All Operation)
8. Doubly Linear Link List (All Operation)
9. Addition of Two Polynomial Equaction
10. Infix to Prefix Conversion
11. Infix to Postfix Conversion
12. Implement Evaluation of Postfix
13. Binary Search Tree All Operation)
14. Searching Element of Binary Search Tree
15. Sorting Binary Search Tree
16. Sorting Using Bubble Sort
C PROGRAMMING LANGAUGE
1. Print "Hello World"
2. Addition of Two Number
3. Swapping of Two Number within Three Variables
4. Swapping of Two Number without Three Variables
5. Greatest of Three Number
6. Minimum of Three Number
7. Average of Three Number
8. Check Number is Prime and Not-Prime
9. Check Year is Leap and Not-Leap year
10. Check character is Vowel and Consonant
11. Check Number is Positive and Negative
12. Check Number is Arm-strong and Not-Arm-Stong
13. Square of Any Number
14. Area of Circle
15. Count Number by Shifting
16. Left Shifting
17. Print 1 to 10 by(While Loop)
18. Using Switch case
19. Array Select of Ascending order
20. Addition of Two Matrix
21. Multipilication of Two Number
22. Factorial Number
23. Addition of Input Digits
24. Insert a Current Date
25. Check Number is Even and Odd
26. Check Alphabate and Digit
27. All ASCII Code of C Lang.
28. Check Simple Interest
29. Print a Table of User Choice
30. Stop Watch
31. Check Matrix is Uni and Not-Unit Matrix
32. Largest Number of Enter Elements
33. Any String to Change of lower case to Upper Case
