BACHELOR OF COMPUTER APPLICATIONS Course Code : BCSL-033 Course Title : Data and File Structures Lab Assignment Number : BCA(3)/L-033/Assignment/17-18 Maximum Marks : 50 Weightage : 25% Write an algorithm and program for implementation of multiple stacks in an Array – IGNOU BCA Assignment 2017 – 18 CODE: #include <stdio.h> #define max 10 int… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(2)/021/Assignment/17-18 Maximum Marks : 100 Weightage : 25% Write an algorithm for the implementation of a Doubly Linked List – IGNOU MCA Assignment 2017 – 18 CODE: #include<stdio.h> struct node { int data; struct node *next; struct… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(2)/021/Assignment/17-18 Maximum Marks : 100 Weightage : 25% Write an algorithm for the implementation of an AVL tree – IGNOU MCA Assignment 2017 – 18 CODE: #include <stdio.h> #include <stdlib.h> struct avl_node_s { struct avl_node_s *left; struct… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(II)/021/Assignment/15-16 Maximum Marks : 100 Weightage : 25% Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them . #include <stdio.h> #define MAX 20 void insert_que1(int *,int *,int *,int); void insert_que2(int… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(II)/021/Assignment/15-16 Maximum Marks : 100 Weightage : 25% Write an algorithm for the implementation of a Dequeue . #include <stdio.h> #define max 10 int top1, top2, stk_arr[max]; void push(); void pop(); void display(); void main() { int… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Data and File Structures Assignment Number : MCA(2)/021/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Write an algorithm for the implementation of Circular Doubly Linked Lists. #include<stdio.h> struct node { int data; struct node *next; struct node *prev; }; typedef struct node… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-021 Course Title : Problem Solving and Programming Assignment Number : MCA(1)/021/Assign/13 Assignment 2013 Write an algorithm for the implementation of Circular Linked Lists. #include<stdio.h> struct node { int data; struct node *next; }; typedef struct node node; //with this Use “node” instead of “struct node”… Read More »