{"id":951,"date":"2018-01-31T06:13:42","date_gmt":"2018-01-31T06:13:42","guid":{"rendered":"http:\/\/www.inspirenignite.com\/vtu\/?p=951"},"modified":"2018-02-01T05:09:18","modified_gmt":"2018-02-01T05:09:18","slug":"vtu-beb-tech-2017-2018-detailed-syllabus-programming-c-data-structures","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/vtu\/vtu-beb-tech-2017-2018-detailed-syllabus-programming-c-data-structures\/","title":{"rendered":"VTU BE\/B.Tech (2017 \u2013 2018) Detailed Syllabus Programming In C and Data Structures"},"content":{"rendered":"

Programming In C and Data Structures\u00a02017 – 2018 Syllabus\u00a0for BE\/B.Tech sem I & sem II\u00a0is\u00a0covered here. This will help you to understand complete curriculum along with details such as exam marks and duration. The details are as follows.<\/p>\n\n\n\n\n\n
Subject Code<\/th>\n17PCD13\/23<\/th>\nIA Marks<\/th>\n40<\/th>\n<\/tr>\n
Number of Lecture Hours\/Week<\/td>\n04<\/td>\nExam Marks<\/td>\n60<\/td>\n<\/tr>\n
Total Number of Lecture Hours<\/td>\n50<\/td>\nExam Hours<\/td>\n03<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

CREDITS – 04<\/strong><\/p>\n

Course objectives:\u00a0<\/strong>The objectives of this course is to make students to learn basic principles of\u00a0Problem solving, implementing through C programming language and to\u00a0design & develop programming skills. To gain knowledge of data structures\u00a0and their applications.<\/p>\n

Module -1 : \u00a0<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0[Hours \u2013 10]<\/strong>
\nINTRODUCTION TO C LANGUAGE:<\/strong> Teaching\u00a0Pseudo code solution to problem, Basic concepts in a C program,\u00a0Declaration, Assignment & Print statements, Data Types,\u00a0operators and expressions etc, Programming examples and\u00a0exercise.\u00a0Text 1: Chapter 2, and Text 2: 1.1, 1.2, 1.3<\/p>\n

Module -2:<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[Hours \u2013 10]<\/strong>
\n BRANCHING AND LOOPING:\u00a0<\/strong>Two way selection (if, if-else, nested if-else, cascaded if-else),\u00a0switch statement, ternary operator? Go to, Loops (For, while-do,\u00a0do-while) in C, break and continue, Programming examples and\u00a0exercises.\u00a0Text 1: Chapter 3. & Text 2: 4.4.<\/p>\n

Module \u2013 3: \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[Hours \u2013 10]<\/strong>
\nFUNCTIONS, ARRAYS AND STRINGS\u00a0ARRAYS AND STRINGS:<\/strong> Using an array, Using arrays with\u00a0Functions, Multi-Dimensional arrays. String: Declaring,\u00a0Initializing, Printing and reading strings, string manipulation\u00a0functions, String input and output functions, array of strings,\u00a0Programming examples and Exercises.\u00a0Text 1: 5.7, & Text 2: 7.3, 7.4, chapter 9\u00a0FUNCTIONS: Functions in C, Argument Passing \u2013 call by value,\u00a0call by reference, Functions and program structure, location of\u00a0functions, void and parameter less Functions, Recursion,\u00a0Programming examples and exercises.\u00a0Text 1: 1.7, 1.8, Chapter 4. Text 2: 5.1 to 5.4.<\/p>\n

Module-4: \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[Hours \u2013 10]<\/strong>
\n STRUCTURES AND FILE MANAGEMENT :\u00a0<\/strong>Basic of structures, structures and Functions, Array of\u00a0structures, structure Data types, type definition, Defining, opening\u00a0and closing of files, Input and output operations, Programming\u00a0examples and exercises.\u00a0Text 1: 6.1 to 6.3. Text 2: 10.1 to 10.4, Chapter 11.<\/p>\n

Module-5: \u00a0 \u00a0 \u00a0 \u00a0[Hours \u2013 10]<\/strong>
\nPOINTERS AND PREPROCESSORS & Data Structures :\u00a0<\/strong>Pointers and address, pointers and functions (call by reference)\u00a0arguments, pointers and arrays, address arithmetic, character\u00a0pointer and functions, pointers to pointer ,Initialization of pointer\u00a0arrays, Dynamic memory allocations methods, Introduction to\u00a0Preprocessors, compiler control Directives, Programming examples\u00a0and exercises.\u00a0Text 1: 5.1 to 5.6, 5.8. Text 2: 12.2, 12.3, 13.1 to 13.7.\u00a0Introduction to Data Structures: Primitive and non primitive\u00a0data types, Abstract data types, Definition and applications of\u00a0Stacks, Queues, Linked Lists and Trees.\u00a0Text 2 : 14.1, 14.2, 14.11, 14.12, 14.13, 14.15, 14.16, 14.17, 15.1.<\/p>\n

Course outcomes:<\/strong> On completion of this course, students are able to<\/p>\n