Data Structures using C COMPUTER SCIENCE 3RD SEMESTER SYLLABUS

Data Structures using C COMPUTER SCIENCE 3RD SEMESTER SYLLABUS

Government of Karnataka Department of Technical Education Bengaluru

C	Course Title:     Data Structures using C
	Scheme (L:T:P) : 4:0:0	Total Contact Hours: 52	Course Code: 15CS41T
	Type of Course: Lectures, Self Study & Student Activity.	Credit :04	Core/ Elective: Core
CIE- 25 Marks                                                                                                         SEE- 100 Marks

 Prerequisites:

Knowledge of C programming.

 Course Objectives

To study the concepts of derived data types and data structures such as linked list, stack, queue, sorting and searching techniques.

 Course Outcome

On successful completion of the course, the students will be able to attain below Course Outcome (CO):

Course outcome									CL	Linked PO	Teaching Hours
CO1	Illustrate the concepts of pointers and dynamic memory allocation with programs.								U,A	1 to 4 and 7 to 10	08
CO2	Discuss different types of file operations and command   line   arguments   to    develop   simple program. of lists and apply various operations on them.								U,A	1 to 4 and 7 to 10	06
CO3	Describe data structures and different types of linked list								U,A	1 to 4 and 7 to 10	10
CO4	Construct stacks and queues using the concept of Arrays and Linked lists.								U,A	1 to 4 and 7 to 10	10
CO5	Illustrate operations.	the	use	of	Binary	Trees	and	its	U,A	1 to 4 and 7 to 10	08
CO6	Explain sorting and searching techniques with associated programs.								U,A	1 to 4 and 7 to 10	10
									Total sessions		52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised taxonomy)

 Course-PO Attainment Matrix

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised taxonomy)

 

 Course-PO Attainment Matrix

Course	Programme Outcomes
	1	2	3	4	5	6	7	8	9	10

Data Structures using C

3

3

3

3

-

-

3

3

3

3

Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.

Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO. If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3

If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2 If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1

If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed

 Course Content and Blue Print of Marks for SEE

 Course Content and Blue Print of Marks for SEE

Pointers - Concept of pointers, Declaring and initializing pointers, Accessing variables using pointers, Pointer arithmetic, Pointers and arrays, Pointers and character strings, Pointers and functions, Pointer as a function argument, Pointers to function, Pointers and structures.

Dynamic Memory allocation – Introduction, Dynamic memory allocation, Allocating a block of memory: Malloc, Allocating multiple blocks of memory:  Calloc, Releasing the  used space: Free Altering the size of memory: Realloc

Introduction, Defining and opening a file, closing a file, Input / Output operations on files, Error handling during I/O operations, Random Access to files, Command line arguments

Introduction to data structures – Introduction, Characteristics, Types of data structures, data structure operations.

 

Linked lists – Introduction, Basic concept, linked list implementation, Types of linked lists, Circular linked list (no implementation), doubly linked list (no implementation).

Stack – Introduction, Stacks, Stack operations, stack implementations.

Queues – Introduction, Basic concept, queue operations, queue implementations, circular queue (no implementation), priority queues (no implementation), double ended queues (no implementation).

Introduction, Basic concept, Binary tree, Binary tree representation, Binary tree traversal.

Sorting – Introduction, sorting techniques – selection sort, insertion sort, bubble sort, quick sort (no implementation), merge sort (no implementation).

Searching – Introduction, Linear search, binary search.

Application of data structure – Introduction, Applications of stack, Infix to postfix conversion, Evaluation of a postfix expression, Recursion, factorial, GCD, List application of queues, linked lists and trees.

1. Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill for

Unit I and II

2. Data Structures using C, E. Balagurusamy, Tata Mcgraw Hill for Unit III,IV,V,VI

1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson

Education.

2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN

9788183331630

3. Data structures A Programming Approach with C Second Edition , PHI publication, Dharmender Singh Kushwaha, Arun Kumar Misra.

4. Programming in C and Data Structure, P.B.Kotur, Sapna Book house

5. http://spoken-tutorial.org/tutorial- search/?search_foss=C+and+Cpp&search_language=English

6. http://www.tutorialspoint.com/cprogramming/

7. http://www.indiabix.com/online-test/c-programming-test/

 Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)

Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5 students.

 

1. Each group should do any one of the following type activity or any other similar activity related to the course and before conduction, get it approved from concerned course coordinator and programme coordinator.

2. Each group should conduct different activity and no repeating should occur

1	Implementation of Double linked list and circular linked list
2	Implementation of Circular Queue
3	Implementation of function pointers
4	Design and implement the Applications of Stack
5	Quiz

1 Implementation of Double linked list and circular linked list

2 Implementation of Circular Queue

3 Implementation of function pointers

4 Design and implement the Applications of Stack

5 Quiz

Method	What		To who m	When/Where (Frequency in the course)	Max Marks	Evidence collected	Course outcomes
Direct Assessment	CIE	IA	Students	Three IA tests (Average of three tests will be computed)	20	Blue books	1 to 6
				Student activities	05	Report	1 to 6
				Total	25
	SE E	End Exam		End of the course	100	Answer scripts at BTE	1 to 6
Indirect Assessment			Students	Middle of the course		Feedback forms	1, 2, 3 Delivery of course
	End of Course Survey			End of the course		Questionnaires	1 to 6 Effectiveness of Delivery of instructions & Assessment Methods

Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s taxonomy) such as:

Sl. No	Bloom’s Category	%
1	Remembrance	10
2	Understanding	50
3	Application	40

Note to IA verifier: The following documents to be verified by CIE verifier at the end of semester

1. Blue books (20 marks)

2. Student suggested activities report for 5 marks

3. Student feedback on course regarding Effectiveness of Delivery of instructions & Assessment Methods.