Kurukshetra University, Kurukshetra

(Established by the State Legislature Act XII of 1956)

(‘A+’ Grade, NAAC Accredited)




||     योगस्थ:  कुरु कर्माणि     ||

समबुद्धि व योग  युक्त होकर कर्म करो

(Perform Actions while Stead fasting in the State of Yoga)









Kurukshetra University - Wikipedia




Scheme of Examination and Syllabus of Bachelor of Science (B.Sc.) Programme (Course Computer Science) (CBCS) in Phased Manner


DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS


CBCS CURRICULUM (2020-21)

Program Name: Bachelor of Science (B.Sc.) Programme (Course Computer Science) (CBCS) 

 (For the Batches Admitted From 2020-2021)


Programme Outcomes (POs) for Three Year B.Sc. Programme (Course Computer Science) 


PO1

Knowledge

Capable of demonstrating comprehensive disciplinary knowledge gained during course of study

PO2

Communication

Ability to communicate effectively on general and scientific topics with the scientific community and with society at large

PO3

Problem Solving

Capability of applying knowledge to solve scientific and other problems 

PO4

Individual and Team Work

Capable to learn and work effectively as an individual, and as a member or leader in diverse teams, in multidisciplinary settings’

PO5

Investigation of Problems

Ability of critical thinking, analytical reasoning and research based knowledge including design of experiments, analysis and interpretation of data to provide conclusions 

PO6

Modern Tool usage

Ability to use and learn techniques, skills and modern tools for scientific practices 

PO7

Science and Society

Ability to apply reasoning to assess the different issues related to society and the consequent responsibilities relevant to the professional scientific practices 

PO8

Life-Long Learning

Aptitude to apply knowledge and skills that are necessary for participating in learning activities throughout the life 

PO9

Environment and Sustainability

Ability to design and develop modern systems which are environmentally sensitive and to understand the importance of sustainable development. 

PO10

Ethics

Apply ethical principles and professional responsibilities in scientific practices

PO11

Project Management

Ability to demonstrate knowledge and understanding of the scientific principles and apply these to manage projects


Programme Specific Outcomes (PSOs) for Three Year B.Sc. Programme (Course Computer Science)


PSO1

Students will be able to acquire the basic understanding of the principles and working of the hardware and software aspects of computer systems. 

PSO2

Explore technical knowledge in diverse areas of Computer Science and experience an environment conducive in cultivating skills for successful career, entrepreneurship and higher studies.

PSO3

Papers such as C++, JAVA, Python, Web designing give an effective and efficient real time solution in various domains. 







SCHEME OF EXAMINATION FOR B.Sc. Programme (Course Computer Science) under CHOICE BASED CREDIT SYSTEM (CBCS) w.e.f. Academic Session 2020-21 in phased manner

Semester

Course Opted

Course Code

Course Name 

Credits

Work load/ hours/week

Exam Time (Hrs.)

External Marks

Internal Marks


Total Marks

Max

Pass

Max

Pass

Max

Pass

1

CORE COURSE-III 


CC- IIIA

COMPUTER FUNDAMENTALS    

3

3

3

60

24

15

6

75

30

CC- III B

WEB DESIGNING USING HTML AND CSS

3

3

3

60

24

15

6

75

30

CORE COURSE PRACTICAL

CC- III B (P)

S/W LAB BASED ON CC- III B

2

4

3

40

16

10

4

50

20


TOTAL

08

10


160

64

40

16

200

80

2


CORE COURSE-VI 

CC- VI A

C++ PROGRAMMING -I 

3

3

3

60

24

15

6

75

30

CC- VI B

LOGICAL ORGANIZATION OF COMPUTER

3

3

3

60

24

15

6

75

30

CORE COURSE PRACTICAL

CC- VI B (P)

S/W LAB BASED ON  CC- VI A

2

4

3

40

16

10

4

50

20

TOTAL

08

10


160

64

40

16

200

80

3

CORE COURSE-IX

CC- IX A

C++ PROGRAMMING- II

3

3

3

60

24

15

6

75

30

CC- IX B

DATA STRUCTURES

3

3

3

60

24

15

6

75

30

CORE COURSE PRACTICAL

CC- IX B (P)

S/W LAB BASED ON CC- IX B

2

4

3

40

16

10

4

50

20

TOTAL

08

10


160

64

40

16

200

80



4

CORE COURSE-XII

CC- XII A

PROGRAMMING IN JAVA 

3

3

3

60

24

15

6

75

30

CC- XII B

OPERATING SYSTEMS

3

3

3

60

24

15

6

75

30

CORE COURSE PRACTICAL

CC- XII A (P)

S/W LAB BASED ON JAVA

2

4

3

40

16

10

4

50

20

TOTAL

08

10


160

64

40

16

200

80



5

DISCIPLINE SPECIFIC ELECTIVE-III


DSE-III

ELECTIVE-I

4

4

3

80

32

20

8

100

40

DSE-III(P)

S/W LAB BASED ON DSE-III

2

4

3

40

16

10

4

50

20

SKILL ENHANCEMENT COURSE-III

SEC-III

ELECTIVE-II                     

2

2

3

40

16

10

4

50

20

TOTAL

08

10


160

64

40

16

200

80

ELECTIVE-I

  1. JAVASCRIPT

  2. DATABASE MANAGEMENT SYSTEM

  3. SOFTWARE ENGINEERING


ELECTIVE-II

  1. DATA WAREHOUSING AND MINING 

  2. COMPUTER ORIENTED STATISTICAL METHODS

  3. COMPUTER NETWORKS 

6

DISCIPLINE SPECIFIC ELECTIVE-VI

DSE-VI

ELECTIVE-III

4

4

3

80

32

20

8

100

40

DSE-VI(P)

S/W LAB BASED ON DSE-VI

2

4

3

40

16

10

4

50

20

SKILL ENHANCEMENT COURSE-IV 

SEC-IV

ELECTIVE-IV                 

2

2

3

40

16

10

4

50

20

TOTAL

08

10


160

64

40

16

200

80

ELECTIVE-III

    1. LINUX & SHELL PROGRAMMING 

    2. PROGRAMMING USING PYTHON

    3. VISUAL PROGRAMMING USING C#

ELECTIVE-IV

  1.  ARTIFICIAL INTELLIGENCE

  2. INFORMATION SECURITY

  3. E- COMMERCE 



Total Credits (B.Sc. Programme (Course Computer Science)):   8 + 8 + 8 + 8 +8 + 8   = 48

                  Total Contact Hours (B.Sc. Programme (Course Computer Science)): 10 + 10 + 10 + 10 + 10 + 10    = 60

  1. A student can opt for any one paper out of the list of elective papers provided against each paper code for respective semester.

  2. One credit equivalent to 1 hour of teaching/2 hours of Practical work

  3. One credit equivalent to 25 marks

  4. Teaching workload will be calculated on the basis of teaching contact hours of the course. 













CC – III A: COMPUTER FUNDAMENTALS

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the this course is to help students to enhance their basic concept of computer hardware, software, memory and operating environments along with the concepts of problem solving using programming languages which will lead to code generation in future for computer science job aspirants.

Course Outcomes: At the end of this course, the student will be able to: 

CC – IIIA.1: understand the basic terminology of hardware and software components of a computer system;

CC – IIIA.2: understand the working of input/output device and storage devices;

CC – IIIA.3: develop program logic using algorithms, flowchart, decision tables, DFDs, etc.

CC – IIIA.4: develop sorting, searching, merging and other basic algorithms to solve problems;


CO-PO Mapping Matrix for Course Code: CC – III A

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC – IIIA.1

3

3

2

3

3

2

2

2

2

3

2

CC – IIIA.2

3

2

3

3

3

2

2

2

2

2

2

CC – IIIA.3

3

3

2

3

3

2

2

2

2

3

2

CC – IIIA.4

3

2

3

3

3

2

2

2

2

2

2

Average

3

2.5

2.5

3

3

2

2

2

2

2.5

2



CO-PSO Mapping Matrix for Course Code: CC – III A

COs

PSO1

PSO2

PSO3

CC – IIIA.1

3

3

2

CC – IIIA.2

2

3

3

CC – IIIA.3

3

3

2

CC – IIIA.4

2

3

3

Average

2.5

3

2.5


UNIT – I 

Computer Fundamentals: Evolution of Computers through generations, Characteristics of Computers, Strengths and Limitations of Computers, Classification of Computers, Functional Components of a Computer System, Applications of computers in Various Fields; Software, Types of Software: System software, Application software, Utility Software, Shareware, Freeware, Firmware, Free Software.  Hardware components of a computer system – processor, RAM, ROMs, motherboard, power supply etc

UNIT – II 

Storage devices: Types of Storage devices, Magnetic tape, Hard disk, Optical disk, Flash memory 

I/O Devices: I/O Ports, Device Controller, Device Driver

Input Devices: Classification and use, keyboard, Pointing devices – mouse, touch pad and track ball, Video digitizer, remote control, joystick, magnetic stripes, scanner, digital camera, microphone, sensor, and MIDI instruments

Output Devices: Monitor, printers –classification, laser, ink jet, dot-matrix, plotter, and speaker.




UNIT – III

Planning the Computer Program: Techniques of Problem Solving, Program, Types of Program Errors, Debugging a Program, Testing Program, Documentation: Need & Different Forms.

Developing Program Logic: Algorithm, Characteristics of Good Algorithm, Pseudo Code, Flowchart & its Symbols, Data Flow Diagrams (DFDs), Decision Tables & their types and Decision Trees.

UNIT – IV 

Developing Algorithms: Time & space complexity of algorithms, Big-O Notation, Drawing Flowcharts and writing algorithms in pseudo code for basic problems.

Sorting Algorithms: bubble sort, selection sort, insertion sort, quick sort. Searching Algorithms – linear search, binary search. Merging Algorithm.


Text Books: 

        1. Sinha, P.K. & Sinha, Priti, Computer Fundamentals, BPB. 

        2. Dromey, R.G., How to Solve it By Computer, PHI. 


Reference Books: 

        1. Norton, Peter, Introduction to Computer, McGraw-Hill. 

        2. Leon, Alexis & Leon, Mathews, Introduction to Computers, Leon Tech World. 

        3. Rajaraman, V., Fundamentals of Computers, PHI. 





































CC- III B: WEB DESIGNING USING HTML AND CSS

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of web as a tool in presenting information. Each and every product in e-world now needs a website, this course will make student knowing about the concept of web design in general.

Course Outcomes: At the end of this course, the student will be able to:

CC- III B.1: outline the idea of web and its components. 

CC- III B.2: understand the theoretical steps for developing a website.

CC- III B.3: learn the skills that will enable him/her to design simple web pages.

CC- III B.4: learn CSS to specify style to web pages.



CO-PO Mapping Matrix for Course Code: CC – III B

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- III B.1

3

1

2

1

1

1

1

2

1

1

1

CC- III B.2

3

2

1

1

1

1

1

2

1

1

1

CC- III B.3

3

2

2

1

1

3

1

2

2

1

1

CC- III B.4

3

2

2

1

1

3

1

2

2

1

2

Average

3

1.75

1.75

1

1

2

1

2

1.5

1

1.3


CO-PSO Mapping Matrix for Course Code: CC – III B

COs

PSO1

PSO2

PSO3

CC- III B.1

2

2

2

CC- III B.2

2

2

2

CC- III B.3

2

3

3

CC- III B.4

2

3

3

Average

2

2.5

2.5


UNIT – I 

Introduction to Internet and World Wide Web (WWW); Evolution and History of World Wide Web, Web Pages and Contents, Web Clients, Web Servers, Web Browsers; Hypertext Transfer Protocol, URLs; Searching and Web-Casting Techniques, Search Engines and Search Tools, Scripting Languages. 


UNIT – II 


Web Publishing: Hosting website; Internet Service Provider; Planning and designing website; Web Content Authoring, Web Graphics Design, Web Programming, Steps For Developing website, Choosing the Contents, Home Page, Domain Names, Creating a Website and Introduction to Mark up Languages (HTML and DHTML).


UNIT – III


Web Development: HTML Document Features, Fundamentals HTML Elements, Creating Links; Headers; Text styles; Text Structuring; Text colour and Background; Formatting text; Page layouts, Images; Ordered and Unordered lists; Inserting Graphics; Table Creation and Layouts; Frame Creation and Layouts; Working with Forms and Menus; Working with Radio Buttons; Check Boxes; Text Boxes.


UNIT – IV                                                             


Introduction to CSS (Cascading Style Sheets): Features, Core Syntax, Types, Style Sheets and HTML, Style Rule Cascading and Inheritance, Text Properties, CSS Box Model, Normal Flow Box Layout, Positioning and other useful Style Properties; Features of CSS3.


Text Books:

  1. Raj Kamal, Internet and Web Technologies, Tata McGraw-Hill.

  2. Ramesh Bangia, Multimedia and Web Technology, Firewall Media.


REFERENCE BOOKS:


  1. Thomas A. Powell, Web Design: The Complete Reference, Tata McGraw-Hill

  2. Wendy Willard, HTML Beginners Guide, Tata McGraw-Hill.

  3. Deitel and Goldberg, Internet and World Wide Web, How to Program, PHI.








































CC- VI A : C++ PROGRAMMING -I

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of C++ (high level language) as one of the programming tool and generating logical development using programming. This course will help students to learn about OOPS concepts and linking C++ as a powerful OOPS language.

Course Outcomes: At the end of this course, the student will be able to:  

CC- VI A.1: understand basic concept of C++;

CC- VI A.2: acquire the knowledge of C++ operators, hierarchy and precedence and various control structures;

CC- VI A.3: learn to use arrays and string in C++ programs;

CC- VI A.4: get familiar with OOPS concepts with C++.


CO-PO Mapping Matrix for Course Code: CC – VI A

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- VI A.1

3

3

2

3

3

2

2

2

2

3

2

CC- VI A.2

3

2

3

3

3

2

2

2

2

2

2

CC- VI A.3

2

3

3

3

2

2

2

2

1

1

1

CC- VI A.4

3

2

2

2

3

3

3

3

3

2

2

Average

2.75

2.5

2.5

2.75

2.75

2.25

2.25

2.25

2

2

1.75


CO-PSO Mapping Matrix for Course Code: CC – VI A

COs

PSO1

PSO2

PSO3

CC- VI A.1

3

3

2

CC- VI A.2

2

3

3

CC- VI A.3

3

3

3

CC- VI A.4

2

2

2

Average

2.5

2.75

2.5


UNIT – I 

Introduction to C++: About C++, Character Set, Keywords, Identifiers, Constants, Punctuators, Date Types: User-Defined, Built-in, Derived Data Types, Access Modifiers, Unformatted and Formatted I/O Operations. I/O using extraction and extraction operators, Type Conversion, Type Casting.

UNIT – II 

Operators in C++: Arithmetic, Relational, Logical, Ternary, Precedence & associativity of Operators. Control Structures: if statement, if-else statement, nested if, if-else-if ladder, switch…case statement, break and continue, goto statement, nested switch…case statement, Loops: while loop, do…while loop, for loop.


UNIT – III

Arrays and strings: Array definition, initialization, multidimensional arrays, Manipulation of array elements, String declaration and initialization, Manipulations, String handing functions. Functions: Declaration and Definition, return values, arguments, passing parameters by value, call by reference, call by pointer, Recursions, Inline  and external linkage Functions, storage classes.





UNIT – IV 

Object-Oriented Features of C++: Class and Objects, Data hiding & encapsulation, abstraction, constructors & destructors, Data Members and Member Functions, accessing class members, empty class, local class, global class, Scope Resolution Operator and its Uses, Static Data Members, Static Member Functions, Structure vs Class.



Text Books:

  1. Herbert Scildt, C++, The Complete Reference,Tata McGraw-Hill 

  2. Robert Lafore, Object Oriented Programming in C++, SAMS Publishing


Reference Books:

  1. Bjarne Stroustrup, The C++ Programming Language, Pearson Education 

  2. Balaguruswami, E., Object Oriented Programming In C++, Tata McGraw-Hill. 

  3. Richard Johnson, An Introduction to Object-Oriented Application Development, Thomson Learning. 









































CC- VI B: LOGICAL ORGANIZATION OF COMPUTERS

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of computer as a system and making student aware of internal mechanism of computer hardware and it’s working.

Course Outcomes: At the end of this course, the student will be able to:  

CC- VI B.1: understand number systems, error detecting & correcting code and character representations;

CC- VI B.2: understand computer arithmetic and Boolean algebra and simplification of Boolean expressions.

CC- VI B.3: design combinational circuits using logic gates.

CC- VI B.4: design sequential circuits such as registers and counters using flip-flops.


CO-PO Mapping Matrix for Course Code: CC – VI B

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- VI B.1

3

3

2

3

3

2

2

2

2

1

2

CC- VI B.2

3

2

3

3

1

2

2

3

2

2

2

CC- VI B.3

2

3

3

3

2

2

3

2

1

1

2

CC- VI B.4

3

2

2

2

3

3

2

3

3

2

3

Average

2.75

2.5

2.5

2.75

2.25

2.25

2.25

2.5

2

1.5

2.25



CO-PSO Mapping Matrix for Course Code: CC – VI B

COs

PSO1

PSO2

PSO3

CC- VI A.1

2

1

2

CC- VI A.2

2

1

1

CC- VI A.3

2

2

1

CC- VI A.4

2

2

1

Average

2

1.5

1.25


UNIT – I 

Number Systems: Binary, Octal, Decimal and Hexadecimal, Conversions from one number system to another, BCD Codes, Error Detecting and Correcting Codes, Character Representation – ASCII, EBCDIC and Unicode, Binary Arithmetic; Binary Addition, Binary Subtraction, Binary Multiplication, Binary Division, Complementary numbering systems: 1’s and 2’s Complements representations, Fixed-Point and Floating-Point Representation of Numbers.


UNIT – II 

Boolean Algebra: Boolean Algebra Postulates, basic Boolean Theorems, Boolean Expressions, Boolean Functions, Truth Tables, Canonical Representation of Boolean Expressions: SOP and POS, Simplification of Boolean Expressions using Boolean Postulates & Theorems, Kaurnaugh-Maps (upto four variables), Tabular Method, Handling Don’t Care conditions.



UNIT – III

Logic Gates: Basic Logic Gates – AND, OR, NOT, Universal Gates – NAND, NOR, Other Gates – XOR, XNOR etc. NAND, NOR. Their symbols, truth tables and Boolean expressions. Combinational Circuits: Design Procedures, Half Adder, Full Adder, Half Subtractor, Full Subtracor, Multiplexers, Demultiplexers, Decoder, Encoder, Comparators, Code Converters. 


UNIT – IV 

Sequential Circuits: Basic Flip- Flops and their working. Synchronous and Asynchronous Flip –Flops, Triggering of Flip-Flops, Clocked RS, D Type, JK, T type and Master-Slave Flip-Flops. State Table, State Diagram and State Equations. Flip-flops characteristics & Excitation Tables. Designing Registers & Counters: Asynchronous and Synchronous Binary Ripple Counter, Binary Synchronous Counter, Modulo-N Counters and Up-Down Counters. 

Text Books:

  1. M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd. 

  2. V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, Prentice Hall.


Reference Books:

  1. Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India Pvt. Ltd. 

  2. Nicholas Carter, Schaum’s Outlines Computer Architecture, Tata McGraw-Hill.







































CC- IX A: C++ PROGRAMMING- II

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of C++ (high level language) as one of the programming tool and generating logical development using programming. This course will help students to learn about OOPS concepts and linking C++ as a powerful OOPS language.

Course Outcomes: At the end of this course, the student will be able to:  

CC- IX A.1: understand pointers, constructor and destructors in C++;

CC- IX A.2: acquire the detailed knowledge of polymorphism;

CC- IX A.3: learn to implement exception handling and template;  

CC- IX A.4: learn File handling in C++. 


CO-PO Mapping Matrix for Course Code: CC- IX A

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- IX A.1

3

3

2

3

3

2

2

2

2

3

2

CC- IX A.2

3

2

3

3

3

2

2

2

2

2

2

CC- IX A.3

3

2

3

3

2

2

2

2

1

1

2

CC- IX A.4

3

2

2

2

2

3

3

3

3

2

2

Average

3

2.25

2.5

2.75

2.5

2.25

2.25

2.25

2

2

2



CO-PSO Mapping Matrix for Course Code: CC- IX A

COs

PSO1

PSO2

PSO3

CC- IX A.1

3

3

2

CC- IX A.2

2

3

3

CC- IX A.3

3

3

3

CC- IX A.4

2

2

2

Average

2.5

2.75

2.5


UNIT – I 

Pointers & Runtime binding: pointer variable, address operator, void pointer, dynamic memory allocation & deallocation, Pointer arithmetic. Object Initialization and Cleanup: Constructors, types of constructors, destructors, constant objects and constructors. Friend Function & Class: defining friend function and friend class, defining member function of a class as friend function.

UNIT – II 

Static Polymorphism: Function Overloading & Operator Overloading, over loadable operators, overloading unary & Binary Operators, Concatenating Strings using Operators overloading, 

Inheritance: Definition, Need, derivation types, different Forms of Inheritance, overloading vs overriding. 

Dynamic Polymorphism: Virtual and Pure Virtual Functions and their need, Virtual derivation, Virtual Destructor.

UNIT – III

Exception Handling in C++: Exception handling model, Exception handling constructs – try, throw, catch, Order of catch blocks, Catching all exceptions, Nested try blocks, handling uncaught exceptions, unexpected(),  terminate() and standard exceptions. Generic Programming: Function template, Overloading of template functions, Member function templates, class templates.


UNIT – IV 

File handling: Hierarchy of File Streams, opening & closing files, file modes, file pointers and their manipulation.

Sequential access to a file, Text & Binary files, saving and retrieving objects in a file, random access to a file.


Text Books:

  1. Herbert Scildt, C++, The Complete Reference, Tata McGraw-Hill. 

  2. Robert Lafore, Object Oriented Programming in C++, SAMS Publishing.

Reference Books:

  1. Bjarne Stroustrup, the C++ Programming Language, Pearson Education. 

  2. Balaguruswami, E., Object Oriented Programming In C++, Tata McGraw-Hill.














































CC- IX B: DATA STRUCTURE

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: Learning of data structure is like learning alphabets to learn any proper language. In this course student will be aware of memory management and use of data structure in computer programming. 

Course Outcomes: At the end of this course, the student will be able to:  

CC- IX B.1: learn basics of data structure and algorithm complexities;

CC- IX B.2: implement arrays and various searching, sorting techniques; 

CC- IX B.3: understand the idea of implementation for stack, linked list and queue;

CC- IX B.4: learn tree traversal methods and graphs;


CO-PO Mapping Matrix for Course Code: CC – IX B

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- IX B.1

3

3

2

3

3

2

2

2

2

3

2

CC- IX B.2

3

2

3

3

3

2

2

2

2

2

2

CC- IX B.3

2

3

3

3

2

2

2

2

1

1

2

CC- IX B.4

3

2

2

2

3

3

2

3

3

2

2

Average

2.75

2.5

2.5

2.75

2.75

2.25

2

2.25

2

2

2



CO-PSO Mapping Matrix for Course Code: CC – IX B 

COs

PSO1

PSO2

PSO3

CC- IX B.1

2

2

3

CC- IX B.2

2

3

3

CC- IX B.3

2

3

3

CC- IX B.4

2

2

3

Average

2

2.5

3


UNIT – I 

Data Structure Definition, Data Type vs. Data Structure, Categories of Data Structures, Data Structure Operations, Applications of Data Structures, Algorithms Complexity and Time-Space Trade-off, Big-O Notation. Strings: Introduction, Strings, String Operations, Pattern Matching Algorithms. 


UNIT – II 

Arrays: Introduction, Linear Arrays, Representation of Linear Array in Memory, Traversal, Insertions, Deletion in an Array, Multidimensional Arrays, Sparse Matrix. Algorithm for Insertion, Deletion Addition and Multiplication in 2-D Array. Searching and Sorting Techniques, Sorting Techniques: Bubble Sort, Merge Sort, Selection Sort’, Heap Sort, Insertion Sort. Searching Techniques: Sequential Searching, Binary Searching, Search Trees.


UNIT – III

Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications.

Linked Lists: Introduction, Types, Operations (Insertion, Deletion, Traversal, Searching, Sorting), Applications, Dynamic Memory Management, Implementation of Linked Representations. 


UNIT – IV 

Trees: Basic Terminology, Representation, Binary Trees, Tree Representations using Linked List, Basic Operation on Binary tree, Traversal of Binary Trees: In order, Pre-order & Post-order, Applications of Binary tree. Algorithm of Tree Traversal with and without Recursion. Graphs: Definitions and Basic Terminologies, Representation of Graphs, Graph Traversals, Shortest Path Problem, Applications.


Text Books:

  1. Seymour Lipschutz, Data Structures, Tata McGraw-Hill Publishing Company Limited, Schaum’s Outlines. 

  2. YedidyanLangsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, Data Structures Using C, Pearson 

Education.

Reference Books:

  1. Trembley, J.P. And Sorenson P.G., An Introduction to Data Structures With Applications, Mcgraw-Hill. 

  2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Addison-Wesley. 











































CC- XII A: PROGRAMMING IN JAVA

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of JAVA as a High level language as one of the programming tool and generating logical development using programming. Making student to learn about OOPS and linking JAVA as a powerful OOPs language. Also making student aware of property of JAVA as Platform independent.

Course Outcomes: At the end of this course, the student will be able to: 

CC- XII A.1: demonstrate the basic programming constructs of Java and OOPs to develop Java programs. 

CC- XII A.2: learn and develop various controls and branching of logics under various cases using language control structures.

CC- XII A.3: exemplify the usage to implement polymorphism and Inheritance in java programs.

CC- XII A.4: acquire knowledge of Packages, Interfaces, Exceptions and Multithreading in building efficient applications.


CO-PO Mapping Matrix for Course Code: CC – XII A

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- XII A.1

3

2

3

1

3

2

2

3

2

1

2

CC- XII A.2

3

2

3

1

2

3

2

3

2

1

3

CC- XII A.3

3

2

3

1

2

2

2

3

2

2

CC- XII A.4

3

2

3

1

3

3

2

3

3

1

3

Average

3

2

3

1

2.5

2.5

2

3

2.25

1

2.5



CO-PSO Mapping Matrix for Course Code: CC – XII A

COs

PSO1

PSO2

PSO3

CC- XII A.1

1

2

3

CC- XII A.2

1

3

3

CC- XII A.3

1

2

3

CC- XII A.4

1

3

3

Average

1

2.5

3



UNIT – I 

Key Attributes of Object-Oriented Programming, Introduction to Java, History and Features of Java, Java Virtual Machine (JVM), JDK, Java Runtime Environment; Basic Elements: Lexical Tokens, Identifiers, Keywords, Literals, Comments, Primitive Data types, Operators, Assignments; Input/output in Java: Basics, I/O Classes, Reading Console Input.


UNIT – II 

Control Structures in Java: Decision and Loop Control Statements.

Class and Object in Java: Class Fundamentals, creation of Objects, Defining Methods, Argument Passing Mechanism, Constructors, Abstract Class, Static Members. Array in Java: Defining an Array, Initializing & Accessing Array, Multi –Dimensional Array.



UNIT – III

String: String Fundamentals, Operations on Array and String, String Constructors, Creating Strings using String Class and StringBuffer Class. Polymorphism in Java: Basic Concept, Types, Overriding vs Overloading, Inheritance: Benefits of Inheritance, Types of Inheritance


UNIT – IV 

Interface : Implementing Interface, extending Interface; package: creating a package, import keyword; exception handling: catching multiple exception, throw/throws keyword, Finally keyword, user defined exception, Introduction to Multithreading



Text Books:

  1. Ivor Horton, Beginning JAVA 2, WROX Publications, New Delhi

  2. Patrick Naughton and Herbert Schlitz,JAVA-2 Complete Reference ,TMH, New Delhi

  3. Paul Deital & Harvey Deital, Java: How to Program, Pearson Education.



Reference Books:

  1. Balaguruswamy, Programming with Java, TMH, New Delhi.

  2. Java6 Programming, BlackBook,KoGenT, DreamtechPress. 






























CC-XII B: OPERATING SYSTEM

Type: Core Course (CC)

Course Credits: 03

Contact Hours: 03 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 60

External Pass Marks: 24

Internal Maximum Marks: 15

Total Max. Marks: 75

Total Pass Marks: 30

Instructions to paper setter for End semester examination: 

Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to provide knowledge of Operating System (OS) as a system program. Making student to learn about OS and linking OS as a powerful tool to make system work. Student will be able to learn types of OS and learn about system operations using OS.

Course Outcomes: At the end of this course, the student will be able to:  

CC-XII B.1: understand the basic concepts of operating systems and its services.

CC-XII B.2: understand concept of process management and scheduling.

CC-XII B.3: acquire knowledge of process synchronization along with deadlock handling. 

CC-XII B.4: learn about memory management and distributed operating system.


CO-PO Mapping Matrix for Course Code: CC – XII B

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

CC- XII B.1

3

3

2

3

3

2

2

2

2

2

CC- XII B.2

3

2

3

3

3

2

2

2

2

2

CC- XII B.3

2

3

3

3

2

2

2

2

2

1

2

CC- XII B.4

3

3

2

2

3

3

2

3

2

2

Average

2.75

2.75

2.5

2.75

2.75

2.25

2

2.25

2

1

2


CO-PSO Mapping Matrix for Course Code: CC – XII B

COs

PSO1

PSO2

PSO3

CC- XII B.1

2

3

2

CC- XII B.2

2

3

3

CC- XII B.3

2

3

3

CC- XII B.4

2

2

2

Average

2

2.75

2.5



UNIT – I 

Introductory Concepts: Operating System Functions and Characteristics, Historical Evolution of Operating Systems,

Operating System Structure and Operations; 

Types of Operating System: Real time, Multiprogramming, Multiprocessing, Batch processing;

Operating System Services, Operating System Interface, Methodologies for Implementation of Operating System, Service System Calls, System Programs.

UNIT – II 

Process Management: Process Concepts, Operations on Processes, Process States and Process Control Block. Inter-Process Communication;

Multithreaded Programming: Multithreading Models, Threading Issues;

CPU Scheduling: Scheduling Criteria, Levels of Scheduling, Scheduling Algorithms, Multiple Processor Scheduling; Algorithm Evaluation. 

UNIT – III

Synchronization: Critical Section Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, Classical Problem of Synchronization, Monitors, Atomic Transactions;

Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection and Recovery.


UNIT – IV 

Memory Management Strategies: Memory Management of Single-User and Multiuser Operating System, Partitioning, Swapping, Contiguous Memory Allocation, Paging and Segmentation; 

Virtual Memory Management: Demand Paging, Page Replacement Algorithms, Thrashing, Memory Mapped Files.

Distributed Operating Systems: Types of Network based Operating Systems, Network Structure, Design Issues; 

Text Books:

  1. Silberschatz A., Galvin P.B.,and Gagne G., Operating System Concepts, John Wiley & Sons. 

  2. Godbole, A.S., Operating Systems, Tata McGraw-Hill Publishing Company, New Delhi.


Reference Books:

  1. Deitel, H.M., Operating Systems, Addison-Wesley Publishing Company, New York. 

  2. Tanenbaum, A.S., Operating System-Design and Implementation, Prentice Hall of India, New Delhi.










































DSE-III (I): JAVASCRIPT

Type: Discipline Specific Elective (DSE)

Course Credits: 04

Contact Hours: 04 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 80

External Pass Marks: 32

Internal Maximum Marks: 20

Total Max. Marks: 100

Total Pass Marks: 40

Instructions To Paper Setter For End Semester Exam: Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: The aim of the course is to develop the skill & knowledge of concepts commonly used in dynamic language programming. Student will also be able to learn about client side interfaces through the use of DOM.

Course Outcomes: At the end of this course, the student will be able to: 

DSE-III (I).1: understand concept of Scripting.

DSE-III (I).2: acquire knowledge about basic fundamentals of JavaScript.

DSE-III (I).3: understand the applicability of various objects like window, document used in programming.

DSE-III (I).4: acquire the skills that will enable him to design and build high level web enabled applications. 


CO-PO Mapping Matrix for Course Code: DSE-III (I)

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

DSE-III (I).1

3

3

2

3

1

3

2

3

2

1

2

DSE-III (I).2

3

3

3

3

1

3

2

2

2

1

2

DSE-III (I).3

3

3

3

3

2

3

2

2

2

1

2

DSE-III (I).4

3

3

3

3

2

3

2

3

2

2

3

Average

3

3

2.75

3

1.5

3

2

2.5

2

1.25

2.25


CO-PSO Mapping Matrix for Course Code: DSE-III (I)

COs

PSO1

PSO2

PSO3

DSE-III (I).1

2

3

3

DSE-III (I).2

2

3

3

DSE-III (I).3

2

3

3

DSE-III (I).4

2

3

3

Average

2

3

3




UNIT – I 

The Nature of JavaScript: Evolution of Scripting Languages, JavaScript -Definition, Programming for Non-Programmers, Introduction to Client–Side Programming, Comparison between Java, JavaScript & VB Script. Enhancing HTML Documents with JavaScript. Static and Dynamic web pages.


UNIT – II 

Introduction to JavaScript: Document Object Model (DOM), obtaining user inputs, memory concepts, Character set, case sensitivity, comments, Literals, Expression & Operators, Control Structures, looping constructs, break, continue statements, variables, Data types, Keywords.


UNIT – III

JavaScript types, merge multiple JavaScript into one, Running Scripts, Methods, and Events, Introduction to Objects: String, Date, Boolean, Window, document and various Object interaction,



UNIT – IV 

Array declaration and allocation, passing arrays to function, Scoping rules, Recursion and iteration, cookies, Form Validation. Introduction to XML.



Text Books:

  1. David Flanagan, JavaScript: The Definitive Guide: The Definitive Guide. 

  2. Chris Bates, Web Programming, building Internet applications, WILEY Dreamtech.



Reference Books:

  1. Kogent Learning, Web Technologies: HTML, JavaScript, PHP, Java, JSP, XML, AJAX – Black Book, Wiley India Pvt. Ltd.







































DSE-III (II): DATABASE MANAGEMENT SYSTEM

Type: Discipline Specific Elective (DSE)

Course Credits: 04

Contact Hours: 04 hours/week.

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 80

External Pass Marks: 32

Internal Maximum Marks: 20

Total Max. Marks: 100

Total Pass Marks: 40

Instructions To Paper Setter For End Semester Exam: Examiner will be required to set NINE questions in all. Question No.1 will consist of objective type / short-answer type questions covering the entire syllabus. In addition to Question no. 1, the examiner is required to set EIGHT more questions selecting TWO from each UNIT. Student will be required to attempt FIVE questions in all. Question No.1 will be compulsory. In addition to compulsory question, student will have to attempt FOUR more questions selecting ONE question from each UNIT. All questions will carry equal marks.

Course Objectives: Today almost all real life problems include data. The objective of this paper to get student aware about the basic concept of Data. In this paper student will learn database management and its implementation.

Course Outcomes: At the end of this course, the student will be able to: 

DSE-III (II).1: learn basic concepts of data base along with its functions and components.

DSE-III (II).2: understand Relational data models.

DSE-III (II).3: understand SQL as query language and Learn the concept of relational algebra and calculus.

DSE-III (II).4: acquire knowledge of advanced concepts of DBMS.


CO-PO matrix for the Course  Code: DSE-III (II)

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

DSE-III (II).1

3

3

2

3

3

2

2

2

3

3

2

DSE-III(II) .2

3

2

3

3

3

1

2

2

2

2

2

DSE-III(II) .3

3

3

2

2

3

3

2

3

3

2

2

DSE-III(II) .4

2

3

3

3

2

2

2

2

1