Go Programming Language from Google Latest CSE Final Year Seminar Report

Introduction to Go Programming Language from Google Seminar Topic:

The paper is about the introduction to the programming language named GO. It is for programmers with c or c++ knowledge.  This project describes the language specification with a series of programs implementing key features of the language.

In this programming the declaration of the functions are similar to that of the programing languages like ‘C’ where the functions are declared with the keyword ‘func’, also the execution of the program starts from main method only. A string constant contains Unicode characters encoded in UTF-8. GO is also a multi-threaded language which increases the performance of the applications.

The declaration of comment is similar to that of declaration in c++     /* … */.  Regarding the semicolon we can notice that our general program has no semicolons.

When we speak about this language the compilers included are Gccgo which makes use of GCC back end. Usage of this type of compilers will run most fastly and also capable of generating less code when compared to that of Gccgo. It is similar to the usage of variable type specification of integer; float also unsigned integers like uint.

These compilers run faster but generate less code compared to that of Gccgo. Go defines variables of types such as int8, float64 and also unsigned integers like uint, uint32 and more.

With the channels we will be able to service the multiple clients without using the multiplexer explicitly .This covers some of the basic topics in general about Go programming language.

In this paper we have given the introduction to the programming language named GO. It is for programmers with c or c++ knowledge.  This project describes the language specification with a series of programs implementing key features of the language. 

Download Go Programming Language from Google Latest CSE Final Year Seminar Report.

Game Development Technical Paper Presentation for Computer Science Students

Introduction to Game Development Technical Paper Presentation:

The paper is about development of the game. The game is software which is being installed in the computer systems. The goal of the games development involves 100% satisfaction and also entertainment to a maximum extent for the users. By using this game development process the different types of the video games are being produced.

Games are developed based on consoles. Running of the same game is not possible on consoles multi-times. Also it costs high for developing a game. As a result the consumers mostly deal with the existing players which makes new comers life more miserable.

In general the development process by the game developer involves the development done from a single person to large business association. These games are developed for generating profit. The games which are well-made can get enough profit. It is even important for the games developer to estimate the development costs so that they can attain profits more than the investment.

The games which are developed previously used to provide the entertainment to lower extent.   The implementation of the system and also for playing of the system required the mainframe computers. Existing industries provide high supply in fields of research, advertising and manufacturing. The life of the competitors become difficult  to enter into competition without the market share sufficiently.

The process of the game development involves three stages which includes the pre-production, also the production and also the post production. This process of production of game assures a high quality services to user to provide entertainment to maximum extent. Some of the game industries include EA, also UBISOFT and also ZYNGA for producing high quality games.

Download Game Development Technical Paper Presentation for Computer Science Students.

Ajax Technology CSE Seminar Topic with Documentation

Introduction to Ajax Technology Seminar Topic:

The paper is about the Ajax technology.  The technology Ajax is used for creating the customized web applications which are dynamic in nature.  It forms a communication which is asynchronous and also two-way; this communication exists between the server and also the web browser.  The aim of this paper is for providing the information about the technology AJAX, what all the duties that are performed by this technology, and also the situations when this technology should be implemented and also when not to use. This paper also includes the future enhancements when compared to that of present.

This type of communication which is asynchronous helps user to browse the webpage, as they are being loaded as sections. It has also capability of adding information which is new or being updated recently without the page being refreshed. In the present situation the application of Ajax is being used in many companies as many customers prefer the application which is being developed using this technology.

Developing an Ajax application includes the writing of the code with three sections, where the first section includes the code which is being written in HTML, where the second section is written in the JavaScript, whereas the third section is written in server script written in PHP.  Where each section of code represent the Ajax request and if there is any missing in the request then the section may fail.

AJAX helps to develop internet applications. It makes use of XML for communication with server. Overall they provide application which is interactive. We can conclude that AJAX is easy technology to learn with a little knowledge of html. Al Though the Ajax provides the web applications which are interactive and rich but if they are not properly used can create security problems.

Download Ajax Technology CSE Seminar Topic with Documentation.

High Speed Adder Used In Digital Signal Processing Technical Seminar Topic for CSE

Introduction to High speed adder used in digital signal processing Seminar Topic:

At the very least, most people expect computers to do some kind of arithmetic computation and thus, most people expect computers to add. Combinational logic circuits that perform binary addition are known as adders. We have half adder and full adder. Half adder is a combinational circuit which performs the addition of two bits.

In half adder circuit we have two binary inputs and two binary outputs. Full adder is also a combinational circuit which performs the addition of three bits. Full adder circuit may also be implemented from the combination of two half adder circuits. 

             We have some problems with this adder like it is very slow and some times it may give wrong results because of slow propagation of signals. To overcome these problems we have several adders, those are: Ripple adder, Carry Look Ahead adder, Carry Select adder, 2’s compliment adder, Conditional Sum adder, Carry Save adder.

Download High Speed Adder Used In Digital Signal Processing Technical Seminar Topic for CSE .

 

Numerical Problem a Parallel Approach Topic for CSE Technical Seminar with PPT

Introduction to Numerical Problem a Parallel Approach Topic Presentation:

We know that in sequential processing we need to process the data sequentially that is one by one which is very time consuming and in sequential approach there is a lack of interprocessor communication. Parallel processing is solving a problem by working at a time on different parts of that problem. We require algorithms, programming languages, operating systems, compilers and so many numbers of processors that may be in tens or in millions also. Parallel processing reduces the time taking to solve the problems. 

Flynn’s Classification

1. Single instruction stream, single data stream (SISD) Computer:

            In SISD computer we have only one control and one processor instruction stream is sent to processor from the control and processed the data stream is sent to the memory. 

2. Multiple instruction stream, single data stream (MISD) computer:

            In MISD computers we have number of processors and controls. A single data stream is sent from the memory to the processor then numbers of instruction stream are sent to the controls. 

3. Single instruction stream, multiple data stream (SIMD) computer:

            In SIMD computer we have number of processors and a single control. Numbers of data streams are sent to the processors from the memory and a single instruction stream is sent to all the processors from the single control. 

4. Multiple instruction stream, multiple data stream (MIMD) computer:

            In MIMD we have number of processors and controls. Numbers of data streams are sent from the shared memory or interconnection network to the processor and numbers of instructon streams are sent to the processor from the number of controls. 

In parallel processing we use number of parallel algorithms. A parallel algorithm is a solution method to be solved on a parallel computer. The quality of the parallel algorithm depends on the speedup it produces. The larger the speedup, the better the parallel algorithm.

Download Numerical Problem a Parallel Approach Topic for CSE Technical Seminar with PPT.

Quality of Service Routing Approaches and Algorithms CSE Technical Seminar

Introduction to Quality of Service Routing Approaches and Algorithms Technical Seminar:

Now-a-days so many applications are there in the internet that need service guarantee in order to maintain the functionality. So far there were no preferences to traffic; internet has followed best effort service. But now, the applications need the service guarantee, to provide this we need a system which provides these kinds of guarantees.

Quality of Service includes some mechanisms and provides such guarantees. QoS considers hop count and doesn’t follow shortest path routing. QoS routing is a routing scheme, under which paths for flows would be determined based on some knowledge of Resource availability in the network as well as the QoS requirements of the flow. 

Objectives: 

            The objectives of QoS are based on the information about network state and resource availability. These are as follows

  • Dynamic determination of feasible paths.
  • Optimization of resource usage.
  • Graceful performance degradation. 

Routing algorithms

            We have several problems in QoS routing and we can solve these problems using some algorithms. The two complex problems are MCOP (Multi-Constrained Optimal Path routing problem) and MCP (Multi-Constrained Path routing problem).these can be solved by heuristic approaches. The algorithms that are for the optimization problem MCOP can easily solve also the MCP problem by just checking if the optimal path is feasible with regard to the given constraints. For solving the MCP problem we have several algorithms. Those are Chen and Nahrstedt’s algorithm, Jaffe’s algorithm, Tunable Accuracy Multiple Constraints Routing Algorithm, Iwata’s algorithm, Randomized algorithm.

Routing strategies and approaches:

            QoS routing algorithms are divided into 3 broad classes based on the different tasks done by the QoS routing. Those are i) Source routing ii) Distributed routing iii) Hierarchical routing.

            QoS routing is more popular now because of OSPF protocol.Qospf uses three metrics: Available bandwidth, Propagation delay, Hop count

 Download Quality of Service Routing Approaches and Algorithms CSE Technical Seminar.

Technical Seminar Topic with PPT on Mining the Web Graph for IT Students

Web mining refers to applying data mining techniques on web based hypertexts. As we have large amount of data available online. web mining is more popular now-a-days.      E-commerce is the most important application of web mining for its rapid development. 

Classification of web mining

Web mining is classified into three types based on the type of data used: i) web content mining ii) web structure mining iii) web usage mining

Web content mining: web content mining explains the mining of data from web contents. Web is the repository of data so that there are so many techniques to extract the data. Most of the techniques are based on the semi structured HTML documents data and unstructured free text data. Web content mining is of two point views information retrieval view and database view.

Web structure mining: under web structure mining the models behind the hyperlinks is discovered. These models shows the structures of the hyperlinks present on the web site so that the similar data could be grouped together therefore it would be easy to the user to retrieve the data.

Web usage mining: different user uses different technique to retrieve the needed information from the web. These patterns are discovered using this technique to improve the quality of web content to the end user and also to improve the site design. Web usage mining is also known as web log mining.

Web data clustering:

Clustering the web data means to group the data. Similar kind of data is grouped together into one class so that when ever the user requests for particular data the information related to that particular topic will be retrieved. We have lot benefits by clustering the data like integrating various data representations, improving the web data accessibility, improving information retrieval, etc. We have different types of clustering. Those are: hierarchical clustering, partitional clustering, probabilistic clustering, graph based clustering, fuzzy clustering, neural network based clustering and hybrid clustering.

Web caching:

Web caching refers to storage of recently retrieved computer information to future use. Web caching decreases the traffic in the web by reducing the bandwidth usage and reduces the server load. Evaluation methods and techniques of web caching are hit rate, weighted hit rate and latency.

Download Technical Seminar Topic with PPT on Mining the Web Graph for IT Students.

Subnetting and VLSM Topic for CSE Technical Seminar with PPT

Introduction to Subnetting and VLSM Topic for CSE Technical Seminar:

Every system has given a unique IP address consisting of 32 bits written in dotted decimal format. This 32 bit IP address is divided into two parts: first 0-15bits represents network number and from16-31bits represents host number. The IP address consists of binary numbers Following is the example of an IP address:

         40     .179       . 220          .200

10001100.10110011.11011100.11001000. 

Subnetting: 

An IP address consists of network number and host number therefore subnetting is dividing the network number part classes into small pieces. In subnetting bits are borrowed from host ID part to the network ID.The IP address is classified into 5 different classes. Those are Class A, Class B, Class C, Class D and Class E. The value ranges of these classes starting from class A are- 0 to 126 (127 is loop back), 128 to 191, 192 to 223, 224 to 239 and 240 to 255 respectively. To make the networks class A, Class B and Class C are used, for multicasting class D addresses are used and class E addresses are reserved for future use. IP address has two-level hierarchy in which network ID and host ID are present in subnetting the host ID is divided into subnet ID and host ID thus it forms three-level hierarchy.

The IP address for network and broadcasting is different, for network address all the bits present in host number are set to ‘0’ and for broadcast all the bits of host are set to ‘1’. Here we need not to consider the length of the host section. 

Custom subnet mask: 

Customized subnetting means dividing the point between subnet ID and host ID according to our choice. Custom subnet mask is a subnet mask that we use to create the customized subnet. 

Disadvantage of Subnetting: 

 In subnetting the host ID is partitioned into subnet ID and Host ID, the subnet ID represents IP addresses are interpreted and used for routing. Here all the addresses may not be used so that so many addresses may be wasted. Here is the solution to overcome this problem i.e.; VLSM. 

VLSM (Variable Length Subnet Mask): 

VLSM is allocating the address resources to the subnets based on the requirement simply VLSM is subnetting the subnets of variable size. Therefore VLSM is more flexible than the subnetting and reduces the wastage of IP address resources.

Download Subnetting and VLSM Topic for CSE Technical Seminar with PPT.

B.tech CSE Technical Seminar Topic on Subnetting and Supernetting with PPT

Introduction to Subnetting and Supernetting Technical Seminar Topic:

The traffic over the network address space utilization can not be controlled by installing more routers or by increasing the size of the routing tables. Every system has given a unique IP address consisting of 32 bits written in dotted decimal format. This 32 bit IP address is divided into two parts: first 0-15bits represents network number and from16-31bits represents host number. 

Classful IP addressing

Classful addressing divides the entire IP address space (0.0.0.0 to 255.255.255.255) into classes. The different classes of IP address are Class A, Class B, Class C, Class D & Class E. The value ranges of these classes starting from class A are- 0 to 126 (127 is loop back), 128 to 191, 192 to 223, 224 to 239 and 240 to 255 respectively. 

Subnetting: 

The basic purpose of subnetting is to control the traffic over the networks. An IP address consists of network number and host number therefore subnetting is dividing the network number part classes into small pieces. In subnetting bits are borrowed from host ID part to the network ID part. It has two-level hierarchy in which network number and host number parts are present, in three level hierarchy we have network number, subnet number and host number. 

Supernetting/CIDR: 

Supernetting is combining the multiple internet address of a class. It does not follow the concept of classes because it is very confusing. CIDR stands for Classes Inter-Domain Routing. The notation of CIDR is xxx.xxx.xxx.xxx/n here ‘n’ is the number of leftmost ‘1’ bits in the mask.

Download B.tech CSE Technical Seminar Topic on Subnetting and Supernetting with PPT.

Security in Operating System and WindowsNT Final Year CSE Technical Seminar PPT

Introduction to Security in Operating System and WindowsNT Technical Seminar Topic:

Computer security refers to the protection of all components like hardware, software, and stored data of a computer from damage, theft, or unauthorized use. Most confidential data should be protected from the unauthorized users so that the data should be encrypted. Many users accessing the data lead to data inconsistency as they may alter the data. So, proper passwords should be used. Sometimes systems may crash so that we may loss important data to overcome this we should maintain data backup. 

Security problems in operating systems: 

Authentication: authentication is mainly dependent on the user identity. The most common user identity is giving passwords. When the user enters the username then the system asks for the password if the entered password matches the password stored in the system the system assumes that the user as the legal user. But the passwords can be easily guessed by the unauthorized users if we use simple passwords. So we should be more careful while choosing the passwords. The main problem is keeping the password secret. To solve this problem we have encrypted passwords and one time passwords. 

Program threats: Hackers thefts the data or programs written by some users and they may change them. it leads to the misuse of the data. The two major program threats are Trojan horses and Trap doors. 

System threats: the two main system threats are warms and viruses. Warm replicates a file so that the number of copies of a file are produced ultimately then the system performance goes downs. Virus spread their programs to all the files and damages them. These viruses are usually spread by downloading data from the network and exchanging the infected disks. 

WindowsNT: 

Microsoft included security as part of the initial design specifications for Windows NT, and it is pervasive in the operating system. The security model includes components to control who accesses which objects, which actions an individual can take on an object, and which events are audited.

Download Security in Operating System and WindowsNT Final Year CSE Technical Seminar PPT.