Mscit (DS)

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 24

1.

Student Profile:

Guru Nanak College Budhlada


MSC IT I, 2021-22
S Roll
No No Reg No. Student Name Category Contact No. City

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

6 806 5111-17-508 MOHIT SHARMA GENERAL 7087768980 BHIKHI

5111-2017- DAVINDER
7 807 1326 SHARMA GENERAL 9501105767 GAMMIWALA

8 808 5111-2020-977 ANMOL KUMAR GENERAL 7056065636 SIRSA

9 809 5111-2017-482 INDERJEET KAUR GENERAL 7888371867 BARETA

10 810 5111-13-887 BUTA SINGH GENERAL 9872302170 BUDHLADA

11 811 JASPREET SINGH SPORTS 700977925 BATHINDA

12 812 511-2017-846 OMKAR SINGH SPORTS 7009518145 PATIALA

GURLOVELEEN
13 813 5111-17-1671 SINGH SPORTS 9815072344 FEROZPUR
2. Time Table:

Time Table 2021-22

S. No Name I II III IV V

MSC IT 1 & PGDCA


BCA I & MSC IT MSC IT 1 &
BA I RDBMS LAB
Amandeep BVOC SD I Data and MSC IT
1 Data File RDMS and Computer
Kaur
Structure Structure Oracle Science
3. Syllabus
SYLLABI
OUTLINES
FOR
PAPERS AND TESTS

M.Sc. (IT) Semester II


Sessions 2020-21 & 2021-2022

Code No. Title of Paper Lectures Univ. Exam. Int. Ass.


per Week Marks Marks

MITM1201T Object Oriented 5 70 30


Programming Using C++

MITM1202T Data and File Structures 5 70 30

MITM1203T Visual Basic 5 70 30

MITM1204T RDBMS and Oracle 5 70 30

MITM1205L Programming Lab – II 8 70 30

MITM1206L Programming Lab – III 8 70 30

CONTINUOUS ASSESSMENT (THEORY PAPERS)

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.

2 Assignment/Quizzes : 20% of the marks allotted for Continuous


. Assessment

3 Attendance : 10% of the marks allotted for Continuous


. Assessment.

4 Class Participation and behavior : 10% of the marks allotted for Continuous
. Assessment.
MIMT-1202: Data and File Structures

Maximum Marks: 70 Maximum Time: 3 Hrs.


Minimum Pass Marks: 35% Lectures to be delivered: 45-55

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

Weekly Lesson Plan”

Weekly Lesson Plan


Date Class Subject Topics covered Teaching aids used
MSC
Data and File Intro to DS and types
15-3-2022 IT+LE Whiteboard
Structures of DS
Sem II
16-3-2022 Algorithm Analysis Whiteboard

Queue and its


17-3-2022 Whiteboard
operation

Memory
19-3-2022 representation of Whiteboard
queue

Dequeues,circular
21-3-2022 Whiteboard
queue

22-3-2022 Priority queue Whiteboard

24-3-2022 Application of queues Whiteboard

1 D Array and it’s


25-3-2022 Whiteboard
operation

28-3-2022 2 D array Whiteboard

29-3-2022 Row-major order Whiteboard

30-3-2022 Column major order Whiteboard


31-3-2022 Spare matrix Whiteboard

2-4-2022 Stack Basis Whiteboard


Representation of
6-4-2022 stack Whiteboard
in memory
7-4-2022 Stack operations Whiteboard
MSC
Data and File Applications of stack
9-4-2022 IT+LE Whiteboard
Structures
Sem II
Introduction to Linked
11-4-2022 Whiteboard
list, Operation
Implementation of
13-4-2022 linked-list & Types of Whiteboard
linked-list

16-4-2022 Merge sort, Radix sort Whiteboard

Quick sort, selection


18-4-2022 Whiteboard
sort

Heap sort, insertion


19-4-2022 Whiteboard
sort

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

Direct access storage


26-4-2022 Whiteboard
devices
Processing sequential
27-4-2022 files, advantages and Whiteboard
disadvantages
Processing of direct
28-4-2022 files, advantages and Whiteboard
disadvantages
Indexed file
organization,
29-4-2022 processing of file, Whiteboard
advantage and
disadvantages
MSC
Data and File Graph and its
30-4-2022 IT+LE Whiteboard
Structures terminology
Sem II
Adjacency matrix
2-5-2022 representation, Linked Whiteboard
List representation

4-5-2022 Operations performed Whiteboard


on graph

5-5-2022 Application of graph Whiteboard

6-5-2022 Threaded Binary tree Whiteboard

Binary search tree, B-


7-5-2022 Whiteboard
tree
5. Recommended Reference Books:

 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)

CLASS - MSC IT 1ST SEM-2nd, Attendance record

SUBJECT: Data and File Structures

Total Lectures Delivered=36

S.N0 Roll No Student Name MAR. APL. MAY. Total


2022 2022 Lectures
2022
(19) (5) Attended
(12)

1 10502 RAMPY KAUR 11 18 5 34

2 10504 MANPREET KAUR 10 15 5 30

3 10506 AMANJOT KAUR 11 16 4 31

4 10509 SARBJEET SINGH 11 17 5 33

5 10510 LOVELY GARG 11 16 5 32

6 10512 MAMTA KAUR 10 18 4 32

7 10513 GURDEEP SINGH 11 19 4 34

8 10514 KHUSHPREET SINGH 11 18 4 33

9 10515 RAMANDEEP KAUR 12 18 5 35

10 10516 GURPREET SINGH 11 17 4 32

11 10517 ASHISH KUMAR 11 19 5 35

12 10518 RAJWINDER SINGH 12 19 5 36

CLASS - MSC IT LE SEM-2nd, Attendance record

1 801 GURDHIYAN SINGH 11 17 4 32

2 802 HUSANPREET 10 16 3 29
SHARMA

3 803 PRINKA RANI 11 18 5 34

4 804 JYOTI 11 18 5 34

5 805 ISHAN TANEJA 11 17 4 32

6 806 MOHIT SHARMA 10 17 3 30

7 807 DAVINDER SHARMA 11 18 4 33

8 808 ANMOL KUMAR 11 19 4 34

9 809 INDERJEET KAUR 12 17 5 34

10 810 BUTA SINGH 11 17 5 33

11 811 JASPREET SINGH 11 16 5 32

12 812 OMKAR SINGH 12 17 3 32

GURLOVELEEN
11 4
13 813 SINGH 18 33

7. Detail of Weak and Brilliant Students


LIST OF INTELLIGENT STUDENTS:
10515, 10518, 10502
LIST OF WEAK STUDENTS:
810, 803 ,805
8.Record of Internal Assessment and Evaluation:
1 Two tests will be conducted during the Semester. : 60% of the marks allotted for
. Both the tests will be considered for assessment. Continuous Assessment

2 Assignment/Quizzes : 20% of the marks allotted for


. Continuous Assessment

3 Attendance : 10% of the marks allotted for


. Continuous Assessment.

4 Class Participation and behavior : 10% of the marks allotted for


. Continuous Assessment.

Guru Nanak College Budhlada Mansa


M.Sc IT-I Semester- II Session: May 2022
SUBJECT: Data and File Structures
Teacher Name: Amandeep Kaur

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:

Guru Nanak College Budhlada Mansa


M.Sc IT- LE Semester- IV Session: May 2022
SUBJECT:DATA Structure And File System
Teacher Name:Amandeep Kaur
Sr Test Class
N college s Assessment( Attenda Particip Total
o Exam_RollNo _rollno name (18) 6) nce(3) ation (3)
1 113501 803 PRINKA RANI 16 6 3 3 28
2 113502 804 JYOTI 17 6 3 3 29
3 113503 809 INDERJEET KAUR 16 6 3 3 28
4 113504 OMKAR SINGH 16 6 3 3 28
5 113505 806 MOHIT SHARMA 16 6 3 3 28
6 113506 811 JASPREET SINGH 15 6 3 3 27
7 113507 805 ISHAN TANEJA 16 6 3 3 28
HUSANPREET
15 6 3 3
8 113508 802 SHARMA 27
GURLOVELEEN
16 6 3 3
9 113509 813 SINGH 28
10 113510 801 GURDHIYAN SINGH 16 6 3 3 28
11 113511 807 DAVINDER SHARMA 15 6 3 3 27
12 113512 810 BUTA SINGH 16 6 3 3 28
13 113513 808 ANMOL KUMAR 17 6 3 3 29

9.Test Record (MST) QUESTION PAPER

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

Data and File Structures


M.Sc IT-I
SEMESTER-II
MAX MARKS: 70 TIM3HOURS
Note: Attempt two questions from Section A and two questions from Section B. Section
C is compulsory.
Section A
I. Explain Array. Define types of Array. How 2D array is represented in memory.
II. What is Stack? Define operations on stack. Write an algorithm to insert and delete
elements in stack.
III. What do you mean by Linked List? What operations we can perform on Linked list.
Explain insertion in linked list.
IV. Define Queue. Explain types of queues in detail 10.5*2=21
Section B
V. What do you mean by Graph? How we can represent graph in memory? Explain
Adjacency matrix representation.
VI. Explain Quick Sort with the help of example.
VII. What is File organization? Explain Sequential file organization in detail giving it’s
merits and demerits.
VIII. Define Hashing. Explain various Hashing techniques. 10.5*2=21

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 .

Guru Nanak College Budhlada (Mansa)


MSC IT 1st Session 2021-22
MST 1 Record
SUBJECT:Data and File structures
S NO Roll No Student Name Marks(25)
10502 RAMPY KAUR
1 22
10504 MANPREET KAUR
2 17
10506 AMANJOT KAUR
3 15
10509 SARBJEET SINGH
4 19
10510 LOVELY GARG
5 18
10512 MAMTA KAUR
6 15
10513 GURDEEP SINGH
7 15
10514 KHUSHPREET SINGH
8 17
10515 RAMANDEEP KAUR
9 23
10516 GURPREET SINGH
10 12
10517 ASHISH KUMAR
11 21
10518 RAJWINDER SINGH
12 23

801 GURDHIYAN SINGH


1 12
802 HUSANPREET SHARMA
2 14
803 PRINKA RANI
3 15
804 JYOTI
4 23
805 ISHAN TANEJA
5 14
806 MOHIT SHARMA
6 15
807 DAVINDER SHARMA
7 12
808 ANMOL KUMAR
8 11
809 INDERJEET KAUR
9 14
810 BUTA SINGH
10 12
811 JASPREET SINGH
11 11
812 OMKAR SINGH
12 15
813 GURLOVELEEN SINGH
13 17

Guru Nanak College Budhlada(Mansa)


MSC IT 1st Session 2021-22
MST 2 Record
SUBJECT: Data and File Structures
S NO Roll No Student Name Marks(70)
1 10502 RAMPY KAUR 48
2 10506 AMANJOT KAUR 34
3 10509 SARBJEET SINGH 20
4 10510 LOVELY GARG 44
5 10513 GURDEEP SINGH 25
6 10514 KHUSHPREET SINGH 11
7 10515 RAMANDEEP KAUR 63
8 10516 GURPREET SINGH 40
9 10517 ASHISH KUMAR 57
10 10518 RAJWINDER SINGH 64
MSC LE Session 2021-22
3 803 PRINKA RANI 14
4 804 JYOTI 61
10 810 BUTA SINGH 8

10.Assignment Record
Best Assignment
Assignment Record Details

Guru Nanak College Budhlada(Mansa)


MSC IT 1st Session 2021-22
Attendance Record
SUBJECT: Data and File Structures
S NO Roll No Student Name Marks(10)
1 10502 RAMPY KAUR 8
2 10504 MANPREET KAUR 8
3 10506 AMANJOT KAUR 7
4 10509 SARBJEET SINGH 8
5 10510 LOVELY GARG 8
6 10512 MAMTA KAUR 7
7 10513 GURDEEP SINGH 8
8 10514 KHUSHPREET SINGH 8
9 10515 RAMANDEEP KAUR 9
10 10516 GURPREET SINGH 8
11 10517 ASHISH KUMAR 8
12 10518 RAJWINDER SINGH 9
MSC LE 1st Session 2021-22
1 801 GURDHIYAN SINGH 8
2 802 HUSANPREET SHARMA 7
3 803 PRINKA RANI 8
4 804 JYOTI 9
5 805 ISHAN TANEJA 8
6 806 MOHIT SHARMA 7
7 807 DAVINDER SHARMA 8
8 808 ANMOL KUMAR
8
9 809 INDERJEET KAUR
7
8 810 BUTA SINGH 7
9 811 JASPREET SINGH 8
10 812 OMKAR SINGH 8
11 813 GURLOVELEEN SINGH 9

You might also like