









Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Semester wise BcA computers study guide
Typology: Study notes
1 / 16
This page cannot be seen from the preview
Don't miss anything!
[Based on I-C. Model of Karnataka State Higher Education Council] Semest er Course Code Title of the Paper Credits Languages, Skill Enhancement (SEC), and Ability Enhancement Courses (AECC) Credits Total Credits I CA-C1T Discrete Structure 3 OE1: Open Elective 3 26 CA-C2T Problem solving Techniques 3 Language L1 3 CA-C3T Data Structure 3 Language L2 3 CA-C4L Problem solving Lab 2 SEC I : Office Management Tools 2 CA-C5L Data Structure Lab 2 Physical Education 1 Health & Willingness 1 II CA-C6T Computer Architecture 3 OE2: Open Elective 3 26 CA-C7T Object Oriented Programming using Java 3 Language L1 3 CA-C8T Database Management System 3 Language L2 3 CA-C9L Java Lab 2 Environmental Science 2 CA-C10L Database Management System Lab 2 Physical Education 1 NCC/NSS/CL/R&R 1 III CA-C11T Operating Systems 3 OE3: Open Elective 3 26 CA-C12T Computer Networks 3 Language L1 3 CA-C13T Python Programming 3 Language L2 3 CA-C14L Computer Networks Lab 2 SEC II : Computer Assembly and Repair 2 CA-C15L Python Programming Lab 2 Physical Education 1 NCC/NSS/CL/R&R 1 IV CA-C16T Software Engineering 3 OE4: Open Elective 3 26 CA-C17T Artificial Intelligence 3 Language L1 3 CA-C18T Internet Technologies 3 Language L2 3 CA-C19L Artificial Intelligence Lab 2 The Constitution of India 2 CA-C20L Internet Technologies Lab 2 Physical Education 1 NCC/NSS/CL/R&R 1 V CA-C21T Design and Analysis of Algorithm 3 CA-V1 Vocation Course I : Quantitative Techniques 3 23 CA-C22T Data Analytics 3 CA-E1 Elective I : a. Data Mining b. Computer Graphics 3 CA-C23T Web Programming 3 SEC III : Cyber Crime, Cyber Law, and Intellectual Property Right 2 CA-C24L Data Analytics Lab 2 Physical Education 1 CA-C25L Web Programming Lab 2 NCC/NSS/CL/R&R 1
Semest er Course Code Title of the Paper Credits (^) Languages, Skill Enhancement (SEC), and Ability Enhancement Courses (AECC) Credits (^) Total Credits VI CA-C26T Theory of Computation 3 CA-V2 Vocation Course II : Electronic Content Design 3 23 CA-C27T Machine Learning (^3) CA-E2 Elective II : a. Operations Research b. Software Testing 3 CA-C28T Mobile Application Development 3 Professional Communication 2 CA-C29L Machine Learning Lab 2 Physical Education 1 CA-C30L Mobile Application Development Lab 2 NCC/NSS/CL/R&R 1 VII (^) CA-C31T Cloud Computing 3 CA-V3 Vocation Course III : Technical Writing 3 21 CA-C32T Internet of Things 3 CA-E3 Elective III : a. Modeling and Simulation b. Compiler Design 3 CA-C33T Internship 2 Research Methodology 3 CA-C34L Cloud Computing Lab 2 CA-C35L Internet of Things Lab 2 VIII CA-C36T Block Chain Technologies 3 CA-V4 Vocation Course IV : Project Management 3 20 CA-C37T Cryptography and System Security 3 CA-E4 Elective IV : a. Human Computer Interface b. Parallel Algorithms 3 CA-C38T Block Chain Technologies Lab 2 Research Project 6
Total Teaching Hours: 48 No. of Hours / Week: 03 UNIT - I [12 Hours] Introduction: The Role of Algorithms in Computing, Algorithms as a technology, Analyzing algorithms, Designing algorithms, Growth of Functions, Asymptotic notation, Standard notations and common functions. Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a set of numbers, Factorial Computation, Generating of the Fibonacci sequence, Reversing the digits of an integer, Character to number conversion. UNIT - II [12 Hours] C Programming: Getting Started, Variables and Arithmetic expressions. Input and Output: Standard input and output, formatted output- printf, variable length argument list, formatted input-scanf. Control Flow: Statements and Blocks, If-else, else-if, switch, loops: while loop, for loop, do while, break and continue, goto and labels. Pointers and Arrays: pointers and address, pointers and function arguments, multidimensional array, initialization of pointer arrays, command line arguments. UNIT - III [12 Hours] Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the greatest common divisor of two integers, computing the prime factors of an integer, generation of pseudo random numbers, raising a number to a large power. Array Techniques: Array order Reversal, Array counting or Histogramming, Finding the maximum number in a set, removal of duplicates from an ordered array, partitioning an array, Finding the kth smallest element, multiplication of two matrices. UNIT - IV [12 Hours] Merging: the two-way merge. Sorting: Sorting by selection, sorting by exchange, sorting by insertion, sorting by diminishing increment, sorting by partitioning. Searching: binary search, hash search. Text processing and Pattern searching: text line length adjustment, keyword searching in text, text line editing, linear pattern search Text Books:
Total Teaching Hours: 48 No. of Hours / Week: 03 UNIT-I [12 Hours] Introduction and Overview: Definition, Elementary data organization, Data Structures, data Structures operations, Abstract data types, algorithms complexity, time-space trade off. Preliminaries: Mathematical notations and functions, Algorithmic notations, control structures, Complexity of algorithms, asymptotic notations for complexity of algorithms. Arrays: Definition, Linear arrays, arrays as ADT, Representation of Linear Arrays in Memory,Traversing Linear arrays, Inserting and deleting, Multi-dimensional arrays, Matrices and Sparse matrices. UNIT-II [12 Hours] Linked list: Definition, Representation of Singly Linked List in memory,Traversing a Singly linked list, Searching in a Singly linked list, Memory allocation, Garbage collection, Insertion into a singly linked list, Deletion from a singly linked list; Doubly linked list, Header linked list, Circular linked list. Stacks: Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT, Arithmetic Expressions: Polish Notation, Conversion of infix expression to postfix expression, Evaluation of Post fix expression, Application of Stacks, Recursion, Towers of Hanoi, Implementation of recursive procedures by stack. Queues: Definition, Array representation of queue, Linked list representation of queues. Types of queue: Simple queue, Circular queue, Double-ended queue, Priority queue, Operations on Queues, Applications of queues. UNIT-III [12 Hours] Binary Trees: Definitions, Tree Search, Traversal of Binary Tree, Tree Sort, Building a Binary Search Tree, Height Balance: AVL Trees, Contiguous Representation of Binary Trees: Heaps, Lexicographic Search Trees: Tries, External Searching: B-Trees, Applications of Trees. Graphs: Mathematical Back ground, Computer Representation, Graph Traversal, Topological Sorting UNIT-IV [12 Hours] Searching: Introduction and Notation, Sequential Search, Binary Search, Comparison of Methods. Sorting: Introduction and Notation, Insertion Sort, Selection Sort, Shell Sort, Divide And Conquer, Merge sort for Linked List, Quick sort for Contiguous List. Hashing: Sparse Tables, Choosing a Hash function, Collision Resolution with Open Addressing, Collision Resolution by Chaining. Text Books:
NOTE: For all the programs write the output, flowchart and number of basic operations performed.
Total Teaching Hours: 48 No. of Hours / Week: 03 UNIT - I [12 Hours] Number Systems: Binary, Octal, Hexa decimal numbers, base conversion, addition, subtraction of binary numbers, one's and two's complements, positive and negative numbers, character codes ASCII, EBCDIC. Computer Arithmetic: Addition and Subtraction, Multiplication and Division algorithms, Floating-point Arithmetic Operations, Decimal arithmetic operations. Structure of Computers: Computer types, Functional units, Basic operational concepts, Von-Neumann Architecture, Bus Structures, Software, Performance, Multiprocessors and Multicomputer, Digital Logic Circuits: Logic gates, Boolean algebra, M a p S i m p l i f i c a t i o n. C o m b i n a t i o n a l C i r c u i t s : H a l f A d d e r , F u l l A d d e r , f l i p flops.Sequentialcircuits:Shiftregisters,Counters,IntegratedCircuits,Mux,Demux,Encoder,Decoder.Data representation: Fixed and Floating point. UNIT - II [12 Hours] Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer Instructions and Instruction cycle. Timing and Control, Memory-Reference Instructions, Input-Output and interrupt. Central processing unit: Stack organization, Instruction Formats, Addressing Modes, Data Transfer and Manipulation, Complex Instruction Set Computer (CISC) Reduced Instruction Set Computer (RISC), CISC vs RISC UNIT - III [12 Hours] Register Transfer and Micro-operations: Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro-Operations, Logic Micro-Operations, Shift Micro-Operations, Arithmetic logic shift unit. Micro-programmed Control: Control Memory, Address Sequencing, Micro-Program example, Design of Control Unit. Input Output: I/O interface, Programmed IO, Memory Mapped IO, Interrupt Driven IO, DMA. Instruction level parallelism: Instruction level parallelism (ILP)-over coming data hazards, limitations of ILP UNIT - IV [12 Hours] Memory System: Memory Hierarchy, Semiconductor Memories, RAM(Random Access Memory), Read Only Memory (ROM), Types of ROM, Cache Memory, Performance considerations, Virtual memory, Paging, Secondary Storage, RAID. Multiprocessors And Thread level Parallelism: Characteristics of multiprocessors, Multi-Threaded Architecture, Distributed Memory MIMD Architectures, Interconnection structures, TEXT BOOKS:
Total Teaching Hours: 48 No. of Hours / Week: 03 UNIT - 1 [12 Hours] Databases and Database Users: Introduction, An example, Characteristics of the Database Approach, Actors on the Scene, Workers behind the Scene, Advantages of Using DBMS Approach, A Brief History of Database Applications, When Not to Use a DBMS. Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-schema Architecture and Data Independence, Database Languages and Interfaces, The Database System Environment, Centralized and Client-Server Architectures, Classification of Database Management Systems. UNIT - 2 [12 Hours] Data Modeling Using Entity-Relationship Model: Using High-Level Conceptual Data Models for Database Design, An Example Database Application, Entity Types, Entity Sets, Attributes and Keys, Relationship Types, Relationship Sets, Roles and Structural Constraints, Weak Entity Types, Refining the ER Design Company Database Diagrams, Naming Conventions and Design. Issues, File organization and storage, secondary storage devices, type of single level ordered index, multi-level indexes, indexes on multiple keys, other types of indexes. UNIT â 3 [12 Hours] Relational Model and Relational Algebra: Relational Model Concepts, Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions and Dealing with Constraint Violations, Unary Relational Operations: SELECT and PROJECT, Relational Algebra Operations from SET Theory, Binary Relational Operations: JOIN and DIVISION, Additional Relational Operations, Examples of Queries in Relational Algebra. Relational Database Design: Anomalies in a database, functional dependency, normal forms, lossless join and dependency, BCNF, normalization through synthesis, higher order normal forms. SQL- SQL Data Definition and Data Types, Specifying Constraints in SQL, Schema Change Statements in SQL, Basic Queries in SQL, More Complex SQL Queries, Insert, Delete and Update Statements in SQL, Specifying Constraints as Assertion and Trigger, Views(Virtual Tables) in SQL, Embedded SQL, Dynamic SQL, UNIT â 4 [12 Hours] Introduction to transaction processing, transaction and system concepts, desirable properties of transactions, transaction support in SQL. Concurrency control techniques: two-phase locking techniques, concurrency control based on timestamp ordering. Recovery techniques: recovery concepts, recovery in multi-database systems, database backup and recovery from catastrophic failures. Text Books: