- Information
- AI Chat
B Tech 2nd Year CSE Hindi 2022 23 revised -1
Btech (kcs-701)
APJ Abdul Kalam Technological University
Recommended for you
Preview text
DR. A.P. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW
Evaluation Scheme & Syllabus
For
B. 2nd Year
Computer Science and Engineering (Hindi)
On
AICTE Model Curriculum
(Effective from the Session: 2022-23)
DR. A.P. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW
General Guidelines for Computer Science and Engineering-(Hindi)
1. The Internal and External examination papers may be bilingual ( Hindi & English )
2. Students may write the assessment (internal and external) either in Hindi, English or
both.
3. The subject teacher may use Hindi and English both as instruction medium.
4. Students may be motivated to develop application for Hindi language as mini or major
projects.
SEMESTER- IV
Sl.
No.
Subject
Codes
Subject
Periods Evaluation Scheme
End Semester
Total Credit L T P CT TA Total PS TE PE
1
KAS402H/
KOE041H-
048H
Maths IV/Engg. Science Course 3 1 0 30 20 50 100 150 4
2
KVE401H/
KAS
Universal Human Values/ Technical Communication
3 0 0
30 20 50 100 150 3
2 1 0
3 KCS401H Operating Systems 3 0 0 30 20 50 100 150 3
4 KCS402H
Theory of Automata and Formal Languages
3 1 0 30 20 50 100 150 4
5 KCS403H Microprocessor 3 1 0 30 20 50 100 150 4
6 KCS451H Operating Systems Lab 0 0 2 25 25 50 1
7 KCS452H Microprocessor Lab 0 0 2 25 25 50 1
8 KCS453H
Python Language Programming Lab
0 0 2 25 25 50 1
9
KNC402H/
KNC401H
Python Programming/Computer System Security
2 0 0 15 10 25 50 0
10
MOOCs (Essential for Hons. Degree)
Total 900 21
B. COMPUTER SCIENCE AND ENGINEERING - HINDI
THIRD SEMESTER (DETAILED SYLLABUS
KCS 301H DATA STRUCTURE
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1
Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by the algorithms and their common applications. K1, K 2 CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K 2
CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K 3
CO 4
Understanding the concept of recursion, application of recursion and its implementation and removal of recursion. K 4 CO 5 Identify the alternative implementations of data structures with respect to its performance to solve a real world problem.
K5, K 6
DETAILED SYLLABUS 3-1-
Unit Topic Proposed Lecture
I
Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C. Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array Application of arrays, Sparse Matrices and their representations. Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two variables Polynomial.
08
II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of recursion Problem solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs between iteration and recursion. Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.
08
III
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.
08
IV
Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm.
08
KCS 302H COMPUTER ORGANIZATION AND ARCHITECTURE
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Study of the basic structure and operation of a digital computer system. K1, K 2 CO 2 Analysis of the design of arithmetic & logic unit and understanding of the fixed point and floating-point arithmetic operations. K2, K 4
CO 3 Implementation of control unit techniques and the concept of Pipelining K 3 CO 4 Understanding the hierarchical memory system, cache memories and virtual memory K 2 CO 5 Understanding the different ways of communicating with I/O devices and standard I/O interfaces K2, K 4
DETAILED SYLLABUS 3-1-
Unit Topic Proposed Lecture
I
Introduction: Functional units of digital system and their interconnections, buses, bus architecture, types of buses and bus arbitration. Register, bus and memory transfer. Processor organization, general registers organization, stack organization and addressing modes.
08
II
Arithmetic and logic unit: Look ahead carries adders. Multiplication: Signed operand multiplication, Booths algorithm and array multiplier. Division and logic operations. Floating point arithmetic operation, Arithmetic & logic unit design. IEEE Standard for Floating Point Numbers
08
III
Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc), micro operations, execution of a complete instruction. Program Control, Reduced Instruction Set Computer, Pipelining. Hardwire and micro programmed control: micro programme sequencing, concept of horizontal and vertical microprogramming.
08
IV
Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory organization. ROM memories. Cache memories: concept and design issues & performance, address mapping and replacement Auxiliary memories: magnetic disk, magnetic tape and optical disks Virtual memory: concept implementation.
08
V
Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of interrupts and exceptions. Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and Direct Memory Access., I/O channels and processors. Serial Communication: Synchronous & asynchronous communication, standard communication interfaces.
08
Text books: 1. Computer System Architecture - M. Mano
Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition, Reprint 2012
John P. Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition, 1998. Reference books
William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson Education, Seventh edition, 2006.
Behrooz Parahami, “Computer Architecture”, Oxford University Press, Eighth Impression, 2011.
David A. Patterson and John L. Hennessy, “Computer Architecture-A Quantitative Approach”, Elsevier, a division
of reed India Private Limited, Fifth edition, 2012 7. Structured Computer Organization, Tannenbaum(PHI)
KCS 303H DISCRETE STRUCTURES & THEORY OF LOGIC
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Write an argument using logical notation and determine if the argument is or is not valid. K3, K 4
CO 2 Understand the basic principles of sets and operations in sets. K1, K 2
CO 3
Demonstrate an understanding of relations and functions and be able to determine their properties. K 3 CO 4 Demonstrate different traversal methods for trees and graphs. K1, K 4
CO 5 Model problems in Computer Science using graphs and trees. K2, K 6
DETAILED SYLLABUS 3-1- Unit Topic Proposed Lecture
I
Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition of relation, Order of relations. Functions: Definition, Classification of functions, Operations on functions, Recursively defined functions. Growth of Functions. Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.
08
II Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields.
08
III
Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra.
08
IV
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory of Inference. (8) Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference theory of predicate logic.
08
V
Trees: Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring, Recurrence Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving recurrences. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
08
Text books: 1, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006. 2. B. Kolman, R. Busby, and S. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004. 3.E. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000. 4.R. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004 5, Seymour, “ Discrete Mathematics”, McGraw Hill. 6, J & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill. 4. Deo, 7, “Graph Theory With application to Engineering and Computer.”, PHI. 8. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi
Note: Understanding of mathematical computation software Mapple to experiment the followings (exp. 10 to 25):
- Working of Computation software
- Discover a closed formula for a given recursive sequence vice-versa
- Recursion and Induction
- Practice of various set operations
- Counting
- Combinatorial equivalence
- Permutations and combinations
- Difference between structures, permutations and sets
- Implementation of a recursive counting technique
- The Birthday problem
- Poker Hands problem
- Baseball best-of-5 series: Experimental probabilities
- Baseball: Binomial Probability
- Expected Value Problems
- Basketball: One and One
- Binary Relations: Influence
B.
COMPUTER SCIENCE AND ENGINEERING - HINDI
FOURTH SEMESTER (DETAILED SYLLABUS)
KCS 401H OPERATING SYSTEM
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Understand the structure and functions of OS K1, K 2 CO 2 Learn about Processes, Threads and Scheduling algorithms. K1, K 2 CO 3 Understand the principles of concurrency and Deadlocks K 2 CO 4 Learn various memory management scheme K 2 CO 5 Study I/O management and File systems. K2,K 4 DETAILED SYLLABUS 3-0- Unit Topic Proposed Lecture
I
Introduction : Operating system and functions, Classification of Operating systems- Batch, Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered structure, System Components, Operating System services, Reentrant Kernels, Monolithic and Microkernel Systems.
08
II
Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, Test and Set operation; Classical Problem in Concurrency- Dining Philosopher Problem, Sleeping Barber Problem; Inter Process Communication models and Schemes, Process generation.
08
III
CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process Transition Diagram, Schedulers, Process Control Block (PCB), Process address space, Process identification information, Threads and their management, Scheduling Algorithms, Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention, Avoidance and detection, Recovery from deadlock.
08
IV
Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation, Virtual memory concepts, Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing, Cache memory organization, Locality of reference.
08
V
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk storage and disk scheduling, RAID. File System: File concept, File organization and access mechanism, File directories, and File sharing, File system implementation issues, File system protection and security.
08
Text books: 1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley 2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education 3. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education 4. D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition, 5. TMH 5. William Stallings, “Operating Systems: Internals and Design Principles ”, 6th Edition, Pearson Education
KCS 403H MICROPROCESSOR
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Apply a basic concept of digital fundamentals to Microprocessor based personal computer system.
K3, K 4
CO 2 Analyze a detailed s/w & h/w structure of the Microprocessor. K2,K 4
CO 3 Illustrate how the different peripherals (8085/8086) are interfaced with Microprocessor. K 3
CO 4 Analyze the properties of Microprocessors(8085/8086) K 4
CO 5 Evaluate the data transfer information through serial & parallel ports. K 5
DETAILED SYLLABUS 3-1- Unit Topic Proposed Lecture
I Microprocessor evolution and types, microprocessor architecture and operation of its components, addressing modes, interrupts, data transfer schemes, instruction and data flow, timer and timing diagram, Interfacing devices.
08
II Pin diagram and internal architecture of 8085 microprocessor, registers, ALU, Control & status, interrupt and machine cycle. Instruction sets. Addressing modes. Instruction formats Instruction Classification: data transfer, arithmetic operations, logical operations, branching operations, machine control and assembler directives.
08
III
Architecture of 8086 microprocessor: register organization, bus interface unit, execution unit, memory addressing, and memory segmentation. Operating modes. Instruction sets, instruction format, Types of instructions. Interrupts: hardware and software interrupts.
08
IV
Assembly language programming based on intel 8085/8086. Instructions, data transfer, arithmetic, logic, branch operations, looping, counting, indexing, programming techniques, counters and time delays, stacks and subroutines, conditional call and return instructions
08
V Peripheral Devices: 8237 DMA Controller, 8255 programmable peripheral interface, 8253/8254programmable timer/counter, 8259 programmable interrupt controller, 8251 USART and RS232C.
08
Text books: 1. Gaonkar, Ramesh S , “Microprocessor Architecture, Programming and Applications with 2. 8085”, Penram International Publishing. 3. Ray A K , Bhurchandi K M , “Advanced Microprocessors and Peripherals”, TMH 4. Hall D V ,”Microprocessor Interfacing’, TMH 5. Liu and, “ Introduction to Microprocessor”, TMH 6. Brey, Barry B, “INTEL Microprocessors”, PHI 7. Renu Sigh & B. Gibson G A , “ Microcomputer System: The 8086/8088 family’’ ,PHI 8. Aditya P Mathur Sigh, “Microprocessor, Interfacing and Applications M Rafiqzzaman, “Microprocessors, Theory and Applications 9. J. Antonakos, An Introduction to the Intel Family of Microprocessors, Pearson, 1999
KCS 451H OPERATING SYSTEM LAB
- Study of hardware and software requirements of different operating systems (UNIX,LINUX,WINDOWS XP, WINDOWS7/
- Execute various UNIX system calls for i. Process management ii. File management iii. Input/output Systems calls
- Implement CPU Scheduling Policies: i. SJF ii. Priority iii. FCFS iv. Multi-level Queue
- Implement file storage allocation technique: i. Contiguous(using array) ii. Linked –list(using linked-list) iii. Indirect allocation (indexing)
- Implementation of contiguous allocation techniques: i. Worst-Fit ii. Best- Fit iii. First- Fit
- Calculation of external and internal fragmentation i. Free space list of blocks from system ii. List process file from the system
- Implementation of compaction for the continually changing memory layout and calculate total movement of data
- Implementation of resource allocation graph RAG)
- Implementation of Banker‟s algorithm
- Conversion of resource allocation graph (RAG) to wait for graph (WFG) for each type of method used for storing graph.
- Implement the solution for Bounded Buffer (producer-consumer)problem using inter process communication techniques-Semaphores
- Implement the solutions for Readers-Writers problem using inter process communication technique -Semaphore
KCS 452H MICROPROCESSOR LAB
- Write a program using 8085 Microprocessor for Decimal, Hexadecimal addition and subtraction of two Numbers.
- Write a program using 8085 Microprocessor for addition and subtraction of two BCD numbers.
- To perform multiplication and division of two 8 bit numbers using 8085.
- To find the largest and smallest number in an array of data using 8085 instruction set.
- To write a program to arrange an array of data in ascending and descending order.
- To convert given Hexadecimal number into its equivalent ASCII number and vice versa using 8085 instruction set.
- To write a program to initiate 8251 and to check the transmission and reception of character.
- To interface 8253 programmable interval timer to 8085 and verify the operation of 8253 in six different modes.
- To interface DAC with 8085 to demonstrate the generation of square, saw tooth and triangular wave.
- Serial communication between two 8085 through RS-232 C port.
B Tech 2nd Year CSE Hindi 2022 23 revised -1
Course: Btech (kcs-701)
University: APJ Abdul Kalam Technological University
- Discover more from:
