Tag Archives: implementation


Write an algorithm for the implementation of a multiple queues in a single dimensional array – IGNOU MCA Assignment 2015 – 16

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 »

Write an algorithm for the implementation of a Dequeue – IGNOU MCA Assignment 2015 – 16

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 »

A C program and algorithm to implement Circular Doubly Linked List – IGNOU MCA Assignment 2014 – 15

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 »

A C program and algorithm to implement Circular Linked Lists – IGNOU MCA Assignment 2014 – 15

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 »