Win the race ......

Java Magazine - January/February 2012 digital Edition

2012-02-08T08:59:00.000+05:30

Java Magazine by Oracle - January/February 2012 digital Edition

For Java to remain relevant in the age of cloud computing, the standards need to evolve to meet new deployment and management requirements. In this issue, we take you inside that process to learn how Java EE 7 will accomplish this goal.

Tame the Cloud
Oracle's Cameron Purdy on how Java EE is evolving to become the cloud computing platform standard.

Looking Ahead to Java EE 7
Arun Gupta takes us on a tour of Java EE 7 JSRs.

Project Coin: The Java Language Has Evolved!
These additions to the Java language in Java SE 7 will help you be more productive.

JavaFX and Swing
Go from Swing to JavaFX.

Lightweight Publish-Subscribe
Adam Bien on CDI.

Fix This
In this issue’s code puzzler, Marek Piechut challenges your knowledge of Swing.

And more!

Click here to read the Magazine

C++ Basic Interview Questions

2012-02-01T10:22:00.000+05:30

What is the difference between an object and a class?
http://www.coolinterview.com/interview/950/

What is the difference between class and structure?
http://www.coolinterview.com/interview/956/

What is an object?
http://www.coolinterview.com/interview/958/

What is a class?
http://www.coolinterview.com/interview/959/

How is method overriding different from overloading?
http://www.coolinterview.com/interview/1614/

From a versioning perspective, what are the drawbacks of extending an interface as opposed to extending a class?
http://www.coolinterview.com/interview/1639/

What are the things contains in .obj file ? ( compiled result of .cpp file )
http://www.coolinterview.com/interview/6083/

What is the difference between Object and Instance?
http://www.coolinterview.com/interview/6086/

Different types of languages compare in c++ and other languagesOops concepts in other language oops
http://www.coolinterview.com/interview/6099/

what is memory leaking in c++ ?
http://www.coolinterview.com/interview/6103/

what is the difference between c&c++?
http://www.coolinterview.com/interview/6108/

Why can't one make an object of abstract class?Give compiler view of statement
http://www.coolinterview.com/interview/6110/

In c++ have a default constructor ?
http://www.coolinterview.com/interview/6112/

What are the different types of Storage classes?
http://www.coolinterview.com/interview/6124/

Difference between "C structure" and "C++ structure".
http://www.coolinterview.com/interview/6129/

What is encapsulation?
http://www.coolinterview.com/interview/6137/

What is the difference between an object and a class?
http://www.coolinterview.com/interview/6138/

What is the Basic nature of "cin" and "cout" and what concept or principle we are using on those two?
http://www.coolinterview.com/interview/6141/

What is the difference between class and structure?
http://www.coolinterview.com/interview/6144/

What is the difference between structures and classes in C++?
http://www.coolinterview.com/interview/6146/

What is a class?
http://www.coolinterview.com/interview/6147/

The class which acts as interface between the C++ and the Java layer?
http://www.coolinterview.com/interview/9708/

what are the differences between c and c++.what are the advantages the are only in c++ but not in c
http://www.coolinterview.com/interview/12652/

why c++ is called as object-oriented language? Here what does object mean?
http://www.coolinterview.com/interview/12653/

what are the differences between member function and constructor?
http://www.coolinterview.com/interview/12655/

What is Difference between c and c++?
http://www.coolinterview.com/interview/12763/

what are the differences between c and c++? If possible give more points.what are the disadvantages of C++?
http://www.coolinterview.com/interview/12786/

Which type of questions are asked in interviews?
http://www.coolinterview.com/interview/12859/

What are the major differences between C, C++, JAVA?
http://www.coolinterview.com/interview/13853/

What is the return value for getch()?
http://www.coolinterview.com/interview/15778/

What is the definition of abstract class and virtual function?
http://www.coolinterview.com/interview/15786/

I am a new computer engineering student can you please explain what is c++ and its uses please answer me this question as faster as you can?
http://www.coolinterview.com/interview/15842/

What is class?What is object?Describe these 2 with example.
http://www.coolinterview.com/interview/15958/

What is a local class?
http://www.coolinterview.com/interview/16119/

How do you access the static member of a class?
http://www.coolinterview.com/interview/16157/

Define a class named cord, a point in Cartesian coordinate system where each point has two int type values x and y. Your class must contain necessary constructors and arithmetic operator functions. Write necessary codes to test your class?
http://www.coolinterview.com/interview/16213/

Can constructors & destructor be virtual ?
http://www.coolinterview.com/interview/16285/

What is prototype in c++ and c?
http://www.coolinterview.com/interview/16382/

Explain about member functions?
http://www.coolinterview.com/interview/22192/

Define encapsulation?
http://www.coolinterview.com/interview/22196/

Yahoo users must know..

2012-01-20T18:31:00.000+05:30

Yahoo Mail user are requested to aware of this mail. Some hackers are passing this email to get the details of your account to access your account for illegal communication.

Lecture - 25 Data Structures for Graphs

2012-01-07T12:02:00.000+05:30

Data Structures - Chapter 1: Stack

2012-01-07T11:59:00.000+05:30

Life in 2050

2012-01-07T11:14:00.000+05:30

We are on the threshold of a new era. Our planet's climate is at risk. Natural resources are growing scarce. In 2050, the number of people living in cities will be greater than the entire population of the Earth today. That's why researchers, inventors, and engineers need to be more creative today than ever before. Computers as medical assistants, robots as household servants, sensory organs for electric cars, buildings as energy providers, farms in skyscrapers, power plants in the desert and on the high seas, supercomputers the size of a pea - these are not visions but almost tangible realities in laboratories all over the globe.
In a unique survey, science journalist and industry insider Ulrich Eberl vividly describes the key trends that will shape our lives - and how we ourselves can help to invent the world of tomorrow.

ROLL LAPTOP Amazing new Technology 2012

2012-01-07T10:45:00.000+05:30

In 2012

2012-01-02T11:21:00.001+05:30

Ask around and you’ll hear it over and over again: Enterprise IT shops are worried about using the cloud. They’re concerned about the security, privacy and governance risks of moving their data and applications outside their four walls. Cloud vendor lock-in and job security are also major worries for these guys, though few IT pros will admit to the latter.
Next year will be no different. But instead of keeping the cloud at arms’ length, which many enterprise IT shops have done this year, 2012 will be the year for taking the plunge. If you’ve been sitting on the fence, here are some thoughts on what to expect next year that might push you over the edge.

For Predictions : refer the following site

Happy and Prosperous New Year 2012.

Oracle & Java Magazine

2011-12-21T09:23:00.004+05:30

Oracle Magazine - January - February 2012 Edition

Java Magazine - November - December 2011 Edition

Set of Materials for Facing Technical Quiz - www.Carrerride.com

2011-12-17T16:33:00.000+05:30

List of Online IT Quiz Sites

2011-12-17T16:28:00.000+05:30

the following are the sites provide the users to test their Technical Skills.

Database Mangement System

Also the site http://www.ex-designz.net provides Quiz for the following subjects
ASP

ASP 2

ASP ADO

ASP Server Side Include

ASP.NET

C# .NET

CSS

HTML

IIS 6 Administration

Java

JavaScript

Javascript Fundamental

Linux

PERL

PHP

Project Management

Search Engine Optimization

Server Administrator

SQL

SQL Advanced

SQL Server Administration

VB.NET

Web Designer

Windows 2000 Server

Windows 2003 Server Adminstration

Data Structure Question Bank

2011-12-16T12:27:00.002+05:30

UNITI : DATA STRUCTURES

1. Define ADT.

2. What is a datastructure? What are the types of data structures?

3. Definea linear and non linear data structure.

4. Definein brief an array. What are the types of array operations?

5. Whatis a recursive algorithm?

6. What isthe difference between a stack and a Queue?

7. Can astack be described as a pointer? Explain

8. Isit possible to insert different type of elements in a stack? How?

9. Howwould you sort a linked list?

10. Explainthe types of linked lists.

11. Explainin brief a linked list.

12. Implement an algorithm to reverse adoubly linked list.

13. Implement an algorithm to insert in asorted list.

14. Implement an algorithm to reverse adoubly linked list.

15. Implement an algorithm to insert in asorted list.

16. What is an Algorithm?

17. List out and define the performancemeasures of an algorithm.

18. What is Complexity analysis?

19. Explain Space complexity?

20. Explain Time complexity?

21. List out the components that are usedfor space complexity?

22. What do asymptotic notation means?

23. Define linear data structure?

24. Define Non Linear data structure?

25. Convertthe expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix andPostfix notations.

26. What are different types of Linked List?

27. What are different types of Circular Linked List?

28. List certain applications of lists

29. List the basic operations carried out in a linkedlist?

30. Define a stack?

31. Define a queue?

32. Difference between Arrays and Linked List?

33. What is single linked list?

34. Define HEAD pointer and NULL pointer?

35. Define double linked list?

36. Write operations that can be done on stack?

37. Mention applications of stack?

38. Define Infix, prefix and postfix notations?

39. What are the conditions that followed in the arrayimplementation of queue?

40. What are the conditions that could befollowed in a linked list implementations of queue?

UNITII : TREES

41. List out few of the Application of treedata-structure?

42. Drawa binary Tree for the expression :
A * B - (C + D) * (P / Q)
Write a program in ‘C' language which accepts inorder and preorder traversaloutputs of a Binary Tree as input and prints the correspondingBinary tree.

43. Definetree?

44. Write a function and the node datastructure to visit all of the nodes in a binary tree.

45. Writea function to find the depth of a binary tree.

46. Define Depth of tree?

47. Define Degree of a node?

48. define Degree of a tree?

49. Define Terminal node or leaf?

50. Define Non-terminal node?

51. Define sibling?

52. Define binary tree?

53. Define expression tree?

54. Construction of expression trees?

55. Define tree traversal and mention the type oftraversals?

UNITIII SORTING AND SEARCHING

56. Whatis insertion sort? How many passes are required for the elements to be sorted ?

57. What is the need of external sorting? Differentiate between merge sort and quick sort ?

58. What is replacement selection ?

59. What is sorting?

60. What issequential search? What is the average number of comparisons in a sequentialsearch?

61. Whatis binary searching and Fibonacci search?

62. The element being searched for is not found in an arrayof 100 elements. What is the average number of comparisons needed in asequential

63. Which sort show the best average behavior?

64. What is the average number ofcomparisons in a sequential search?

65. Write Binary Search program

66. Write programs for Bubble Sort, Quicksort

UNITIV GRAPHS AND THEIR APPLICATIONS

67. What is a graph?

68. What are Directed graphs?

69. What isthe Huffman algorithm?

70. Define Path.

71. Define Cycle.

72. Define Connected graph.

73. What are the conditions for a graph to become a tree?

74. . Define a Weighted Graph.

75. Give the types of representation of graphs

76. What is a minimum spanning tree

77. Explain about Adjacency Matrix

78. What are the methods to solve minimum spanning tree?

79. Explain briefly about Prim’s algorithm

80. Define a depth first spanning tree.

81. What is a tree edge?

UNITV STORAGE MANAGEMENT

82. What is the reference count method?

83. What is Garbage Collection?

84. What are the algorithms associated with GarbageCollection

85. What is Collection and Compaction ?

86. What are the variations in Garbage Collection?

Data structure - imp questions

2011-12-16T12:20:00.002+05:30

1. What is data structure?

A data structure is a way of organizing data that considers notonly the items stored, but also their

relationship to each other. Advance knowledge about therelationship between data items allows

designing of efficient algorithms for the manipulation of data.

2. List out the areas in which data structures are appliedextensively?

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 followingareas : 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 heterogeneouslinked list, what pointer

type will you use?

The heterogeneous linked list contains different data types inits nodes and we need a link, pointer to

connect them. It is not possible to use ordinary pointers forthis. So we go for void pointer. Void

pointer is capable of storing pointer to any type as it is ageneric pointer type.

5. Minimum number of queues needed to implement the priorityqueue?

Two. One queue is used for actual storing of data and anotherfor storing priorities.

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

Stack. Because of its LIFO (Last In First Out) property itremembers its 'caller' so knows whom to

return when the function has to return. Recursion makes use ofsystem 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 isto be used.

7. What are the notations used in Evaluation of ArithmeticExpressions using prefix and

postfix forms?

Polish and Reverse Polish notations.

8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) toequivalent 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 followingmethods? (Insertion, Selection,

Exchange, Deletion)

Sorting is not possible in Deletion. Usinginsertion we can perform insertion sort, using selection

we can perform selection sort, using exchange we can perform thebubble sort (and other similar

sorting methods). But no sorting method can be done just usingdeletion.

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 ofMultilinked Structures?

1. Sparse matrix,

2. Index generation.

13. In tree construction which is the suitable efficient datastructure? (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 8Queens problem?

Backtracking.

15. In an AVL tree, at what condition the balancing is to bedone?

If the 'pivotal value' (or the 'Height factor') is greater than1 or less than -1.

16. What is the bucket size, when the overlapping and collisionoccur at same time?

One. If there is only one entry possible in the bucket, when thecollision occurs, there is no way to

accommodate the colliding value. This results in the overlappingof values.

17. Classify the Hashing Functions based on the various methodsby 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 andthe methods used in each of

the type?

1. Open addressing (closed hashing), Themethods used include: Overflow block.

2. Closed addressing (open hashing), Themethods used include: Linked list, Binary tree.

19. In RDBMS, what is the efficient data structure used in theinternal storage

representation?

B+ tree. Because in B+ tree, all the data is stored only in leafnodes, that makes searching

easier. This corresponds to the records that shall be stored inleaf nodes.

20. What is a spanning Tree?

A spanning tree is a tree associated with a network. All thenodes of the graph appear on the

tree once. A minimum spanning tree is a spanning tree organizedso that the total edge

weight between nodes is minimized.

21. Does the minimum spanning tree of a graph give theshortest distance between

any 2 specified nodes?

The Minimal spanning tree assures that the total weight of thetree is kept at its minimum.

But it doesn't mean that the distance between any two nodesinvolved in the minimumspanning

tree is minimum.

22. Which is the simplest file stru

cture? (Sequential, Indexed, Random)

Sequential is the simplest file structure.

23. Whether Linked List is linear or Non-linear datastructure?

According to Access strategies Linked list is a linear one.

According to Storage Linked List is a Non-linear one.

Data Structures - Two Marks Q & A

2011-12-16T12:13:00.001+05:30

1. Limitationsof arrays

· Arrayshave a fixed dimension. Once the size of an array is decided it cannot beincreased or decreased during execution.

· Arrayelements are always stored in contiguous memory locations. So it needcontiguous locations otherwise memory will not be allocated to the arrays

· Operationslike insertion of a new element in an array or deletion of an existing elementfrom the array are pretty tedious. This is because during insertion or deletioneach element after the specified position has to be shifted one position to theright or one position to the left.

1. Define Data Structure.

A data structure is a way oforganizing data that considers not only the items stored, but also theirrelationship to each other. Advance knowledge about the relationship betweendata items allows designing of efficient algorithms for the manipulation ofdata.

2. Why do we need data structures?

v Data structures allow us to achieve an important goal: componentreuse

v Once each datastructure has been implemented once, it can be used over and over again invarious applications.

3. Simple Classification of DataStructure.

The data structure can beclassified into two types as follows:

a) Linear Data Structures – Allthe elements are formed in a sequence or maintain a linear ordering

i. Arrays

ii. LinkedLists

iii. Stacks

iv. Queues

b) Non-Linear Data Structures –All the elements are distributed on a plane i.e. these have no such sequence ofelements as in case of linear data structure.

i. Trees

ii. Graphs

iii. Sets

4. List the operations performedin the Linear Data Structure

a) Traversal – Processing eachelement in the list

b) Search – Finding the locationof the element with a given value.

c) Insertion / Storing – Adding anew element to the list.

d) Deletion – Removing an elementfrom the list.

e) Sorting – Arranging theelements in some type of order.

f) Merging – Combining two listsinto a single list.

5. Explain Linked List

v A linked list is a list ofelements in which the elements of the list can be placed anywhere in memory,and these elements are linked with each other using an explicit link field,that is by storing the address of the next element in the link field of theprevious element.

v A linked list is aself-referential data type because it contains a pointer or link to anotherdata of the same type. This permit insertion and removal of nodes at any pointin the list in constant time, but do not allow random access.

6. What is a node?

Each element structure in aslinked list called node, containing two fields one is data and another isaddress of next data.

7. Advantages of Linked List

Linked List is dynamic data structure; the size of a list can grow or shrink during the program execution. So, maximum size need not be known in advance.
The Linked List does not waste memory
It is not necessary to specify the size of the list, as in the case of arrays.
Linked List provides the flexibility in allowing the items to be rearranged.

8. What are the pitfalls encounteredin single linked list?

A singly linked list allows traversal of the list in only one direction.
Deleting a node from a list requires keeping track of the previous node, that is, the node whose link points to the node to be deleted.
If the link in any node gets corrupted, the remaining nodes of the list become unusable.

9. Define Stack

v Stack is a linear datastructure and is an ordered collection of homogeneous data elements, where theinsertion and deletion operations takes place at one end called top of thestack.

v A stack data structure exhibitsthe LIFO (Last In First Out) property.

10. What are operations allowed ina Stack?

PUSH : This operation is used to add an item into the top of the stack.
POP : This operation is used to remove an item from the top of the stack.
PEEK : This operation is used to display the top item in the stack.

11. List the notations used torepresent the arithmetic expressions.

1. Infix: operator

Ex: A + B

2. Prefix: operator

(also called as polish notation) Ex: +AB

3. Postfix: operator

Ex: AB+

12. Rules for converting an Infixnotation to postfix form

Assume, the fully parenthesized version of the Infix expression
Move all operator, so that they replace their corresponding right part of parenthesis
Remove all parenthesis

Example: ((A+((B^C)-D))*(E-(A/C))) à ABC^D-+EAC/-*

13. DefineQueue

Queue is an ordered collectionof homogeneous data elements, in which the element insertion and deletion takesplace at two ends called front and rear. The elements are ordered in linearfashion and inserted at REAR end and deleted FRONT end. This exhibits FIFO(First In First Out) property.

14. Applicationsof Queue

Applications of queue as a datastructure are more common.

a) Within a computer system theremay be queues of tasks waiting for the line printer, or for access to diskstorage, or in a time-sharing system for use of the CPU.

b) Within a single program, theremay be multiple requests to be kept in a queue, or one task may create othertasks, which must be done in turn by keeping them in a queue.

15. Whatis the need of Circular Queue?

4 Queue implemented using anarray suffers from one limitation i.e. there is a possibility that the queue isreported as full (since rear has reachedthe end of the array), even though in actuality there might be empty slotsat the beginning of the queue. To overcome this limitation circular queue is needed.

4 Now the queue would be reportedas full only when all the slots in the array stand occupied.

16. Whatis deque?

v The word deque is a short formof double-endedqueue and defines a data structure in which items can be added ordeleted at either the front or rear end, but no changes can be made elsewherein the list.

v Thus a deque is ageneralization of both a stack and a queue.

17. Typesof Linked Lists:

a) Linear Singly Linked List

b) Circular Linked List

c) Two-way or doubly linked lists

d) Circular doubly linked lists

18. Whatare the Applications of linked list?

a) Implementation of Stack

b) Implementation of Queue

c) Implementation of Tree

d) Implementation of Graph

19. Applications of Stack

a) It is very useful to evaluatearithmetic expressions. (Postfix Expressions)

b) Infix to Postfix Transformation

c) It is useful during theexecution of recursive programs

d) A Stack is useful for designingthe compiler in operating system to store local variables inside a functionblock.

e) A stack can be used in functioncalls including recursion.

f) Reversing Data

g) Reverse a List

h) Convert Decimal to Binary

i) Parsing – It is a logic thatbreaks into independent pieces for further processing

j) Backtracking

Huffman Algorithm - to build a Huffman Tree

2011-12-16T12:08:00.001+05:30

/* Huffman Coding in C . This program reads a text file named on thecommand line, then compresses it using Huffman coding. The file is read twice,once to determine the frequencies of the characters, and again to do the actualcompression. */

#include < stdio.h>
#include < stdlib.h>
#include < string.h>
#include < time.h>

/* there are 256 possible characters */

#define NUM_CHARS 256

/* tree node, heap node */

typedef struct _treenode treenode;
struct _treenode {
int freq; /* frequency; is the priority for heap */
unsigned char ch; /* character, if any */
treenode *left, /* left child of Huffman tree (not heap!) */
*right; /* right child of Huffman tree */
};

/* this is a priority queue implemented as a binary heap */
typedef struct _pq {
int heap_size;
treenode *A[NUM_CHARS];
} PQ;

/* create an empty queue */

void create_pq (PQ *p) {
p->heap_size = 0;
}

/* this heap node's parent */

int parent (int i) {
return (i-1) / 2;
}

/* this heap node's left kid */

int left (int i) {
return i * 2 + 1;
}

/* this heap node's right kid */

int right (int i) {
return i * 2 + 2;
}

/* makes the subheap with root i into a heap , assuming left(i) and
* right(i) are heaps
*/
void heapify (PQ *p, int i) {
int l, r, smallest;
treenode *t;

l = left (i);
r = right (i);

/* find the smallest of parent, left, and right */

if (l < p->heap_size && p->A[l]->freq <p->A[i]->freq)
smallest = l;
else
smallest = i;
if (r < p->heap_size && p->A[r]->freq <p->A[smallest]->freq)
smallest = r;

/* swap the parent with the smallest, if needed. */

if (smallest != i) {
t = p->A[i];
p->A[i] = p->A[smallest];
p->A[smallest] = t;
heapify (p, smallest);
}
}

/* insert an element into the priority queue. r->freq is the priority */
void insert_pq (PQ *p, treenode *r) {
int i;

p->heap_size++;
i = p->heap_size - 1;

/* we would like to place r at the end of the array,
* but this might violate the heap property. we'll start
* at the end and work our way up
*/
while ((i > 0) && (p->A[parent(i)]->freq > r->freq)) {
p->A[i] = p->A[parent(i)];
i = parent (i);
}
p->A[i] = r;
}

/* remove the element at head of the queue (i.e., with minimum frequency) */
treenode *extract_min_pq (PQ *p) {
treenode *r;

if (p->heap_size == 0) {
printf ("heap underflow!\n");
exit (1);
}

/* get return value out of the root */

r = p->A[0];

/* take the last and stick it in the root (just like heapsort) */

p->A[0] = p->A[p->heap_size-1];

/* one less thing in queue */

p->heap_size--;

/* left and right are a heap, make the root a heap */

heapify (p, 0);
return r;
}

/* read the file, computing the frequencies for each character
* and placing them in v[]
*/
unsigned int get_frequencies (FILE *f, unsigned int v[]) {
int r, n;

/* n will count characters */

for (n=0;;n++) {

/* fgetc() gets an unsigned char, converts to int */

r = fgetc (f);

/* no more? get out of loop */

if (feof (f)) break;

/* one more of this character */

v[r]++;
}
return n;
}

/* make the huffman tree from frequencies in freq[] (Huffman's Algorithm) */

treenode *build_huffman (unsigned int freqs[]) {
int i, n;
treenode *x, *y, *z;
PQ p;

/* make an empty queue */

create_pq (&p);

/* for each character, make a heap/tree node with its value
* and frequency
*/
for (i=0; i< NUM_CHARS; i++) {
x = malloc (sizeof (treenode));

/* its a leaf of the Huffman tree */

x->left = NULL;
x->right = NULL;
x->freq = freqs[i];
x->ch = (char) i;

/* put this node into the heap */

insert_pq (&p, x);
}

/* at this point, the heap is a "forest" of singleton trees */

n = p.heap_size-1; /* heap_size isn't loop invariant! */

/* if we insert two things and remove one each time,
* at the end of heap_size-1 iterations, there will be
* one tree left in the heap
*/
for (i=0; i< n; i++) {

/* make a new node z from the two least frequent
* nodes x and y
*/
z = malloc (sizeof (treenode));
x = extract_min_pq (&p);
y = extract_min_pq (&p);
z->left = x;
z->right = y;

/* z's frequency is the sum of x and y */

z->freq = x->freq + y->freq;

/* put this back in the queue */

insert_pq (&p, z);
}

/* return the only thing left in the queue, the whole Huffman tree */

return extract_min_pq (&p);
}

/* traverse the Huffman tree, building up the codes in codes[] */

void traverse (treenode *r, /* root of this (sub)tree */
int level, /* current level in Huffman tree */
char code_so_far[], /* code string up to this point in tree */
char *codes[]) {/* array of codes */

/* if we're at a leaf node, */

if ((r->left == NULL) && (r->right == NULL)) {

/* put in a null terminator */

code_so_far[level] = 0;

/* make a copy of the code and put it in the array */

codes[r->ch] = strdup (code_so_far);
} else {

/* not at a leaf node. go left with bit 0 */

code_so_far[level] = '0';
traverse (r->left, level+1, code_so_far, codes);

/* go right with bit 1 */

code_so_far[level] = '1';
traverse (r->right, level+1, code_so_far, codes);
}
}

/* global variables, a necessary evil */

int nbits, current_byte, nbytes;

/* output a single bit to an open file */

void bitout (FILE *f, char b) {

/* shift current byte left one */

current_byte < < = 1;

/* put a one on the end of this byte if b is '1' */

if (b == '1') current_byte |= 1;

/* one more bit */

nbits++;

/* enough bits? write out the byte */

if (nbits == 8) {
fputc (current_byte, f);
nbytes++;
nbits = 0;
current_byte = 0;
}
}

/* using the codes in codes[], encode the file in infile, writing
* the result on outfile
*/
void encode_file (FILE *infile, FILE *outfile, char *codes[]) {
unsigned char ch;
char *s;

/* initialize globals for bitout() */

current_byte = 0;
nbits = 0;
nbytes = 0;

/* continue until end of file */

for (;;) {

/* get a char */

ch = fgetc (infile);
if (feof (infile)) break;

/* put the corresponding bitstring on outfile */

for (s=codes[ch]; *s; s++) bitout (outfile, *s);
}

/* finish off the last byte */

while (nbits) bitout (outfile, '0');
}

/* main program */

int main (int argc, char *argv[]) {
FILE *f, *g;
treenode *r; /* root of Huffman tree */
unsigned int n, /* number of bytes in file */
freqs[NUM_CHARS]; /* frequency of each char */
char *codes[NUM_CHARS], /* array of codes, 1 per char */
code[NUM_CHARS], /* a place to hold one code */
fname[100]; /* what to call output file */

/* hassle user */

if (argc != 2) {
fprintf (stderr, "Usage: %s < filename>\n", argv[0]);
exit (1);
}

/* set all frequencies to zero */

memset (freqs, 0, sizeof (freqs));

/* open command line argument file */

f = fopen (argv[1], "r");
if (!f) {
perror (argv[1]);
exit (1);
}

/* compute frequencies from this file */

n = get_frequencies (f, freqs);
fclose (f);

/* make the huffman tree */

r = build_huffman (freqs);

/* traverse the tree, filling codes[] with the codes */

traverse (r, 0, code, codes);

/* name the output file something.huf */

sprintf (fname, "%s.huf", argv[1]);
g = fopen (fname, "w");
if (!g) {
perror (fname);
exit (1);
}

/* write frequencies to file so they can be reproduced */

fwrite (freqs, NUM_CHARS, sizeof (int), g);

/* write number of characters to file as binary int */

fwrite (&n, 1, sizeof (int), g);

/* open input file again */

f = fopen (argv[1], "r");
if (!f) {
perror (argv[1]);
exit (1);
}

/* encode f to g with codes[] */

encode_file (f, g, codes);
fclose (f);
fclose (g);
/* brag */
printf ("%s is %0.2f%% of %s\n",
fname, (float) nbytes / (float) n, argv[1]);
exit (0);
}

Tamil dictionary. English to Tamil dictionary. Tamil to English dictionary. Tamil dictionary with pronunciation.

2011-12-07T10:57:00.000+05:30

Tamil dictionary. English to Tamil dictionary. Tamil to English dictionary. Tamil dictionary with pronunciation.

Excellent site for every one.

It has Tamil Stories, Devotional songs (Lyrics), Kids Tamil learning etc., are available

This site is very useful for Every Individual.

Program for Finding Transitive Closure - Warshall Algorithm

2011-12-01T09:24:00.001+05:30

#include
#include
#define MAX 20

display(int matrix[MAX][MAX],int n)
{

int i,j;
for(i=0;i{

for(j=0;j
printf("%3d",matrix[i][j]);

printf("\n");

}

}

int main()
{

int i,j,k,n;
int w_adj[MAX][MAX],adj[MAX][MAX],path[MAX][MAX];

printf("Enter number of vertices : ");
scanf("%d",&n);

printf("Enter weighted adjacency matrix :\n");
for(i=0;i
for(j=0;j
scanf("%d",&w_adj[i][j]);

printf("The weighted adjacency matrix is :\n");
display(w_adj,n);

/* Make weighted adjacency matrix into boolean adjacency matrix*/

for(i=0;i
for(j=0;j
if(w_adj[i][j]==0)

adj[i][j]=0;

else

adj[i][j]=1;

printf("The adjacency matrix is :\n");
display(adj,n);

for(i=0;i
for(j=0;j
path[i][j]=adj[i][j];

for(k=0;k{

printf("P%d is :\n",k);
display(path,n);
for(i=0;i
for(j=0;j
path[i][j]=( path[i][j] || ( path[i][k] && path[k][j] ) );

}

printf("Path matrix P%d of the given graph is :\n",k);
display(path,n);

}/*End of main() */

Program for Depth First Search for an un-directed Graph using C

2011-12-01T09:21:00.001+05:30

#include

#define MAX 10
int n;
int adj[MAX][MAX];
int visited[MAX];

void readmatrix()
{
    int i,j;
    printf("\nEnter the number of Vertices in the Graph : ");
    scanf("%d",&n);
    printf("\nEnter the Adjacency Matrix\n\n");
    for (i = 1; i <= n; i++)
        for (j = 1; j<= n; j++)
            scanf("%d",&adj[i][j]);
    for (i = 1; i <= n; i++)
        visited[i] = 0;
}

int dfs(int start)
{
    int stack[MAX];
    int top=-1,i;
    printf("%d - ",start);
    visited[start]=1;
    stack[++top]=start;
    while(top!=-1)
    {
      start=stack[top];
      for(i=1;i<=MAX;i++)
      {
         if(adj[start][i]&&visited[i]==0)
          {
             stack[++top]=i;
             printf("%d-",i);
             visited[i]=1;
             break;
           }
       }

     if(i==MAX)
             top--;
    }
    return 0;
}

int main()
{

    int source;
    printf("\n Program for Depth First Search for an un-directed Graph");
    readmatrix();
    printf("\nEnter the Source : ");
    scanf("%d",&source);
    printf("\nThe nodes visited in the DFS order is : ");
    dfs(source);
    printf("\n");
    return 0;
}

Program for Breadth First Search in a graph using C

2011-12-01T09:20:00.001+05:30

#include

#define MAX 10

int n;
int adj[MAX][MAX
];
int visited[MAX];
void readmatrix()
{
    int i,j;
    printf("\nEnter the number of Vertices in the Graph : ");
    scanf("%d",&n);
    printf("\nEnter the Adjacency Matrix\n\n");
    for (i = 1; i <= n; i++)
        for (j = 1; j<= n; j++)
            scanf("%d",&adj[i][j]);
    for (i = 1; i <= n; i++)
        visited[i] = 0;
}

void bfs(int source)
{
    int queue[MAX];
    int i, front, rear, root;
    front = rear = 0;
    visited[source] = 1;
    queue[rear++] = source;
    printf("%d   ",source);
    while (front != rear)
    {
        root = queue[front];
        for (i = 1; i <= n; i++)
            if (adj[root][i] && !visited[i])
            {
                visited[i] = 1;
                queue[rear++] = i;
                printf("%d   ",i);
            }
        front++;
    }
}

int main()
{
    int source;
    printf("\n Program for Breadth First Search for a un-directed Graph");
    readmatrix();
    printf("\nEnter the Source : ");
    scanf("%d",&source);
    printf("\nThe nodes visited in the BFS order is : ");
    bfs(source);
    return 0;
}

Journal of Computer Applications

2011-11-30T14:36:00.001+05:30

PHP Interview Questions

2011-09-21T10:41:00.002+05:30

PHP Interview Questions

PHP E-books

PHPInterview Questions

Tech Preparation

Carrerride.com

About Wipro

2011-09-20T10:58:00.001+05:30

From the Internet the following are the details gathered about the WIPRO.

Profile

Profile

Profile

More on Wipro Questions

Wipro 2010

2011-09-20T10:24:00.000+05:30

WIPRO Paper on 27 March 2010 @ Bangalore

1)APTITUDE TEST:

There was individual cut off for all the sections

Section1- English, 15 questions

Directions 1-5 : Pick out the most effective word from the given words to fill in the blank to make the sentence meaningfully complete

1. While facts are ________ and data hard to come by, even scientists occasionally throw side the professional pretense of
______ and tear into each other with shameless appeals to authority and arguments that shameless appeals to authority and
arguments that are unabashedly ad hominid.

a. elusive...objectivity
b. establish...courtesy
c. demonstrate .. neutrality
d. ineluctable...cooperation
ANS: (A)

2. While the disease is in ______ state it is almost impossible to determine its existence by_____ .

a. a dormant ..postulate
b. a critical...examination
c. an acute ...analysis
d. a latent...observation
ANS: (d)

3. The storehouse was infested.........................rats.

A) by B) of C) with D) in

Ans: C

4. Please distribute these sweets........................the children

A) in B) between C) amid D) among

Ans: D

5. This custom seems to have originated .....................and East European country

A) in B) from C) by D) with

Ans: A

Directions 6-10: The following questions, consist of two words each that have a certain relationship to each other, followed by four lettered pairs of words. Select the lettered pair that has the same relationship as the original pair of words.

6. OFFHAND : PREMEDITATION : :

a. upright : integrity b. aboveboard : guile c. cutthroat : competition d. backward : direction
ANS: (b)

7. POLTERGEIST : APPARATION::

a. dwarf : stature b. witch : familiar c. ogre : monster d. sorcerer : spell
ANS: (c)

8.AVER : AFFIRMATION : :

a. proclaim: objection b. denounce : defiance c. refuse : distress d. demur : protest
ANS. (d)

9. Duralumin : Aircraft

A) Brass : Alloy B) Stone : Sculptor C) Iron : Steel D) Bronze : Statue

Ans: D

10. Cool : Frigid

A) Livid :Lurid B) Pool : Placid C) Tepid : Torried D) Lack : Abundant

Ans : C

Direction 11-13 : In each of the following questions, find out which part of the sentence has an error. if there is no mistake the answer is 'no error'

11. If I was you / I would have / terminated his services then and there / No error

A B C D

Ans : A

12. as soon as I will reach Bombay / I will send / you the books / you have asked for / No error

A B C D E

Ans: A

13. Our conception of / what should a science of mental life be / has changed considerably since James' time / No error
A B C D

Ans : B

Directions 14-15 : In each of the following questions, a sentence has been given in Active (or passive) voice. Out of the four alternatives suggested select the one which best express the same sentence in Passive (or Active) Voice.

14. Do you imitate others ?

A) Are others imitated by you ?

B) Are others being imitated by you ?

C) Were others being imitated by you ?

D) Have others been imitated by you ?

Ans : A

15. I saw him conducting the rehearsal.

A) He was seen conducting the rehearsal

B) I saw the rehearsal to be conducted by him

C) He was seen by me to conduct the rehearsal

D) I saw the rehearsal being conducted by him

Ans : D

Section2-apptitude 15 questions

The questions 1-2 are based on the following data

6 people A,B,C,D,E and F sit around a table for dinner. Since A does not like C, he doesn't sit either opposite or
beside C.B and F always like to sit opposite each other.

1. If A is beside F then who is are the two neighbours of B?

(a) D and C
(b) E and C
(c) D and E
(d) Either (a) or (b)

Ans. (c)

2. If D is adjacent to F then who is adjacent to C?

(a) E and B
(b) D and A
(c) D and B
(d) either (a) or (c)

Ans.(d)

3. Complete the sequence A, E ,I ,M ,Q ,U , _ , _

(a) B, F
(b) Y, C
(c) G, I
(d) K, O

Ans.(b)

4. If the letters of the word "rachit" are arranged in all possible ways and these words are written out as in a dictionary,
what is the rank of the word "rachit".

(a) 485
(b) 480
(c) 478
(d) 481

Ans. (d)

5. Ravi's salary was reduced by 25%.Percentage increase to be effected to bring the salary to the original level is

(a) 20%
(b) 25%
(c) 33 1/3%
(d) 30%

Ans. (c)

6. A and B can finish a piece of work in 20 days .B and C in 30 days and C and A in 40 days. In how many days
will A alone finish the job

(a) 48
(b) 34 2/7
(c) 44
(d) 45

Ans. (a)

7. How long will a train 100m long travelling at 72kmph take to overtake another train 200m long travelling at 54kmph ?

(a) 70sec
(b) 1min
(c) 1 min 15 sec
(d) 55 sec

Ans. (b)

8. What is the product of the irrational roots of the equation (2x-1)(2x-3)(2x-5)(2x-7)=9?

(a) 3/2
(b) 4
(c) 3
(d) 3/4

Ans. (a)

9. The total population of a village is 5000. The number of males and females increases by 10% and 15% respectively
and consequently the population of the village becomes 5600. what was the number of males in the village ?

A) 2000 B) 2500 C) 3000 D) 4000

Ans : C

10. Fresh fruit contains 68% water and dry fruit contains 20% water. How much dry fruit can be obtained from 100 kg
of fresh fruits ?

A) 32 kg B) 40 kg C) 52 kg D) 80 kg

Ans : B

11. If "segment" is coded as rffndou, then "ritual" is coded as

(a) shutbm
(b) qjutbk
(c) qhutbk
(d) qhubtk

Ans. (c)

12. If "football" is "cricket" ,"cricket" is "basketball" ,"basketball" is "volleyball","volleyball" is "khokho" and "khokho" is
cricket, which is not a ball game?

(a) cricket
(b) football
(c) khokho
(d) basketball

Ans. (a)

13. Which of the following is a recursive set of production

(a) S --> a|A, A --> S
(b) S --> a|A, A --> b
(c) S -->aA, A-->S
(d) None of these

Ans. (c)
14. A sum 's' is divided into 4 parts. second person gets Rs 10 more than first.3rd person is Rs 10 more than second,
4th is 10 more than 3rd.how much amount do 1st person get.

Ans: (s-60)/4
15. One ship goes along the stream direction 28 km and in opposite direction 13 km in 5 hrs for each direction. What is the
velocity of stream?

Ans: 1.5 kmph

Section3-technical ,20 questions

1. What sorting algos have their best and worst case times equal ?

Ans. O(nlogn) for mergesort and heap sort

2. What page replacement algorithm has minimum number of page faults ?

Ans. Optimality algorithm

3. What is the use of virtual base class in c++

Ans. Multiple lines between derived classes.

4. Assignment operator targets to _____

Ans. l-value
5. A byte addressable computer has memory capacity of 2 power m Kbytes and can perform 2 power n operations an
instruction involving three operands and one operator needs maximum of___________ bits

Ans. 3m + n
6. In round robin scheduling, if time quantum is too large then it degenerates to

Ans. FCFS
7. What data structures you should use for dictionary searching and it should be capable of doing spell check also ?

Ans: Hashing

8. What is the value of 121 base 4 + 84 base 16 ?

Ans : 2130
9. When the fn. is called where the return address is stored?

Ans. stack
10. C program code

int zap (int n)

{

if (n<=1)then zap=1;

else zap=zap(n-3)+zap(n-1);

}

then the call zap(6) gives the values of zap

[a] 8 [b] 9 [c] 6 [d] 12 [e] 15

Ans: b

11. Virtual memory size depends on

[a] address lines [b] data bus

[c] disc space [d] a & c [e] none

Ans : a
12. Critical section is

Ans: statements which are accessing shared resources

13. In which layer ROUTING is performed ?
Ans. Network Layer

14. What is the output of the following code snippet

main()

{

printf(5+”Fascimile”);

}

Ans. mile
15. Which one has no L-Value

A a[i] B. i C. 2 D. *(a+i)

Ans . C
16. Which is true for binary search ?

A Traversal scheme B. Greedy algorithm

C. Divide and conquer algorithm D. none of these

Ans. C

17. What is the protocol used for getting the physical address by supplying IP address of a node ?

A. ARP B. RARP C. BOOTP D. DHCP

Ans. A

18. Which is not an OS?

a) Win 3.1 b) Win 95

c) Win 98 d) Win 2000

Ans. a

19. Tcp/ip is

a) connectionless b) connection oriented c) both a & b d) none

Ans: b
20. A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is

(a) Quick Sort (b) Heap Sort (c) Merge Sort (d) Insert Sort

Ans. (a)

wipro written Test

2011-09-20T10:22:00.002+05:30

Wipro written test question paper 28th Feb. 2011 at Hyderabad

1. Given the following statement enum day = { jan = 1 ,feb=4, april, may} What is the value of may?

(a) 4
(b) 5
(c) 6
(d) 11
(e) None of the above

2. Find the output for the following C program
main
{int x,j,k;
j=k=6;x=2;
x=j*k;
printf("%d", x);

3. Find the output for the following C program

fn f(x)
{ if(x<=0) > return;
else f(x-1)+x;
}

4. Find the output for the following C program

i=20,k=0;
for(j=1;j {k+=j<10?4:3;> }
printf("%d", k);

Ans. k=4

5. Find the output for the following C program

int i =10
main()
{int i =20,n;
for(n=0;n<=i;) > {int i=10;
i++;
}
printf("%d", i);

Ans. i=20

6. Find the output for the following C program

int x=5;
y= x&y

7.Find the output for the following C program

Y=10;
if( Y++>9 && Y++!=10 && Y++>10)
{printf("%d", Y);
else
printf("%d", Y);
}

Ans. 13

8. Find the output for the following C program

f=(x>y)?x:y

a) f points to max of x and y
b) f points to min of x and y
c)error

Ans. (a)

9. What is the sizeof(long int)

(a) 4 bytes
(b) 2 bytes
(c) compiler dependent
(d) 8 bytes

10. Which of the function operator cannot be over loaded

(a) <= > (b) ?:
(c) ==
(d) *

Wipro Placement Questions

2011-09-20T10:21:00.000+05:30

Wipro Placement Paper on 21st April 2011 at Bangalore

1. If a man buys 1 lt of milk for Rs.12 and mixes it with 20% water and sells it for Rs.15, then what is the percentage of gain?

2. Pipe A can fill a tank in 30 mins and Pipe B can fill it in 28 mins.If 3/4th of the tank is filled by Pipe B alone and both are opened, how much time is

required by both the pipes to fill the tank completely ?

3. If on an item a company gives 25% discount, they earn 25% profit. If they now give 10% discount then what is the profit percentage.

4. A certain number of men can finish a piece of work in 10 days. If however there were 10 men less it will take 10 days more for the work to be

finished. How many men were there originally?

5. In simple interest what sum amounts of Rs.1120/- in 4 years and Rs.1200/- in 5 years ?

VERBAL

1. Please distribute these sweets........................the children

2. This custom seems to have originated .....................and East European country

NON VERBAL

1.How long will a train 1km long travelling at 75kmph take to overtake another train 500m long travelling at 94kmph ?

2.The total population of a village is 5500. The number of males and females increases by 80% and 65% respectively
and consequently the population of the village becomes 5600. what was the number of females in the village ?

3.A and B can finish a piece of work in 40 days .B and C in 60 days and C and A in 80 days. In how many days
will B alone finish the job ?

TECHNICAL

1.NVL : Null value function

2.TTITLE & BTITLE: control report headings & footers.

3.COMPUTE: control computations on subsets created by the BREAK command.

4.Minus: product of two tables listing only the non-matching rows.

5.Rollback work in the current transaction to be undone.

6.few differences between Unicode character encoding to that of ASCII.

7.With help of DBMS what is the differences between shared and exclusive locks ?

8.what is the primary difference between applets and conventional web applications ?

9.In the context of memory management schemes what is the primary difference between swapping and paging ?

Wipro Questions

2011-09-20T10:19:00.002+05:30

WIPRO Interview Questions on 9th January 2011 at Bangalore

Q.1. Consider a string variable stroriginal holding a string value in its memory. Consider the following lines of C code.
strcpy(strdummy,stroriginal);
strreversed = strrev(strdummy);

If stroriginal is a palindrome which of the following statements is true.

a) strcmp(stroriginal,strreversed) is 0
b) strcmp(stroriginal,strrev(strreversed)) is 1
c) strcmp(stroriginal,strreversed) is 1

Answer :- Option a) is the right answer. If the string is a palindrome the strcmp will return 0 while comparing the original and the reversed string.

Q.2. Consider the following lines of C code :

int i,j,summ,lim;
i=0;
j=1;
for(lim = 1; lim <= 10; lim++)
{
summ = j + i;
i = j;
j = sum;
printf("%d",summ);
}

What kind of sequence the above code will generate ?

a) Even Numbers
b) Arithmetic Progression
c) Fibonacci Series

Answer :- The above code would generate option c) Fibonacci Series

Q.3. State True or False. Recursion Type Programming can be used to generate Fibonacci series in C

Answer :- True. Fibonacci series can be generated by recursion programming.

Q.4. Can you say few differences between Unicode character encoding and that of ASCII.

Answer :-Unicode uses 16 bits to encode characters and symbols whereas ASCII uses only 8 bits. Unicode has become a universal standard due to the fact that they can represent far great letters than ASCII. Unicode can be used hassle free to encode several regional languages other than English.

Q.5. With reference to DBMS like Oracle or Sybase, can you tell the differences between shared and exclusive locks ?

Answer :-Multiple transactions use shared locks during database read operations (SELECT Queries) as no data modification is involved. However if a transaction wants to change value of column/columns in single or multiple rows, it acquires an exclusive lock which will not be open to other transactions simultaneously.

Q.6. Can you tell the primary difference between applets and conventional web applications ?

Answer :-Applet is a program that would be downloaded to browser and run on local CPU whereas web applications get executed on server.

Q.7. In the context of memory management schemes, can you tell a primary difference between swapping and paging?

Answer :-Paging refers to writing and reading individual pages (fixed size) of a program to secondary memory (during program execution). Swapping refers to swap an entire program with another in secondary memory during heavy resource utilization.

Q.8. What is RAID ? What is its purpose ?

Answer :- RAID stands for Redundant Array of Independent Disks. It refers to a group of redundant disks (2 or more) which offers fault tolerance towards memory failures.

Q.9.Name the unique address that is stored on ROM on the network adapter card.

Answer :-MAC (Media Access Control) Address is the answer.

Q.10.How to find the maximum number of IPs that can be assigned to a PC.

Answer :-A simple rule to identify the number of NICs or Network Interface Cards. An equal number of IPs can be assigned (provided the OS supports).

Q.11.Tell one good programming requirement that illustrates the fact that C is a strongly typed language ?

Answer :-C involves variable declarations before their usage. This makes it clear that C is strongly typed.

Q.12. Consider a weather report application in C where any change in temperature by +- 2 degrees will be constantly reported to the system and the application should store the times of the day when these changes took place. Which is a better data structure to be used in this scenario - an array or a linked list ?

Answer :-Linked List would handle dynamically growing data very well when compared to arrays. Hence it would be a better choice.

Q.13.Can one use arrays to implement stacks or queues over linked lists ? Is it feasible ?

Answer :-Thought linked lists are commonly used for implementing stacks or queues, with good programming logic, arrays can also be used to implement those. However, as you would expect, linked lists are far more efficient in this scenario.