new—–regarding project guide list for the final year students

YOU CAN DOWNLOAD IT FROM THIS LINKproject guide

regards
MANU DEV
Asst.prof
sddiet, barwala

Advertisements
Posted in Uncategorized | Leave a comment

new– regarding project guidelines

The name of your principal in project files now would be written as Dr. MAMTA RATTI.

Posted in Uncategorized | Leave a comment

notice: project guidelines for final year students

YOU CAN DOWNLOAD IT FROM THIS LINk guidelines_for_project_work

regards
SUNIL SHARMA
HOD, MCA
sddiet, barwala

Posted in Uncategorized | Leave a comment

new notice—–project viva exam of final semester.

dear students,

project viva exam  of final year students  would be held on 08-05-2012 .  students are advised that they should come at 9:00 am in the department with project file.

HOD

mcadepartment

Posted in Uncategorized | Leave a comment

new notice—–practical exam of 2nd semester.

dear students,

practical eaxm  of 2nd semester would be held on 25-06-2012 .  students are advised that they should come at 9:00 am in the department with practical files. Also students who have not submit their fine come along with fine.

 

HOD

mcadepartment

Posted in Uncategorized | Leave a comment

new notice—- internal viva exam date for final year students

Dear students,

                    Internal viva exam would start from the 11-06-2012 onwards in the mcadepartment.(according to university roll no.). students should report in front of their guides with full preparations like with running project, running environment , CD that is whatever required to run their project. It should be noted that internal viva exam is of 100 and marks would be given as par your performance.

11-06-2012 = from roll no.  1 to 10.

12-06-2012 = from roll no.  11 to 20.

13-06-2012 = from roll no.  20 to 30.

14-06-2012 = from roll no.  30 to 40.

15-06-2012 = from roll no.  40 to till end.

 

regards

HOD

MCA DEPARTMENT

Posted in Uncategorized | Leave a comment

LIST OF PROGRAMS OF Data structures

 

1. wap to implement linear search.

2.wap to implement binary search,

3.wap to implement insertion sort and quick sort.

4.wap to implement matrix addition.

5.wap to insert element before given element in linear linked list.

6.wap to delete  element from the beginning in linear linked list.

7.wap to perform push and pop operations in the stack.

8.wap to implement string concatenation.

9.wap to implement dequeue operation in linear queue.

10. wap to implement enqueue operation in priority queue.

11.wap to implement binary tree traversal.

12wap to implement to insert new node in bst.

13wap to implement shortest path algorithm in graph.

14wap to implemention of inserting new node and deleting of node in graph.

 

Posted in Uncategorized | Leave a comment