Microsoft Word is a word processor developed by Microsoft. It was first released in 1983 under
the name Multi-Tool Word for Xenix systems. Subsequent versions were later written for several
other platforms including I
Course list: http:/www.c-jump.com/bcc/
The Boot Process and Operating Systems
1. Booting Process
The heart of a modern computer is one or more Central Processing Units.
A CPU gets its instructions from memory.
The CPU reads instruction from the BIOS and s
A computer cannot do anything on its own. It must be instructed to do task
desired by us. Hence, it is necessary to specify a sequence of instructions a
computer must perform to solve a problem. Such a sequence of instructions
RTP packet header
Profile-specific extension header ID Extension header length
HTML EVENTS REFERENCES
When a user visit your website, they do things like click on text and images and given links, hover over
A synopsis for
Orchid International College
Submitted Date: 2016, July 8th
Department of Management
Orchid Intl College
Title: Airline Reservation System
In this system, I have include airline schedules, fare tariffs, passenger reservations and ticket
records. An user can view different flights available with different timing for a particular date a
SELF STUDY 1
To make the students understand the concept of structures and pointers in C+ and
how they can be implemented.
The student must have done Chapter 1 before working on this exercise.
Chapter 2- Linked Lists
At the end of this chapter you will be able to understand the concept of linked lists
and implement them in your programs.
2.1.1 Static and Dynamic Memory Allocation
2.1.2 Memory Allocation Pro
Chapter 8 - Trees
At the end of this chapter you will be able to understand the concept of trees and their
application as data structures.
8.2 Binary Trees
8.2.1 Properties of Binary Trees
8.2.2 ADT of Binary Trees
Chapter 7 - Searching Techniques
At the end of this chapter you will be able to implement various searching
techniques and compare them in various situations.
7.2 Sequential Search
Chapter 3 - Stacks and Queues
Stacks And Queues
At the end of this chapter you will be able to understand the concept of stacks
and queues and implement them in your programs.
3.2 ADT of Stacks
3.3.1 Using Array
Chapter 6 - Sorting
At the end of this chapter, you will be able to understand different sorting methods.
6.2 Insertion Sort
6.3 Selection Sort
6.4 Bubble Sort
6.5 Shell Sort
6.6 Divide and Conquer Method
6.6.1 Merge Sort
Chapter 4 - Matrices
At the end of this chapter, you will be able to understand what matrices are and will
learn to perform various operations on them.
4.2 Abstract Data Type of Matrices
4.3.1 Static Im
Chapter 9 - Graphs
At the end of this chapter you will be able to implement the various searching
techniques of graphs.
9.2 ADT of graph
9.3.1 Static Implementation
9.3.2 Linked Implementation
Chapter 5 - Recursion
At the end of this chapter you will be able to understand the concept of recursion and
will learn to implement it in programs.
5.2 Basics of Recursion
Chapter 1 - Introduction to Data Structures and Algorithms
Introduction to Data Structures and Algorithms
At the end of this chapter, you will be familiar with the concepts of data structures
1.2 Abstract Data Type
Unit 6: Multiway Trees
A tree is defined as either an empty structure or a structure whose children are disjoint trees t 1, t2,.tm .
According to this definition, each node of this kind of tree can have more than two children. This tree is
called a multiw
Unit 3: Stacks and Queues
A stack is a linear data structure that can be accessed only at one of its ends for storing and retrieving
data. Such a stack resembles piles of trays in a cafeteria. New trays are put on the top of the pile and top
Unit 1: Complexity Analysis
Data structure is the way of storing data in a computer so that it can be used efficiently.
There are two types of data structure
1. Linear Data Structure: When the elements are stored on contiguous memory locati
Unit 5: Binary Tree
Linked list usually provide greater flexibility than array, but they are linear structures and it is difficult to
use them to organize a hierarchical representation of objects. To overcome these limitations, we create a
Unit 7 : Graphs
A simple graph G is composed of a finite set of vertices and a finite set of edges. A graph is
denoted by G. A graph is denoted as G = (V,E). The elements of V are the vertices and those of E
are the edges. The vertex set of V are denoted
Unit 8 Sorting
The efficiency of data handling can be increased if the data are sorted according to some criteria
of order. It is often necessary to sort data before processing. We choose some criteria that is
used to order data. The choice will vary from
Unit 9: Hashing
Searching refers to finding a given data item in a set, list or array. In general searching is of two
types: Linear search and binary search.
Linear search or sequential search
In sequential search we search for a key in a sequen