1 PCA151C Data Structures Using C PCA152C Operating Systems PCA153C Introduction to Web Technologies

Size: px

Start display at page:

Download "1 PCA151C Data Structures Using C PCA152C Operating Systems PCA153C Introduction to Web Technologies"

Shavonne Gordon
5 years ago
Views:

1 Sl. No. Subject code Basaveshwar Engineering College(Autonomous), Bagalkote Department of Computer Applications (MCA) Scheme and syllabus for I Semester MCA No. of hours per week Subject Lecture Tutorial Practical Total 1 PCA151C Data Structures Using C PCA152C Operating Systems PCA153C Introduction to Web Technologies PCA154C Computer Organization PCA155L Data Structures Laboratory credits 6 PCA156L UNIX Shell Programming Laboratory PCA157L Web Technologies Laboratory PCA158S Seminar-I Total

2 PCA151C: Data Structures Using C 4 Credits (3-2- 0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Pointers: Concepts, Pointer variables, Accessing variables through pointers, Pointer declaration and definition, Initialization of pointer variables, Pointers and functions, Pointer to pointers, Compatibility, Lvalue and Rvalue, Arrays and pointers, Pointer arithmetic and arrays, Passing an array to a function, Memory allocation functions, Array of pointers, dynamic array, Strings and pointers, array of strings, string manipulation functions. Derived types Enumerated, Structure and Union: The type definition, Enumerated types, Structure, Accessing structures, Complex structures, Array of structures, Structures and functions, Unions, pointers to structures. Files: Revision of file concepts, character i/o functions, Classification of Files, creating, reading, printing and copying text file, Using Binary Files, Standard Library Functions for Files. UNIT II Introduction to data structures: Information and meaning, Abstract data types, Sequences as value definitions, ADT for varying length character strings, Representing other data structures, Rational numbers, Allocation of storage and scope of variables. The Stack: Definition and examples Primitive operation, Example, The stack as an ADT, Testing for exceptional conditions, implementing the push operation. Example: Infix, postfix and prefix, Basic definitions and examples. Evaluating a postfix expression, Program to evaluate a postfix expression, converting an expression from infix to postfix, Program to convert an expression from infix to postfix. Recursion: Recursive definition and processes, Factorial function, Multiplication of natural numbers, Fibonacci sequence, Binary search, Properties of recursive definition or algorithms, Towers of Hanoi problem. UNIT III Queues and Lists: The queue and its sequential representation: The queue as an ADT, C implementation of queues, Insert operation, Priority queue, Array implementation of a priority. Linked

3 lists: Inserting and removing nodes from a list, Linked implementation of stacks, getnode and freenode operations, Linked implementation of queues, Linked list as a data structure, Examples of list operations, Header nodes, Lists in C: Array implementation of lists, Limitations of array implementation, Allocating and freeing dynamic variables, Linked lists using dynamic variable, Non integer and non-homogeneous lists. Other list structures: Circular lists, Stack as a circular list, Queue as circular list, Primitive operations on circular lists, doubly linked lists. UNIT IV Trees: Binary trees: Operations on binary trees, Applications of binary trees. Binary tree representation: Node representation of binary tree, Internal and external nodes, implicit array representation of binary trees, choosing a binary tree representation, threaded binary trees. Representing Lists as Binary Tree: Finding kth element, Deleting an Element, Implementing Tree- Represented Lists in C, Constructing a Tree-Represented List. Trees and their application: Tree traversals, General expressions as trees, evaluating an expression tree, constructing a tree. Basic concepts of Graphs, C representation of Graphs. Text Books: 1. Behrouz A. Forouzan and Richard F. Gilberg, 2nd Edition, Thomson, 2003, Computer Science A Structured Programming Approach Using C. 2. Data structures using C and C++ by Yedidyah Langsam and Moshe J.Augenstein and Aaron M. Tenanbaum, PHI. Question Paper Pattern for SEE: 1. Total of 8 questions with two from each unit to be set uniformly covering the entire syllabus. 2. Each question should not have more than four sub divisions. 3. Any five full questions have to be answered choosing atleast one from each unit. Course Outcomes (COs): 1. Implement stack operations and its applications. 2. Understand various types of queues and its applications. 3. Able to solve the problems with help of linked list. 4. Gain the knowledge of problem solving with help of tree techniques. 5. Understand how to apply the knowledge of searching and sorting. 6. Solve real world problems by applying data structure concepts.

4 PCA152C: Operating Systems 4 Credits (3-2- 0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Introduction to operating systems, system structures: What operating systems do; Computer System organization; Computer System architecture; Operating System structure; Operating System operations; Process management; Memory management; Storage management; Protection and security; Kernel data structures, Computing environments and Open source operating systems. System Structures: Operating System Services; User - Operating System interface; System calls; Types of system calls; System programs; Operating System design and implementation; Operating System structure; Operating System debugging, Operating System generation; System boot. Process Management: Process concept; Process scheduling Multi-Threaded Programming: Overview; Multi-core programming, Multithreading models; Thread Libraries; Implicit threading, threading issues. UNIT II Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Thread scheduling, Multiple-Processor scheduling; Real time CPU scheduling. Process Synchronization: The Critical section problem; Peterson s solution; Synchronization hardware; Mutex locks, Semaphores; Classical problems of synchronization; Monitors. Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection, recovery from deadlock. UNIT III Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Segmentation, Paging; Structure of page table. Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.

5 UNIT IV File System: File concept; Access methods; Directory and disk structure; File system mounting; File sharing; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management. Mass storage structures: Overview, Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Text Book : 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts, 9 th edition, Wiley-India, Reference Books: 1. D.M Dhamdhere, Operating Systems: A Concept Based Approach 2 nd Edition, Tata McGraw- Hill, P.C.P. Bhatt,Operating Systems, 2 nd Edition, PHI, Harvey M Deital, Operating Systems, 3 rd Edition, Addison Wesley, Question Paper Pattern for SEE: 1. Total of 8 questions with two from each unit to be set uniformly covering the entire syllabus. 2. Each question should not have more than four sub divisions. 3. Any five full questions have to be answered choosing atleast one from each unit. Course Outcomes (COs): 1. Understand basic concepts and functions of as OS. 2. Appreciate process management concepts and scheduling algorithms. 3. Comprehend process synchronization and dealing with deadlock. 4. Build knowledge of memory management techniques and concepts of virtual memory. 5. Comprehend file and directory structure and implementation along with mass storage management.

6 PCA153C: Introduction to Web Technologies 4 Credits (3-2- 0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I Fundamentals of WEB: Introduction to Internet, World Wide Web, Web Browsers, Web Servers, Uniform Resource-Locators, MIME, HTTP, Security, Web Programmers Toolbox. Introduction to HTML and XHTML: Basic syntax, Standard structure, Basic text markup, Images, Hypertext Links, Lists, Tables, Forms, Frames with Examples. Syntactic difference between HTML and XHTML. HTML5 features, HTML4 VS HTML5 new elements. UNIT II Cascading Style Sheets: Introduction, Levels of style sheets, Style specification formats, Selector forms, Property value forms, Font properties, List properties, Color, Alignment of text, The box model, Background images, The <span> and <div> tags, Conflict resolution. Basics of Java Script: Overview of JavaScript, Object orientation and JavaScript, Syntactic characteristics, Primitives, operations, and expressions. Screen output and keyboard input, Control statements, Object creation and modification, Arrays, Functions, Constructors, Pattern matching using regular expressions, Errors in scripts. UNIT III The JavaScript Execution Environment, The Document Object Model, Elements Access in Java Script, Events and Event Handling, Handling Events from Body Elements, Handling Events from Text Box and password Elements.DOM2 Event Model, Navigator Object, DOM tree traversal and Modification. Dynamic Documents with Java Scripts: Introduction, PositioningElements, Moving Elements, Changing Colors and Fonts, Dynamic Content, Stacking elements, Locating the mouse cursor, Reacting to a mouse, Slow Movement of Elements.

7 UNIT IV Introduction to XML: Introduction, Syntax, Document Structure, Document type definitions, Namespaces, XML schemas, displaying raw XML documents, Displaying XML documents with CSS, XSLT style sheets, XML processors, Web services, Introduction to PHP: overview of PHP, General syntactic characteristics, primitives, operations and expressions, output, control statements, arrays, functions, pattern matching, form handling. Text Books: 1. Robert W.Sebesta: Programming the World Wide Web, 4 th Edition, Pearson education. Reference Books: 1. Jeffrey.C.Jackson: Web Technologies-A Computer Science Perspective, Pearson Education, Eleventh Impression, Chris Bates: Web Programming Building Internet Applications, 3rdEdition, Wiley India, M.Srinivasan: Web Technology Theory and Practice, Pearson Education, Question Paper Pattern for SEE: 1. Total of 8 questions with two from each unit to be set uniformly covering the entire syllabus. 2. Each question should not have more than four sub divisions. 3. Any five full questions have to be answered choosing atleast one from each unit. Course Outcomes (COs): 1. Understand the fundamentals of Internet and HTML. 2. Develop interactive web pages using CSS and Javascript. 3. Understand the basics of DOM. 4. Understand the basics of XML and PHP programming. 5. Develop dynamic web documents using Document Object Model (DOM).

8 PCA154C: Computer Organization 4 Credits (4-0- 0) CIE Marks: 50 SEE Marks: 100 Total Hours: 52 SEE Hours: 03 UNIT I 13 Hours Basic Structures of Computers: Computer types, Functional units, Input unit, Memory unit, Arithmetic & logic unit, Output unit, Control unit, Basic Operational Concepts, Bus Structures, Multiprocessor & Multi-computers, Memory locations and addresses; Memory operations; Instructions and sequencing; Addressing modes UNIT II 13 Hours Input Output Organization: Accessing I/O devices, Interrupts, Direct Memory Access, Buses, and Interface Circuits. The Memory System: Basic Concepts, Semiconductor RAM Memories, Read only, Memories, Cache Memories, Virtual memories, Secondary Storage. UNIT III 13 Hours Number System: Digital systems, Binary numbers, decimal numbers, base of number system, base conversion, octal and hexadecimal numbers, complements, addition and subtraction of numbers using complements, representation of negative numbers, binary codes, binary logic Arithmetic Unit: Addition & Subtraction of Signed Numbers, Design of fast adders, Multiplication Positive numbers, Signed -Operand Multiplication, Fast Multiplication, Integer division Floating-Point Numbers & Operations UNIT IV 13 Hours Basic Processing Unit: Fundamental Concepts Execution of a Complete Instruction, Multiple-Bus, Organization, Hardwired Control, Micro-programmed Control. Pipelining-Basic concepts, data hazards, instruction hazards, influence on instruction sets, data path and control considerations, superscalar operations; Computer peripherals-input devices; Output devices, Serial communication links.

9 Text Books: 1. Carl Hamacher, Z Vamesic & S Zaky, Computer Organization, 5th Edition, McGraw Hill Morris Mano, Digital Logic and Computer Design, PHI 23 rd reprint, October Reference Books: 1. M. Moris Mano & Charles R. Kime, Logic and Computer Design Fundamentals, 2nd Edition, Pearson Education Asia, Thomas I Flyid, Digital Fundamentals, 3 rd edition, United bookstall, New Delhi. Question Paper Pattern for SEE: 1. Total of 8 questions with two from each unit to be set uniformly covering the entire syllabus. 2. Each question should not have more than four sub divisions. 3. Any five full questions have to be answered choosing atleast one from each unit. Course Outcomes (COs): 1. Understand the fundamental concepts of computer architecture 2. Understand the concepts of memory system. 3. Understand representation of number system. 4. Understand the concepts of basic processing unit. 5. Apply the knowledge of computer organization in the design of systems.

10 PCA155L: Data Structures Laboratory 2 Credits (0-0-4) CIE Marks: 50 SEE Marks: 50 Total Hours: 52 SEE Hours: 03 Assignments: 1. Program on pointers to arrays and structures. 2. Program on string with pointers. 3. Program on file operations. 4. Stack implementation using arrays, pointers and structures, pointers and arrays. 5. Implementation of stack applications: Recursion, Evaluation of postfix expression, Conversion of Infix to postfix. 6. Queue implementation using arrays, structures, pointers and arrays, pointers and structures. 7. Circular Queue (using Static memory allocation) and Priority queue implementation (using dynamic memory allocation). 8. Applications of singly linked list, doubly linked list (implementation of stack, queue) 9. Programs on searching (Binary, Linear, binary search tree) using integer and string arrays. 10. Program on applications of Graph. LABORATORY ASSESSMENT: 1. Each laboratory is evaluated for 100 marks (50 CIE and 50 SEE). 2. Allocation of 50 marks for CIE: a. Performance and journal write up: Marks for each experiment =30 marks /no.of proposed experiments. b. One practical test for 20 marks (05 marks-write up, 10 marks-execution and results, 05 marks-vivavoce) 3. Allocation of 50 marks for SEE: 25%- write up, 50% -execution and results and 25%- Viva Voce. Course Outcomes (COs): 1. Implement advance concepts in C. 2. Apply data structure concepts to develop interactive applications in C. 3. Understand linear data structure and their applications such as stacks, queues and lists. 4. Understand the non linear data structure and their applications. 5. Be fluent in the use of different types of sorting and searching techniques.

11 PCA156L: UNIX Shell Programming Laboratory 1.5Credits (0-0-3) CIE Marks: 50 SEE Marks: 50 Total Hours: 42 SEE Hours: 03 Assignments: 1 a. Demonstrate Customizing and Environment Commands b. Write a shell script on Interactive Shell Script using shell variables 2 a. Demonstrate UNIX Utility Commands b. Write a shell script on system l variables 3a. Demonstrate vi- different modes of Commands b. Write a shell script on Positional parameters through passing command line arguments 4a. Demonstrate vi- Deleting, Moving and yanking Commands b. Write a shell script on arithmetic expression handling commands 5a. Demonstrate vi- Search and Replace using Regular Expression Commands b. Write a shell script on Decision control using if structure commands 6a. Demonstrate vi- File Handling using scrolling Commands b. Write a shell script on case-structure commands. 7a. Demonstrate UNIX Filter commands on user defined database file. b. Write a shell script on Loop Control structure commands. 8a. Demonstrate basic administration commands b. Write a shell script on Meta characters and special parameter functions 9a. Demonstrate Advance administration commands b. Write a awk script on user defined database file using basic functions 10a. Demonstrate basic Network handling commands b. Write a awk script on user defined database file using Advance functions

12 LABORATORY ASSESMENT: 1. Each laboratory is evaluated for 100 marks (50 CIE and 50 SEE). 2. Allocation of 50 marks for CIE: a. Performance and journal write up: Marks for each experiment =30 marks /no.of proposed experiments. b. One practical test for 20 marks (05 marks-write up, 10 marks-execution and results, 05 marks-vivavoce) 3. Allocation of 50 marks for SEE: 25%- write up, 50% -execution and results and 25%- Viva Voce. Course Outcomes (COs): 1. Understand the UNIX programming environment. 2. Be fluent in the use of vi editor. 3. Be able to design and implement shell scripts to manage users with different types of Permission and file based applications. 4. Understand and implementing the shell and Awk scripts.

13 PCA157L: Web Technologies Laboratory 1.5 Credits (0-0- 3) CIE Marks: 50 SEE Marks: 50 Total Hours: 42 SEE Hours: 03 Assignments: 1. Create an XHTML page to demonstrate the usage of Text Formatting tags, Links, Images, Tables etc. 2. Demonstrate a static web page using the frame tag which includes hyperlinks, images, Paragraphs, radio button, check box, list, and table. 3. Develop and demonstrate the usage of inline and internal style sheet using CSS. 4. Develop and demonstrate the usage of external style sheet using CSS. 5. Develop and demonstrate using java script, a XHTML document that displays random numbers (integers). 6. Develop and demonstrate using Javascript,an XHTML document that use of onload and onfocus events. 7. Develop and demonstrate, using JavaScript script, a XHTML document that use of mouse events 8. Design and develop an website by using HTML, CSS, Javascript that consists the following pages. Home page, Registration and with client side validation using Javascript 9. Design an XML document to store information and create an XSLT style sheet for the respective information. 10. Program on PHP form designing. LABORATORY ASSESMENT: 1. Each laboratory is evaluated for 100 marks (50 CIE and 50 SEE). 2. Allocation of 50 marks for CIE: a. Performance and journal write up: Marks for each experiment =30 marks /no.of proposed experiments. b. One practical test for 20 marks (05 marks-write up, 10 marks-execution and results, 05 marks-viva-voce) 3. Allocation of 50 marks for SEE: 25%- write up, 50% -execution and results and 25%- Viva Voce.

14 Course Outcomes (COs): 1. Create web pages using HTML and CSS. 2. Create dynamic web pages using popular programming languages and techniques used on the Web. 3. Design and develop XML documents for given problem.

15 PCA158S: Seminar-I 1 Credits (0-0- 2) CIE Marks: 50 SEE Marks: 50 Total Hours: 24 SEE Hours: 03 Seminars are used as a course delivery mode to gather current trends in technology, research literature and self learn topics of their interests. Student has to research a technical topic, make presentation and give a detailed document on their findings in consultation with the guide. SEMINAR ASSESSMENT: 1. Seminar-I is evaluated for 50 marks (50 CIE) 2. Allocation of 50 Marks for CIE : a. 30 Marks evaluated by guide. b. 20 Marks by CIE conduction (Panel of 3 members). i. 25% for write up and viva-voce. ii. 25% for report. iii. 50% for presentation. Course Outcomes (COs): 1. Identify seminar topics based on contemporary technical, societal and environmental issues. 2. Conduct literature survey in the selected domain. 3. Explore advanced concepts and technologies. 4. Make oral and written technical presentation.

Govt. of Karnataka, Department of Technical Education Diploma in Computer Science & Engineering. Fifth Semester. Subject: Web Programming

Govt. of Karnataka, Department of Technical Education Diploma in Computer Science & Engineering Fifth Semester Subject: Web Programming Contact Hrs / week: 4 Total hrs: 64 Table of Contents SN Content