AAAA
Uploaded by
arunkumararunkumar1401401AAAA
Uploaded by
arunkumararunkumar1401401 tag)Font-style elements:(bold, italic, font, 6
small, strong, strike, big tags)
TIl_| Lists: Types of lists: Ordered, Unordered— Nesting L
is-Other tags:
Marquee, HR, BR- Using Images ~Creating Hyper-links, 6
TV) Tables: Creating basic Table, Table elements, Caption—Table and cell ;
alignment-Row span, Col span-Cellpadding
V_|_ Frames: Frameset—Targeted Links-No frame-Forms: Input, Text area,
Select, Option 6
TOTAL HOURS| 30
Course Outcomes Programme Oulcomes
CO _| On completion of this course, students will
Knows the basic concept in HTML
POT, PO2, POS, PO, POS,
©O | Concept of resources in HTML Pos
Knows Design concept POI, POR, POS, POS, POS,
CO | Concept of Meta Data Pos
2__| Understand the concept of save the files.
Understand the page format
POL, PO2, POS, PO4, POS,
CO Concept of is pos
Creating Links. 2, POS, Pe
CO | Know the concept of creating link to email address POI, PO?, PO3, PO4, FOS,
i Pos
Concept of adding images
Co | Understand the table creation Pog POR POM POS,
‘i Pos ‘Textbooks
T | “Mastering HTMLS and CSS3 Made Easy”, TeachUComp Ine., 2014
‘Thomas Michaud, “Foundations of Web Design: Introduction to HTML & CSS”
Web Resources
2 | ttns://www_w3schools.com/htmi/default.as
|
1 | https://www.teachucomp.com/samples/htmi/5/manuals/Mastering HTML5-CSS3.pdf |
Mapping with Programme Outcomes:
CORSO PSOT [PSO2 [PSO3 | PSO4 | PSOS | PSOG
cor 5 3 3 3 3 3
COZ 3 3 z 5 3 3
COs z 3 3 3 3 3
Coa 3 3 7 7 3
COs 3 3 z 3 3
Weightage of course 14 15 14 ia] 15 5
contributed fo each PSO
SSirong3_M-Medium-21-Low-t
Subject Subject Name L]t\P\s > Marks
cat , sis
2 Eels [5/2
= &| g/z
o Cg? B\S=
Fc Problem Solving Fe 2]-|-)-]2)2] 25 | 75] 100
‘Techniques
Learning Objectives
LO1_| Familiarize with writing of algorithms, fundamentals of C and philosophy of problem solving.
LO2_| Implement different programming constructs and decomposition of problems into functions.
LO3_| Use data flow diagram, Pseudo code to implement solutions.
LO4 | Define and use of arrays with simple applications
LOS | Understand about operating system and their uses
UNIT
Contents [__No. Of. Hours Tatroduction: History, characteristics and limitations of
Computer. Hardware/Anatomy of Computer: CPU, Memory,
Secondary storage devices, Input Devices and Output
devices. Types of Computers: PC, Workstation,
Minicomputer, Main frame and Supercomputer. Software:
System software and Application software. Programming
Languages: Machine language, Assembly language, High-
level language,4 GL and SGL-Features of good programming
language. Translators: Interpreters and Compilers
TT
Data: Data types, Input, Processing of data, Arithmetic
Operators, Hierarchy of operations and Output. Different
phases in Program Development Cycle (PDC).Structured
Programming: Algorithm: Features of good algorithm,
Benefits and drawbacks of algorithm. Flowcharts:
Advantages and limitations of flowcharts, when to use
flowcharts, flowchart symbols and types of flowcharts
Pseudocode: Writing a pseudocode. Coding, documenting
and testing a program: Comment lines and types of errors.
Program design: Modular Programming
rir
Selection Structures: Relational and Logical Operators
Selecting from Several Alternatives — Applications of
Selection Structures. Repetition Structures: Counter
Controlled Loops —Nested Loops— Applications of Repetition
Structures.
WV
Data: Numeric Data and Character Based Data. Arrays:
One Dimensional Array - Two Dimensional Arrays ~ Strings
as Arrays of Characters.
Data Flow Diagrams: Definition, DFD symbols and types
of DFDs. Program Modules: Subprograms-Value and
Reference parameters- Scope of a variable - Functions —
Recursion. Files: File Basics-Creating and reading a
sequential file- Modifying Sequential Files.
TOTAL HOURS
30
Course Outeomes
Programme
Outcomes
co
‘On completion of this course, students will
col
Study the basic knowledge of Computers.
Analyze the programming languages.
POI, PO2, PO3,
PO4, POS, POG
co2
Study the data types and arithmetic operations
Know about the algorithms.
Develop program using flow chart and pseudocode.
POI, PO2, POS,
PO4, POS, POG
co3
‘Determine the various operators.
Explain about the structures.
Illustrate the concept of Loops
POL, PO2, POS,
PO4, POS, POG
Study about Numeric data and character-based data,
POI, PO2, POS, Od | Analyze about Arrays PO4, POS, POS
Explain about DFD POI, PO2, POS,
COS _ | Illustrate program modules. pod, POS POS
Creating and reading Files
‘Textbooks
1 | Stewart Venit, “Introduction to Programming: Concepts and Design™, Fourth Edition,
2010, Dream Tech Publishers.
Web Resources
T [lips // www codesansar.com/computer-basics/problem-solving-using-compuler.him
2._| hitp:Tiwww.aptel itm.ac.in/video php?subjectld=106102067
3.__] http: Tutubersity.com/?paxe_ 10-876
Mapping with Programme Outcomes:
CORSO PSOI|PSO2 |PSO3 |PSO4 | PSOS | PSO6
col 3 3 3 3 3 3
coz 3 3 3 3 3 3
COs 3 z 3 3 3 3
co4 3 3 z 3 3 3
cos 3 3 3 3 3 2
Weightage of course 15 14 14 15 15 14
contributed to each PSO
S-Strong-3 M-Medium-2 L-Low-1
Semester II
Title of the Subject Name ‘Category TIP el eee
Course/ 2 z =
Paper z = < z\s
ozo |g 8
a a
DAT
cos | TavCmumpawe we fs) | las as [sw
Learning Objectives
LOL To understand the concepts of ADTs.
LO2 To learn linear data structures-lists, stacks, queucs
LO3 To lear Tree structures and application of trees
LO4 To lear graph strutures and and application of graphs To understand various
Sorting and searching
UNIT. Contents No, of
Hours
‘Abstract Data Types (ADTS)- List ADT-array-based implementation-
1 linked list implementation: singly linked lists-circular linked lists- 15
doubly-linked lists - operations- Insertion-Deletion -Applications of
lists-Polynomial Addition
Stack ADT-Operations- Applications- Evaluating arithmetic expressions
ul = Conversion of infix to postfix expression-Queue ADT+Operations- 15
Circular Queue- applications of queues.
Tree ADT-Binary Tree ADT-expression trees-applications of trees-
1 _| binary search tree ADT- insertion and deletion operations binary-tree | 15
traversals
Definition- Representation of Graph-Types of graph-Breadth first
Vv traversal - Depth first traversal 15
Searching-Linear search-Binary search-Sorting-Bubble sort-Selection
Vv sort-Insertion sort-Hashing-Hash functions-Separate _chaining-Open 1s
Addressing Rehashing Extendible Hashing
Total 75
‘Course Outcomes Programmeme Outcome
CO On completion of this course, students will
5 Inderstand the concept of Dynamic mem:
COL | inanagement daa types algaitimg, Big O ftation | POLsPOS
Coz Understand basic data structures such as arrays, linkeT | poy
lists, stacks and queues.
Cos Deseribe the hash fnetion and concepls oF clision and 559 pg
Cod Solve problem involving graphs, trees and heaps POS, POS
08 | setching inser and Jeleton of data POS, POS
Text Book
T T. Mark Allen Weiss, “Data Structures and Algorithm Analysis in CH, Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition
Reference Books:
1. Thomas H.Cormen,ChalesE.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction to
Algorithms”, McGraw Hill 2009, 3rd Edition.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education 2003
Web Resources
1
2. htps://www.geeksforgecks.org/learn-data-structures-and-algorithms-dsa-tutorial/
Mapping with Programme Outcomes: CO/PSO PSO1 | PSO2 | PSO3 PSO4 | PSOS | PSO6
col 3 3 3 3 3 3
co2 3 3 1 3 3 3
cos 3 3 3 23 2
Cod 3 2 3 2 [3 3
cos 3 3 3 3 3 3
Weightage of course 15 14 B B 15 14
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1
Title of the Subject Name Category JL |T|P |S a)Bauee
Course/ 2| §
Paper 3 = < z =
SEO |g 8
4 a
DAT
STRUCTURE AND
ccs ALGORITHMS core =f - -]4)-] 4] 4) 25 | 75) 100
LAB
[Note: Practical
offered through C++]
Learning Objectives
LOL To understand the concepts of ADTs
Lo2 To leam linear data structures-lists, stacks, queues
LO3 To leam Tree structures and application of trees
Lod To leam graph structures and application of graphs
To understand various sorting and searching
SL No Contents No. of
Hours
Write a program to implement the List ADT using arrays and linked
lists.
Write a program to implement the Stack ADT using arrays and
linked lists
Write a program to implement the Queue ADT using arrays and
linked list
4 Write a program that reads an infix expression, converts the
expression to postfix form and then evaluates the postfix expression (use stack ADT),
Write a program to perform the following operations:
‘* Insert an element into a Doubly Linked List.
5 * Delete an element from a Doubly Linked List. 60
© Search for a key element in a Doubly Linked List.
Write @ program to perform the following operations:
6
‘© Insert an element into a binary search tree.
‘© Delete an element from a binary search tree.
‘+ Inorder, preorder and postorder Traversals of a binary
search tree.
‘Write a programs for the implementation of BFS and DFS for a
1
given graph.
Write a programs for implementing the following searching methods:
© Linear search
8 © Binary search.
Write a programs for implementing the following sorting methods
* Bubble sort
6 © Selection sort
+ Insertion sort
Total 60
‘Course Outcomes Programmem Outcome
CO ‘On completion of this course, students will
1 Understand the concept of Dynamic memory me Pe
‘management, data types, algorithms, Big O notation POLPO4POS
2 Understand basic data stractures such as arrays inked | poy pog.pO6
lists, stacks and queues
3 Describe the hash function and concepts of collision and | poy po3,po6
its resolution methods ,
4 Solve problem involving graphs, trees and heaps PO3,POS
3 ‘Apply Algorithm for solving problems like sorting,
acarching, insertion and deletion of data POI,POS,PO6
Text Book
T Mark Allen Weiss, “Data Structures and Algorithm Analysis in C+", Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition Reference Books
Thomas 1I-Cormen,ChalesE.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction
to Algorithms”, McGraw Hill 2009, 3rd Edition
2, ‘Aho, Hoperoft and Ullman, “Data Structures and Algorithms”, Pearson Education
2003
‘Web Resources
T https: Awww programiz.com/dsa
2, hups://www.geeksforgecks.org/leam-data-structures-and-algorithms-dsa-tutorial
Mapping with Programme Outcomes:
Co/PSO PSO1 PSO2 | PSO3 PSO4 |PSOS PSO6
col 3 3 3 3 3 3
co2 3 3 1 3 2 3
co3 3 3 3 3 2 3
co4 3 3 3 3 2 3
cos 3 2 3 3 3 3
Weightage of course 15 15 3 15 3 15
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1
Subject Code | Sabjeet Name TFS) 7).
E eel. |Eog
é gad jg 2
SECL OFFICE AUTOMA Skill - |- |- [2 [2 | 25 15 100
Enha. 2
Course
(SEC)
earning Objects
Lor Understand the basics of computer systems and its components.
LO2 | Understand and apply the basic concepts of word processing package,
103 Understand and apply the basic concepts of electronic spreadsheet software.
LO4 Understand and apply the basic concepts of database management system,
LOS Understand and create a presentation using PowerPoint tool.
UNIT ‘Contents No. of
Hours
7 econy consap Memory wits CPU Tapat Devons Key Bods Mose
and
‘Scanner. Outputdevices:Monitor,Printer.IntroductiontoOperatingsystems&itsfea 6
ture LINUX-Wiedown, lsredsedoatoogemmingLtgrages
I
Word Processing: Open, Save and close word document; Editing 6
text — tools, formatting, bullets; Spell Checker - Document formatting — Paragraph alignment, indentation, headers and footers,
numbering; printing-Preview, options, merge.
i Spreadsheets:Excel—
opening enteringtextanddata, formatting navigating;Formulas—
enteringhandling and copying; Charts-creating, formatting and 6
printing,analysistables,preparationoffinancialstatements,introductiont
odataanalyities.
IV Database Concepts: The concept of data base management system;
Data field, records, and files, Sorting and indexing data; Searching 6
records. Designing queries, and reports(MS—Access),
v Power point: Introduction to Power point - Features —
Understanding slide typecasting &viewing slides — creating slide
shows. Applying special object — including objects & pictures — Slide 6
transition—Animation effects, audio inclusion, timer
Total 30
‘Course Outcomes Programme Outcomes
CO ‘Gn completion of this course, students will
COT Possess the knowledge on the basies of computes | pay pO9 pO3,PO6,POR
and its components
COZ] Gain knowledge on Creating Documents, spreadsheet | py 559 pos,pOs
and presentation.
COS] Leam the concepis of Database and implement the | po3 pos, po7
Query in Database
COd | Demonstrate the understanding of different P03,P04,P05,P07
automation tools.
5 lize the automation tools for documentatio
C05 Utilize the automation tools for documentation, PO4,P06,PO7,POR
calculation and presentation purpose.
Text Book
1 PeterNorton, “IntroductiontoComputers”—TataMcGraw-Iill
Reference Books
T Jennifer Ackerman Keitel, Guy Hat-Davis, Curt Simmons, “MicrosoR 2003”, Tata
McGrawHill
Web Resources
T hittps://Awww.udemy.com/course/office-automation-certificate-course,
2. https://Awww.javatpoint.com/automation-tools
Mapping with Programme Outcomes:
MAPPING TABLE CO/PSO PSO | PSO2 | PSO3 | PSO4 | PSOS | PSOG
cor 3 2 2 3 3 3
coz 3
co3 3 3 3 3 3 3
Coa 3 3
COs 3 3 3 3 3 3
Weightage of course
contributed to each
1s 4 4 15 15 15
Pso
S-Strong-3 _ M-Medium-2_T-Low-1
Subject | Subject Name LT |P|S Marks
Code 2 ¢
£ EYou might also like
