UG BSC Computer Science Syllabus NEP 2020
UG BSC Computer Science Syllabus NEP 2020
and
Open Elective Courses in Computer Science
Submitted to
2. Computer Science as MAJOR with another Subject also as MAJOR (Table IIIA of Model Curriculum)
3. Computer Science as MINOR with another Subject as MAJOR (As per Table IIA of Model Curriculum)
Hour of Discipline Specific Hour of
Discipline Specific Core Teaching/ Week
Sem Elective Courses Teaching
Courses(DSC)
Theory Lab (DSE)/ Vocational /Week
Courses (VC)
1 21BSDSC1: Computer Fundamentals and
Programming in C 4
21BSDSC1P: C Programming Lab 4
2 21BSDSC2: Data Structures using C 4
21BSDSC2P: Data structures Lab 4
3 21BSDSC3: Design and Analysis of
Algorithms 4
21BSDSC3P: DAA Lab
4
4 21BSDSC4: Database Management Systems 4
21BSDSC4P: DBMS Lab 4
Open Elective:
2
Vocational Courses:
Group-1: Group-1:
• DTP, CAD and Multimedia • Health Care Technologies
• Hardware and Server Maintenance • Digital Marketing
• Web Content Management Systems • Office Automation
• E-Commerce • Multimedia Processing
• Web Designing • Accounting Package
3
Model Syllabus for BSc (Basic and Honors), Semesters I and II
Semester I
Course Title: Computer Fundamentals and Course code: 21BSDSC1
Programming in C
Content Hours
Unit - 1
Fundamentals of Computers: Introduction to Computers - Computer Definition, Characteristics of 8
Computers, Evolution and History of Computers, Types of Computers, Basic Organisation of a
Digital Computer; Number Systems – different types, conversion from one number system to
another; Computer Codes – BCD, Gray Code, ASCII and Unicode; Boolean Algebra – Boolean
Operators with Truth Tables; Types of Software – System Software and Utility Software; Computer
Languages - Machine Level, Assembly Level & High Level Languages, Translator Programs –
Assembler, Interpreter and Compiler; Planning a Computer Program - Algorithm, Flowchart and
Pseudo code with Examples.
Unit - 2
Introduction to C Programming: Over View of C; History and Features of C; Structure of a C 10
Program with Examples; Creating and Executing a C Program; Compilation process in C.
C Programming Basic Concepts: C Character Set; C tokens - keywords, identifiers, constants, and
variables; Data types; Declaration & initialization of variables; Symbolic constants.
Input and output with C: Formatted I/O functions - printf and scanf, control stings and escape
sequences, output specifications with printf functions; Unformatted I/O functions to read and
display single character and a string - getchar, putchar, gets and puts functions.
Unit - 3
C Operators & Expressions: Arithmetic operators; Relational operators; Logical operators; 12
Assignment operators; Increment & Decrement operators; Bitwise operators; Conditional
operator; Special operators; Operator Precedence and Associatively; Evaluation of arithmetic
expressions; Type conversion.
4
Control Structures: Decision making Statements - Simple if, if_else, nested if_else, else_if ladder,
Switch-case, goto, break & continue statements; Looping Statements - Entry controlled and Exit
controlled statements, while, do-while, for loops, Nested loops.
Unit - 4
Arrays: One Dimensional arrays - Declaration, Initialization and Memory representation; Two 12
Dimensional arrays - Declaration, Initialization and Memory representation.
Strings: Declaring & Initializing string variables; String handling functions - strlen, strcmp, strcpy and
strcat; Character handling functions - toascii, toupper, tolower, isalpha, isnumeric etc.
Pointers in C: Understanding pointers - Declaring and initializing pointers, accessing address and
value of variables using pointers; Pointers and Arrays; Pointer Arithmetic; Advantages and
disadvantages of using pointers;
Unit - 5
User Defined Functions: Need for user defined functions; Format of C user defined functions; 10
Components of user defined functions - return type, name, parameter list, function body, return
statement and function call; Categories of user defined functions - With and without parameters
and return type.
User defined data types: Structures - Structure Definition, Advantages of Structure, declaring
structure variables, accessing structure members, Structure members initialization, comparing
structure variables, Array of Structures; Unions - Union definition; difference between Structures
and Unions.
Text Books
1. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals (Sixth Edition), BPB Publication
2. E. Balgurusamy: Programming in ANSI C (TMH)
References
1. Kamthane: Programming with ANSI and TURBO C (Pearson Education)
2. V. Rajaraman: Programming in C (PHI – EEE)
3. S. ByronGottfried: Programming with C (TMH)
4. Kernighan & Ritche: The C Programming Language (PHI)
5. Yashwant Kanitkar: Let us C
6. P.B. Kottur: Programming in C (Sapna Book House)
5
Course Title: C Programming Lab Course code: 21BSDSC1P
Total Contact Hours: 42 Course Credits: 02
Formative Assessment Marks: 25 Duration of SEE/Exam: 03 Hours
Summative Assessment Marks: 25
Practice Lab
The following activities be carried out/ discussed in the lab during the initial period of the semester.
1. Basic Computer Proficiency
a. Familiarization of Computer Hardware Parts
b. Basic Computer Operations and Maintenance.
c. Do’s and Don’ts, Safety Guidelines in Computer Lab
2. Familiarization of Basic Software – Operating System, Word Processors, Internet Browsers,
Integrated Development Environment (IDE) with Examples.
3. Type Program Code, Debug and Compile basic programs covering C Programming
fundamentals discussed during theory classes.
Programming Lab
Part A:
1. Write a C Program to read radius of a circle and to find area and circumference
2. Write a C Program to read three numbers and find the biggest of three
3. Write a C Program to demonstrate library functions in math.h
4. Write a C Program to check for prime
5. Write a C Program to generate n primes
6. Write a C Program to read a number, find the sum of the digits, reverse the number and
check it for palindrome
7. Write a C Program to read numbers from keyboard continuously till the user presses 999
and to find the sum of only positive numbers
8. Write a C Program to read percentage of marks and to display appropriate message
(Demonstration of else-if ladder)
9. Write a C Program to find the roots of quadratic equation (demonstration of switch-case
statement)
10. Write a C program to read marks scored by n students and find the average of marks
(Demonstration of single dimensional array)
11. Write a C Program to remove Duplicate Element in a single dimensional Array
12. Program to perform addition and subtraction of Matrices
Part B:
1. Write a C Program to find the length of a string without using built in function
2. Write a C Program to demonstrate string functions.
3. Write a C Program to demonstrate pointers in C
4. Write a C Program to check a number for prime by defining isprime( ) function
5. Write a C Program to read, display and to find the trace of a square matrix
6. Write a C Program to read, display and add two m x n matrices using functions
7. Write a C Program to read, display and multiply two m x n matrices using functions
8. Write a C Program to read a string and to find the number of alphabets, digits, vowels,
consonants, spaces and special characters.
9. Write a C Program to Reverse a String using Pointer
10. Write a C Program to Swap Two Numbers using Pointers
11. Write a C Program to demonstrate student structure to read & display records of n
students.
12. Write a C Program to demonstrate the difference between structure & union.
Note: Student has to execute a minimum of 10 programs in each part to complete the Lab course.
6
Semester: II
Course Title: Data Structures using C Course code: 21BSDSC2
Course Content
Content Hours
Unit - 1
Introduction to data structures: Definition; Types of data structures - Primitive & Non-primitive, 10
Linear and Non-linear; Operations on data structures.
Algorithm Specification, Performance Analysis, Performance Measurement
Recursion: Definition; Types of recursions; Recursion Technique Examples - Fibonacci numbers,
GCD, Binomial coefficient nCr, Towers of Hanoi; Comparison between iterative and recursive
functions.
Unit - 2
Arrays: Basic Concepts – Definition, Declaration, Initialisation, Operations on arrays; Types of 10
arrays; Arrays as abstract data types (ADT); Representation of Linear Arrays in memory;
Traversing linear arrays; Inserting and deleting elements; Sorting – Selection sort, Bubble sort, Quick
sort, Selection sort, Insertion sort; Searching - Sequential Search, Binary search; Iterative and
Recursive searching; Multidimensional arrays; Representation of multidimensional arrays; Sparse
matrices.
Unit - 3
Dynamic memory allocation: Static & Dynamic memory allocation; Memory allocation and de- 12
allocation functions - malloc, calloc, realloc and free.
Linked list: Basic Concepts – Definition and Representation of linked list, Types of linked lists -
Singly linked list, Doubly liked list, Header liked list, Circular linked list; Representation of Linked
list in Memory;
Operations on Singly linked lists – Traversing, Searching, Insertion, Deletion; Memory allocation;
Garbage collection,
7
Unit - 4
Stacks: Basic Concepts – Definition and Representation of stacks; Operations on stacks; Applications 10
of stacks; Infix, postfix and prefix notations; Conversion from infix to postfix using stack; Evaluation
of postfix expression using stack; Application of stack in function calls.
Queues: Basic Concepts – Definition and Representation of queues; Types of queues - Simple
queues, Circular queues, Double ended queues, Priority queues; Operations on Simple queues;
Unit - 5
Trees: Definition; Tree terminologies –node, root node, parent node, ancestors of a node, siblings, 10
terminal & non-terminal nodes, degree of a node, level, edge, path, depth;
Binary tree: Type of binary trees - strict binary tree, complete binary tree, binary search tree and
heap tree; Array representation of binary tree. Traversal of binary tree; preorder, inorder and
postorder traversal; Reconstruction of a binary tree when any two of the traversals are given.
Text Books
1. Satraj Sahani: Fundamentals of Data Structures
References
1. Tanenbaum: Data structures using C (Pearson Education)
2. Kamathane: Introduction to Data structures (Pearson Education)
3. Y. Kanitkar: Data Structures Using C (BPB)
4. Kottur: Data Structure Using C
5. Padma Reddy: Data Structure Using C
6. Sudipa Mukherjee: Data Structures using C – 1000 Problems and Solutions (McGraw Hill
Education, 2007))
8
Course Title: Data Structures Lab Course code: 21BSDSC2P
Total Contact Hours: 42 Course Credits: 02
Formative Assessment Marks: 25 Duration of SEE/Exam: 03 Hours
Summative Assessment Marks: 25
Programming Lab
Part A:
1. Write a C Program to find GCD using recursive function
2. Write a C Program to display Pascal Triangle using binomial function
3. Write a C Program to generate n Fibonacci numbers using recursive function.
4. Write a C Program to implement Towers of Hanoi.
5. Write a C Program to implement dynamic array, find smallest and largest element of the
array.
6. Write a C Program to create two files to store even and odd numbers.
7. Write a C Program to create a file to store student records.
8. Write a C Program to read the names of cities and arrange them alphabetically.
9. Write a C Program to sort the given list using selection sort technique.
10. Write a C Program to sort the given list using bubble sort technique.
Part B:
1. Write a C Program to sort the given list using insertion sort technique.
2. Write a C Program to sort the given list using quick sort technique.
3. Write a C Program to sort the given list using merge sort technique.
4. Write a C Program to search an element using linear search technique.
5. Write a C Program to search an element using recursive binary search technique.
6. Write a C Program to implement Stack.
7. Write a C Program to convert an infix expression to postfix.
8. Write a C Program to implement simple queue.
9. Write a C Program to implement linear linked list.
10. Write a C Program to display traversal of a tree.
9
Open Electives in Computer Science:
(For BA, BSc, BCom, BSW, BBA, BBM students studying Core Courses other than
ComputerScience/ Computer Applications)
• Office Automation
• C Programming Concepts
• Multimedia Processing
• Python Programming Concepts
• R Programming
• E-Content Development
• E-Commerce
• Web Designing
• Computer Animation
• Accounting Package
10
Skill Enhancement Course for B.Sc and other courses
Course Content:
Content Hours
Unit – 1
Fundamentals of computer and Operating System:
Fundamentals of computer: An Overview of Computer, Functional Components of
a computer (Working of each unit), Evolution and Generations of Computers,
Classification of Computers, Applications of Computers. 05
Operating System: Operating Systems, types of operating systems, major functions
of the operating systems, types of user interface, examples of operating systems: MS-
DOS, Windows, Mac OS, Linux, Solaris, Android.
Unit – 2
Office Automation Tools, ICT and Security Aspects:
Office automation tools and ICT: word processor, power point, and spread sheet,
creating an email-ID, e-mail reading, saving, printing, forwarding and deleting the
mails, checking the mails, viewing and running file attachments, addressing with cc
and bcc, Google forms, working with Google Meet and Zoom Meet. Introduction to e- 05
learning platforms such as Swayam and MOOC.
Security Aspects: Threats and Prevention, Malware - virus, Worms, Ransomware,
Trojan, Spyware, adware, key loggers, Modes of Malware distribution, Antivirus,
HTTP vs HTTPS, Firewall, Cookies, Hackers and Crackers.
Unit – 3
E-Commence, E- payment methods and Societal impacts:
E-Commence: Basic Web Commerce Concept, The E-Commerce Environment,
Electro Marketplace Technologies, B2B, B2C and C2C.
E- payment methods: Cash Payment System, Credit Payment System, Types of
05
Electronic Payment Systems: Credit Card • Debit Card • Smart Card • E-Money •
Electronic Fund Transfer (EFT).
Societal impacts: Digital Foot prints, Digital Society and Netizen, Data Protection, E-
waste, Impact on Health.
11
Laboratory Activities:
• Identifying the configuration and version of a computer system (PC), laptop,
and a mobile phone.
• Create an email-ID and sending and editing with mail merge.
• Creating a Google form and send it to Ten users.
• Scheduling a virtual meet and invite peoples to join the Google meet and Zoom
Meet.
• Record the virtual Meet, chatting and sharing the documents or presentation on
virtual meet.
• Creating a hotspot from a mobile phone, and allowing others to use the hotspot.
30
• Sign in and create account e-learning platforms such as Swayam and MOOC.
• Creating a one-minute video of your choice in your native tongue, and upload
the video to YouTube.
• Creating and composing word document, creating tables, creating charts etc.
• Preparing power point slides using transition and animations.
• Simple computation using spread sheet.
• Creating an account in the railway reservation website, IRCTC, and finding
trains from Vijayapura to Bangalore.
• Creating an account in Redbus.in and book bus tickets online.
• Demo of online order placing for book using online e-payment methods.
Text Books:
1. Fundamentals of computers - V. Rajaraman - Prentice- Hall of India.
2. Computer Fundamentals - P. K. Sinha Publisher: BPB Publications.
Reference Links:
• Operating Systems: https://ftms.edu.my/v2/wpcontent/uploads/2019/02/csca0101_ch06.pdf
• Gmail Creating links: https://clubrunner.blob.core.windows.net/00000000961/en-
ca/files/homepage/how-to-create-a-gmail-account/HowtoCreateaGmailAccount.pdf
• Google Forms: https://pdst.ie/sites/default/files/Google%20Drive_1.pdf
• Google Meet: https://edvance.hawaii.hawaii.edu/wp-content/uploads/Google-Meet-Tutorial-
Getting-Started-and-Recording-a-Lecture.pdf
• Zoom Meet: https://assets.zoom.us/docs/user-guides/zoom-rooms-full-user-guide.pdf
• Swayam: https://www.aicte-india.org/bureaus/swayam
• Security Aspects - https://ncert.nic.in/textbook/pdf/lecs112.pdf
• E-Commence: http://www.aagasc.edu.in/cs/msccs/ECommerce%20Unit%201.pdf
• E- payment methods:http://www.dspmuranchi.ac.in/pdf/Blog/e%20business%20Unit-
III,%20%202020.pdf
• Societal impacts: https://ncert.nic.in/textbook/pdf/leip106.pdf
12
Course Title: Artificial Intelligence Course code: 21SEC2 Course Credits: 2
Total Contact Hours: 13 hours of theory and 26 hours of Duration of ESA: 01 Hour
practical
Formative Assessment Marks: 20 marks Summative Assessment
Marks: 30 marks
Course Content
Unit - 1
Overview of AI: Definition of Artificial Intelligence, Philosophy of AI, Goals of AI,
Elements of AI system, Programming a computer without and with AI, AI Techniques,
History of AI. 05
Intelligent Systems: Definition and understanding of Intelligence, Types of
Intelligence, Human Intelligence vs Machine Intelligence.
Unit – 2
AI Applications: Virtual assistance, Travel and Navigation, Education and
Healthcare, Optical character recognition, E-commerce and mobile payment
05
systems, Image based search and photo editing.
AI Examples in daily life: Installation of AI apps and instructions to use AI apps.
Unit – 3
Robotics: Introduction to Robotics, Difference in Robot System and Other AI
Program, Components of a Robot. 03
13
Laboratory Activities:
• Amazon Alexa:
https://play.google.com/store/apps/details?id=com.amazon.dee.app&hl=en&
am p;gl=US
• Google Lens:
https://play.google.com/store/search?q=google+lens&c=apps&hl=en&gl=US
• Image to Text to Speech ML OCR: 26
https://play.google.com/store/apps/details?id=com.mlscanner.image.text.speec hrs
h& hl=en_IN&gl=US
• Google Pay:
https://play.google.com/store/apps/details?id=com.google.android.apps.nbu.pai
sa
.user&hl=en_IN&gl=US
• Grammarly:
https://play.google.com/store/search?q=grammarly&c=apps&hl=en_IN&gl=
• Google Map:
https://play.google.com/store/search?q=google+maps&c=apps&hl=en&gl=US
• FaceApp:
https://play.google.com/store/apps/details?id=io.faceapp&hl=en_IN&gl=US
• Socratic:
https://play.google.com/store/apps/details?id=com.google.socratic&hl=en_IN&gl
=US
• Google Fit: Activity Tracking:
https://play.google.com/store/apps/details?id=com.google.android.apps.fitness&
h l=en_IN&gl=US
• SwiftKey Keyboard:
https://swiftkey-keyboard.en.uptodown.com/android
• E-commerce App:
https://play.google.com/store/apps/details?id=com.jpl.jiomart&hl=en_IN&gl=US
Text Books:
1. Wolfgang Ertel, “Introduction to Artificial Intelligence”, 2nd Edition, Springer
International Publishing 2017.
2. Michael Negnevitsky, “Artificial Intelligence A Guide to Intelligent Systems”, 2 nd
Edition, Pearson Education Limited 2005.
References:
1. https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_tutorial.pdf
2. Kevin Knight, Elaine Rich, Shivashankar B. Nair, ”Artificial Intelligence”, 3 rd Edition, July
2017.
Reference Links:
1. Voice Assistant: https://alan.app/blog/voiceassistant-2/
2. Browse with image: https://www.pocket-lint.com/apps/news/google/141075-what-
is- google-lens-and-how-does-it-work-and-which-devices-have-it
3. OCR: https://aws.amazon.com/what-is/ocr/
4. Mobile Payment system: https://gocardless.com/en-us/guides/posts/how-do-
14
mobile- payment-systems-work/
5. Grammarly: https://techjury.net/blog/how-to-use-grammarly/#gref
6. Travel & Navigation: https://blog.google/products/maps/google-maps-101-ai-power-
new-features-io-2021/
7. AI in photo editing: https://digital-photography-school.com/artificial-intelligence-
changed-photo-editing/
8. AI in education: https://www.makeuseof.com/what-is-google-socratic-how-does-it-
work/
9. AI in health and fitness: https://cubettech.com/resources/blog/implementing-
machine- learning-and-ai-in-health-and-fitness/
10. E-commerce and online shopping:
https://medium.com/@nyxonedigital/importance- of-e-commerce-and-online-
shopping-and-why-to-sell-online-5a3fd8e6f416
15
Open Elective in Computer Science
Course Title: Office Automation Course code: 21CSOE1 Course Credits: 3 (3L+0T+0P)
Semester: I Duration of SEE: 03 Hour
Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks
Course Outcomes (COs)
After completing this course satisfactorily, a student will be able to:
• Office tools course would enable the students in crafting professional word
documents, excel spread sheets, power point presentations using the Microsoft
suite of office tools.
• To familiarize the students in preparation of documents and presentations with
office automation tools.
• To perform documentation to perform accounting operations.
• To perform presentation skills.
Contents Hours
Unit-1
Fundamentals of computer: Overview of a Computer, Functional Components of a computer (Working of 10
each unit), Evolution of Computers, Generations Of Computers, Classification of Computers,
Applications of Computers.
Hardware: Block diagram of computer, Input and Output devices, Memory and storages devices,
Different ports and its uses, Different type of printers.
Unit-2
OFFICE APPLICATIONS –I 8
MS-Word Processing: Typing, Editing, Proofing & Reviewing, Formatting Text & Paragraphs, Automatic
Formatting and Styles, Working with Tables, Graphics and Frames, Mail Merge, Automating Your Work &
printing Documents.
Unit-3
OFFICE APPLICATIONS –II 8
Excel Spreadsheet: Working & Editing in Workbooks, Creating Formats & Links, formatting a Worksheet
& creating graphic objects, Creating Charts (Graphs), formatting and analyzing data, Organizing Data in a
List (Data Management), Sharing & Importing Data, Printing
Unit-4
OFFICE APPLICATIONS –III 8
MS Power point: Introduction to presentation – Opening new presentation, Different presentation
templates, Setting backgrounds, Selecting presentation layouts. Creating a presentation – Setting
Presentation style, Adding text to the Presentation. Formatting a Presentation - Adding style, Colour,
gradient fills, arranging objects, Adding Header & Footer, Slide Background, Slide layout. Adding
Graphics to the Presentation- Inserting pictures, movies, tables etc into presentation, Drawing Pictures
using Draw. Adding Effects to the Presentation- Setting Animation & transition effect. Printing Handouts,
Generating Standalone Presentation viewer.
Unit-5
INTERNET & ADVANCED COMMUNICATION 8
Internet and Web Browsers: Definition & History of Internet - Uses of Internet - Definition of Web
Addressing-URL-Different types of Internet Connections; Dial up connection, Broad band ( ISDN, DSL,
Cable), Wireless ( Wi-Fi, WiMax, Satellite, Mobile) naming convention, browsers and its types, internet
browsing, searching - Search Engines - Portals - Social Networking sites- Blogs - viewing a webpage,
downloading and uploading the website; Creating an email-ID, e-mail reading, saving, printing, forwarding
and deleting the mails, checking the mails, viewing and running file attachments, addressing with cc and
bcc.
16
Text Books
1. V. Rajaraman: Computer Fundamentals, 6th Edition, Prentice Hall India Learning Private Limited,
2014.
2. John Walkenbach, Herb Tyson, Faithe Wempen, cary N. Prague, Michael R. groh, Peter G.
Aitken, and Lisa a. Bucki : Microsoft Office 2007 Bible, Wiley India pvt.Ltd.,2007.
3. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals 6th Edition, BPB Publication, 2004.
References
1. Alexis Leon, Mathews Leon, and Leena Leon: Introduction to Information Technology, 2nd
Edition, Vijay Nicole Imprints Pvt. Ltd., 2009.
2. Shelly Cashman: Discovering the Internet: Complete, 4th Edition - Course Technology,
CENGAGE Learning Custom Publishing, 2012.
3. Etc-end the Clutter: Computer & Internet Basics Step-by-Step, Infinity Publishing, 2004.
4. R. Gabriel Gurley: A Conceptual Guide to OpenOffice.org 3, Create Space Independent
Publishing Platform, 2008.
17
Course Title: Computer Fundamentals Course code: 21CSOE2 Course Credits: 3 (3L+0T+0P)
Semester: II Duration of SEE: 03 Hour
Total Contact Hours: 42 SEE: 60 Marks
IA: 40 Marks
Course Content
Contents Hours
Unit-1
Computer Basics: Characteristics of Computers, Simple Model of a Computer, Algorithms, 10
Problem Solving Using Computers. Programming Languages: Why Programming Language?
Assembly Language, Higher Level Programming Languages, Compiling A High-Level Language
Program, Some High-Level Languages.
Unit-2
Computer Memory: Memory Cell, Memory Organization, Read Only Memory, Serial Access 8
Memory, Physical Devices Used to Construct Memories, Magnetic Hard Disk, Compact Disk
Read Only Memory (CDROM), Magnetic Tape Drive, Memory Hierarchy.
Unit-3
Binary Arithmetic: Binary Addition, Subtraction, Multiplication and Division, Signed Numbers, 8
Two’s Complement Representation of Numbers, Addition/Subtraction of Numbers in 2’s
Complement Notation, Floating Point Representation of Numbers, Arithmetic Operations with
Normalized Floating-Point Numbers. Data Representation: Representation of Characters in
Computers, Representation of Integers, fractions, Hexadecimal and Octal Representation of
Numbers, Decimal to Binary Conversion.
Unit-4
Logic Circuits: Introduction, Switching Circuits, AND/OR/NOT Operations, Boolean Functions, 8
Boolean Functions, Duality Principle, Theorems, Precedence of Operators, Venn Diagram, Truth
Table, Canonical Forms for Boolean Functions, Logic Circuits.
Unit-5
Computer Networks: Need for Computer Communication Networks, Communication 8
Protocols, Types of Networks, Network Topologies, Interconnecting Networks, Internet and
World Wide Web (WWW), Internet Security, The Future of Internet Technology.
18
Text Books:
1. V. Rajaraman, Neeharika Adabala: Fundamentals of Computers, 6th Edition, PHI Learning Private
limited, 2015.
References:
1. P.B. Kotur: Computer Concepts and C Programming, 23rd edition, Sapna Book House, March 2013.
2. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals, 6th Edition, BPB Publication,
2010.
3. Anita Goel: Computer Fundamentals, Pearson Education India, 2010.
4. Reema Thareja: Fundamentals of Computers, Oxford University Press, 2019.
19
Continuous Assessment Scheme
C1: Internal Test 15
C2: Internal Test 15
Seminar 05
Assignment 05
PART A
Q 1 a) (10*1=10)
b)
c)
d)
e)
f)
g)
h)
i)
j)
PART B (5*10=50)
Q 2 a) 5M
b) 5M
Q 3 a) 5M
b) 5M
Q 4 a) 5M
b) 5M
Q 5 a) 5M
b) 5M
Q 6 a) 5M
b) 5M
Q 7 a) 5M
b) 5M
a) 5M
Q8
b) 5M
20