Scribd
Upload
80 views

Sharda University CMP-201: Data Structures Using 'C' Assignment: 01

The document contains 12 questions related to data structures and C programming. It asks the student to: 1) Convert infix to postfix expressions and evaluate postfix expressions using a stack. 2) Find the location of an element in a 3D array. 3) Write functions to push and pop nodes to/from a linked stack. 4) Write a function to delete a node from a dynamically allocated linked list. 5) Explain dynamic memory allocation and deallocation and differentiate between various functions. 6) Write codes for inserting and deleting nodes from linked and circular linked lists.

Uploaded by

Aditya Prakash
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
80 views

Sharda University CMP-201: Data Structures Using 'C' Assignment: 01

The document contains 12 questions related to data structures and C programming. It asks the student to: 1) Convert infix to postfix expressions and evaluate postfix expressions using a stack. 2) Find the location of an element in a 3D array. 3) Write functions to push and pop nodes to/from a linked stack. 4) Write a function to delete a node from a dynamically allocated linked list. 5) Explain dynamic memory allocation and deallocation and differentiate between various functions. 6) Write codes for inserting and deleting nodes from linked and circular linked lists.

Uploaded by

Aditya Prakash
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

SHARDA UNIVERSITY CMP-201: Data Structures using 'C' ASSIGNMENT: 01

Question 1 Change the following infix expression postfix expression. (A + B)*C+D/E-F Question 2 Question 3 Suppose a 3d array LA is declared using LA(3:8, -4:1, 6: 9), base(LA)=200, w=4. find loc of LA[2,-2,5]. (Row major order). Convert the expression (True && False) || !(False || True) to postfix expression. Show the contents of the stack at every step. Use a stack to evaluate the following postfix expression and show the content of the stack after execution of each operation. Don't write any code. Assume as if you are using push and pop member functions of the stack. AB-CD+E*+ (where A=5, B=3, C=5, D =4, and E=2) Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : 50,40,+,18, 14,-, *,+ Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : TRUE, FALSE, TRUE, FALSE, NOT, OR, TRUE, OR, OR, AND Write a program for creating polynomial using linked list? Each node of a STACK contains the following information, in addition to required pointer field : i) Roll number of the student ii) Age of the student Give the structure of node for the linked stack in question TOP is a pointer which points to the topmost node of the STACK. Write the following functions. i) PUSH() - To push a node to the stack which is allocated dynamically ii) POP() - To remove a node from the stack and release the memory.

Question 4

Question 5

Question 6

Question 7 Question 8

[Type text]

Question 9

Write a function in C to perform a DELETE operation in a dynamically allocated link list considering the following description : struct Node { float U,V; Node *Link; };

Question 10

What is dynamic memory allocation and deallocation? Differentiate between following (1) Malloc() , calloc(), new() (2) free(), delete(), realloc()

Question 11 Question 12

Write a code for inserting a node at the beginning, in between and end of linked list? Write a code for deleting a given information node from circular linked list?

[Type text]

You might also like