Skip to main content

Featured Post

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

Representing STACK using one-dimensional ARRAY in 'C'

Representing STACK using one-dimensional ARRAY 

             STACK can be represented either horizontally or vertically as consecutive memory cells if it is implemented by Array. A variable TOP is used to store the current index. Initially when the STACK is empty TOP contains a 0 index when the lower bound of array is 1, it can be stored with -1 if the lower bound is 0.
   
Horizontal representation:


When ITEM is to be PUSHed, TOP is incremented by 1 and at TOP position of Array the ITEM is placed. When TOP is equal to N, the size of STACK, and PUSH operation is done, then ‘Overflow’ occurs. If an ITEM is to be POPped from the STACK, the ITEM placed at TOP index is removed (deleted) and TOP is decremented by 1. Remember here when deletion is done, the items stored in array are not changed only the index is changed. When POP operation is applied to an empty STACK (STACK is empty when TOP is 0) ‘Underflow’ occurs. 

Example 1: Consider a STACK of size 6.
PUSH 6 on to STACK. TOP is incremented by 1 and 6 is placed in the STACK at TOP position. TOP<---TOP+1 and STACK [TOP]<---6.
PUSH 7and 3 on STACK. To PUSH 7 TOP is incremented by 1 and 7 is placed at TOP position that is at second position. To PUSH 3 again TOP is incremented by 1 and 3 is placed at TOP position that is at third position. After these two operations the STACK becomes:
POP the STACK. To POP the ITEM stored at TOP index is copied in a variable, ITEM<---STACK[TOP],  and TOP is decremented by 1.
Example 2 Consider a STACK of size 8. The string “INDIA” CAN BE reversed using STACK.
                                                                              
Now repeatedly POP till the STACK is empty and write the POPped characters you will get the reversed string, AIDNI
Example 3: Consider a STACK of size 8. Using the STACK convert a decimal number 52 to binary number.

½=0, STOP. STACK creation is over. Now repeatedly POP till STACK is empty and write the POPped number you will get the binary equivalent of 52 i.e. 110100. 

       STACK is also used to evaluate a POSTFIX expression value and to convert an INFIX expression to POSTFIX expression.

Comments

Popular Post

Polynomial representation using Linked List for Data Structure in 'C'

Polynomial representation using Linked List The linked list can be used to represent a polynomial of any degree. Simply the information field is changed according to the number of variables used in the polynomial. If a single variable is used in the polynomial the information field of the node contains two parts: one for coefficient of variable and the other for degree of variable. Let us consider an example to represent a polynomial using linked list as follows: Polynomial:      3x 3 -4x 2 +2x-9 Linked List: In the above linked list, the external pointer ‘ROOT’ point to the first node of the linked list. The first node of the linked list contains the information about the variable with the highest degree. The first node points to the next node with next lowest degree of the variable. Representation of a polynomial using the linked list is beneficial when the operations on the polynomial like addition and subtractions are performed. The resulting polynomial can also

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

Memory representation of Linked List Data Structures in C Language

                                 Memory representation of Linked List              In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.                Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:       Suppose next node is allocated at an address 506, so the list becomes,   Suppose next node is allocated with an address with an address 10,s the list become, The other way to represent the linked list is as shown below:  In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of