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
Pd cse enggingering hjfhbgifufkvjcig
Typology: Exercises
1 / 13
This page cannot be seen from the preview
Don't miss anything!
Sl. No. Subject Codes Subject Periods Evaluation Scheme End Semester (^) Total Credit L T P CT TA Total PS TE PE 1
Engineering Science Course/Maths IV
Technical Communication/Universal Human values
3 KCS301 Data Structure 3 1 0 30 20 50 100 150 4 4 KCS Computer Organization and Architecture
Discrete Structures & Theory of Logic
6 KCS351 Data Structures Using C Lab 0 0 2 25 25 50 1 7 KCS352 Computer Organization Lab 0 0 2 25 25 50 1 8 KCS Discrete Structure & Logic Lab
Mini Project or Internship Assessment*
Computer System Security/Python Programming
MOOCs (Essential for Hons. Degree) Total 950 22 *The Mini Project or internship (3-4 weeks) conducted during summer break after II semester and will be assessed during III semester.
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.
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.
Identify the alternative implementations of data structures with respect to its performance to solve a real world problem.
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.
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.
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.
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.
Text books:
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.
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.
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.
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.
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.
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
Text books: 1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
Write C Programs to illustrate the concept of the following:
Theory of Automata and Formal Languages Course Outcome ( CO) Bloom’s Knowledge Level (KL) At the end of course , the student will be able to understand CO 1 Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and grammars
CO 2 Analyse and design, Turing machines, formal languages, and grammars^ K4, K 6 CO 3 Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and complexity through problem solving
CO 4 Prove the basic results of the Theory of Computation.^ K2,K 3 CO 5 State and explain the relevance of the Church-Turing thesis.^ K1, K 5 DETAILED SYLLABUS 3-1- Unit Topic Proposed Lecture I Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata, Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε-Transition, Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata, Myhill-Nerode Theorem, Simulation of DFA and NFA
Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem, Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s Theorem, Regular and Non-Regular Languages- Closure properties of Regular Languages, Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision properties, Finite Automata and Regular Languages, Regular Languages and Computers, Simulation of Transition Graph and Regular language.
Regular and Non-Regular Grammars: Context Free Grammar(CFG)-Definition, Derivations, Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky Hierarchy, Programming problems based on the properties of CFGs.
Push Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL, Programming problems based on the properties of CFLs.
Turing Machines and Recursive Function Theory : Basic Turing Machine Model, Representation of Turing Machines, Language Acceptability of Turing Machines, Techniques for Turing Machine Construction, Modifications of Turing Machine, Turing Machine as Computer of Integer Functions, Universal Turing machine, Linear Bounded Automata, Church’s Thesis, Recursive and Recursively Enumerable language, Halting Problem, Post’s Correspondance Problem, Introduction to Recursive Function Theory.
Text books:
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.
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.
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.
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.
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
V Peripheral Devices: 8237 DMA Controller, 8255 programmable peripheral interface, 8253/8254programmable timer/counter, 8259 programmable interrupt controller, 8251 USART and RS232C.
Text books:
