Mscit (DS)
Mscit (DS)
Mscit (DS)
Student Profile:
950126125
1 10502 5111-2018-1847 RAMPY KAUR SC 7 RIEOND KALAN
MANPREET 981537983
2 10504 5111-2018-281 KAUR SC 4 BUDHLADA
814678480
3 10506 5111-2017-1511 AMANJOT KAUR GENERAL 2 MAL SINGH WALA
SARBJEET 828496537
4 10509 5111-18-1854 SINGH SC 7 DHARMGARH
730780906
5 10510 5111-18-1482 LOVELY GARG GENERAL 6 CHEEMA
814623064
6 10512 5111-18-1858 MAMTA KAUR SC 7 DASKA
GURDEEP 946362913
7 10513 5111-18-1487 SINGH SC 7 TOLAWAL CHEEMA
KHUSHPREET 905650866
8 10514 5111-18-1483 SINGH GENERAL 5 KULRIAN
RAMANDEEP 946361702
9 10515 5126-17-202 KAUR GENERAL 4 AHEMDPUR
GURPREET 828403304
10 10516 5111-18-1478 SINGH BC 6 BACHHOANA
977945865
11 10517 5111-18-1846 ASHISH KUMAR GENERAL 7 MANSA
RAJWINDER 828383803
12 10518 5132-2017-301 SINGH SC 9 MATTI
MSC-LE, 2021-22
GURDHIYAN
1 801 2112-14-641 SINGH GENERAL 9023149298 BATHINDA
HUSANPREET
2 802 5111-2015-783 SHARMA GENERAL 9463921675 PHAPHRA BHAI KA
3 803 5111-2017-187 PRINKA RANI GENERAL 7347251877 KOT DHARMU
5111-2019-
4 804 1483 JYOTI GENERAL 6239443646 BUDHLADA
5111-2016-
5 805 1007 ISHAN TANEJA GENERAL 9915438053 BUDHLADA
5111-2017- DAVINDER
7 807 1326 SHARMA GENERAL 9501105767 GAMMIWALA
GURLOVELEEN
13 813 5111-17-1671 SINGH SPORTS 9815072344 FEROZPUR
2. Time Table:
S. No Name I II III IV V
1 Two tests will be conducted during : 60% of the marks allotted for Continuous
. the Semester. Both the tests will Assessment
be considered for assessment.
4 Class Participation and behavior : 10% of the marks allotted for Continuous
. Assessment.
MIMT-1202: Data and File Structures
Course Objective: This course is designed to explore computing and to show students the
art of practical implementation and usage of Algorithms and Data Structures. On
completion of this course, the students will be able to
Be familiar with basic data structure of algorithms.
Design and analyze programming problem statements
Choose appropriate data structures and algorithms and use it to design algorithms for
a specific problem.
Handle operations like searching, insertion, deletion and traversing mechanism
Come up with analysis of efficiency and proofs of correctness
Course Content
SECTION A
Data Structure: Introduction to data structure and algorithm, Algorithm analysis: Time space
trade off algorithms and Big O notation. Arrays: Introduction, one dimensional and
multidimensional arrays, memory representation of arrays, operations on arrays, sparse arrays
and sparse matrices and their implementation, Advantages and limitation of arrays.
Stacks: Introduction; Operation on stacks; Implementation of stacks, Application of stacks:
matching parenthesis, evaluation of arithmetic expressions, conversion from infix to postfix,
recursion.
Queues: Introduction, operation on queues, circular queue, memory representation of queues,
dequeues, priority queues, application of queues.
Linked List: Introduction; operation on linked list, circular linked list, doubly linked list,
header linked list, implementation of linked list, application of linked lists.
Trees: Introduction; Binary Tree; Threaded Binary Trees; Binary Search Tree; Balanced
Trees; B-Trees; Heap
SECTION B
Graphs: Introduction Graph: Graph terminology, Memory Representation of Graphs:
adjacency matrix representation of graphs, adjacency list or linked representation of graphs,
Operations performed on graphs, Application of graphs
Sorting: Selection Sort, Insertion Sort, Merge Sort, Bucket Sort, Radix Sort, Quick Sort and
Heap Sort
Hashing: Hashing techniques; Collision resolution; Deleting items from a hash table;
Application of hashing
File Organization: Introduction, External Storage Device: Sequential Access Storage Device
(SASD), Direct Access Storage Device (DASD) Sequential File Organization: processing
sequential files, operations on sequential files, advantages and disadvantages of sequential
file organization Direct File Organization: introduction, processing of direct files, advantages
and disadvantages of direct organization Indexed Sequential Organization: introduction,
processing of indexed sequential files, advantages and disadvantages of indexed sequential
organization
Pedagogy:
The Instructor is expected to use leading pedagogical approaches in the class room situation,
research-based methodology, innovative instructional methods, extensive use of technology
in the class room, online modules of MOOCS, and comprehensive assessment practices to
strengthen teaching efforts and improve student learning outcomes.
The Instructor of class will engage in a combination of academic reading, analyzing case
studies, preparing the weekly assigned readings and exercises, encouraging in class
discussions, and live project based learning.
Case/Class Discussion Assignments:
Students will work in groups of up to four to prepare a brief write-up due before the start of
each class covering the case study or class material to be discussed in the next session.
Questions may include a quantitative analysis of the problem facing the decision-maker in the
case.
Class Participation:
Attendance will be taken at each class. Class participation is scored for each student for each
class
Text and Readings: Students should focus on material presented in lectures. The text should
be used to provide further explanation and examples of concepts and techniques discussed in
the course:
A. Tanenbaum, Y. Lanhgsam and A.J. Augenstein, "Data Structures Using C", PHI.
Loomis, Marry,“Data Management and File Structures”, PHI
Seymour Lipschultz, “Theory and Practice of Data Structures", McGraw-Hill.
E. Horowitz and S. Sahni, “Data Structures with Pascal", Galgotia.
M. J. Folk, B. Zoellick, G Riccardi, “File Structures”, Pearson Education.
Scheme of Examination
English will be the medium of instruction and examination.
Written Examinations will be conducted at the end of each Semester as per the
Academic Calendar notified in advance
Each course will carry 100 marks of which 30 marks shall be reserved for internal
assessment and the remaining 70 marks for written examination to be held at the end
of each semester.
The duration of written examination for each paper shall be three hours.
The minimum marks for passing the examination for each semester shall be 35% in
aggregate as well as a minimum of 35% marks in the semester-end examination in
each paper.
A minimum of 75% of classroom attendance is required in each subject.
Instructions to the External Paper Setter
The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
Instructions for candidates
Candidates are required to attempt five questions in all, selecting two questions each
from section A and B and compulsory question of section C.
Use of non-programmable scientific calculator is allowed.
4. Action Plain of syllabus to be covered (Monthly distribution, Weekly distribution)
Lecture Distribution
MIMT-1202: Data and File Structures
SECTION A
1.Data Structure: Introduction to data structure and algorithm
2.Algorithm analysis: Time space trade off algorithms and Big O notation.
3.Arrays: Introduction, one dimensional and multidimensional arrays,
4. memory representation of arrays
5.operations on arrays
6. sparse arrays and sparse matrices and their implementation
7. Advantages and limitation of arrays.
8.Stacks: Introduction
9. Operation on stacks
10.Implementation of stacks
11. Application of stacks: matching parenthesis
12 evaluation of arithmetic expressions,
13.conversion from infix to postfix
14. recursion.
15. Queues: Introduction
16. operation on queues
17. circular queue, memory representation of queues
18.dequeues, priority queues
19. application of queues.
20.Linked List: Introduction; operation on linked list
21. circular linked list, doubly linked list
22. header linked list, implementation of linked list
23.application of linked lists.
24.Trees: Introduction; Binary Tree
25.Threaded Binary Trees; Binary Search Tree
26. Balanced Trees; B-Trees; Heap
SECTION B
27.Graphs: Introduction Graph: Graph terminology
28. Memory Representation of Graphs: adjacency matrix representation of graphs,
29.adjacency list or linked representation of graphs,
30.Operations performed on graphs
31.Application of graphs
32.Sorting: Selection Sort, Insertion Sort
33. Merge Sort, Bucket Sort
34. Radix Sort, Quick Sort
35. Heap Sort
36.Hashing: Hashing techniques
37.Collision resolution
38. Deleting items from a hash table
39. Application of hashing
40.File Organization: Introduction
41.External Storage Device: Sequential Access Storage Device (SASD)
42.Direct Access Storage Device (DASD)
43.Sequential File Organization: processing sequential files,
44.operations on sequential files
45. advantages and disadvantages of sequential file organization
46.Direct File Organization: introduction
47.processing of direct files
48. advantages and disadvantages of direct organization
49.Indexed Sequential Organization: introduction,
50. processing of indexed sequential files
51.advantages and disadvantages of indexed sequential organization
Memory
19-3-2022 representation of Whiteboard
queue
Dequeues,circular
21-3-2022 Whiteboard
queue
Hashing it’s
20-4-2022 Whiteboard
techniques
Collision resolution
21-4-2022 Whiteboard
and deleting items
Application of
22-4-2022 Whiteboard
Hashing
Introduction to File
23-4-2022 Whiteboard
organization
Sequential access
25-4-2022 Whiteboard
storage devices
A. Tanenbaum, Y. Lanhgsam and A.J. Augenstein, "Data Structures Using C", PHI.
Loomis, Marry,“Data Management and File Structures”, PHI
Seymour Lipschultz, “Theory and Practice of Data Structures", McGraw-Hill.
E. Horowitz and S. Sahni, “Data Structures with Pascal", Galgotia.
M. J. Folk, B. Zoellick, G Riccardi, “File Structures”, Pearson Education.
6. Lecture division (Lecture Statement)
2 802 HUSANPREET 10 16 3 29
SHARMA
4 804 JYOTI 11 18 5 34
GURLOVELEEN
11 4
13 813 SINGH 18 33
Class
Partici
pation
and
Sr Exam_R college Attendenc behavi Total(30
No. ollNo _rollno name Tests Assignment e our )
1 303101 RAMPY KAUR 16 6 3 3 28
RAMANDEEP
2 303102 10515 KAUR 17 6 3 3 29
3 303103 10504 MANPREET KAUR 17 5 2 2 26
4 303104 10512 MAMTA KAUR 16 6 3 2 27
5 303105 AMANJOT KAUR 15 5 3 3 26
6 303106 SARBJEET SINGH 16 6 3 3 28
RAJWINDER
7 303107 10518 SINGH 17 6 3 3 29
8 303108 LOVELY GARG 16 6 3 2 27
KHUSHPREET
9 303109 10514 SINGH 15 6 3 3 27
10 303110 GURPREET SINGH 16 5 3 2 26
11 303111 10513 GURDEEP SINGH 16 6 3 3 28
12 303112 10517 ASHISH KUMAR 16 6 3 3 28
Signature:
MST 1
FILE AND DATA STRUCTURES
M.Sc IT-I +LE
SEMESTER-II
MAX MARKS: 25
Note:Attempt any one question each from Section A and B. Section C is compulsory.
Section-A
1. Define Array and it’s memory representation.(8)
2. What is stack? Write algorithm for PUSH and POP.(8)
Section-B
3. Define linked list and insertion in linked list with algorithm. (8)
4. Define queue and it’s applications. (8)
Section-C
1. Time space trade off (3)
2. Binary search tree (3)
3. Types of queues (3)
MST 2
Section C
XI. Attempt all questions 7*4=28
(a)What do you mean by Time Space trade off.
(b) Differentiate between Tree and Graph
(c) Differentiate between Stack and Queue.
(d) Define Types of File organization
(e) What is Complexity and it’s types.
(f) Define Binary tree, binary search tree with example.
(g) What are types of sorting. Explain any one .
10.Assignment Record
Best Assignment
Assignment Record Details