Austudents
An Anna University Students Network
Data Structure Lab Codings and C Codings-Free Download
Aug 31st
DATASTRUCTURE LAB CODINGS
| Name Of The Program | Codings |
|---|---|
|
Travelling Salesman Problem using backtracking.
|
Get Code |
|
Program to search an element using binary search method
|
Get Code |
|
Program to compute factorial & generate fibonacci of a number
|
Get Code |
|
Knapsack Problem Using Backtracking
|
Get Code |
|
knapsack using dynamic programming
|
Get Code |
|
Program to find minimum spanning tree using kruskal’s algorithm
|
Get Code |
|
PROGRAM TO MULTIPLY TWO MATRIX USING STRASSEN’S TECHNIQUE
|
Get Code |
|
Program to sort the given number using divide & conquer technique.
|
Get Code |
|
Program to find the minimum and maximum no. in the list
|
Get Code |
|
NQUEEN PROBLEM
|
Get Code |
|
Program to build optimal bindary search tree
|
Get Code |
|
Program to count number of palindrome in the words
|
Get Code |
|
Raising 2 to the power of n
|
Get Code |
|
Prim s algorithm
|
Get Code |
|
Quick Sorting
|
Get Code |
|
Dijkstra’s shortest path algorithm
|
Get Code |
|
STRASSEN S MATRIX MULTIPLICATION
|
Get Code |
|
Subset Sum Problem
|
Get Code |
|
TOWER OF HANOI
|
Get Code |
|
Program to implement an array in Data Strcture.
|
Get Code |
|
DataStructure-Program to merge two 1-D arrays.
|
Get Code |
|
DataStructure-Program to perform operations matrix addition, multiplicaton.
|
Get Code |
|
DataStructure-Program for matrix operations dertminant, singular.
|
Get Code |
|
DataStructure-Program to add two polynomials.
|
Get Code |
|
DataStructure-Program to multiply two polynomials.
|
Get Code |
|
DataStructure-Program to perform some basic operations on string.
|
Get Code |
|
DataStructure-Program to check entered name in the master list.
|
Get Code |
|
DataStructure- Program to swap elements of array of pointers to strings.
|
Get Code |
|
DataStructure-Program to allocate memory dynamically.
|
Get Code |
|
DataStructure-Program to search for a string into another string.
|
Get Code |
|
DataStructure-string functions.
|
Get Code |
|
DataStructure-Program to maintain a linked list .
|
Get Code |
|
DataStructure-Program to add a new node to the asscending order linked list.
|
Get Code |
|
DataStructure-Program to reverse a linked list.
|
Get Code |
|
DataStructure-Program to merge two linked list.
|
Get Code |
|
DataStructure-Program to sort a linked list by swapping data.
|
Get Code |
|
DataStructure-Program to sort a linked list by readjusting the links.
|
Get Code |
|
DataStructure-Program to implement a circular queue as a linked list
|
Get Code |
|
Program to concatenate one linked list
|
Get Code |
|
DataStructure-Program to find the number of nodes in the linked list using recursion.
|
Get Code |
|
DataStructure-Program to compare two linked lists using recursion.
|
Get Code |
|
DataStructure-Program to copy one linked list into another using recursion.
|
Get Code |
|
DataStructure-Program to add a new node at the end of linked list using recursion.
|
Get Code |
|
DataStructure-Program to maintain a doubly linked list.
|
Get Code |
|
DataStructure-Program to add two polynomials maintained as linked lists.
|
Get Code |
|
DataStructure-Program to multiply two polynomials maintained as linked lists.
|
Get Code |
|
DataStructure-Program to create a 3-tuple from a given matrix .
|
Get Code |
|
DataStructure-Program to transpose a sparse matrix.
|
Get Code |
|
DataStructure-Program to add two sparse matrices.
|
Get Code |
|
DataStructure-Program to multiply two sparse matrices.
|
Get Code |
|
DataStructure-Program to store sparse matrix as a linked list.
|
Get Code |
|
DataStructure-Program implements array as a stack.
|
Get Code |
|
DataStructure-Program implements linked list as a stack.
|
Get Code |
|
DataStructure-Program to convert an Infix expression to Prefix form.
|
Get Code |
|
DataStructure-Program to convert an Infix form to Postfix form
|
Get Code |
|
DataStructure-Program to convert expression in postfix form to prefix form.
|
Get Code |
|
DataStructure-Program to convert an expression in postfix form to an infix form.
|
Get Code |
|
DataStructure-Program to evaluate an epression entered in postfix form.
|
Get Code |
|
DataStructure-Program that implements queue as an array.
|
Get Code |
|
DataStructure-Program that implements queue as a linked list.
|
Get Code |
|
DataStructure-Program that implements circular queue as an array.
|
Get Code |
|
DataStructure-Program that implements deque using an array.
|
Get Code |
|
DataStructure-Program that implements a priority queue using an array.
|
Get Code |
|
DataStructure-Program to build a binary search tree from arrays.
|
Get Code |
|
DataStructure-Program to implement a binary search tree.
|
Get Code |
|
DataStructure- Program to insert and delete a node from the binary search tree.
|
Get Code |
|
DataStructure-Program to maintain a threaded binary tree.
|
Get Code |
|
DataStructure-Program to maintain an AVL tree.
|
Get Code |
|
DataStructure-Program which maintains a B-tree
|
Get Code |
|
DataStructure-Program to maintain a heap.
|
Get Code |
|
DataStructure-Linear search in an unsorted array.
|
Get Code |
|
DataStructure-Linear search in a sorted array.
|
Get Code |
|
DataStructure-Binary search in a sorted array.
|
Get Code |
|
DataStructure-Bubble sort.
|
Get Code |
|
DataStructure-Selection sort.
|
Get Code |
|
DataStructure-Quick sort.
|
Get Code |
|
DataStructure-Insertion sort.
|
Get Code |
|
DataStructure-Binary Tree Sorting.
|
Get Code |
|
DataStructure-Heap Sort.
|
Get Code |
|
DataStructure-Merge Sort.
|
Get Code |
|
DataStructure-External Sorting.
|
Get Code |
|
DataStructure-depth first search algorithm.
|
Get Code |
|
DataStructure-breadth first search algorithm.
|
Get Code |
|
DataStructure-minimum cost of a spanning tree.
|
Get Code |
|
DataStructure-find the shortes path.
|
Get Code |
C LAB CODINGS
| Name Of The Program | Codings |
|---|---|
|
C Program for BANK OPERATION.
|
Get Code |
|
C Program for finding COS THETA Value
|
Get Code |
|
C Program for Exponential value.
|
Get Code |
|
C Program for factorial using recursion.
|
Get Code |
|
C Program for fibanacci series using recursion.
|
Get Code |
|
C Program for String Length.
|
Get Code |
|
C Program for Library Operation.
|
Get Code |
|
C PROGRAM FOR PASCAL TRIANGLE.
|
Get Code |
|
C Program for Prime Number Generation.
|
Get Code |
|
C Program For REPLACE OF STRING.
|
Get Code |
|
C Program For String Reverse.
|
Get Code |
|
C Program for salesman problem.
|
Get Code |
|
C Program for sine series.
|
Get Code |
|
C Program for STUDENT MARKLIST.
|
Get Code |
|
C Program for SubString.
|
Get Code |
|
C Program For to find largest and smallest value in two dimension matrix.
|
Get Code |
|
C Program For Matrix addition.
|
Get Code |
|
C Program For ARMSTRONG NUMBER.
|
Get Code |
|
C Program For FINDING ONE DIMENSIONAL ARRAY BIG AND SMALL ELEMENT.
|
Get Code |
|
C Program For FIBINACCI SERIES USING ARRAY.
|
Get Code |
|
C Program For ARRAY REVERSE.
|
Get Code |
|
C Program For ASCII VALUE
|
Get Code |
|
C Program For BINARY SEARCH.
|
Get Code |
|
C Program For SUM OF DIAGONAL ELEMENTS IN MATRIX.
|
Get Code |
|
C Program For TRANSPOSE MATRIX
|
Get Code |
|
C Program For MAKING NUMBER SERIES .
|
Get Code |
|
C Program For ORDER OF NUMBERS.
|
Get Code |
|
C Program For PALINDROME OF NUMBER.
|
Get Code |
|
C Program For PERFECT NUMBER.
|
Get Code |
|
C Program for PRIME NUMBER FINDING
|
Get Code |
|
C Program For UPPER TRIANGULAR MATRIX.
|
Get Code |
|
C Program For SWAPPING VALUES.
|
Get Code |
|
C Program For SUM OF DIGITS.
|
Get Code |
|
C Program For PRIME SERIES.
|
Get Code |
|
C Program For DUPLICATE ELIMNATION.
|
Get Code |
|
C Program For BINARY TO DECIMAL.
|
Get Code |
|
C Program For DECIMAL TO BINARY.
|
Get Code |
|
C Program For INSERTION SORTING.
|
Get Code |
|
C Program For BUBBLE SORTING.
|
Get Code |
|
C Program For NCR VALUE BY RECURSIVE FUNCTION.
|
Get Code |
|
C Program For FINDING POWER VALUE OF GIVEN NUMBER.
|
Get Code |
|
C Program For FACTORIAL USING RECURSION.
|
Get Code |
|
C Program For SELECTION SORTING.
|
Get Code |
|
C Program For FIBANACCI SERIES USING RECURSION.
|
Get Code |
International Conference on Advanced Computing during 14-16, Dec’2010
Aug 17th
ICoAC 2010 (International Conference on Advanced Computing) seeks to bring together international researchers to present papers and generate discussions on current research and development in latest trends in IT. The conference will feature a range of presentations on latest research as well as stimulating talks and keynote addresses
ICoAC 2010 is an international conference in the field of Computer Science and Communication focusing to address issues and developments in advanced computing. It is hosted by Department of Computer Technology annually during December. The Second edition of ICAoC will be held during 14-16 December, 2010. The first edition of icac has been held during 13-15 december 2009. Information Society is facing challenges due to the complexity of its structure in terms of networking, middleware, peer to peer applications, ubiquitous computing, pervasive computing with diverse usage in commercial, personal, communal and public domains, posing various critical issues to be addressed and solved.
The ICoAC 2010 is to provide a forum for International community to discuss and debate on the developments in the cutting edge technologies of computing.
The conference will feature peer-reviewed technical paper presentation with short-papers and posters, tutorial, student paper presentation and stimulating keynote talks.
Objective:
ICoAC 2010 seeks to bring together international researchers to present papers
and generate discussions on current research and developments in latest trends in
computing.
Theme of the conference is “Advanced Computing towards Knowledge Society.”
MIT – IT Dept. International Conference
Aug 17th
ICRTIT 201103-05 June, 2011ICRTIT 201103-05 June, 2011
Rapid development in the area of information technology in the past few years has led to unprecedented increase in the number of people using these technologies and also the interest in research and development. ICRTIT 2011 aims to bring together innovative academics, researchers and industrial experts in the field of Information Technology, Computer Science and Communications and allied fields to a common forum, for a constructive dialog on theoretical concepts and practical ideas. Practicing engineers and technologists, scientists from R & D Institutions, faculty members of engineering colleges, research scholars and postgraduate students are expected to participate in this conference. The conference venue is located at the Madras Institute of Technology campus of Anna University, Chennai, Tamil Nadu, India. This conference is technically & financially co-sponsored by IEEE Madras Section.
Venue of the Conference:
Rajam Hall,
Madras Institute of Technology,
Anna University Campus,
Chrompet,
Chennai,
Tamil Nadu,
India.
Brochure:
http://www.annauniv.edu/icrtit/res/brochure.pdf
