Sort & Filter in Excel
You can sort your data in Excel in descending and ascending order. You can filter your data If you only want to display records that meet certain criteria.
Sort
If you only want to sort on one column, execute the following easy steps.
1. Open the accompanied Excel file, and click any cell in the column you want to sort.

2. To sort in ascending order, click on the Data tab and then click AZ.

Result:

Note: in a similar way, you can sort in descending order by clicking on ZA.
If y ....etc

[:=Read Full Message Here=:]

SYNOPSIS

PROJECT DOMAIN:
The project MAGIC STRIGS belongs to the domain of windows. Having a mathematical background it is a novel attempt to implement it by employing programming concepts.

PROBLEM STATEMENT :
To design a game named Magic strings where the user guesses an alphanumeric string of a specified length and the computer displays the string guessed by the user in his mind.

PROJECT DESCRIPTION:
In this game the user is initially prompted to guess an alphanumeric string of
....etc

[:=Read Full Message Here=:]

genetic algorithm application

Index of Most Important Applications of the Genetic Algorithms

This section presents a overview of applications of genetic algorithms to real-world problems.

Genetic Algorithms in Parametric Design of Aircraft, by Mark F. Bramlette and Eugene E. Bouchard. The authors discuss optimizing aircraft designs when the task is posed as that of optimizing a list of parameters. They have approached the problem with a number of optimization algorithms, including a genetic algorithm using real number representation. They ....etc

[:=Read Full Message Here=:]

Sort & Filter in Excel
You can sort your data in Excel in descending and ascending order. You can filter your data If you only want to display records that meet certain criteria.
Sort
If you only want to sort on one column, execute the following easy steps.
1. Open the accompanied Excel file, and click any cell in the column you want to sort.

2. To sort in ascending order, click on the Data tab and then click AZ.

Result:

Note: in a similar way, you can sort in descending order by clicking on ZA.
If y ....etc

[:=Read Full Message Here=:]

Viva Questions

1) What is the time complexity of linear search? (n) 2) What is the time complexity of binary search? (log2n) 3) What is the major requirement for binary search? The given list should be sorted. 4) What is binary search? It is an efficient method of finding out a required item from a given list, provided the list is in order. The process is: 1. 2. 3. 4. First the middle item of the sorted list is found. Compare the item with this element. If they are equal search is complete. If the middle elemen ....etc

[:=Read Full Message Here=:]

Viva Questions

1) What is the time complexity of linear search? (n) 2) What is the time complexity of binary search? (log2n) 3) What is the major requirement for binary search? The given list should be sorted. 4) What is binary search? It is an efficient method of finding out a required item from a given list, provided the list is in order. The process is: 1. 2. 3. 4. First the middle item of the sorted list is found. Compare the item with this element. If they are equal search is complete. If the middle elemen ....etc

[:=Read Full Message Here=:]

Abstract

Counting sort is a linear time sorting algorithm used to sort items when they belong to a fixed and finite set. Integers which lie in a fixed interval, say k1 to k2, are examples of such items.
The algorithm proceeds by defining an ordering relation between the items from which the set to be sorted is derived (for a set of integers, this relation is trivial).Let the set to be sorted be called A. Then, an auxiliary array with size equal to the number of items in the superset is defined, say B. For each element in A, s ....etc

[:=Read Full Message Here=:]

Brute-Force approach

1. Define Brute-Force approach.
Brute force is a straightforward approach of solving the problem. It is directly based onthe problem statement and definitions of concepts that are directly involved in the problem. Inshort, the method has Just do it approach.
2. Write any four examples for Brute force approach.
a. Computing an
b. Computing n!
c. Performing multiplication of two matrices
d. Searching a key value from given list of element
3. Write the various features of Brute force a ....etc

[:=Read Full Message Here=:]

Caricatures of Big Bang from Matrices
Presented By:
Sumit R. Das
University of Kentucky, Lexington

Space-time from Matrices
A common slogan in string theory is that space and time are not fundamental, but derived concepts which emerge out of more fundamental structures.
In a few cases we have some hint of what this structure could be these are situations where the space-time physics has a holographic description usually in terms of a field theory of matrices.
These are in fact description of closed ....etc

[:=Read Full Message Here=:]

about bucket sort animation example in to the right box for getting free material ....etc

[:=Read Full Message Here=:]

CS2K707(P) Seminar Report on
SERVICE LOCATION PROTOCOL
Submitted In Partial Fullment Of The Degree OfBachelor Of Technology
By
DEEPTI TOORY
1.367,S7 CSE
Department of Computer Science & EngineeringNational Institute of Technology, Calicut2004 Monsoon
National Institute of Technology, Calicut
Department of Computer Science & Engineering

Abstract:
The service location protocol provides a scalable framework for the discovery andselection of network services. Using this protocol, computers using the internet need l ....etc

[:=Read Full Message Here=:]

import java.io.*;
class Dem21
{
public static void main(String args)throws IOException
{
BufferedReader b=new BufferedReader(new InputStreamReader(System.in));
int i,j,n=0;
String s1;
System.out.println(enter the array size:);
try
{
n=Integer.parseInt(b.readLine());
String s=new String;
System.out.println(enter the strings:);
for(i=0;i {
s=b.readLine();
}
for(i=0;i {
for(j=i+1;j {
if(s.compareTo(s)>0)
{
String tmp=s;
s=s[ ....etc

[:=Read Full Message Here=:]

hai,
do you know the pc sort instrument is similar for 5 pen pc technology , and i think both technology is same
and you can get 5 pen pc technology full report from this sites below..
http://seminarsprojects.net/Thread-5-pen-pc-technology
http://seminarsprojects.net/Thread-5-pen-pc-technology?page=4
http://seminarsprojects.net/Thread-5-pen-pc-technology?page=7
http://seminarsprojects.net/Thread-5-pen-pc-technology?page=8
http://seminarsprojects.net/Thread-5-pen-pc-technology?page=9
http://seminarsprojects.net/Thread-pensort-instrument ....etc

[:=Read Full Message Here=:]

LINUX FROM SCRATCH
PROJECT REPORT
Submitted by
FALCON FRANCIS MANJU V RAVINDRAN RANJITH KIRAN K SOUMI CG VINU THANKACHAN
CHAPTER 1INTRODUCTION
One important reason for LFS's existence is to help people learn how a Linux system works from the inside out. One of the best things that this learning experience provides is the ability to customize Linux to your own tastes and needs.
A key benefit of LFS is that it allows users to have more control over the system without relying on someone else's Linux implementation.
Anot ....etc

[:=Read Full Message Here=:]

Presented By:
VISHWAS HANUMANT JADHAV
Under The Guidance of
Prof. Mr. NILESH PATNI
Modern College Of Engineering, Pune-05

Abstract
Go is a compiled, garbage-collected, concurrent programming language developed by Google Inc.
The initial design of Go was started in September 2007 by Robert Griesemer, Rob Pike, and Ken Thompson, building on previous work related to the Inferno operating system. Go was officially announced in November 2009, with implementations released for the Linux and Mac OS X platf ....etc

[:=Read Full Message Here=:]

algorithm,Analysis of INSERTION SORT,Hiring Problem,Quicksort,knapsack problem,Greedy

1. What is algorithm? What are the characteristics of an algorithm? And explain designing methods of an algorithm with example.
Ans: Algorithm:
In mathematics, computer science, and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields.
Characteristics of an algorithm
Algorithms should ha ....etc

[:=Read Full Message Here=:]

import java.io.*;
class Dem20
{
public static void main(String args)throws IOException
{
BufferedReader b=new BufferedReader(new InputStreamReader(System.in));
int i,n=0;
String s1;
try
{
System.out.println(enter the size of array:);

n=Integer.parseInt(b.readLine());
String s=new String;
System.out.println(enter the string:);
for(i=0;i {
s=b.readLine();
}
for(i=0;i {
StringBuffer sb=new StringBuffer(s) ;
s1=new String(sb.reverse());
if(s.equals(s1 ....etc

[:=Read Full Message Here=:]

CS2K707(P) Seminar Report on
SERVICE LOCATION PROTOCOL
Submitted In Partial Fullment Of The Degree OfBachelor Of Technology
By
DEEPTI TOORY
1.367,S7 CSE
Department of Computer Science & EngineeringNational Institute of Technology, Calicut2004 Monsoon
National Institute of Technology, Calicut
Department of Computer Science & Engineering

Abstract:
The service location protocol provides a scalable framework for the discovery andselection of network services. Using this protocol, computers using the internet need l ....etc

[:=Read Full Message Here=:]