Information Technology
IT-501
(Operating System )
IT-502
(Computer Networks )
IT-503 (A)
(Theory of Computation )
IT-503 (B)
(Microprocessor and Interfacing )
IT-503 (C)
(Object Oriented Analysis and Design )
Syllabus
- Unit I Introduction to Operating Systems, Evaluation of OS, Types of operating Systems, system protection, Operating system services, Operating System structure, System Calls and System Boots, Operating System design and implementation, Spooling and Buffering.
- Unit II Basic concepts of CPU scheduling, Scheduling criteria, Scheduling algorithms, algorithm evaluation, multiple processor scheduling. Process concept, operations on processes, threads, inter process communication, precedence graphs, critical section problem, semaphores, classical problems of synchronization,
- Unit III Deadlock problem, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Methods for deadlock handling. Concepts of memory management, logical and physical address space, swapping, Fixed and Dynamic Partitions, Best-Fit, First-Fit and Worst Fit Allocation, paging, segmentation, and paging combined with segmentation.
- Unit IV Concepts of virtual memory, Cache Memory Organization, demand paging, page replacement algorithms, allocation of frames, thrashing, demand segmentation, Role of Operating System in Security, Security Breaches, System Protection, and Password Managment.
- Unit V Disk scheduling, file concepts, File manager, File organization, access methods, allocation methods, free space managements, directory systems, file protection, file organization & access mechanism, file sharing implement issue, File Management in Linux, introduction to distributed systems.
Syllabus
- Unit I Importance of computer networks, broadcast and point to point networks, Local area networks and Wide area networks , ISO-OSI reference model, TCP/IP model , interfaces and services, Protocol data unit, connection oriented and connectionless services, service primitives, Binding Protocol Address- ARP & RARP, packet format, Encapsulation.
- Unit II Data-Link layer: - Data link layer design issues, framing , flow & error control , physical addressing, Stop & Wait protocol ,Go back N ARQ ,selective repeat ARQ ,piggybacking and pipelining ,HDLC LAN Protocol stack-Logical link control and Media Access Control sublayer, IEEE 802.2 LLC Frame format; MAC layer Protocols- static and dynamic allocation, Pure and slotted ALOHA, Carrier sense multiple access, Persistent and non persistent CSMA, IEEE standard 802.3, 802.4, 802.5, FDDI,
- Unit III The Network layer- logical addressing, classful & classless addressing, packet delivery & forwarding. unicast routing protocols , multicast routing protocols, Routing algorithm- Least Cost, Dijkstra's, Bellman-ford, Introduction to Internet protocol, IPv4 header, IPv4 Datagrams, Encapsulation, Fragmentation and Reassembly, IP routing, Subnet addressing, Subnet mask, Super netting- special case of IP addresses, Ipv6-Motivation, frame format and addressing. ICMP: Introduction, ICMP Header, ICMP message types.
- Unit IV Transport layer- TCP: Introduction ,Transport services , Process to process delivery, TCP ,congestion control algorithms, quality of service, headers, connection establishment and termination, timeout of connection establishment, maximum segment size, port no. and socket addresses, TCP timers, UDP: Introduction, UDP header, UDP checksum, UDP operations, encapsulation & decapsulation, queuing, SCTP-Services, transmission sequence number, stream identifier, stream sequence number, packet format.
- Unit V Application layer - BOOTP:-operation, packet format, DHCP:-Address allocation, configuration & packet Format, DNS: Distribution of name spaces, DNS in the internet, FTP:-Connection, Communication, command processing, TFTP, E-Mail: SMTP, POP, IMAP, SNMP. study of internetworking devices and their configuration– switches, hubs, Bridges, routers and Gateways.
Syllabus
- UNIT I Introduction of the theory of computation, Finite state automata – description of finite automata, properties of transition functions, Transition graph, designing finite automata, FSM, DFA, NFA, 2-way finite automata, equivalence of NFA and DFA, Mealy and Moore machines.
- UNIT II Regular grammars, regular expressions, regular sets, closure properties of regular grammars, Arden’s theorem, Myhill-Nerode theorem, pumping lemma for regular languages, Application of pumping lemma, applications of finite automata, minimization of FSA.
- UNIT III Introduction of Context-Free Grammar - derivation trees, ambiguity, simplification of CFGs, normal forms of CFGs- Chomsky Normal Form and Greibach Normal forms, pumping lemma for CFLs, decision algorithms for CFGs, designing CFGs, Closure properties of CFL’s.
- UNIT IV Introduction of PDA, formal definition, closure property of PDA, examples of PDA, Deterministic Pushdown Automata, NPDA, conversion PDA to CFG, conversion CFG to PDA.
- UNIT V Turing machines - basics and formal definition, language acceptability by TM, examples of TM, variants of TMs – multitape TM, NDTM, Universal Turing Machine, offline TMs, equivalence of single tape and multitape TMs. Recursive and recursively enumerable languages, decidable and undecidable problems – examples, halting problem, reducibility. Introduction of P, NP, NP complete, NP hard problems and Examples of these problems.
Syllabus
- UNIT –I: Evolution of microprocessor, single chip micro computers, Micro processor Application, Microprocessor and its architecture, addressing modes, instruction, Instruction sets, Arithmetic and Logic Instruction, Program control instruction, Introduction –8086 family, procedure and macros, connection , Timing and Troubleshooting interrupt, 80286, 80836 and 80486 micro processor system concept.
- UNIT –II: Microprocessor Cycle, AIU, Timing and control Unit, Register data, Address bus, Pin Configuration, Intel 8086 instruction, Opcode and operands, limitation word size. Programming the microprocessor Assembly language, The Pentium and Pentium Pro Micro Processorwith features, Pentium II, Pentium III and Pentium –IV Microprocessor with software changes. Instruction set for Intel 8086, Introduction Intimation and data formats, Addressing modes, Status flags, Symbols and abbreviations, programming of microprocessors, Assembly language, high level language, areas of application of various languages, Stacks, Sub routines system, software, commands in assembly language, software Development, Debugging program, Modular programming, Structured programming, Top-down, Bottom-up design , MACRO microprogramming.
- UNIT-III: Assembly language programming with Examples like Addition of 8/16-bit Binary number, subtraction of 8/16 bit binary number, Address partitioning, addressing mode, type of addressing mode, memory and I/o interfacing, Data transfer schemes, Interfacing device and I/o devices I/o ports, Basic I/o Interfacing MDS, Micro controllers, I/o processor and co-processors ,Microcomputer Development system, Single chip micro computers, intel 8748 intel 8051, inter 8096, intel 8049intel 2920/2921, I/o processor UPI-425,UPI-41,42, Co processor, math processor math co-processor –8087, 80287, 80387DX 803875x
- UNIT –IV: Bus Interface I/o port Addressing, decoding 8279, Programmable key board/display interface, 8254 Internal Timer, 16550 programmable communication interface A/D, 8259A Programmable Interrupt Controller, 8237 DMA Controller, Shared bus operation, disk Memory system Video display. ISA Bus, Extended ISA ( EISA) and VESA Local Buses, Peripheral Component Inter Connect (Pc I) Bus, Parallel Printer interface (LPT) Universal serial Bus (USB) Accelerated graphics port (AGP),Programmable Communication interfere 8251 VSART CRT Controller 8275, 6854, Floppy disk Controller 8272, I/o processor 8089.
- UNIT –V: Memory Unit, RAM,SRAM, DRAM,ROM, PROM EPROM, EEPROM Nonvolatile RAM semiconductor Technology for memory, Shift register, Magnetic Memory, Tap, disc, main memory and secondary memory cache memory, program memory and Data Memory, Real and virtual memory Buses, memory Addressing capacity of CPU, processing speed of computer
Syllabus
- UNIT I Introduction: Overview of object oriented concepts, Object Orientation, OO Software Development life cycle, Object oriented methodology, OO Themes, Modeling Concepts, Role of Analysis and Design in software development, Overview of various OOAD methodologies, OO approach vs conventional approach, Unified process of Software development, UML, Goals of UML, Overview of different models.
- UNIT II Static Modeling using Class Diagrams: Object and Class concepts, Link and association, Multiplicity, Ternary Association, Recursive association, Association class, Generalization and Inheritance, Multiple inheritance, Aggregation and composition, Abstract Class, Packages.
- UNIT III Dynamic Modeling using State Diagrams: Events, States, Transitions and conditions, Types of state diagrams, Continuous life cycle state diagrams, one-shot life cycle state diagrams, Sub states, Nested state diagrams, Signal generalization, Concurrency, Junction state, Synch state, Relation of class and state models.
- UNIT IV Interaction Modeling: Use case Models, Actors and use cases, Use Case relationships, Use of Use cases for validation and verification, Sequence diagrams, Procedural sequence models, activity models, swim lanes, Dynamic concurrency, decomposing an activity, Communication Diagrams, Architectural Modeling: Component and Deployment Diagrams.
- UNIT V System design and class design, Implementation modeling, Implementing structure and implementing functionality, Frameworks, Design Patterns, Object-Oriented Languages and their comparison, Object-Oriented Databases, ObjectOriented Programming Style, CORBA, COM, DCOM.