Semantic Analysis

Introduction

Compiler:

A compiler is a piece of software that translates the source code written in a high-level programming language to object code in a low-level programming language. This process is performed so that the code may be transformed into an executable program.

The first compiler was written in 1952 by Grace Hopper for the A-0 programming language. The FORTRAN team is generally credited as having introduced the first complete compiler in 1957. In 1960, COBOL was the first language to be compiled on multiple architectures.

Structure of a Compiler:

Binary Search Tree - Code

Binary Search Tree

The following C++ code will explains the implementation of Binary Search Tree.
The following implementation is in object oriented using the Tree class and tree object. 
The implemented ADT functions of Binary Search Tree are insert and search.

Binary Search Tree

Introduction to Tree
Tree is used in data structure. A tree is used for quick search and can store unordered data.

A tree diagram is a useful tool to list all the logical possibilities of a sequence of events where each event can occur in a finite number of ways.

A tree consists of a root, a number of branches leaving the root, and possible additional branches leaving the end points of other branches.
A tree is normally constructed from left to right. A vertex of degree 1 in a tree is called a terminal vertex or a leaf node and a vertex of degree greater than 1 in a tree is called an internal vertex or a branch. The nodes at the lowest levels of the tree (the ones with no sub-trees) are called leaves.

Depth First Search

What is Graph?
A graph is just a set of vertices (nodes), together with edges (connections) between some pairs of nodes. If the connections have a direction, the graph is said to be “directed graph”, otherwise the graph is said to be “undirected graph”.

A graph G = (V, E) with V, i.e. set of vertices and E, i.e. set of edges.

Searching a graph: Systematically follow the edges of a graph to visit the vertices of the graph. And is used to discover the structure of a graph.

Standard graph searching algorithms are

• Depth First Search (DFS)
• Breadth First Search (BFS)

Problem Statement
Deeply search a graph to make logical tree. 
Depth First Search
Depth first is an algorithm for traversing or searching a tree. It explore edges out of the most recently discovered vertex v. When all edges of v have been explored, backtrack to explore other edges leaving the vertex from which v was discovered (its predecessor). 

 “Search as deep as possible first.”

Depth first search is another way of traversing graphs, which is closely related to preorder traversal of a tree. 

Computer Networks

Network in other words, you can say is a ‘web’. So, Computer Network becomes ‘web of computers’. This special kind of web of computers should be designed so intelligently that there should be no mess, not much expensive, secure, efficient and quick in communicating with each other.

For computers to communicate with other computers there should be some devices which are able to send data (according to its nature) in medium. Network devices are the components used to connect computers or electronic devices to communicate in a network of computers.

“Network devices are those devices which are used to interconnect two or more than two computers with each other to share data, information, voice, resources and to communicate with each other.”

Network devices are the hardware responsible to send data on medium and some software, which helps in making a secure and efficient network. And the software is also used to monitor the traffic of the network device.

The network devices and its components which you use in a network depend on the type of need of the network with efficiency, speedy, secure and cheap. 

Double Link List

Double Link List 

The following C++ code will explains the implementation of Double Link List.

The following implementation is in object oriented using the DoubleLinkList class and dll object. The implemented ADT functions of Double Link List are insert, print, search, modify and delete.

Single Link List

Single Link List

The following C++ code will explains the implementation of Single Link List.

The following implementation is in object oriented using the SingleLinkList class and sll object. The implemented ADT functions of Single Link List are insert, print, search, modify and delete.

Insertion sort

In insertion sort, we compares adjacent elements and swap them, if they are out of order. We take the next element and insert into the sorted list that we maintained in the beginning of the array and repeats the procedure on it and so on.

Advantages: 

Insertion sort provides several advantages

• Insertion sort takes advantage of pre-sorting
• Simple implementation
• Efficient for small data sets
• Stable: does not change the relative order of elements with equal keys
• O(1) extra space
• O(n²) comparisons and swaps
• Adaptive: O(n) time when nearly sorted
• Very low overhead
• Online: New elements can be added during the sort

Merge Sort

Merge Sort 

The following C++ code will explains the implementation of Merge Sort and sort the user input numbers in descending order.

The following implementation is in object oriented using the MergeSort class and ms object. Actual logic of Merge sort is in the function of Merge().

Bubble Sort

Bubble Sort

The following C++ code will explains the implementation of Bubble sort and sort the user input numbers in descending order.
The following implementation is in object oriented using the BubbleSort class and bs object. Actual logic of Bubble sort is in the function of BSort(). 

Linear Searching

Linear Searching 

The following C++ code will explains the implementation of Linear Searching and sort the user input numbers in descending order.

The following implementation is in object oriented using the LinearSearching class and ls object. Actual logic of Linear Searching is in the function of LSearching().
Remember in Linear Searching, bubble sort is used to sort the data and to search in the sorted data Linear Searching is used.

General Searching

General Searching 

The following C++ code will explains the implementation of General Searching and sort the user input numbers in descending order.

The following implementation is in object oriented using the GeneralSearching class and gs object. Actual logic of General Searching is in the function of GSearching(). 
Remember in General Searching, bubble sort is used to sort the data and to search in the sorted data General Searching is used.

CMMI - Capability Maturity Model Integration

CMMI

CMMI (Capability Maturity Model Integration) is a set of rules and recommendations which should lead to improvements within your organization. It puts best practices used in software development and service management. It has been developed in Carnegie-Mellon University by the Software Engineering Institute (SEI).

CMMI may also be understood as a framework to recognize and improve processes within organization. Because of its abstraction it can be used for all kinds of manufacture. CMMI levels is a set of steps which each organization can obtain in order to increase its value on a market. It requires a lot of involvement and efforts to get onto level 5.

1. Initial
2. Managed
3. Defined
4. Quantitatively Managed
5. Optimizing

Pipeline Forwarding

What is pipelining?

Pipelining forwarding is a method to prevent the hazards of pipelining. If in a clock pulse multi-processes can be done, by availing this opportunity leads the processing and efficiency of our software can be increased as time consumption is much less.

Equation of Motion

Equation of Motion

There are three important equations which are used to solve the problems about the motion of bodies. These equations show the relation between initial velocity, final velocity, acceleration, distance and time. These are known as equations of motion. It is necessary to mention that in these equations

• Motion will always be taken along straight line.
• Acceleration will be uniform.
• Although velocity, acceleration etc. are vector quantities but in these equations their magnitude will only be considered.
• Initial velocity will be taken as positive. Other quantities which are in the direction of initial velocity will be taken as positive and in the opposite direction will be taken as negative

The three equations of motion are: 

Movie Rental System

Movie rental system project in the context of Software Engineering.

Gap between generations – A challenge for the Future

What is Generation gap?

• A difference in values and attitudes between one generation and another, especially between young people and their parents.
• "Each generation imagines itself to be more intelligent than the one that went before it, and wiser than the one that comes after it.” (George Orwell)