Sawaal
  • Home/
  • Searching for h

 Searching for "h"

Q:

main()

{

char s[ ] = "man";

int i;

for( i=0; s[ i ]; i++)

printf( "n%c%c%c%c", s[ i ], *(s+i), *(i+s), i[s] );

}

A) mmmm aaaa nnnn B) aaaa mmmm nnnn
C) nnnn aaaa mmmm D) None
 
Answer & Explanation Answer: A) mmmm aaaa nnnn

Explanation:

s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the same idea.Generally array name is the base address for that array. Here s is the base address. i is the index number/displacement from the base address. So, indirecting it with * is same as s[i]. i[s] may be surprising. But in the case of C it is same as s[i].

Report Error

View Answer Report Error Discuss

Filed Under: Programming

Q:

Which is the simplest file structure?

A) Sequential B) Indexed
C) Random D) None
 
Answer & Explanation Answer: A) Sequential

Explanation:

Sequential is the simplest file structure

Report Error

View Answer Report Error Discuss

Filed Under: Software Testing

Q:

What is a spanning Tree?

Answer

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

Report Error

View answer Workspace Report Error Discuss

Subject: Technology

Q:

Classify the Hashing Functions based on the various methods by which the key value is found.

Answer

Direct method,


 Subtraction method,


 Modulo-Division method,


 Digit-Extraction method,


 Mid-Square method,


 Folding method,


Pseudo-random method

Report Error

View answer Workspace Report Error Discuss

Subject: Technology

Q:

List out few of the applications that make use of Multilinked Structures?

Answer

Sparse matrix,


Index generation

Report Error

View answer Workspace Report Error Discuss

Subject: Technology

Q:

What is the data structures used to perform recursion?

Answer

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.

Report Error

View answer Workspace Report Error Discuss

Subject: C++

Q:

List out the areas in which data structures are applied extensively?

Answer

Compiler Design,


 Operating System,


 Database Management System,


Statistical analysis package,


Numerical Analysis,


 Graphics,


 Artificial Intelligence,


 Simulation

Report Error

View answer Workspace Report Error Discuss

Subject: C++

Q:

When Were You Most Satisfied in Your Job?

Answer

The interviewer wants to know what motivates you. If you can relate an example of a job or project when you were excited, the interviewer will get an idea of your preferences.


Eg: "I was very satisfied in my last job, because I worked directly with the customers and their problems; that is an important part of the job for me."

Report Error

View answer Workspace Report Error Discuss

Subject: About Yourself