JAVA Interview questions with answers

 Interview Questions in Core Java

1.what is a transient variable?

                A transient variable is a variable that may not be serialized.

2.which containers use a border Layout as their default layout?

               The window, Frame and Dialog classes use a border layout as their default layout.

3.Why do threads block on I/O?

              Threads block on i/o (that is enters the waiting state) so that other threads may execute while the i/o Operation is performed.

4. How are Observer and Observable used?

              Objects that subclass the Observable class maintain a list of observers. When an Observable object is updated it invokes the update() method of each of its observers to notify the observers that it has changed state. The Observer interface is implemented by objects that observe Observable objects.

5. What is synchronization and why is it important?

             With respect to multithreading, synchronization is the capability to control the access of multiple threads to shared resources. Without synchronization, it is possible for one thread to modify a shared object while another thread is in the process of using or updating that object's value. This often leads to significant errors.

6. Can a lock be acquired on a class?

            Yes, a lock can be acquired on a class. This lock is acquired on the class's Class object.

7. What's new with the stop(), suspend() and resume() methods in JDK 1.2?

            The stop(), suspend() and resume() methods have been deprecated in JDK 1.2.

8. Is null a keyword?

             The null value is not a keyword.

9. What is the preferred size of a component?

             The preferred size of a component is the minimum component size that will allow the component to display normally.

10. What method is used to specify a container's layout?

             The setLayout() method is used to specify a container's layout.

11. Which containers use a FlowLayout as their default layout?

             The Panel and Applet classes use the FlowLayout as their default layout.

12. What state does a thread enter when it terminates its processing?

              When a thread terminates its processing, it enters the dead state.

13. What is the Collections API?

              The Collections API is a set of classes and interfaces that support operations on collections of objects.

14. Which characters may be used as the second character of an identifier, but not as the first

character of an identifier?

               The digits 0 through 9 may not be used as the first character of an identifier but they may be used after the first character of an identifier.

15. What is the List interface?

            The List interface provides support for ordered collections of objects.

16. How does Java handle integer overflows and underflows?

            It uses those low order bytes of the result that can fit into the size of the type allowed by the operation.

17. What is the Vector class?

          The Vector class provides the capability to implement a growable array of objects.

18. What modifiers may be used with an inner class that is a member of an outer class?

           A (non-local) inner class may be declared as public, protected, private, static, final, or abstract.

19. What is an Iterator interface?

          The Iterator interface is used to step through the elements of a Collection.

20. What is the difference between the >> and >>> operators?

           The >> operator carries the sign bit when shifting right. The >>> zero-fills bits that have been shifted out.

21. Which method of the Component class is used to set the position and size of a component?

           setBounds()

22. How many bits are used to represent Unicode, ASCII, UTF-16, and UTF-8 characters?

           Unicode requires 16 bits and ASCII require 7 bits. Although the ASCII character set uses only 7 bits, it is usually represented as 8 bits. UTF-8 represents characters using 8, 16, and 18 bit patterns. UTF-16 uses 16- bit and larger bit patterns.

23. What is the difference between yielding and sleeping?

               When a task invokes its yield() method, it returns to the ready state. When a task invokes its sleep() method, it returns to the waiting state.

24. Which java.util classes and interfaces support event handling?

              The EventObject class and the EventListener interface support event processing.

25. Is sizeof a keyword?

             The sizeof operator is not a keyword.

26. What are wrapped classes?

             Wrapped classes are classes that allow primitive types to be accessed as objects.

27. Does garbage collection guarantee that a program will not run out of memory?

           Garbage collection does not guarantee that a program will not run out of memory. It is possible for programs to use up memory resources faster than they are garbage collected. It is also possible for programs to create objects that are not subject to garbage collection.

28. What restrictions are placed on the location of a package statement within a source code file?

          A package statement must appear as the first line in a source code file (excluding blank lines and comments).

29. Can an object's finalize() method be invoked while it is reachable?

           An object's finalize() method cannot be invoked by the garbage collector while the object is still reachable. However, an object's finalize() method may be invoked by other objects.

30. What is the immediate superclass of the Applet class?

            Panel

31. What is the difference between preemptive scheduling and time slicing?

          Under preemptive scheduling, the highest priority task executes until it enters the waiting or dead states or a higher priority task comes into existence. Under time slicing, a task executes for a predefined slice of time and then reenters the pool of ready tasks. The scheduler then determines which task should execute next, based on priority and other factors.

32. Name three Component subclasses that support painting.

         The Canvas, Frame, Panel, and Applet classes support painting.

33. What value does readLine() return when it has reached the end of a file?

         The readLine() method returns null when it has reached the end of a file.

34. What is the immediate superclass of the Dialog class?

         Window

35. What is clipping?

         Clipping is the process of confining paint operations to a limited area or shape.

36. What is a native method?

          A native method is a method that is implemented in a language other than Java.

37. Can a for statement loop indefinitely?

         Yes, a for statement can loop indefinitely. For example, consider the following:

for(;;) ;

38. What are order of precedence and associativity, and how are they used?

         Order of precedence determines the order in which operators are evaluated in expressions. Associatity determines whether an expression is evaluated left-to-right or right-to-left.

39. When a thread blocks on I/O, what state does it enter?

         A thread enters the waiting state when it blocks on I/O.

40. To what value is a variable of the String type automatically initialized?

         The default value of an String type is null.

41. What is the catch or declare rule for method declarations?

         If a checked exception may be thrown within the body of a method, the method must either catch the exception or declare it in its throws clause.

42. What is the difference between a MenuItem and a CheckboxMenuItem?

         The CheckboxMenuItem class extends the MenuItem class to support a menu item that may be checked or unchecked.

43. What is a task's priority and how is it used in scheduling?

        A task's priority is an integer value that identifies the relative order in which it should be executed with respect to other tasks. The scheduler attempts to schedule higher priority tasks before lower priority tasks.

44. What class is the top of the AWT event hierarchy?

         The java.awt.AWTEvent class is the highest-level class in the AWT event-class hierarchy.

45. When a thread is created and started, what is its initial state?

           A thread is in the ready state after it has been created and started.

46. Can an anonymous class be declared as implementing an interface and extending a class?

            An anonymous class may implement an interface or extend a superclass, but may not be declared to do both.

47. What is the range of the short type?

             The range of the short type is -(2^15) to 2^15 - 1.

48. What is the range of the char type?

              The range of the char type is 0 to 2^16 - 1.

49. In which package are most of the AWT events that support the event-delegation model defined?

             Most of the AWT-related events of the event-delegation model are defined in the java.awt.event package.The AWTEvent class is defined in the java.awt package.

50. What is the immediate superclass of Menu?

          MenuItem

51. What is the purpose of finalization?

        The purpose of finalization is to give an unreachable object the opportunity to perform any cleanup processing before the object is garbage collected.

Introduction to JSP

JSP (JAVA Server Pages):

              JSP technology is used to create web application. It focuses more on presentation logic of the web  application.JSP pages are easier to maintain then a Servlet. JSP pages are opposite of Servlets.  Servlet adds HTML code inside Java code while JSP adds Java code inside HTML. Everything a  Servlet can do, a JSP page can also do it.

     JSP enables us to write HTML pages containing tags that run powerful Java programs. JSP separates presentation and business logic as Web designer can design and update JSP pages without learning  the Java language and Java Developer can also write code without concerning the web design.

How JSP becomes servlet :

        JSP pages are converted into Servlet by the Web Container. The Container translates a JSP page  into servletclass source(.java) file and then compiles into a Java Servlet class.

Benefits of JSP:

· Easy to maintain

· High Performance and Scalability.

· JSP is built on Java technology, so it is platform independent.

Lifecycle of JSP:

  A JSP page is converted into Servlet in order to service requests. The translation of a JSP page to a  Servlet is called Lifecycle of JSP. The methods used in lifecycle of JSP are same as that of servlet.  
The only difference is that the jsp methods are prefixed with the keyword jsp.JSP Lifecycle consists of  following steps.

· Translation of JSP to Servlet code.

· Compilation of Servlet to bytecode.

· Loading Servlet class.

· Creating servlet instance.

· Initialization by calling jspInit() method

· Request Processing by calling jspService() method

· Destroying by calling jspDestroy() method

Web Container translates JSP code into a servlet class source(.java) file, then compiles that into a  java servlet class. In the third step, the servlet class bytecode is loaded using classloader. The  Container then creates an instance of that servlet class.

The initialized servlet can now service request. For each request the Web Container call the   jspService()method. When the Container removes the servlet instance from service, it calls the  jspDestroy() method to perform any required clean up.

Translating JSP into Servlet:

consider the following Jsp Program:

The above jsp program gets converted into servlet as given below:

public class hello_jsp extends HttpServlet {       public void jspService(HttpServletRequest req, HttpServletResponse res) throws IOException, ServletException       {            PrintWriter out=res.getWriter();            response.setContentType(“text/html”);            out.write(“<html><body>”);            String str=”welcome”;            out.write(str);            out.write(“</body></html>”);        } }

GATE Question Papers

1. Computer Science and Information Technology Question Paper:

                Click this to view the question paper

2. Biotechnology Question Paper:

            

                Click this to view the question paper

3. Electronics and Communication Engineering Question Paper:

                Click this to view the question paper

4. Electrical Engineering Question Paper:

                

                 Click this to view the question paper

5. Mechanical Engineering Question Paper:

    

                  Click this to view the question paper

6. Civil Engineering Question Paper:

                  

                   Click this to view the question paper

7. Chemical Engineering Question Paper:

  

                    Click this to view the question paper

8. Instrumentation Engineering Question Paper:

                     Click this to view the question paper

9. Aerospace Engineering Question Paper:

                      

                      Click this to view the question paper

10. Agriculture Engineering Question Paper:

                       Click this to view the question paper

International Conference

1. Name of the Conference/Workshop/Training Program: International Conference on EGovernance and Cloud Computing Services (EGov’15)
2. Focus of the Conference:

EGov'15 is the 2nd international conference organized by department of computer applications, Dr. MGR Educational and Research Institute, University, in the area of various issues related to electronic governance and cloud computing. The conference is featuring an exceptional lineup of invited speakers, researchers, scientists, industrialists, students in a six tracks at the Conference providing an ideal mix of highlevel business, research, academic mastering and industrial talks in the areas of Networking, Security, Telecommunications, Computing, Data Mining, Software engineering and Information Systems Management

3. About the College :

Dr MGR Engineering College was a premier technical institution in Tamil Nadu, India. Having celebrated its Silver Jubilee in the field of education, it was elevated to University status as Dr MGR Educational and Research Institute, University (Declared u/s 3 of the UGC Act 1956) in the year 2003 which integrates Dr MGR Engineering College and Thai Mookambigai Dental College.

About the Department :

DEPARTMENT OF COMPUTER APPLICATIONS was established in 1994 in the erstwhile Dr MGR Educational and Research Institute, University. Department of Computer Applications has a cherished profile and aims to impart high quality education to graduate and post graduate students as well to carry out at the cutting edge of technology research in various disciplines of computer Applications. The department offers UG programmes BCA, B.Sc(Animation and Visual Communication), PG programmes - MCA (3 yr) and MCAlateral entry programmes (2 yr) and research oriented programmes— MPhil (1 yr) and PhD.

Call for Papers (Paper Submission Email id, Paper Themes, etc.,)Conference topics :
1. EGovernance and Cloud Computing technology 

2. Open Source platform 

3. Mobile Governance 

4. EGovernance Standards 

5. Evolution 

6. EGovernance for Disabilities 

7. ICT and Society 

8. Networking & Security 

9. Data Mining & Migration 

10. Information Systems & Management 

11. Software Engineering 

12. Web Technology 

13. Telecommunications 

14. Mobile Computing

Registration Fees:

Delegates from Industry:Rs. 6000 

Faculty Delegates:Rs. 5000 

Research Scholars:Rs. 4500 

UG/PG/MPhil Students:Rs. 4000

Important Dates:

Last date for receiving paper : 25 June 2015 

Notification of Acceptance : 30 June 2015 

Last date for sending camera ready 

Paper along with registration form and DD : 05 July 2015 

Closing of Registration : 10 July 2015 

Inaugural Session : 23 July 2015

in advance or on the first day of the conference.

Address for communication:

The Convener, International Conference EGov’15, 

Department of Computer Applications, 

Dr.MGR Educational and Research Institute University 

Bangalore - Chennai National Highways, 

Maduravoyal, Chennai 600 095. 

Tamil Nadu, India 

conferencemca@gmail.com 

Contact No(s):8508035278/9865464523/9840967756

Some important header files in C

1. <stdio.h>:
 input and output function in program.
2. <conio.h>:
 to clear screen and pause information function.
3. <ctype.h>: 
function for testing characters
4. <string.h>: 
function for manipulating string
5. <math.h>: mathmatical function
6. <stdlib.h>:
 utility function for number, conversion, storage allocation
7. <assert.h>: 
function that can be used to add diagnostics to a program
8. <stdarg.h>: 
function that can be used to step through a list of function arguments
9. <setjmp.h>:
 function that can be used to avoid the normal call and return sequence
10. <signal.h>: 
function for handling exceptional condition that may arise in a program
11. <time.h>: 
function for manipulating date and time
12. <limits.h>: 
constant definitions for the size of C data types
13. <float.h>:
 definitions relating to floating-point arithmetic

List of C Programs

1. Write a program to find factorial of the given number. 
Recursion: A function is called 'recursive ' if a statement within the body of a function calls the same function. It is also called 'circular definition '.Thus recursion is a process of defining something in terms of itself.

Program: To calculate the factorial value using recursion.

#include<stdio.h>
int fact(int n);
int main()
{
int x, i;
printf("En ter a value for x: \n");
scanf("%d" ,&x);
i = fact(x);
printf("\n Factorial of %d is %d", x, i);
return 0;
}
int fact(int n)
{
/* n=0 indicates a terminating condition */
if (n)
return (1);
}
else
{
/* function calling itself */
return (n * fact(n - 1));
/*n*fact(n -1) is a recursive expression */
}
}

OUTPUT:

Enter a value for x: 4
Factorial of 4 is 24

2.Write a program to check whether the given number is even or odd.

Program:

#include<stdio.h>
int main()
{
int a;
printf("En ter a: \n");
scanf("%d" ,&a);
/* logic */
if (a % 2 == 0){

printf("Th e given number is EVEN\n");
}
else{
printf("Th e given number is ODD\n");
}
return 0;
}

Output:
Enter a: 2
The given number is EVEN

3. Write a program to swap two numbers using a temporary variable.

#include<stdio.h>
int main()
{
int a, b, temp;
printf("En ter the value of a and b: \n");
scanf("%d %d",&a,&b);
printf("Be fore swapping a=%d, b=%d \n", a, b);
/*Swapping logic */
temp = a;
a = b;
b = temp;
printf("Af ter swapping a=%d, b=%d", a, b);
return 0;
}

Output:

Enter the values of a and b: 2 3
Before swapping a=2, b=3
After swapping a=3, b=2

4. Write a program to swap two numbers without using a temporary variable. 

#include<stdio.h>
int main()
{
int a, b;
printf("En ter values of a and b: \n");
scanf("%d %d",&a,&b);
printf("Be fore swapping a=%d, b=%d\n", a,b);
/*Swapping logic */
a = a + b;
b = a - b;
a = a - b;
printf("Af ter swapping a=%d b=%d\n", a, b);
return 0;

}

Output:
Enter values of a and b: 2 3
Before swapping a=2, b=3
The values after swapping are a=3 b=2

5. Write a program to swap two numbers using bitwise operators. 
Program: 

#include<stdio.h>
int main()
{
int i = 65;
int k = 120;
printf("\n value of i=%d k=%d before swapping", i, k);
i = i ^ k;
k = i ^ k;
i = i ^ k;
printf("\n value of i=%d k=%d after swapping", i, k);
return 0;

}

6. Write a program to find the greatest of three numbers.

 Program: 

#include<stdio.h>

int main()

{

int a, b, c;

printf("En ter a,b,c: \n");

scanf("%d %d %d",&a,&b,&c);

if (a>b&&a>c){

printf("a is Greater ");

}

else if (b>c)

{

printf("b is Greater ");

}

else {

printf("c is Greater ");

}

return 0;

}

Output:

Enter a,b,c: 3 5 8

c is Greater 

7. Write a program to find the greatest among ten numbers. 

Program: 

#include<stdio.h>

int main()

{

int a[10];

int i;

int greatest;

printf("En ter ten values:");

//Store 10 numbers in an array

for (i = 0; i<10; i++){

scanf("%d" ,&a[i]);

}

//Assume that a[0] is greatest

greatest = a[0];

for (i = 0; i<10; i++){

if (a[i]>greatest){

greatest = a[i];

}

}

printf("\n Greatest of ten numbers is %d", greatest);

return 0;

}

Output:

Enter ten values: 2 53 65 3 88 8 14 5 77 64 

Greatest of ten numbers is 88

8. Write a program to check whether the given number is a prime. 

Program:

#includestdio.h>

Void main()

{

int n, i, c = 0;

printf("En ter any number n: \n");

scanf("%d" ,&n);

/*logic*/

for (i = 1; i<=n/2;i++)

if (n % i == 0){

c++;

}

}

if (c == 2){

printf(“n is a Prime number");

}

else{

printf("n is not a Prime number");

}

getch();

}

Output: 

Enter any number n: 7

 n is Prime 

9. Write a program to check whether the given number is a palindromi c number.

 Program:

#include<stdio.h>

int main()

{

int n, n1, rev = 0, rem;

printf("En ter any number: \n");

scanf("%d" ,&n);

n1 = n;

/* logic */

while (n>0){

rem = n % 10;

rev = rev * 10 + rem;

n = n / 10;

}

if (n1 == rev){

printf("Gi ven number is a palindromi c number");

}

else{

printf("Gi ven number is not a palindromi c number");

}

return 0;

}

Output:

Enter any number: 121

Given number is a palindrome

10.Write a program to check whether the given string is a palindrome . 

Program:

#include<stdio.h>

#include<conio.h>

int main()

{

char string1[20 ];

int i, length;

int flag = 0;

printf("En ter a string: \n");

scanf("%s" , string1);

length = strlen(str ing1);

for(i=0;i<length ;i++){

if(string1 [i] != string1[le ngth-i-1]) 

{

flag = 1;

break;

}

}

if (flag){

printf("%s is not a palindrome \n", string1);

}

else{

printf("%s is a palindrome \n", string1);

}

return 0;

}

Output:

Enter a string: radar

"radar"is a palindrome

Remaining will be continued later.....

Pseudocode in programming languages

PSEUDOCODE is nothing but the false code.It is used to represent the logic of the solution.It is a detailed explanation of the an algorithm.

Pseudocode looks like a programming, but it is not a real programming.

It can be written just like an algorithm.For example, consider a situation where you need to welcome the new user.For this you have to get the name from the user and to append the name with the word "WELCOME"

The required Pseudocode is here:

Begin

  Display 'Enter your name'

  Accept name

  Initial=welcome

  name=strconcat(initial,name)

 Display name

end

Instead we can implement this with the help of scratch,which may be used for creating a simple gaming application using some animation or anything.Here you can make a sprite(cat,dog,etc..) to walk,run,dance and more....

After downloading Scratch you can open it and start writing you Pseudocode or creating your simple gaming application.

JAVA IEEE Projects

 JAVA based CLOUD COMPUTING:

1. Dynamic Heterogeneity-Aware Resource Provisioning in the Cloud (IEEE 2014).
2. Cloud-Based Mobile Multimedia Recommendation System with User Behavior
Information (IEEE 2014).
3. Efficiency Evaluation for Supply Chains Using Maximin Decision Support (IEEE 2014).
4. Shared Authority Based Privacy-preserving Authentication Protocol in Cloud Computing
(IEEE 2014).
5. Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud (IEEE 2014).
6. Towards Scalable Traffic Management in Cloud Data Centers. (IEEE 2014).
7. Consistency as a Service: Auditing Cloud Consistency. (IEEE 2014).
8. On the Knowledge Soundness of a Cooperative Provable Data Possession Scheme in
Multicloud Storage. (IEEE 2014).
9. Software defined environments based on TOSCA in IBM cloud implementations. (IEEE
2014).
10. Secure Deduplication with Efficient and Reliable Convergent Key Management. (IEEE
2014).

 JAVA based GRID COMPUTING:

1. Adaptive Replica Synchronization for Distributed File Systems. (IEEE 2014).
2. A mobility aware scheduler for low cost charging of electric vehicles in smart grid.
(IEEE 2014).

 JAVA based MOBILE COMPUTING:

1. Scheduling in Single-Hop Multiple Access Wireless Networks with Successive
Interference Cancellation. (IEEE 2014).
2. Optimal Cellular Offloading via Device-to-Device Communication Networks with
Fairness Constraints. (IEEE 2014).

JAVA based DATA MINING:

1. Infrequent Weighted Item set Mining Using Frequent Pattern Growth. (IEEE 2014).
2. Secure Spatial Top-<i>k</i> Query Processing via Un trusted Location-based Service
Provider. (IEEE 2014).
3. Similarity Preserving Snippet-Based Visualization of Web Search Results. (IEEE 2014).
4. Risk Aware Query Replacement Approach for Secure Databases Performance
Management. (IEEE 2014)
5. Modeling Temporal Activity Patterns in Dynamic Social Networks. (IEEE 2014).

 JAVA based NETWORK SECURITY:

1. DDoS Detection Method Based on Chaos Analysis of Network Traffic Entropy (IEEE
2014).
2. Pair wise key distribution scheme for two-tier sensor networks (IEEE 2014).
3. Intelligent rule-based phishing websites classification (IEEE 2014).
4. Integrated Security Analysis on Cascading Failure in Complex Networks (IEEE 2014).
5. Tradeoff between Reliability and Security in Multiple Access Relay Networks Under
Falsified Data Injection Attack (IEEE 2014).
6. Security Analysis of Handover Key Management in 4G LTE/SAE Networks (IEEE

2014).

JAVA based WEB MINING:

1. A Fuzzy Preference Tree-Based Recommender System for Personalized Business-to-
Business E-Services. (IEEE 2014)
2. Deep Web data extraction using query string formation. (IEEE 2014)
3. An Empirical Study of Ontology-Based Multi-Document Summarization in Disaster
Management. (IEEE 2014)
4. LIMTopic: A Framework of Incorporating Link based Importance into Topic Modeling.
(IEEE 2014)
5. Identifying Features in Opinion Mining via Intrinsic and Extrinsic Domain Relevance.
(IEEE 2014)
6. Web Image Re-Ranking Using Query-Specific Semantic Signatures. (IEEE 2014)

JAVA based REAL TIME SURVEILLANCE SECURITY:

1. Segmentation and Enhancement of Latent Fingerprints: A Coarse to Fine Ridge Structure
Dictionary. (IEEE 2014)
2. Background elimination method in the event based vision sensor for dynamic
environment. (IEEE 2014)
3. A Novel Approach to Circular Edge Detection for Iris Image Segmentation. (IEEE 2014)

JAVA based NETWORKS:

1. Maximizing P2P File Access Availability in Mobile Ad Hoc Networks Though
Replication for Efficient File Sharing. (IEEE 2014)
2. Receiver-Based Flow Control for Networks in Overload. (IEEE 2014)
3. On the Excess Bandwidth Allocation in ISP Traffic Control for Shared Access Networks.
(IEEE 2014)
4. Transfer Reliability and Congestion Control Strategies in Opportunistic Networks: A
Survey. (IEEE 2014)
5. PSR: A Lightweight Proactive Source Routing Protocol for Mobile Ad Hoc Networks.
(IEEE 2014)
6. Automatic Test Packet Generation. (IEEE 2014)
7. Fairness Analysis of Routing in Opportunistic Mobile Networks. (IEEE 2014)
8. Spectral - and energy-efficient two-stage cooperative multicast for LTE-advanced and
beyond. (IEEE 2014)
9. Constructing Limited Scale-Free Topologies over Peer-to-Peer Networks. (IEEE 2014).

JAVA based IMAGE PROCESSING:

1. Detection and Reconstruction of an Implicit Boundary Surface by Adaptively Expanding
A Small Surface Patch in A 3D Image (IEEE 2014).
2. Neutron source reconstruction from pinhole imaging at National Ignition Facility. (IEEE
2014)
3. Image segmentation by dirichlet process mixture model with generalised mean (IEEE
2014).
4. High-Resolution SAR Image Generation by Subaperture Processing of FMCW Radar
Signal (IEEE 2014).
5. Optimum Signal Processing for Multichannel SAR: With Application to High-Resolution
Wide-Swath Imaging (IEEE 2014).

JAVA based SERVER PERFORMANCE:

1. Tracking of Acoustic Sources Using Random Set Theory. (IEEE 2014)
2. Design and performance evaluation of in-home high throughput streaming service with
ethernet and IEEE1394. (IEEE 2014)

JAVA based NEURAL NETWORKS:

1. A Markov Random Field Groupwise Registration Framework for Face
Recognition.(IEEE 2014)
2. Offline Text-Independent Writer Identification Based on Scale Invariant Feature
Transform. (IEEE 2014)

JAVA based DISTRIBUTED NETWORKS:
1. Improving Scalability of VoD Systems by Optimal Exploitation of Storage and Multicast.
(IEEE 2014)
2. Temporal Workload-Aware Replicated Partitioning for Social Networks. (IEEE 2014)
3. Effects of Cooperation Policy and Network Topology on Performance of In-Network
Caching. (IEEE 2014)
4. Optimal Distributed Malware Defense in Mobile Networks with Heterogeneous Devices.
(IEEE 2014)
5. A Reactive and Scalable Unicast Solution for Video Streaming over VANETs. (IEEE
2014

JAVA based VISUAL CRYPTOGRAPHY:

1. A Lossless Tagged Visual Cryptography Scheme. (IEEE 2014)
2. Random-Grid-Based Visual Cryptography Schemes. (IEEE 2014)

JAVA based INFORMATION SECURITY:
1. Separable data hiding in encrypted image based on compressive sensing. (IEEE 2014)
2. An Overview of Information Hiding in H.264/AVC Compressed Video. (IEEE 2014)
3. A Joint FED Watermarking System Using Spatial Fusion for Verifying the Security
Issues of Teleradiology. (IEEE 2014).

 JAVA based WIRELESS SENSOR NETWORK:
1. Harnessing the High Bandwidth of Multiradio Multichannel 802.11n Mesh Networks.
(IEEE 2014).
2. Bounds on the Benefit of Network Coding for Wireless Multicast and Unicast. (IEEE
2014)
3. Optimal Probabilistic Encryption for Secure Detection in Wireless Sensor Networks.
(IEEE 2014)
4. Channel Time Allocation PSO for Gigabit Multimedia Wireless Networks. (IEEE 2014)
5. A Scalable and Mobility-Resilient Data Search System for Large-Scale Mobile Wireless
Networks. (IEEE 2014)

JAVA based ARTIFICIAL INTELLIGENCE:

1. Classifying text documents using unconventional representation. (IEEE 2014)

JAVA based INTRUSION DETECTION SYSTEMS:
1. A Framework for Evaluating Intrusion Detection Architectures in Advanced Metering
Infrastructures. (IEEE 2014)
2. RRE: A Game-Theoretic Intrusion Response and Recovery Engine. (IEEE 2014)
3. A Semantic Approach to Host-Based Intrusion Detection Systems Using Contiguous and
Discontiguous System Call Patterns. (IEEE 2014)

JAVA based COMPUTATION & DATA SECURITY:
1. Efficient and Retargetable Dynamic Binary Translation on Multicores. (IEEE 2014)
2. Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks. (IEEE
2014)
3. Split and Aggregated-Transmission Control Protocol (SA-TCP) for Smart Power Grid.
(IEEE 2014)

.NET IEEE Projects

 DOTNET based CLOUD COMPUTING :

1. Cloud-Assisted Mobile-Access of Health Data with Privacy and Auditability
(IEEE 2014).
2. Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data.
(IEEE 2014).
3. Price Competition in an Oligopoly Market with Multiple IaaS Cloud Providers.
(IEEE 2014).
4. Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud (IEEE 2014).

DOTNET based KNOWLEDGE AND DATA ENGINEERING

1. Converged architecture for broadcast and multicast services in heterogeneous network
(IEEE 2014).
2. Ideal Forward Error Correction Codes High-Speed Streaming data. (IEEE 2014).
3. A novel model for mining association rules from semantic web data (IEEE 2014).
4. Two-sided expanding ring search (IEEE 2014).
5. Shortest Path Computing in Relational DBMSs (IEEE 2014).

 DOTNET based INFORMATION SECURITY

1. Analysis of Data Hiding Using Digital Image Signal Processing (IEEE 2014).
2. Robust Priority Assignments for Extending Existing Controller Area Network Applications
(IEEE 2014).
3. Paste Rheology Correlating With Dispensed Finger Geometry (IEEE 2014).
4. Compact tunable hyper spectral imaging system (IEEE 2014).

 DOTNET based DISTRIBUTED NETWORKING

1. Energy Efficient Collaborative Beam forming in Wireless Sensor Networks.
(IEEE 2014).
2. Joint Design of Channel and Network Coding for Star Networks Connected by Binary
Symmetric Channels (IEEE 2014).
3. Subspace Pursuit for Sparse Unmixing of Hyperspectral Data (IEEE 2014)..

DOTNET based SECURE TRANSMISSION

1. Trustful Location Based Energy Deterioration on Demand Multipath Routing in Secure
Network (IEEE 2014).
2. The Client Assignment Problem for Continuous Distributed Interactive Applications:
Analysis,Algorithms and Evaluation (IEEE 2014).
3. Power Control and Coding Formulation for State Estimation with Wireless Sensors(IEEE
2014).

DOTNET based IMAGE PROCESSING

1. Localization of license Plate Number using Dynamic Image Processing Technique and
Genetic Algorithm (IEEE 2014).
2. Face recognition and facial expression identification using PCA (IEEE 2014).
3. Edge-based IVD segmentation systems (IEEE 2014).
4. Image Contrast Enhancement Using Color and Depth Histograms (IEEE 2014).
5. Efficient homomorphism encryption on integer vectors and its applications (IEEE 2014).
6. On Scanning Linear Barcodes from Out-of-Focus Blurred Images: A Spatial Dynamic
Template Matching Approach (IEEE 2014)..

DOTNET based NEURAL NETWORKS

1. Multi touch Gesture-Based Authentication (IEEE 2014).
2. A Novel Face Detection Algorithm Based on PCA and Adaboost (IEEE 2014).

 DOTNET based Networks:

1. Adopting hybrid CDN-P2P in IP-over-WDM networks: An energy-efficiency perspective
(IEEE 2014).
2. Leveraging Social Networks for P2P Content-Based File Sharing in Disconnected
MANETs (IEEE 2014).
3. Cognitive Dynamics: From Attractors to Active Inference (IEEE 2014).

 DOTNET based VIDEO PROCESSING:
1. Learning vehicle motion patterns based on environment model and vehicle trajectories
(IEEE 2014)..
2. A MultiScale Particle Filter Framework for Contour Detection (IEEE 2014). [Device
Based]
3. Robust Causality Check for Sampled Scattering Parameters via a Filtered Fourier
Transform.(IEEE 2014). [Device Based]

 DOTNET based WEB MINING:

1. Content based hidden web ranking algorithm (IEEE 2014).
2. Shortest Path Algorithm Based on Delaunay Triangulation (IEEE 2014).
3. A Gesture Learning Interface for Simulated Robot Path Shaping With a Human
Teacher (IEEE 2014).
4. Securing Digital Reputation in Online Social Media (IEEE 2014).

DOTNET based MOBILE COMPUTING

1. Distributed Flow Scheduling in Energy-Aware Data Center Networks on Open Flow-based
platform (IEEE 2014).
2. A survey on energy efficient routing protocols in wireless sensor network (IEEE 2014).
3. GSM infrastructure used for data transmission (IEEE 2014). [Device Based].
4. Probabilistic Average Energy Flooding to Maximize Lifetime of wire-less Networks
(IEEE 2014).
5. Probabilistic Lifetime Maximization of Sensor Networks (IEEE 2014).

Enumeration concepts in C

  
Definition:

•          Enumeration is Userdefined Datatype in C.
•          Keyword: enum

Syntax:

  enum userdefined_name{value1,value2,...};

Sample program:

#include<stdio.h>
#include<conio.h>
void main()
{
enum days{sun,mon,tues,wed,thu,fri,sat};
enum days weekend;                                          //weekend is the instance of days.
weekend=sat;
printf("weekend is %d",weekend);
getch();
}

output:
weekend is 6 //assume sun as 0 ,mon as 1 like that

Logo development of Microsoft

Data Structures interview questions

DATA STRUCTURES INTERVIEW QUESTIONS 

1. What is data structure?
A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.

 2. List out the areas in which data structures are applied extensively?
1. Compiler Design,
2. Operating System,
 3. Database Management System,
 4. Statistical analysis package, 5. Numerical Analysis,
 6. Graphics,
7. Artificial Intelligence,
8. Simulation

3. What are the major data structures used in the following areas : 
RDBMS, Network data model and Hierarchical data model. 1. RDBMS = Array (i.e. Array of structures) 2. Network data model = Graph 3. Hierarchical data model = Trees

4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.

 5. Minimum number of queues needed to implement the priority queue?
 Two. One queue is used for actual storing of data and another for storing priorities.

6. What is the data structures used to perform recursion? 

Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
Polish and Reverse Polish notations.

8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix notations. 
1. Prefix Notation: - * +ABC ^ - DE + FG
2. Postfix Notation: AB + C * DE - FG + ^ -

9. Sorting is not possible by using which of the following methods? (Insertion, Selection, Exchange, Deletion)
Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.

10. What are the methods available in storing sequential files ?  
1. Straight merging, 2. Natural merging, 3. Polyphase sort, 4. Distribution of Initial runs.

11. List out few of the Application of tree data-structure? 
1. The manipulation of Arithmetic expression, 2. Symbol Table construction, 3. Syntax analysis.

12. List out few of the applications that make use of Multilinked Structures?
1. Sparse matrix, 2. Index generation.

13. In tree construction which is the suitable efficient data structure? 
(Array, Linked list, Stack, Queue) Linked list is the suitable efficient data structure.

14. What is the type of the algorithm used in solving the 8 Queens problem? 
Backtracking.

15. In an AVL tree, at what condition the balancing is to be done?
 If the 'pivotal value' (or the 'Height factor') is greater than 1 or less than -1.

16. What is the bucket size, when the overlapping and collision occur at same time?
One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

 17. Classify the Hashing Functions based on the various methods by which the key value is found.
1. Direct method, 2. Subtraction method, 3. Modulo-Division method, 4. Digit-Extraction method, 5. Mid-Square method, 6. Folding method, 7. Pseudo-random method.

18. What are the types of Collision Resolution Techniques and the methods used in each of the type?
Open addressing (closed hashing): The methods used include: Overflow block.
 Closed addressing (open hashing): The methods used include: Linked list, Binary tree 

19. In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.

20. What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.