3261: Foundations of Computer Software KL Diploma Syllabus for IT 3rd Sem 2015 Revision SITTTR

Foundations of Computer Software detailed syllabus for Information Technology (IT) for 2015 revision curriculum has been taken from the SITTTRs official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Information Technology 3rd Sem scheme and its subjects, do visit IT 3rd Sem 2015 revision scheme. The detailed syllabus of foundations of computer software is as follows.

Course Outcomes:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Specific Outcomes:

MODULE – I: Introduction to Data Structures

1. Understand the concepts of data structures
   1. Define Data Structures
   2. Explain basic data structures
   3. Recall the concept of Arrays
2. Discuss linear data structures
   1. Discuss stacks and its operations.
   2. Describe Queue and its operations.
   3. Explain a circular queue
   4. Describe a priority queue
   5. Explain about de-queue
   6. Define a linked list.
   7. Discuss the Linked List operations- Insertion, deletion and searching.

MODULE – II: Searching, Sorting, Tree and Graph

1. Analyze standard algorithms for searching and sorting.
   1. Differentiate between various searching methods.
   2. Explain linear search.
   3. Illustrate binary search.
   4. Define Sorting.
   5. Explain Selection sort.
   6. Describe bubble sort.
   7. Discuss insertion sort.
   8. Explain quick sort
   9. Describe merge sort
   10. Differentiate between the sorting methods Bubble Sort, Selection Sort and Insert Sort
2. To understand the non-linear data structures
   1. Define Tree and Binary tree.
   2. Differentiate between the various tree traversal methods
   3. Define Graph
   4. Explain Depth First searching in Graph
   5. Explain Breadth first searching in Graph

MODULE – III: Basics of System Software and Operating Systems

1. Discuss different system software
   1. Define Software
   2. Differentiate between Application software and System Software
   3. Compare various system software.
   4. Discuss fundamentals of system software.
   5. Explain about language translator.
2. Discuss about operating systems
   1. Define Operating System
   2. Recognize usage of operating systems.
   3. List different types of operating systems.
   4. Explain batch processing system.
   5. Discuss multi programmed system.
   6. Describe a time sharing system.
3. Discuss process management concepts
   1. Define Process
   2. Explain the process states
   3. Define Process Control Block.
   4. Discuss process scheduling algorithms- FCFS, SJF, Round Robin, Priority Scheduling.

MODULE – IV: Memory management, I/O Systems, File System 4.1Understand the concepts of memory management

1. Discuss the need for memory management
2. Explain dynamic loading.
3. Describe swapping.
4. Discuss the concept and need of paging
5. Describe segmentation.
6. Explain virtual memory concept.
7. Compare the various page replacement algorithms.
1. Discuss File System and I/O system concepts
   1. Explain the file concept
   2. Discuss the File Access methods
   3. Compare the various Directory Structures.

MODULE – I:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

MODULE – II:

Searching, Sorting, Tree and Graph Searching & Sorting- linear search, binary search; Selection sort, Insertion sort, Bubble sort, Merge sort, Quick sort, Comparison of different sorting methods(based on applications); Trees & Graphs – Trees – Binary Trees – Tree Traversal – In order – Pre order and Post order. Graphs: – Depth first and breadth first search.

MODULE – III:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

MODULE – IV:

Memory management, I/O Systems, File System Memory management:Dynamic loading, swapping, Paging- basics, Segmentation, Virtual memory-page replacement algorithms; I/O systems- basics, File-System- File Concept, Access Methods, Directory Structure.

Text Books:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Reference Books:

1. R Krishnamoorthy& G IndiraniKumaravel, Data Structures using C, McGraw Hill , New Delhi, 2008
2. Brijendra Kumar Joshi, Data Structures and Algorithms in C, McGraw Hill , New Delhi, 2010
3. Achyut S Godbole, Operating Systems, Tata McGraw Hill , New Delhi, 2nd Edition, 2009
4. D M Dhamdhere, Operating Systems A Concept-based Approach, Tata McGraw Hill, New Delhi, 2nd Edition, 2010
5. V Raghavan, Priniples of Compiler Design,Tata McGraw Hill, India, 2010

For detailed syllabus of all other subjects of Information Technology, 2015 revision curriculum do visit IT 3rd Sem subject syllabuses for 2015 revision.

To see the syllabus of all other branches of diploma 2015 revision curriculum do visit all branches of SITTTR diploma 2015 revision.