Home
Archive for
2015
B-Tech Sixth Semester OOPS Concept and JAVA Programming Guidance
B-Tech Sixth Semester
SUBJECT: OOPS CONCEPT & JAVA PROGRAMMING- Introduction
- Object orientation, History and development of Object Oriented Programming language, concepts of object oriented programming language, Concept of object and class.
- Basic concepts of object oriented programming using Java
- Object, class, encapsulation, polymorphism, threading, applet programming,
- difference between OOPS and other conventional programming-advantages and disadvantages.
B-Tech Sixth Semester Computer Network Guidance
B-Tech Sixth Semester
Subject: Computer Network
- Overview of data communication and Networking:
- Introduction; Data communications: components, data representation(ASCII,ISO etc.),direction of data flow(simplex, half duplex, full duplex); Networks: distributed processing, network criteria, physical structure (type of connection, topology), categories of network (LAN, MAN,WAN);Internet: brief history, internet today; Protocols and standards; Reference models: OSI reference model, TCP/IP reference model, their comparative study.
- Physical level:
- Overview of data(analog & digital), signal(analog & digital), transmission (analog & digital)& transmission media ( guided & non-guided); TDM, FDM, WDM; Circuit switching: time division & space division switch, TDM bus; Telephone network;
- Data link layer:
- Types of errors, framing(character and bit stuffing), error detection & correction methods; Flow control; Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC;
- Medium access sub layer:
- Point to point protocol, LCP, NCP, FDDI, token bus, token ring; Reservation, polling, concentration;
- Multiple access protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, FDMA, TDMA, CDMA;
- Traditional Ethernet, fast Ethernet;
- Network layer:
- Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing : Internet address, classful address, subnetting; Routing : techniques, static vs. dynamic routing , routing table for classful address; Routing algorithms: shortest path algorithm, flooding, distance vector routing, link state routing; Protocols: ARP, RARP, IP, ICMP, IPV6; Unicast and multicast routing protocols.
- Transport layer:
- Process to process delivery; UDP; TCP; Congestion control algorithm: Leaky bucket algorithm, Token bucket algorithm, choke packets; Quality of service: techniques to improve Qos.
- Application layer:
- DNS; SMTP, SNMP, FTP, HTTP & WWW; Security: ryptography, user authentication, security protocols in internet, Firewalls.
- Modern topics:
- ISDN services & ATM ; DSL technology, Cable modem, Sonet.
- Wireless LAN: IEEE 802.11; Introduction to blue-tooth, VLAN’s, Cellular telephony & Satellite network.
B-Tech Fifth Semester Database management System Guidance
B-Tech Fifth Semester
Subject: Database Management System
- Concept & Overview of DBMS, Data Models, Database Languages, Database Administrator, Database Users, Three Schema architecture of DBMS.
- Entity-Relationship Model
- Basic concepts, Design Issues, Mapping Constraints, Keys, Entity-Relationship Diagram, Weak Entity Sets, Extended E-R features.
- Relational Model Structure of relational Databases, Relational Algebra, Relational Calculus, Extended Relational Algebra Operations, Views, Modifications Of the Database.
- SQL and Integrity Constraints
- Concept of DDL, DML, DCL. Basic Structure, Set operations, Aggregate Functions, Null Values, Domain Constraints, Referential Integrity Constraints, assertions, views, Nested Subqueries, Database security application development using SQL, Stored procedures and triggers.
- Relational Database Design Functional Dependency, Different anamolies in designing a Database., Normalization using funtional
- dependencies, Decomposition, Boyce-Codd Normal Form, 3NF, Nomalization using multi-valued depedencies, 4NF, 5NF
- Internals of RDBMS
- Physical data structures, Query optimization : join algorithm, statistics and cost bas optimization.
- Transaction processing, Concurrency control and Recovery Management : transaction model properties, state serializability, lock base protocols, two phase locking.
- File Organization & Index Structures
- File & Record Concept, Placing file records on Disk, Fixed and Variable sized Records, Types of Single-
- Level Index (primary, secondary, clustering), Multilevel Indexes, Dynamic Multilevel Indexes using B tree
- B+ tree.
B-Tech Fifth Semester- Operating System Guidance
B-Tech Fifth Semester
Subject: Operating System
- Introduction to OS. Operating system functions, evaluation of O.S., Different types of O.S.: batch, multiprogrammed, time-sharing, real-time, distributed, parallel.
- System Structure
- Computer system operation, I/O structure, storage structure, storage hierarchy, different types of
- protections, operating system structure (simple, layered, virtual machine), O/S services, system calls.
- Process Management
- Processes: Concept of processes, process scheduling, operations on processes, co-operating
- processes, inter-process communication.
- Threads: overview, benefits of threads, user and kernel threads.
- CPU scheduling: scheduling criteria, preemptive & non-preemptive scheduling, scheduling
- algorithms (FCFS, SJF, RR, priority), algorithm evaluation, multi-processor scheduling.
- Process Synchronization: background, critical section problem, critical region, synchronization
- hardware, classical problems of synchronization, semaphores.
- Deadlocks: system model, deadlock characterization, methods for handling deadlocks, deadlock
- prevention, deadlock avoidance, deadlock detection, recovery from deadlock.
- Storage Management
- Memory Management: background, logical vs. physical address space, swapping, contiguous
- memory allocation, paging, segmentation, segmentation with paging.
- Virtual Memory: background, demand paging, performance, page replacement, page replacement
- algorithms (FCFS, LRU), allocation of frames, thrashing.
- File Systems: file concept, access methods, directory structure, file system structure, allocation
- methods (contiguous, linked, indexed), free-space management (bit vector, linked list, grouping),
- directory implementation (linear list, hash table), efficiency & performance.
- I/O Management: I/O hardware, polling, interrupts, DMA, application I/O interface (block and
- character devices, network devices, clocks and timers, blocking and nonblocking I/O), kernel I/O
- subsystem (scheduling, buffering, caching, spooling and device reservation, error handling),performance.
- Disk Management: disk structure, disk scheduling (FCFS, SSTF, SCAN,C-SCAN) , disk
- reliability, disk formatting, boot block, bad blocks.
- Protection & Security
- Goals of protection, domain of protection, security problem, authentication, one time password,
- program threats, system threats, threat monitoring, encryption.
B-Tech Third Semester- Principals of Programming Languages Guidance
B-Tech Third Semester
Subject: Principals of Programming Languages
- Concepts of structural program development;
- concept of data types;
- precedence and associatively of operators;
- conditional transfer;
- deterministic and in-deterministic loops;
- recursions;
- functions and procedures - call by value, call by reference and their differences; programming for numerical methods; records.
- Data-type handling and various constructs (conditional, loop, functions etc);
- pointers: concept of pointers and passing parameters using pointers, non-numeric processing, concept of arrays of pointers and pointers to pointers;
- structures and unions – advantage of using structures, concept of information hiding, pointers to structures;
- files - basic concept of various types of file access methods: sequential, indexed sequential, random, various statements for file handling
B-Tech Third Semester - Data Structure & Algorithm
B-Tech Third Semester
Subject: Data Structure & Algorithm
Linear Data Structure- Why we need data structure?
- Concepts of data structures: a) Data and data structure b) Abstract Data Type and Data Type.
- Algorithms and programs, basic idea of pseudo-code.
- Algorithm efficiency and analysis, time and space analysis of algorithms – order notations.
Array:
- Different representations – row major, column major.
- Sparse matrix - its implementation and usage. Array representation of polynomials.
Linked List:
- Singly linked list, circular linked list, doubly linked list, linked list representation of polynomial and applications.
Stack and Queue:
- Stack and its implementations (using array, using linked list), applications.
- Queue, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked
- list), applications.
Recursion:
- Principles of recursion – use of stack, differences between recursion and iteration, tail recursion.
Nonlinear Data structures
Trees:
- Basic terminologies, forest, tree representation (using array, using linked list).
- Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) - non-recursive
- traversal algorithms using threaded binary tree, expression tree.
- Binary search tree- operations (creation, insertion, deletion, searching).
- Height balanced binary tree – AVL tree (insertion, deletion with examples only).
- B- Trees – operations (insertion, deletion with examples only).
Graphs:
- Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-graph, degree, cutvertex/
- articulation point, pendant node, clique, complete graph, connected components – strongly connected
- component, weakly connected component, path, shortest path, isomorphism).
- Graph representations/storage implementations – adjacency matrix, adjacency list, adjacency multi-list.
- Graph traversal and connectivity – Depth-first search (DFS), Breadth-first search (BFS) – concepts of edges
- used in DFS and BFS (tree-edge, back-edge, cross-edge, forward-edge), applications.
- Minimal spanning tree – Prim’s algorithm (basic idea of greedy methods).
Searching, Sorting:
- Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick sort, heap sort (concept of max heap, application – priority queue), radix sort.
Searching:
- Sequential search, binary search, interpolation search.
Hashing:
- Hashing functions, collision resolution techniques.
B-Tech Second Semester - C Language Programming Guidance
B-Tech Second Semester
Subject: Basic Computation & Principles of Computer
Programming
Fundamentals and Programming in C Language :
- The C character set identifiers and keywords, data type & sizes, variable names, declaration, statements
- Operators & Expressions:
- Arithmetic operators, relational and logical operators, type, conversion, increment and decrement
- operators, bit wise operators, assignment operators and expressions, precedence and order of evaluation.
- Input and Output: Standard input and output, formatted output -- printf, formatted input scanf.
- Flow of Control: Statement and blocks, if - else, switch, loops - while, for do while, break and continue, go to and labels
- Fundamentals and Program Structures:
- Basic of functions, function types, functions returning values, functions not returning values, auto,
- external, static and register variables, scope rules, recursion, function prototypes, C preprocessor, command line arguments.
- Arrays and Pointers: One dimensional arrays, pointers and functions, multidimensional arrays.
- Structures Union and Files: Basic of structures, structures and functions, arrays of structures, bit fields, formatted and unformatted files.
- ·
1st Semester Guidance - B.Tech
B.Tech 1st Semester Tutors & Guidance by Experienced Teachers. Tutions of C Language.
Subscribe to:
Comments
(
Atom
)