Admin Welcomes U 2011 ~ ANNA UNIVERSITY QUESTION BANKS PAPERS WITH SOLUTIONS

JOIN WITH US :)

WELCOME TO GEEKERS UNIVERSITY OF STUDENT AND PROFESSORS OFFCIAL WEBSITE

THIS WEBSITE BELONGS TO STUDENTS AND PROFESSORS OF GEEKERS UNIVERSITY

GEEKERS UNIVERSITY DEPT

RESEARCH,MBBS,NURSING,ENGINEERING,ARTS AND SCIENCE,TECHNOLGY,DIPLOMA,PLUSTWO,TENTH STANDARD AND SCHOOLS :)

RESULTS

ALL RESULTS,EXAM DATES ,TIME TABLE,ETC

GEEKERS UNIVERSITY

PROJECTS,PAPER PRESENTATION SEMINARS,TUTORIALS,HOW TO,OTHERS,HACKING,MINI PROJECTS

GEEKERS UNIVERSITY---- GAMES

PUZZ,QUIZ,MEDIA,SPORTS,EBOOKS,TUTORIALS,FUN EXAMS,LEARNING,ONLINE TESTING YOUR MIND SPEED,CHATTING AND MUCH MORE


If any add appear like this please click skip add

Category

INFO

CLICK HERE
FOR LATEST RESULTS
LATEST NEW TIME TABLE/EXAM DATES FOR ALL LINK1 LINK2
ANNA UNIVERSITY COLLEGES RANK LIST 2012 CHECK SOON
LATEST FREE PLACEMENT PAPERS FOR ALL COMPANIES CHECK SOON
GET FREE MINI PROJECTS AND FINAL YEAR PROJECTS CLICK HERE
LATEST HOT HACKING TRICKS CLICK HERE

LATEST QUESTION BANKS /PAPERS/entrance FOR ALL EXAMS CLICK HERE link1 link2




our sites
www.tricksnew.blogspot.com www.questionbank.tk
www.freeminiproject.blogspot.com and
www.onlineinfocity.
blogspot.com


NOTE:

FEEL FREE TO CONTACT US click on me
DONT FORGET TO SUBSCRIBE YOUR MAIL ID ----->>>TO GET DAILY question banks IN YOUR INBOX::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: SEE RIGHT SIDE CORNER

Friday, December 2, 2011

Anna University Question Bank Engineering Mathematics -1

Anna University Question Bank Engineering Mathematics -1

hi frds,here we are uploaded by Anna University Question Bank Engineering Mathematics -1 for I year students. This is taken by Maths professors for  Engineering mathematics. We hope that this will very useful for all students in first year Engineering studies.
Anna University Question Bank Engineering Mathematics -1 is also available in pdf file format you can download and read using adobe reader. We  are always uploaded by all Question Banks,Question Papers,Results,Syllabus,Videos,Placement details,Books,AIEEE 2012 and lots more…………in our website Network for education www.tricksnew.blogspot.com.
Anna University Question Bank Engineering Mathematics -1: click here to download

Monday, November 28, 2011


Here is some of updated collection of premium accounts of hotfile,wupload and filesonic


 Visit  www.nextgenhack.com for exclusive Contents
Hotfile Premium Account
Username: rudeman67
Password: awszzz



FileSonic Premium Account

Username: bradenbulay@yahoo.com
Password: parsifal..1




Username: paul.smith@shell.com
Password: hunter96

Username: M@rc-Mitchell.co.uk
Password: vbr467

Wupload Premium Account

Premium Account(s):
Username: bigrob1027@yahoo.com
Password: starling


Source:www.nextgenhack.com

Wednesday, November 23, 2011

AIEEE 2012 Important Dates - Check Here Engineerin...

AIEEE 2012 Important Dates - Check Here Engineerin...: AIEEE 2012 Important Dates - Check Here Engineering Entrance Exam Posted: 18 Nov 2011 12:29 AM PST AIEEE 2012 Complete Notificat...CLICK HERE TO GO

USEFUL LINKS
1.www.tricksnew.blogspot.com
2.www.freeminiproject.blogspot.com
3.www.freeplacementpaper.blogspot.com
4.www.annaunivquestionbanks.blogspot.com

Thursday, November 17, 2011

FREE JAVA PROJECT WITH DOCUMENTATION

Saturday, November 12, 2011

FREE MINI PROJECT FOR UG / PG: Download now Matlab codes for biometric recognitio...

FREE MINI PROJECT FOR UG / PG: Download now Matlab codes for biometric recognitio...: Download now Matlab codes for biometric recognition credit : Download now Matlab codes for biometric recognition ...

Friday, October 21, 2011

Anna University Questions Bank for cse -oops

Anna University OOPS Questions Bank Unit-1

Hello ,
This post is about anna university oops questions bank  . Here I am updating some of the important questions got from my friends for the OOPS Subject of Anna University .Object Oriented Programming subject is a basic subject for the Computer Science , Information Technology department students also other departments like ECE , EEE  also having this subject as a part of their curriculum.
The questions i am updating here are based on the following syllabus . And I am updating all the Question Banks as a Series of 5 posts and each post covers one unit of the syllabus .
Let we take a look at the syllabus of the Anna University Coimbatore
(As all you know that this year (2011) Anna University Coimbatore is working as a subsidiary of Anna University .)
 
This is the syllabus referred from the Anna University Coimbatore Official Website .
Download Anna University Coimbatore CSE Syllabus 3rd and 4th sem
Let move on to the question bank  of Unit – 1.
Anna University OOPS Questions Bank
UNIT I               9
Object oriented programming concepts – objects – classes – methods and messages – abstraction and encapsulation – inheritance – abstract classes – polymorphism.
Introduction to C++ – classes – access specifiers – function and data members – default arguments – function overloading – friend functions – const and volatile functions – static members – Objects – pointers and objects – constant objects – nested classes – local classes
2 Marks
1) Give the evolution diagram of OOPS concept.
Machine language
Procedure language
Assembly language
OOPS
2) What is Procedure oriented language?
Conventional programming, using high-level language such as COBOL, FORTRAN and C are commonly known as Procedure oriented language (POP). In POP number of functions are written to accomplish the tasks such as reading, calculating and printing.
3) Give some characteristics of procedure-oriented language.
• Emphasis is on doing things (algorithms).
• Larger programs are divided into smaller programs known as functions.
• Most of the functions share global data.
• Data move openly around the system from function to function.
• Employs top-down approach in program design.
Function-1 Function-2 Function-3
Function-4 Function-5
Function-6 Function-7 Function-8
Main program
4) Write any four features of OOPS.
• Emphasis is on data rather than on procedure.
• Programs are divided into objects.
• Data is hidden and cannot be accessed by external functions.
• Follows bottom -up approach in program design.
5) What are the basic concepts of OOS?
• Objects.
• Classes.
• Data abstraction and Encapsulation.
• Inheritance.
• Polymorphism.
• Dynamic binding.
• Message passing.
6) What are objects?
Objects are basic run-time entities in an object-oriented system. They may represent a person, a place, a bank account, a table of data or any item that the program has to handle. Each object has the data and code to manipulate the data and theses objects interact with each other.
7)What is a class?
• The entire set of data and code of an object can be made a user-defined data type with the help of a class.
• Once a class has been defined, we can create any number of objects belonging to the classes.
• Classes are user-defined data types and behave like built-in types of the programming language.
8) what is encapsulation?
Wrapping up of data and function within the structure is called as encapsulation.
9)What is data abstraction?
The insulation of data from direct access by the program is called as data hiding or information binding.
The data is not accessible to the outside world and only those functions, which are wrapped in the class, can access it.
10)What are data members and member functions?
Classes use the concept of abstraction and are defined as a list of abstract attributes such as size, weight, and cost and uses functions to operate on these attributes.
The attributes are sometimes called as data members because they hold information. The functions that operate on these data are called as methods or member functions.
Eg: int a,b; // a,b are data members
Void getdata ( ) ; // member function
11)What is dynamic binding or late binding?
Binding refers to the linking of a procedure to the code to be executed in response to the call. Dynamic binding means that the code associated with a given procedure call is not known until the time of the call at the run-time.
12)Write the process of programming in an object-oriented language?
• Create classes that define objects and their behavior.
• Creating objects from class definition.
• Establishing communication among objects.
13)Give any four advantages of OOPS.
• The principle of data hiding helps the programmer to build secure programs that cannot be invaded by code in other parts of the program.
• It is possible to have multiple instances of an object to co-exist without any interference.
• Object oriented programming can be easily upgraded from small to large systems.
• Software complexity can be easily managed.
14)What are the features required for object-based programming Language?
• Data encapsulation.
• Data hiding and access mechanisms.
• Automatic initialization and clear up of objects.
• Operator overloading.
15)What are the features required for object oriented language?
• Data encapsulation.
• Data hiding and access mechanisms.
• Automatic initialization and clear up of objects.
• Operator overloading.
• Inheritance.
• Dynamic binding.
16)Give any four applications of OOPS
•  Real-time systems.
•  Simulation and modeling.
•  Object-oriented databases.
•  AI and expert systems.
17) Give any four applications of c++?
• Since c++ allows us to create hierarchy-related objects, we can build special object-oriented libraries, which can be used later by many programmers.
• C++ are easily maintainable and expandable.
• C part of C++ gives the language the ability to get close to the machine-level details.
• It is expected that C++ will replace C as a general-purpose language in the near future.
18) What are tokens?
The smallest individual units in a program are known as tokens. C++ has the following tokens,
• Keyword
• Identifiers
• Constants
• Strings
• Operator
19)What are keywords?
The keywords implement specific C++ language features. They are explicitly reserved identifiers and cannot be used as names fro the program variables or other user defined program elements.
Eg: go to, If, struct , else ,union etc.
20) Rules for naming the identifiers in C++.
• Only alphabetic characters, digits and underscore are permitted.
• The name cannot start with a digit.
• The upper case and lower case letters are distinct.
• A declared keyword cannot be used as a variable name.
21)What are the operators available in C++?
All operators in C are also used in C++. In addition to insertion operator << and extraction operator >> the other new operators in C++ are,
: Scope resolution operator
: : * Pointer-to-member declarator
->* Pointer-to-member operator
.* Pointer-to-member operator
delete Memory release operator
endl Line feed operator
new Memory allocation operator
setw Field width operator
22)What is a scope resolution operator?
Scope resolution operator is used to uncover the hidden variables. It also allows access to global version of variables.
Eg:
#include<iostream. h>
int m=10; // global variable m
void main ( )
{
int m=20; // local variable m
cout<<”m=”<<m<<”\n”;
cout<<”: : m=”<<: : m<<”\n”;
}
output:
20
10 (: : m access global m)
Scope resolution operator is used to define the function outside the class.
Syntax:
Return type <class name> : : <function name>
Eg:
Void x : : getdata()
23) What are free store operators (or) Memory management operators?
New and Delete operators are called as free store operators since they allocate the memory dynamically.
New operator can be used to create objects of any data type.
Pointer-variable = new data type;
Initialization of the memory using new operator can be done. This can be done as,
Pointer-variable = new data-type(value)
Delete operator is used to release the memory space for reuse. The general form of its use is
Delete pointer-variable;
24) What are manipulators?
Setw, endl are known as manipulators.
Manipulators are operators that are used to format the display. The endl manipulator when used in an output statement causes a linefeed to be inserted and its effect is similar to that of the newline character”\n”.
Eg:Cout<<setw(5)<<sum<<endl;
25) What do you mean by enumerated datatype?
An enumerated datatype is another user-defined datatype, which provides a way for attaching names to numbers, thereby increasing comprehensibility of the code.The syntax of an enum statement is similar to that of the struct statesmen.
Eg:
enum shape{ circle, square, triangle}
enum color{ red, blue, green, yellow}
26) What are symbolic constants?
There are two ways for creating symbolic constants in C++:
• Using the qualifier constant.
• Defining a set of integer constants using enum keyword.
The program in any way cannot modify the value declared as constant in c++.
Eg:
Const int size =10;
Char name [size];
27)What do you mean by dynamic initialization of variables?
C++ permits initialization of the variables at run-time. This is referred to as dynamic initialization of variables.
In C++ ,a variable can be initialized at run-time using expressions at the place of declaration as,
……..
………
int n =strlen(string);
……..
float area=3.14*rad*rad;
Thus declaration and initialization is done simultaneously at the place where the variable is used for the first time.
28) What are reference variable?
A reference variable provides an alias(alternative name) for a previously defined variable.
sum total For example , if make the variable a reference to the variable , then sum and total can be used interchancheably to represent that variable.
Syntax :
Data-type &reference-name = variable-name
Eg:
float total = 100;
float sum = total;
29)What is member-dereferencing operator?
C++ permits to access the class members through pointers. It provides three pointer-to-member operators for this purpose,
: :* To declare a pointer to a member of a class.
* To access a member using object name and a pointer to the member
->* To access a member using a pointer to the object and a pointer to that member.
30)what is function prototype ?
The function prototype describes function interface to the compiler by giving details such as number ,type of arguments and type of return values
Function prototype is a declaration statement in the calling program and is of the
following
Type function_name(argument list); Eg float volume(int x,float y);
31)what is an inline function ?
An inline function is a function that is expanded in line when it is invoked. That is compiler replaces the function call with the corresponding function code.
The inline functions are defined as Inline function-header
{
function body
}
32) Write some situations where inline expansion may not work
• for functions returning values, if loop, a switch, or a goto exists
• for functions not returning values ,if a return statement exists
• if function contain static variables
• if inline functions are recursive
33)what is a default argument ?
Default arguments assign a default value to the parameter, which does not have matching argument in the function call. Default values are specified when the f unction is declared.
Eg : float amount(float principle,int period,float rate=0. 15)
Function call is
Value=amount(5000,7);
Here it takes principle=5000& period=7
And default value for rate=0.15
Value=amount(5000,7,0.34)
Passes an explicit value 0f 0.34 to rate
We must add default value from right to left
34) What are constant arguments ?
keyword is const. The qualifier const tells the compiler that the function should not modify the argument. The compiler will generate an error when this condition is violated. This type of declaration is significant only when we pass arguments by reference or pointers
eg: int strlen( const char *p);
35) How the class is specified ?
Generally class specification has two parts
• class declaration
It describes the type and scope of its member
• class function definition
It describes how the class functions are implemented
The general form is
Class class_name
{
private:
variable declarations;
function declaration;
public:
variable declaration;
function declaration;
};
36) How to create an object ?
Once the class has been declared, we can create variables of that type by using the classname
Eg:classname x; //memory for x is created
37) How to access a class member ?
object-name. function-name(actual arguments)
eg:x.getdata(100,75.5);
38) How the member functions are defined ?
Member functions can be defined in two ways
• outside the class definition
Member function can be defined by using scope resolution operator::
General format is
Return type class_ name::function-name(argument declaration)
{
}
• Inside the class definition
This method of defining member function is to replace the function declaration by the actual function definition inside the class. It is treated as inline function
Eg:class item
{
int a,b ;
void getdata(int x,int y)
{
a=x;
b=y;
};
39) What is static data member?
Static variable are normally used to maintain values common to the entire class.
Feature:
• It is initialized to zero when the first object is created. No other initialization is permitted
• only one copy of that member is created for the entire class and is shared by all the objects
• It is only visible within the class, but its life time is the entire class type and scope of each static member variable must be defined outside the class
• It is stored separately rather than objects
Eg: static int count//count is initialized to zero when an object is created.
int classname::count;//definition of static data member
40) What is static member function?
A member function that is declared as static has the following properties
• A static function can have access to only other static member declared in the same class
• A static member function can be called using the classname as follows
classname ::function_name;
41) How the objects are used as function argument?
This can be done in two ways
• A copy of the entire object is passed to the argument
• Only address of the objects is transferred to the f unction
42) What is called pass by reference?
In this method address of an object is passed, the called function works directly on the actual arguments.
43) Define const member
If a member function does not alter any data in the class, then we may declare it as const member function as
Void mul(int ,int)const;
44) Define pointers to member
It is possible to take the address of a member of a class and assign it to a pointer. The address of a member can be obtained by applying the operator &to a “fully qualified” class member name. A class member pointer can be declared using the operator::*with the class name.
Eg: class A
{
int m;
public:
void show( );
};
pointer to member m is defined as
int A::*ip=&A::m;
A::*->pointer to member of A class
&A::m->address of the m member of A class
45) When the deferencing operator ->* is used?
It is used to access a member when we use pointer to both the object and the member.
47) When the deferencing operator .* is used?
It is used to access a member when the object itself is used as pointers.
48) Define local classes.
Classes can be defined and used inside a function or a block. such classes are called local classes. It can use global variables and static variables declared inside the function but cannot use automatic local variables.
Eg;
void test(int a)
{
…….
}
class student
{
………
};
student s1(a);
}
46) What are Friend functions? Write the syntax
A function that has access to the private member of the class but is not itself a member of the class is called friend functions.
The general form is
friend data_type function_name( );
Friend function is preceded by the keyword ‘friend’.
47)Write some properties of friend functions.
• Friend function is not in the scope of the class to which it has been declared as friend. Hence it cannot be called using the object of that class.
• Usually it has object as arguments.
• It can be declared either in the public or private part of a class.
• It cannot access member names directly. It has to use an object name and dot membership operator with each member name. eg: ( A . x )
48) What is function overloading? Give an example.
Function overloading means we can use the same function name to create functions that perform a variety of different tasks.
Eg: An overloaded add ( ) function handles different data types as shown below.
// Declarations
i. int add( int a, int b); //add function with 2 arguments of same type
ii. int add( int a, int b, int c); //add function with 3 arguments of same type
iii. double add( int p, double q); //add function with 2 arguments of
different type
//Function calls
add (3 , 4); //uses prototype ( i. )
add (3, 4, 5); //uses prototype ( ii. )
add (3 , 10.0); //uses prototype ( iii. )
48) Define local classes.
Classes can be defined and used inside a function or a block. such classes are called
local classes. It can use global variables and static variables declared inside the function
but cannot use automatic local variables.
Eg;
void test(int a)
{
…….
}
class student
{
………
};
student s1(a);}
PART-B
  1. Describe the advantages of OOP(8)
  2. What are the differences between pointers to constants and constant
    pointers?(8)
  3. Describe the applications of OOP technology.
  4. Explain object-oriented paradigm with al1 its essential elements
  5. State the merits and demerits of object oriented methodology
6)   Explain the following concepts of object oriented programming in detail
with an example.
(i) Data abstraction
(ii) Inheritance
(iii) Polymorphism
(iv) Objects
7)Write short notes on access specifiers
8)Explain default arguments with example
9)Explain about friend function with suitable example
10)What is a static member and what are common characteristics
11)Explain about pointers and pointers to member of a class with an example.
12) write short notes on the following and explain with an example:
a) volatile function b)constant function c)local class d)nested class
13) Define function overloading and explain each of the types of function overloading with an  example?
Download The Question Bank For Unit – 1
OOPS Question Bank – Anna University – Unit – I
Ok .Upto Now i had the above questions . If you need more than this just leave  a reply in the comment box . I will update more question bank for the OOPS subject in Future .The series of Anna University OOPS Questions Bank  will continues ….

Saturday, October 8, 2011

TITLE OF PROJECTS+IEEE PAPER,IEEE PROJECTS WITH DOCUMENTATION





               
S.NO 
TITLE OF PROJECTS
DOWNLOADS

1
BUS IDENTIFICATION SYSTEM
2
IEEEE PROJECTS TITLES FOR ALL DEPART MENT
3

college_management_system
4
creb software incorporates three systems

5
employee_loan_management_syste
6
DATA MINING AND DATA WAREHOUSING
7
office_automation_management_system
8
hospital_management_system
9
railway bookings for passenger

10
STATE BANK APLLICATION WITH SOURCE CODE

IEEE 2011-2012 Project Titles


IEEE 2011-2012 Project Titles

1 ON EVENT-BASED MIDDLEWARE FOR LOCATION-AWARE MOBILE APPLICATIONS click hereSOFTWARE ENGINEERING JAVA
2 CLOSENESS: A NEW PRIVACY MEASURE FOR DATA PUBLISHING click here KNOWLEDGE AND DATA ENGINEERING J2EE
3 DATA LEAKAGE DETECTION click here KNOWLEDGE AND DATA ENGINEERING DOT NET
4 ON WIRELESS SCHEDULING ALGORITHMS FOR MINIMIZING THE QUEUE-OVERFLOW PROBABILITY click hereNETWORKING JAVA
5 SECURE DATA COLLECTION IN WIRELESS SENSOR NETWORKS USING RANDOMIZED DISPERSIVE ROUTES click hereMOBILE COMPUTING JAVA
6 PAM: AN EFFICIENT AND PRIVACY-AWARE MONITORING FRAMEWORK FOR CONTINUOUSLY MOVING OBJECTS click hereKNOWLEDGE AND DATA ENGINEERING DOT NET
7 P2P REPUTATION MANAGEMENT USING DISTRIBUTED IDENTITIES AND DECENTRALIZED RECOMMENDATION CHAINS click hereKNOWLEDGE AND DATA ENGINEERING JAVA
8 A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS click hereNETWORKING DOT NET
9 EFFICIENT AND DYNAMIC ROUTING TOPOLOGY INFERENCE FROM END-TO-END MEASUREMENTS click hereNETWORKING JAVA
10 A DYNAMIC EN-ROUTE FILTERING SCHEME FOR DATA REPORTING IN WIRELESS SENSOR NETWORKS click hereNETWORKING JAVA
11 PRIVACY-CONSCIOUS LOCATION-BASED QUERIES IN MOBILE ENVIRONMENTS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
12 MANAGING MULTIDIMENSIONAL HISTORICAL AGGREGATE DATA IN UNSTRUCTURED P2P NETWORKS click_hereKNOWLEDGE AND DATA ENGINEERING JAVA

IEEE 2011-12 Project Titles
1 A TABU SEARCH ALGORITHM FOR CLUSTER BUILDING IN WIRELESS SENSOR NETWORKS click hereMOBILE COMPUTING DOT NET
2 ROUTE STABILITY IN MANETS UNDER THE RANDOM DIRECTION MOBILITY MODEL click hereMOBILE COMPUTING DOT NET
3 GREEDY ROUTING WITH ANTI-VOID TRAVERSAL FOR WIRELESS SENSOR NETWORKS click hereMOBILE COMPUTING DOT NET
4 CELL BREATHING TECHNIQUES FOR LOAD BALANCING IN WIRELESS LANS click hereMOBILE COMPUTING DOT NET
5 RESEQUENCING ANALYSIS OF STOP-AND-WAIT ARQ FOR PARALLEL MULTICHANNEL COMMUNICATIONS click hereNETWORKING DOT NET
6 RESOURCE ALLOCATION IN OFDMA WIRELESS COMMUNICATIONS SYSTEMS SUPPORTING MULTIMEDIA SERVICES click hereNETWORKING DOT NET
7 ENHANCING PRIVACY AND AUTHORIZATION CONTROL SCALABILITY IN THE GRID THROUGH ONTOLOGIES click hereINFORMATION TECHNOLOGY IN BIOMEDICINE JAVA
8 COMBINATORIAL APPROACH FOR PREVENTING SQL INJECTION ATTACKS click hereADVANCE COMPUTING CONFERENCE J2EE
9 DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
10 ANALYSIS OF SHORTEST PATH ROUTING FOR LARGE MULTI-HOP WIRELESS NETWORKS click hereNETWORKING DOT NET
11 SECURE AND POLICY-COMPLIANT SOURCE ROUTING click hereNETWORKING DOT NET
12 FLEXIBLE DETERMINISTIC PACKET MARKING: AN IP TRACEBACK SYSTEM TO FIND THE REAL SOURCE OF ATTACKS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
13 NODE ISOLATION MODEL AND AGE-BASED NEIGHBOR SELECTION IN UNSTRUCTURED P2P NETWORKS click hereNETWORKING JAVA
14 DISTRIBUTED ALGORITHMS FOR CONSTRUCTING APPROXIMATE MINIMUM SPANNING TREES IN WIRELESS SENSOR NETWORKS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
15 MOBILITY MANAGEMENT APPROACHES FOR MOBILE IP NETWORKS: PERFORMANCE COMPARISON AND USE RECOMMENDATIONS click hereNETWORKING JAVA
16 SINGLE-LINK FAILURE DETECTION IN ALL-OPTICAL NETWORKS USING MONITORING CYCLES AND PATHS click hereNETWORKING DOT NET
17 A FAITHFUL DISTRIBUTED MECHANISM FOR SHARING THE COST OF MULTICAST TRANSMISSIONS click herePARALLEL AND DISTRIBUTED SYSTEMS J2EE
18 ATOMICITY ANALYSIS OF SERVICE COMPOSITION ACROSS ORGANIZATIONS click hereSOFTWARE ENGINEERING J2EE
19 DYNAMIC ROUTING WITH SECURITY CONSIDERATIONS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
20 CAR: CONTEXT-AWARE ADAPTIVE ROUTING FOR DELAY-TOLERANT MOBILE NETWORKS click hereMOBILE COMPUTING JAVA
21 COLLUSIVE PIRACY PREVENTION IN P2P CONTENT DELIVERY NETWORKS click hereCOMPUTERS J2EE
22 SPREAD SPECTRUM WATERMARKING SECURITY click hereINFORMATION FORENSICS AND SECURITY DOT NET
23 LOCAL CONSTRUCTION OF NEAR-OPTIMAL POWER SPANNERS FOR WIRELESS AD-HOC NETWORKS click hereMOBILE COMPUTING DOT NET
24 MULTIPLE ROUTING CONFIGURATIONS FOR FAST IP NETWORK RECOVERY click hereNETWORKING JAVA
25 COMPACTION OF SCHEDULES AND A TWO-STAGE APPROACH FOR DUPLICATION-BASED DAG SCHEDULING click herePARALLEL AND DISTRIBUTED SYSTEMS DOT NET
26 THE EFFECTIVENESS OF CHECKSUMS FOR EMBEDDED NETWORKS click hereDEPENDABLE AND SECURE COMPUTING DOT NET
27 DETECTING MALICIOUS PACKET LOSSES click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
28 VIRUS SPREAD IN NETWORKS click hereNETWORKING DOT NET
29 BIASED RANDOM WALKS IN UNIFORM WIRELESS NETWORKS click hereMOBILE COMPUTING DOT NET
30 INFORMATION CONTENT-BASED SENSOR SELECTION AND TRANSMISSION POWER ADJUSTMENT FOR COLLABORATIVE TARGET TRACKING click hereMOBILE COMPUTING DOT NET
31 PRESTO: FEEDBACKDRIVEN DATA MANAGEMENT IN SENSOR NETWORKS click hereNETWORKING DOT NET
32 EXPLICIT LOAD BALANCING TECHNIQUE FOR NGEO SATELLITE IP NETWORKS WITH ON-BOARD PROCESSING CAPABILITIES click hereNETWORKING DOT NET
33 DELAY ANALYSIS FOR MAXIMAL SCHEDULING WITH FLOW CONTROL IN WIRELESS NETWORKS WITH BURSTY TRAFFIC click hereNETWORKING DOT NET
34 OPTIMIZED RESOURCE ALLOCATION FOR SOFTWARE RELEASE PLANNING click hereSOFTWARE ENGINEERING DOT NET
35 AUTOMATIC EXTRACTION OF HEAP REFERENCE PROPERTIES IN OBJECT-ORIENTED PROGRAMS click hereSOFTWARE ENGINEERING DOT NET
36 ENERGY MAPS FOR MOBILE WIRELESS NETWORKS:COHERENCE TIME VERSUS SPREADING PERIOD click here MOBILE COMPUTING DOT NET
37 RANDOMCAST: AN ENERGY EFFICIENT COMMUNICATION SCHEME FOR MOBILE AD HOC NETWORKS click hereMOBILE COMPUTING DOT NET
38 EFFICIENT RESOURCE ALLOCATION FOR WIRELESS MULTICAST click hereMOBILE COMPUTING JAVA
39 MINING FILE DOWNLOADING TIME IN STOCHASTIC PEER TO PEER NETWORKS click hereNETWORKING DOT NET
40 ENHANCING SEARCH PERFORMANCE IN UNSTRUCTURED P2P NETWORKS BASED ON USERS' COMMON INTEREST click hereNETWORKING JAVA
41 QUIVER: CONSISTENT OBJECT SHARING FOR EDGE SERVICES click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
42 BRA: A BIDIRECTIONAL ROUTING ABSTRACTION FOR ASYMMETRIC MOBILE AD HOC NETWORKS click hereNETWORKING JAVA
43 AN EFFICIENT CLUSTERING SCHEME TO EXPLOIT HIERARCHICAL DATA IN NETWORK TRAFFIC ANALYSIS click hereKNOWLEDGE AND DATA ENGINEERING JAVA
44 RATE & DELAY GUARANTEES PROVIDED BY CLOSE PACKET SWITCHES WITH LOAD BALANCING click hereNETWORKING JAVA
45 GEOMETRIC APPROACH TO IMPROVING ACTIVE PACKET LOSS MEASUREMENT click hereNETWORKING JAVA
46 A PRECISE TERMINATION CONDITION OF THE PROBALASTIC PACKET MARKING ALGORITHM click hereDEPENDABLE AND SECURE COMPUTING JAVA
47 INTRUSION DETECTION IN HOMOGENEOUS & HETEROGENEOUS WIRELESS SENSOR NETWORKS click hereMOBILE COMPUTING JAVA
48 A DISTRIBUTED AND SCALABLE ROUTING TABLE MANAGER FOR THE NEXT GENERATION OF IP ROUTERS click here
DOT NET
49 PERFORMANCE OF A SPECULATIVE TRANSMISSION SCHEME FOR SCHEDULING LATENCY REDUCTION click hereNETWORKING JAVA
50 EFFICIENT 2-D GRAY SCALE MORPHOLOGICAL TRANSFORMATIONS WITH ARBITRALY FLAT STRUCTURING ELEMENTS click hereIMAGE PROCESSING DOT NET
51 RATE ALLOCATION & NETWORK LIFETIME PROBLEM FOR WIRELESS SENSOR NETWORKS click hereNETWORKING DOT NET
52 VISION BASED PROCESSING FOR REAL TIME 3-D DATA ACQUISITION BASED CODE STRUCTURED LIGHT click hereIMAGE PROCESSING DOT NET
53 USING THE CONCEPTUAL COHESION OF CLASSES FOR FAULT PREDICTION IN OBJECT ORIENTED SYSTEMS click hereSOFTWARE ENGINEERING JAVA
54 LOCATION BASED SPATIAL QUERY PROCESSING IN WIRELESS BROADCAST ENVIRONMENTS click hereMOBILE COMPUTING JAVA
55 BANDWIDTH ESTIMATION FOR IEEE 802.11 BASED ADHOC NETWORK click hereMOBILE COMPUTING JAVA
56 MODELING & AUTOMATED CONTAINMENT OF WORMS click hereDEPENDABLE AND SECURE COMPUTING JAVA
57 TRUST WORTHY COMUTING UNDER RESOURCE CONSTRAINTS WITH THE DOWN POLICY click hereDEPENDABLE AND SECURE COMPUTING DOT NET
58 BENEFIT-BASED DATA CACHING IN AD HOC NETWORKS click hereMOBILE COMPUTING JAVA
59 STATISTICAL TECHNIQUES FOR DETECTING TRAFFIC ANOMALIES THROUGH PACKET HEADER DATA click hereNETWORKING DOT NET
60 HBA DISTRIBUTED METADATA MANAGEMENT FOR LARGE SCALE CLUSTER BASED STORAGE SYSTEM click herePARALLEL AND DISTRIBUTED SYSTEMS DOT NET
61 TEMPORAL PORTIONING OF COMMUNICATION RESOURCES IN AN INTEGRATED ARCHITECTURE click hereDEPENDABLE AND SECURE COMPUTING DOT NET
62 THE EFFECT OF PAIRS IN PROGRAM DESIGN TASKS click hereSOFTWARE ENGINEERING DOT NET
63 CONSTRUCTING INTER-DOMAIN PACKET FILTERS TO CONTROL IP SPOOFING BASED ON BGP UPDATES click hereDEPENDABLE AND SECURE COMPUTING JAVA
64 ORTHOGONAL DATA EMBEDDING FOR BINARY IMAGES IN MORPHOLOGICAL TRANSFORM DOMAIN- A HIGH-CAPACITY APPROACH click hereMULTIMEDIA DOT NET
65 PROTECTION OF DATABASE SECURITY VIA COLLABORATIVE INFERENCE DETECTION click hereKNOWLEDGE AND DATA ENGINEERING J2EE
66 ESTIMATION OF DEFECTS BASED ON EFECT DECAY MODEL: ED3M click hereSOFTWARE ENGINEERING DOT NET
67 ACTIVE LEARNING METHODS FOR INTERACTIVE IMAGE RETRIEVAL click hereIMAGE PROCESSING DOT NET
68 LOCALIZED SENSOR AREA COVERAGE WITH LOW COMMUNICATION OVERHEAD click hereMOBILE COMPUTING DOT NET
69 HARDWARE ENHANCED ASSOCIATION RULE MINING WITH HASHING AND PIPELINING click hereKNOWLEDGE AND DATA ENGINEERING DOT NET
70 EFFICIENT RESOURCE ALLOCATION FOR WIRELESS MULTICAST click hereMOBILE COMPUTING DOT NET
71 EFFICIENT ROUTING IN INTERMITTENTLY CONNECTED MOBILE NETWORKS: THE MULTIPLE COPY CASE click hereNETWORKING DOT NET
72 A NOVEL FRAMEWORK FOR SEMANTIC ANNOTATION AND PERSONALIZED RETRIEVAL OF SPORTS VIDEO click hereMULTIMEDIA DOT NET
73 TWO TECHNIQUES FOR FAST COMPUTATION OF CONSTRAINED SHORTEST PATHS click hereNETWORKING JAVA
74 WATERMARKING RELATIONAL DATABASES USING OPTIMIZATION-BASED TECHNIQUES click hereKNOWLEDGE AND DATA ENGINEERING DOT NET
75 PROBABILISTIC PACKET MARKING FOR LARGE-SCALE IP TRACE BACK click hereNETWORKING DOT NET
76 DUAL-LINK FAILURE RESILIENCY THROUGH BACKUP LINK MUTUAL EXCLUSION click hereNETWORKING JAVA
77 TRUTH DISCOVERY WITH MULTIPLE CONFLICTING INFORMATION PROVIDERS ON THE WEB click hereKNOWLEDGE AND DATA ENGINEERING J2EE
78 DYNAMIC LOAD BALANCING IN DISTRIBUTED SYSTEMS IN THE PRESENCE OF DELAYS: A REGENERATION-THEORY APPROACH click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
79 A SEMI FRAGILE CONTENT BASED IMAGE WATERMARKING FOR AUTHENTICATION IN SPATIAL DOMAIN USING DISCRETE COSINE TRANSFORM click hereJOURNAL JAVA
80 OCGRR: A NEW SCHEDULING ALGORITHM FOR DIFFERENTIATED SERVICES NETWORKS click herePARALLEL AND DISTRIBUTED SYSTEMS JAVA
81 AN ADAPTIVE PROGRAMMING MODEL FOR FAULT-TOLERANT DISTRIBUTED COMPUTING click hereDEPENDABLE AND SECURE COMPUTING JAVA
82 AN ACKNOWLEDGMENT-BASED APPROACH FOR THE DETECTION OF ROUTING MISBEHAVIOR IN MANETS click hereMOBILE COMPUTING JAVA
83 HYBRID INTRUSION DETECTION WITH WEIGHTED SIGNATURE GENERATION OVER ANOMALOUS INTERNET EPISODES(HIDS) click hereDEPENDABLE AND SECURE COMPUTING J2EE
84 PFUSION: A P2P ARCHITECTURE FOR INTERNET-SCALE CONTENT-BASED SEARCH AND RETRIEVAL click herePARALLEL AND DISTRIBUTED SYSTEMS DOT NET
85 ROUTE RESERVATION IN AD HOC WIRELESS NETWORKS click hereMOBILE COMPUTING JAVA
86 DISTRIBUTED CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL click hereMOBILE COMPUTING JAVA
87 DIGITAL IMAGE PROCESSING TECHNIQUES FOR THE DETECTION AND REMOVAL OF CRACKS IN DIGITIZED PAINTINGS click hereIMAGE PROCESSING DOT NET
88 NOISE REDUCTION BY FUZZY IMAGE FILTERING click hereFUZZY SYSTEMS JAVA
89 A NOVEL SECURE COMMUNICATION PROTOCOL FOR AD HOC NETWORKS [SCP] click here
JAVA
90 FACE RECOGNITION USING LAPLACIAN FACES click herePATTERN ANALYSIS AND MACHINE INTELLIGENCE JAVA
91 PREDICTIVE JOB SCHEDULING IN A CONNECTION LIMITED SYSTEM USING PARALLEL GENETIC ALGORITHM click hereINTERNATIONAL CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS JAVA
92 PERSONALIZED WEB SEARCH WITH SELF-ORGANIZING MAP click hereINTERNATIONAL CONFERENCE ON E-TECHNOLOGY, E-COMMERCE AND E-SERVICE J2EE
93 A DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROAMING IN NEXT-GENERATION MOBILE NETWORKS click hereNETWORKING JAVA
94 STRUCTURE AND TEXTURE FILLING-IN OF MISSING IMAGE BLOCKS IN WIRELESS TRANSMISSION AND COMPRESSION APPLICATIONS click hereIMAGE PROCESSING JAVA
95 NETWORK BORDER PATROL: PREVENTING CONGESTION COLLAPSE AND PROMOTING FAIRNESS IN THE INTERNET click hereNETWORKING JAVA
96 APPLICATION OF BPCS STEGANOGRAPHY TO WAVELET COMPRESSED VIDEO click hereIMAGE PROCESSING JAVA
97 IMAGE PROCESSING FOR EDGE DETECTION click here
DOT NET
98 DOUBLE-COVERED BROADCAST (DCB): A SIMPLE RELIABLE BROADCAST ALGORITHM IN MANETS click_hereCONFERENCE-IEEE INFOCOM JAVA


USEFUL LINKS

STUDENT MARK ANALYSIS system coding




STUDENT MARK ANALYSIS system coding 

 

click here to download








USEFUL LINKS 1.www.tricksnew.blogspot.com 2.www.freeminiproject.blogspot.com 3.www.freeplacementpaper.blogspot.com 4.www.annaunivquestionbanks.blogspot.com

Thursday, October 6, 2011

Online Student Registration System MINI PROJECT FREE DOWNLOADS


  Online Student Registration System

Type
: Web, Technology : ASP, Java Script, MS Access; Credit : AJProfessionals TRICKSNEW
The Online Student Registration System is an web based portal developed in ASP. Online Registration system will allow online submission of student application, Student Registration, Perform Computer based quiz/test. Stored test results, modify student profile. Online Student Registration System Project consists of two functional elements: an enhanced Student module for Registration, Edit Profile, View Test history, Change Password. Online Test/Quiz Module for Start test, give examination, calculate results, store test results, manage question banks.

You can free download all the project documentation, project source code, active server page (*.asp) files, Java Script (.js) files, cascading style sheet (.cs) CSS files, Image and Layout files, database, Installation Guide from download link. Code are well commented for your reference, however if you want any clarification you can contact me for further explanation, click here to view online demo of this application.

Click here to get more than 500 unique academic project idea in different programming languages. Download this project concept, abstract, SRS, source code to complete project for your college submission.

Who can use this project ?
  • Submission of semester and final year college student for academic purpose.
  • Student who are submitting their mini, major project for BE, BCA, BSC-IT, BIT, MBA, MCA, MS, this project is well commented, ready made project documentation available for submission.
  • Who want to learn asp and database programming in visual basic script.
  • Student of Mumbai, Delhi, Calcutta, Chennai, Pune, Bangalore University of India and other international university.
  • IGNOU, SMU, DOEACC student.
  • How to develop web projects by using ASP, Java Script.
  • How to host web application in IIS - Internet Information Server.
     
AbstractCurrently student submits hardcopy of filled application form to the college/university, office staff enters all data into excel file and write same in manual register. Issue hall ticket / admit card to student and conduct test for student. Student comes to college and give test for the specified date. Office staff check all the paper calculate results and type all the details for taking printout and display it in college premises. College inform student to check the result, student comes to college and view the results.

Proposed online student registration system will eliminate all the manual intervention and increase the speed of whole process. System will allow student to fill the form online, system has inbuilt validation system to validate the entered data. After successful submission, system will give unique registration no for each student. Student can login into system by using registration no and give online test. System will show the result after instantly and stored the results for further use.

Project Requirement
  • On line submission of application forms.
  • On-line Quizzes for the first semester courses. There should be minimum 50 questions (objective types with four options)
  • When user leaves the test its result should be displayed at that moment.
  • There should be a proper login system for the user where security is required.
  • The web technologies to be used ; DHTML, CSS, JavaScript and ASP
  • The proper validation should be done.
Solution
After analysis the requirement we decide that we need to create following web pages
  • Home Page
  • Login Page
  • My Page
  • Registration
  • Change Password
  • Edit Profile
  • Start Test
  • Examination
  • Results
  • FAQ
  • Contact Us
Deployment Environment
  • Database Server
    OS – Win 2003 Enterprise Server
    MS Access
    HDD – Min 10 GB, Recommended 25 GB
    RAM – Min 1 GB, Recommended 2 GB
    Processor - Pentium Dual Xenon Processor
     
  • Application Server
    OS – Win 2003 Enterprise Server
    IIS – Internet Information Server
    HDD – Min 5 GB, Recommended 10 GB
    RAM – Min 1 GB, Recommended 2 GB
    Processor - Pentium Dual Xenon Processor
     
  • Workstation: The online registration system web application will operate with the following Web Browsers: Microsoft Internet Explorer version 5.0, 6.0. 7.0.
     
Development Tools and Technologies
  • ASP(Active Server Pages)
    -Inbuilt with IISS 4.0 onward
    -No need of compilation and any special software package.
     
  • MS Access
    -Easy to use and easy to deployment
    -ADO compatibility especially with ASP scripting.
Download the project documentation, source code, database and report files.



Download Type
Download File
Size in KB
No of times download

1. Project Synopsis
9
31665

2. Project Report
22
24423

3. Installation Guide
318
21981

4. Project Source Code
161
27919

For any query and help regarding this project visit.



USEFUL LINKS 
1.www.tricksnew.blogspot.com
2.www.freeminiproject.blogspot.com 
3.www.freeplacementpaper.blogspot.com
4.www.annaunivquestionbanks.blogspot.com

chitika