Survey

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Survey

Document related concepts

no text concepts found

Transcript

Semester IV Computer Science & Engineering COMPUTER ORIGANIZATION AND ARCHITECTURE Unit – I Principles of computer design : Software, hardware interaction layers in computer architecture ,Central processing unit , Machine language instructions , Addressing modes instruction types, instruction set selection, instruction sycle and exectution cycle, Unit –II Control Unit: Data path and control path design, Microprogramming vs. hardwired control, RISC vs. CISC, Pipelining in CPU design, Superscalar procsssors. Unit - III Memory : Memory subsystem Storage technologies, Memory array organization, Memory hierarchy, interleaving, cache and virtual memories and architectural aids to implement these input –output devices and characteristics, Unit – IV Input- Output processing : Bus interface, data transfer techniques I/O interrupts, channels performance evaluation – SPEC marks, Transaction Processing benchmarks SCRIET, CCS University Campus, Meerut 54 Semester IV Computer Science & Engineering ADVANCED CONCEPTS IN C & DATA STRUCTURES Unit –I Introduction Basic Terminology: elementary Data Organization, data structure operations, Algorithms complexity, Time – space Trade – off, Arrays: Arrays Definition and Analysis Represention of linear arrays in Memory Traversing of linear Arrays. Insertion and Deletion , single Dimensional Arrays, Two Dimensional Arrays. Bubble Sroting, Selection sorting, Linear Search , Binary Search, Multidimensional Arrays, Function Associated With Arrays, character String in C,Character string Operations, Arrays as parameters Implementing One Dimensional Arrays. Unit –II Stacks and Queues: Introduction to Operation Associated with stacks push & pop, Arrays Representation of stacks , Operation Associated with stacks Create, Add , Delete, Application of Stacks, Recursion polish Expression and Their Compilation Conversion of Infix Expression to prefix and postfix Expression , Tower of Hanoi problem, Representation of Queue Operation of Queue Create. ADD. Delete, Front Empty, Priority of Queues, Dqueues. Unit –III Linked Lists: Singly Linked Lists, Representation of Linked Lists in Memory Traversing of liked list, Searching a linked list Overflow &Underflow Insertion and Deletion from linked list Deletion. Header linked list Doubly linked list Two –way header lists. Garbage Collection and Compaction string. Unit –IV Trees: Basic Terminology. Binary trees Representation Algebraic Expression, Complete Binary trees. Extended Binary trees. Representing binary tress in memory linked representing of binary trees. Traversing binary trees searching in binary trees, inserting in binary search trees, Complexity of searching algorithm, deleting in binary search tress, path length Huffman “ s algorithm, Tress, AVL Trees, Threaded Trees, B Trees. Graphs : Terminology & Representation. Graphs & Multi graphs Directed Graphs. Sequential representation of graphs, Adjacency matrices, Transversal Connected and Spanning Trees, Shortest path and Transitive Closure . Activity Networks, Topological sort and critical paths Unit –V Sorting; insertion sort, Quick sort Two way merge sort , heap sort, sorting on different Keys , practical consideration for internal sorting. File structure; Physical Storage media , file Organization , Organization of record in to blocks , Sequential files, indexing & hashing primary indices , secondary indices. Tree Index files. B tree index, files, static hash functions, indexing & hashing comparisons SCRIET, CCS University Campus, Meerut 55 Semester IV Computer Science & Engineering OPERATING SYSTEM Unit – I Introduction Operating system and function, evolution of operating system. Batch, Interactive Time sharing and real time , System protection.Operating system structure: System components system structure, operating system services.Concurrent processes: Process concept , Principle of concurrency, producer/ consumer problem , critical section problem , semaphores, Classical problems in concurrency, inter processes communication, process generation, process scheduling, real time scheduling. Unit –II CPU scheduling: Scheduling concept, types of schedulers, performance criteria, scheduling algorithm evolution, Multiprocessor scheduling, real time Scheduling. Deadlock: System model, deadlock characterization, prevention, Avoidance and detection Recovery from deadlock Combined Approach. Unit –III Memory management: base machine, resident monitor , contiguous allocation ,non- contiguous allocation multiprogramming with fixed partiotion , multiprogramming with virtual memory concept Demand paging , performance, paged replaced algorithm, allocation of frames, Thrashing, Cache memory Organization ,impact on performance. I/O Management & disk scheduling; I/O Devices and the Organization of I/O function, I/O Buffering. Disk I/o Operating system Design Issued. Unit –IV File system: File Concept , file Organization and Access Mechanism , File Directories. File Sharing , Implementation Issues. Case studies of : Ms .Dos 2 . Unix 3. Linux 4. Windows NT SCRIET, CCS University Campus, Meerut 56 Semester IV Computer Science & Engineering THEROY OF COMPUTATION Unit – I Introduction To Finite Automate; Strings, Alphabets and Languages, Graphs & Trees, Sequential machine, tables & diagram , Mealy & Moore Machines , State and Machine Equivalence, Unit –II Regular Expressoins; Deterministic and Non : deterministic Finite Automata, Regular Expressions, Regular Grammar, Minimization of DFA, pumping Lemma for Regular sets, Properties of Context Free Languages. Unit –III Context Free Grammar & Languages; Pushdown Automata, Context free languages, Chomsky Classification of languages, pumping Lemma for context free languages, properties of context free languages Unit –IV Turing Machines; Turing Machines, Computing with Turing Machines, Non deterministic Turing Machines, Church; s Thesis, Universal Turing Machines. Unit – V Uncomputability & Computational Complexity; Halting problems, Unsolvable problems a bout Turing Machines, Time bonded Turing Machines the Class p and NP Languages, NP Completeness, some NP Complete problems. SCRIET, CCS University Campus, Meerut 57 Semester IV Computer Science & Engineering DIGITAL ELECTRONICS Unit –I Integrated Circuit Logic Families; Digital IC terminology , TTI logic family, standard TTL series, Circuits and characteristics , STTL, totempole and open collector outputs , TTL tristate , ECL , MOS and CMOS circuits and characteristics, CMOS transmission gate Comparison of various logic families, Unit –II Sequential Circuits; Introduction to sequential machine design: state diagram, state assignment, state table, state reduction, design with different flip- flops, Description and operation of shift registers, shift counters, asynchronous counters, synchronous up/ down counters. Unit –III Memory Devices; Memory terminology, general memory operation, CPU memory connections Semiconductor memory technologies- ROM: architecture, addressing and RAM timing. PROM, EPROM and EEPROM . ROM applications programmable logic device arrays . ROM/ PLD based combinational design. Semiconductors RAM RAM organization, static RAM. Dynamic RAM: structure and operation, read / write cycles. Expanding word size and capacity Unit –IV Very Large Scale Intergrated Systems, Dynamics Moc shift register, Ratioless shift register stages, CMOS domino logic . Ram cells. Charge coupled devices. (CCD) : basic operation, Memory organization , Intergrated infection logic. ( I.I.) Unit –V Analog Interfacing And Wave shaping; Principle of operation of Digital to Analog Converters ( DAC S) Popular type of DACS, DAC Specification , Analog to Digital converters , digital ramp ADC S Data acquisition, successive approximation ADC. Flash ADC. Multiplexed ADC , RS,- 232C, Wave form generation p,:IC 555 Timer. SCRIET, CCS University Campus, Meerut 58 Semester IV Computer Science & Engineering DICRETE MATHEMATICAL STRUCTURE Unit –I Relation & functions: Definition composition of relations type of relations Pictorial representation of relations equivalence of relation mapping one to one And onto function recursively recursively defined functions . Unit –II Basics of structures: Piano’s axioms Mathematical induction Pigeonhole principle Algebraic structures properties semi group monoid group And sub group cyclic group cosets factor groups permutation groups normal /sub groups homomorphism and isomorphism of gooups example and standard results Rings and fields (only definition and example). Unit –III Posets, Hasse, Diagram, Lattices:- Intorduction, ordered set, well ordered set, Hasse diagram of partially ordered set, consistent enumeration, isomorphic ordered Set, well ordered set, lattices, bounded lattices, distributive lattices, group theory, Finite state automata. Unit –IV Application to coding theory: Prepositional logic, first order logic, basic logical Poerations, truth tables, tautologies, contradicationj,. Logical equivalence, algebra of Proposition, logical implications. Unit –V Combinatorics: prince;les, sum rule principles, pproduct rule princeles, Permutation combinations, recurrence relation, generating functkions, poly’s Counting theorem. SCRIET, CCS University Campus, Meerut 59