0

IT6212                  PROGRAMMING AND DATA STRUCTURES LABORATORY  I              L  T P  C

0  0 3 2

OBJECTIVES:

The students should be made to:

  • Be familiar with c programming
  • Be exposed to implementing abstract data types
  • Learn to use files
  • Learn to implement sorting and searching algorithms.

 

  1. C Programs using Conditional and Control Statements
  2. C Programs using Arrays, Strings and Pointers and Functions
  3. Representation of records using Structures in C – Creation of Linked List – Manipulation of records in a Linked List
  4. File Handling in C – Sequential access – Random Access
  5. Operations on a Stack and Queue – infix to postfix – simple expression evaluation using stacks - Linked Stack Implementation – Linked Queue Implementation
  6. Implementation of Sorting algorithms
  7. Implementation of Linear search and Binary Search.

 

 

 

OUTCOMES:

At the end of the course, the student should be able to:

 

TOTAL: 45 PERIODS

 

  • Design and implement C programs for implementing stacks, queues, linked lists.
  • Apply good programming design methods for program development.
  • Apply the different data structures for implementing solutions to practical problems.
  • Develop searching and sorting  programs.

 

LIST OF EQUIPMENTS FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C compiler           30 Nos. (or)

Server with C compiler supporting 30 terminals or more.

 

 

#################################################################################################

 

 

Post a Comment Blogger

 
Top