elearnxml.blogspot.com

cuteayan.blogspot.com

MY LITTLE THINKS: Pointers

http://cuteayan.blogspot.com/2010/12/pointers.html

View my complete profile. Monday, December 6, 2010. Subscribe to: Post Comments (Atom). हिन्दुस्तान के बारे में. Blogger Buzz: Blogger integrates with Amazon Assoc. Queues- Is Full - check if queue is full. Queues - Is Exmpty Queue function. Queues - Inserting item into queue. Queues - Deletion of item from queue. Circular Queues- Deletion of item from circular qu. Circular Queues- Insertion of item into circular q. Queues - Create Queue function. C Programming Questions III. C Programming Questions II.

cuteayan.blogspot.com

MY LITTLE THINKS: C Programming questions I

http://cuteayan.blogspot.com/2010/12/c-programming-questions-i.html

View my complete profile. Monday, December 6, 2010. C Programming questions I. C Programming questions I. Float r1=6.25,r2=2.5,a;. Area of the circle. Is %f", a);. Is %f", a);. What is the output. For(i=1;i 4,i ). Printf("%d",i);break;. Case 2:printf("%d",i);break;. Case 3:printf("%d",i);break;. Switch(i) case 4:printf("%d",i);. Char *s=" 12345s n";. Printf("%d",sizeof(s) ;. Char k= -1 = k=255; */. Signed j=-1; /* char k= -1 = k=65535 */. Or signed int k= -1 = k=65535 */. F(1,2,3);. F(int i,int j,int k).

cuteayan.blogspot.com

MY LITTLE THINKS: Queues - Inserting item into queue

http://cuteayan.blogspot.com/2010/12/queues-inserting-item-into-queue.html

View my complete profile. Monday, December 6, 2010. Queues - Inserting item into queue. Queues - Inserting item into queue. Function (Q , item). This procedure inserts an element ‘item’ at the rear-end of the queue, ‘Q’ only when it is not full. Variable ‘rear’ points to the element recently inserted. Queue overflow condition can be checked by making a call to Function ‘IsFull’. Step 1 checking overflow condition. If (IsFull (Q) then. Message: ‘Queue overflow’. Else goto step 2. Step 3 setting front value.

cuteayan.blogspot.com

MY LITTLE THINKS: Circular Queues- Deletion of item from circular queue

http://cuteayan.blogspot.com/2010/12/circular-queues-deletion-of-item-from.html

View my complete profile. Monday, December 6, 2010. Circular Queues- Deletion of item from circular queue. Circular Queues- Deletion of item from circular queue. This Function deletes an element from circular queue. Step 1 copying front index value to temporary variable. Set data CQ (item [Q(front)]. Step 2 setting values. If (CQ (front) = CQ(rear). Set CQ (front) = – 1. Set CQ(rear) = – 1. Elseif (CQ(front) = SIZE – 1). Set CQ (front) = 0. Set CQ(front ) ¬ CQ (front) 1. Equivalent C code is given below:.

cuteayan.blogspot.com

MY LITTLE THINKS: Queues - Is Exmpty Queue function

http://cuteayan.blogspot.com/2010/12/queues-is-exmpty-queue-function.html

View my complete profile. Monday, December 6, 2010. Queues - Is Exmpty Queue function. Queues - Is Exmpty Queue function. This Function checks the queue for an empty condition. If the queue is empty then it returns True otherwise it returns false. C code is given below:. Boolean IsEmpty (queue Q). If (Q  front = = – 1). Subscribe to: Post Comments (Atom). हिन्दुस्तान के बारे में. Blogger Buzz: Blogger integrates with Amazon Assoc. Queues- Is Full - check if queue is full. Queues - Create Queue function.

cuteayan.blogspot.com

MY LITTLE THINKS: The Basic sections of ‘C’ are explained taking an example::

http://cuteayan.blogspot.com/2010/12/basic-sections-of-c-are-explained.html

View my complete profile. Monday, December 6, 2010. The Basic sections of ‘C’ are explained taking an example:. The Basic sections of ‘C’ are explained taking an example:. A program to calculate average of 5 nos given by the user */. Defining of Constants and Inclusion Of Header Files- - - */. Start Of The Main Program- - - - - - - - - - - - - - - - -*/. Declaration of Variables- - - - - - - - - - - */. Int sum ;. Initialization of Values- - - - - - - - */. For (i=0; i =M; i ). Signed char, unsigned char.

cuteayan.blogspot.com

MY LITTLE THINKS: Stacks

http://cuteayan.blogspot.com/2010/12/stacks.html

View my complete profile. Monday, December 6, 2010. Stacks and queues are two very. A stack is a data structure in which. Addition of new element. Of existing element always takes place at the same end. This end is often known as. Of stack. This situation can be compared to a stack of. In a cafeteria where every new plate added to the stack is added at the. Similarly, every new plate taken off the stack is also from the. Etc Unlike a stack, in a queue the. Takes place at the end (. Of queue), whereas.

cuteayan.blogspot.com

MY LITTLE THINKS: learn c language

http://cuteayan.blogspot.com/2010/12/learn-c-language.html

View my complete profile. Monday, December 6, 2010. Subscribe to: Post Comments (Atom). हिन्दुस्तान के बारे में. Blogger Buzz: Blogger integrates with Amazon Assoc. Queues- Is Full - check if queue is full. Queues - Is Exmpty Queue function. Queues - Inserting item into queue. Queues - Deletion of item from queue. Circular Queues- Deletion of item from circular qu. Circular Queues- Insertion of item into circular q. Queues - Create Queue function. C Programming Questions III. C Programming Questions II.

cuteayan.blogspot.com

MY LITTLE THINKS: data stucture chapter

http://cuteayan.blogspot.com/2010/12/data-stucture-chapter.html

View my complete profile. Monday, December 6, 2010. How do you reverse a singly linked list? How do you reverse a doubly linked list? Write a C program to do the same. This is THE most frequently asked interview question. The most! Here are a few C programs to reverse a singly linked list. Struct node *next;. Globals (not required, though). Mynode *head, *tail, *temp;. Void add(int value);. Void iterative reverse();. Void print list();. Construct the linked list. WEDNESDAY, NOVEMBER 12, 2008. Used It cop...

cuteayan.blogspot.com

MY LITTLE THINKS: Queues - Create Queue function

http://cuteayan.blogspot.com/2010/12/queues-create-queue-function.html

View my complete profile. Monday, December 6, 2010. Queues - Create Queue function. Queues - Create Queue function. The above procedure creates an empty queue. Variable front and rear set to value – 1. C code is given below. Void create Q (queue *Q). Q  front = – 1. Q  rear = – 1;. Subscribe to: Post Comments (Atom). हिन्दुस्तान के बारे में. Blogger Buzz: Blogger integrates with Amazon Assoc. Queues- Is Full - check if queue is full. Queues - Is Exmpty Queue function. Queues - Inserting item into queue.