Data structure
Download as TXT, PDF0 likes621 views
This document contains the course outlines for 5 subjects: 1) Data Structures including lists, arrays, stacks, recursion, queues, linked lists, trees, sorting, and searching algorithms. 2) Object Oriented Programming in C++ covering control structures, functions, classes, objects, arrays, pointers, operator overloading, inheritance, polymorphism, and file streams. 3) Database Management Systems including basic concepts, the relational model, SQL, functions, and PL/SQL. 4) Advanced Operating Systems such as process management, concurrency, deadlocks, storage management, virtual memory, and job scheduling. 5) Electronics including the architecture of 8085 and 8086 microprocessors, instruction sets
Data structure
- 1. B. C.A. Semester-III 3ST1 : Data Structure Unit-I : Introduction : Lists : General Algorithm and operation on data structure. e.g. ADD, DELETE, MERGE, SORT, SEARCH. Arrays& Stacks: Definition and examples of arrays and stacks in .C. Implementation infix, postfix & Prefix using stacks and arrays. Unit-II : Recursion: Definition of recursion and processes, examples of recursion Translation from prefix to postfix simulation recursion. Unit-III : Queues & linked list Definition of Queue and its representation as linked : single & double lists. Circuler linked list, stack as a circular lists. Unit-IV : Trees: Definition of trees & its family definition & representation in a diagramatic mode. Bincury representation of tree as a linked lists. Unit-V : Sorting : Sequential sort, Binary sort, merge sort, selection sorts, Insertion sort and merging technique. Serching : Binary Search, Sequentially searching, hashing, indexed search techniques. 3ST2 : Object Oriented Programming with C++ Unit-I : Introduction to oops: OOps paradigm, features, advantages and applications of oops, Introduction to C++ programme, I/0 functions, preprocessors, directives, Constants and variables, variable declaration and initialization, Type conversion, operators. Unit II : Control Structure : if, switch, do-while, while and for statement, break, continue and goto statement. Functions : Function prototype, function calling, function returning and their types, passing arguments to function, inline functions, default argument, overloaded functions. Unit III : Classes and objects :- Class specification, defining objects, Nesting of member functions, friend functions, passing objects as arguments, returning objects from functions. Constructors :- Defining constructor, parametrized constructor, multiple constructors in a class, Constructor with default argument, destructor. Unit IV : Arrays and pointers : Arrays as class member data, Arrays of objects, Pointers to objects, this pointer, memory management using ‘new‘ and ‘delete‘.
- 2. Operator overloading :- Overloading unary and binary operator, multiple overloading, rules for overloading operators. Inheritance : Derived and base class, Types of Inheritance, visibility mode. Unit V : Virtual Functions and Polymorphism : Introductions, pointers to derived class, definition of virtual functions, pure virtual functions, Rules for Virtual functions, Files and streams : Hierarely of file stream classes, opening and closing of files, files modes, file I/O with stream class. 3ST3 : Data-Base Management System. Unit I : Basis Concepts : Abstraction and Data integration, Architecture for a database system, components of DBMS, advantages and disadvantages. DBA and its role, Database models : Relational, Hierachical and network, their advantages, and disadvantages. Unit II : Relational Model : Relation, Domain & artributes, keys, Relational algebra and calulus, Entity Relationship model, Reducing E-R diagram to tables, functional dependancy, Normalization. 1NF, 2NF, 3NF and BCNF. Unit III : SQL : Components of SQL, Data types, operators, DDL Commands : CREATE, ALTER, DROP for tables, DML Commands; SELECT, INSERT, DELETE and UPDATE, order by clause, Group By and Having clause; view and DML operations on view. Unit IV : Functions: Numeric function : ABS, MOD, FLOOR, CEIL, TRUNC, SQRT, SIGN, SIN, COS, LOG, EXP, LEAST, GREATEST Group functions: AVG, MAX, MIN, SUM, COUNT, Character function : LENGTH, LOWER, UPPER, INITCAP, INSTR, SUBSTR, LPAD, RPAD, LTRIM, RTRIB, DECODE, SOUNDEX, Conversion function: To-NUMBER, To-CHAR‘ , Joins and union. Unit V : PL/SQL : Features, Block structure, Constants and variables, data types, control structure, & programming cursor: Implicity and explicity cursor, their attributes, declaring, opening and fetching cursor; Transaction : SET TRANSACTION, ROLLBACK, COMMIT and AUTO COMMIT, save point, Rollback Segment. 3ST4 : Advanced Operating System Unit-I : Operating Systems : Introduction Process Management Process Concept - Definition of process states, process state Transitions, Process Control Block, suspend and reserve. Unit-II : Asynchronous Concurrent Processors : Parallel procersors,. A control structure for indicating
- 3. parallelism- Parbegin/Parend. Mutual exclusion primitives and their implementation. Dekkers & petorsons algorithm. N-procers synchronization with semaphore Implementing semaphores P and V. Concurrant Programming: Critical Regions and Conditional critical region monitors path expresions, message passing. Unit-III : Deadlock Indifinite postponement: Resource concept, four modification for deadlock, Dead lock prevention. Banker‘s Algorithm, Deadlock Detection. Deadlock Recovery. Unit-IV : Storage Management : Real Storage: Storage Organization, Storage Management storage Hierarchy. Storage Management sttrategies contigious 4 non contigious storage allocations. Single UGC contigious storage allocation, fixed 4 variable partition multiprogramming, multiprogramming with storage swapina. Virtual Storage Management : Virtual storage management strategies, page replacement strategies, localitu, working sets, page fault - frequency page replacement/ Demand Paging, page release page size. Unit-V : Processor Management : JOB & Processor Scheduling : Introduction, Scheduling levels, objectives and criteria, Preempative vs. Non-premptive schduling HRN. Schuduling Multilevel feedback Queues fair shzare schduling. Case Studies : UNIX System, MS-DOS 3ST5 : ELECTRONICS UNIT-I : Evolution of microprocessor, microcomputer,(Block diagram with function of each block), architecture of Intel 8085 microprocessor, function of each block of 8085, pin diagram and function of all pins of 8085, instruction format. Instruction cycle, fetch and execute operation, machine cycle and state, timing diagram (opcode fetch, MR, MW, IOR, IOW). UNIT-II : Instruction and programming of 8085 Addressing mode, classification of instruction set of 8085 with examples, concept of stack and stack pointer, PUSH and POP instruction, simple program illustration. Concept of subroutine: CALL and RET instruction, Delay subroutine (using one register and register pair). Programming : Algorithm, Flowchart, Assembly and machine language, its advantage and disadvantage, assembly language program for addition, subtraction, multiplication, division, finding maximum and minimum numbers. UNIT III : Interfacing Basic interfacing concept, memory mapped I/O and I/O mapped I/O schemes, data transfer scheduling. 8255PPI: block diagram, function of each block, pin diagram, , function of each pin, operating modes of 8255, control word format in I/
- 4. O and BSR mode, illustrative examples. UNIT-IV : 8086 Architecture Block diagram of 8086 microprocessor, BIU and EU, operating modes of 8086, register of 8086-G.P.R,pointer and index register, segment register, concept of segmented memory, instruction pointer, status flag, pin diagram of 8086 microprocessor, physical and effective address. UNIT-V : Instructions and programming of 8086 Instructions: MOV, PUSH, POP, LEA, LDS, LES, Arithmatic & Logic Instructions. Addressing mode, 8086 instruction, Bus cycle , programming: programs of data transfer, addition, subtraction, division, multiplication using various addressing mode