0 оценок0% нашли этот документ полезным (0 голосов)
20 просмотров3 страницы
WAP to create a linklist using structures and pointers and insert elements in the beginning, end and after an element. WAP to traverse the circular linklist.
WAP to create a linklist using structures and pointers and insert elements in the beginning, end and after an element. WAP to traverse the circular linklist.
Авторское право:
Attribution Non-Commercial (BY-NC)
Доступные форматы
Скачайте в формате DOCX, PDF, TXT или читайте онлайн в Scribd
WAP to create a linklist using structures and pointers and insert elements in the beginning, end and after an element. WAP to traverse the circular linklist.
Авторское право:
Attribution Non-Commercial (BY-NC)
Доступные форматы
Скачайте в формате DOCX, PDF, TXT или читайте онлайн в Scribd
1.1. Create an array such that it stores square of first ten even numbers? 1.2. WAP which stores the sum of two arrays such that the first array contains even numbers and second array contains odd numbers? 1.3. WAP such that it finds the elements of the diagonal elements in 5*5? 1.4. WAP such that it finds the sum of 2D array and stores it in 1D array? 2.Functions & Arrays 2.1. Write a function it reads an 2D array & calculate its product and return its product? 3.Structures 3.1. Create a structure that its data members are serial no., students name, student marks in five subjects & students total marks. Create a function to calculate the total marks and also create a function to check the highest scorer and the lowest scorer among all. 3.2. Create a structure employee whose data members are employee ID, name, salary, incentives, T.A. create a function to calculate the total take away from the employees and create a function to find maximum and minimum take away? 4.Linear linklist 4.1 WAP to create a linklist using structures & pointers and insert elements in the beginning, end & after an element. 4.2 WAP to delete element in the linklist using functions to delete from beginning, end & selected item. 4.3 WAP to traverse the single linklist. 5.Doubly linklist 5.1 WAP to create a linklist using structures & pointers and insert elements in the beginning, end & after an element. 5.2 WAP to delete element in the linklist using functions to delete from beginning, end & selected item. 5.3 WAP to traverse the doubly linklist. 6. Circular linklist 6.1 WAP to create a linklist using structures & pointers and insert elements in the beginning, end & after an element. 6.2 WAP to delete element in the linklist using functions to delete from beginning, end & selected item. 6.3 WAP to traverse the circular linklist. 7.Stack 7.1 WAP to push & pop elements in a stack using arrays. 7.2 WAP to push & pop elements in a stack using linklist. 8.Queue 8.1 WAP to insert & delete elements in a queue using arrays. 8.2 WAP to insert & delete elements in a queue using linklist. 9.Trees 9.1 WAP to insert & delete elements in a binary tree using linked list.