0% found this document useful (0 votes)
13 views3 pages

Computer Science Course Overview

Uploaded by

jojorog911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views3 pages

Computer Science Course Overview

Uploaded by

jojorog911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Code: CS501 Computer Organization and Architecture

MODULE-I: Basics of Digital Electronics: Multiplexers and De multiplexers, Decoder and


Encoder, Codes, Logic gates, Flip flops, Registers. Register Transfer and Micro Operations: Bus
and Memory Transfer, Logic Micro Operations, Shift Micro Operations, Register transfer and
register transfer language, Design of arithmetic logic unit.
MODULE II: Basic Computer Organization: Instruction codes, Computer instructions, Timing
and Control, Instruction cycle, Memory reference Instruction, Complete computer
description, Design of basic computer, Input output and interrupt.
MODULE III: Control Unit: Hardwired controls, Micro programmed controls. Central
Processing Unit : Program control, Reduced instruction set computer, Complex instruction set
computer, Data Transfer, Manipulation, General register and stack organization, Addressing
mode.
MODULE IV: Computer Arithmetic: Addition and subtraction algorithm, Multiplication
algorithm, Division algorithms.
MODULE V: Input-Output Organization: Priority interrupt, Peripheral devices, Input output
interface, Data transfer schemes, Program control and interrupts, Direct memory access
transfer, Input/output processor. Memory Unit: High speed memories, Memory hierarchy,
Processor Vs Memory speed, Cache memory, Associative memory, Inter leave, Virtual
memory, Memory management.
MODULE VI : Introduction to Parallel Processing: Pipelining, Characteristics of
multiprocessors, Interconnection structures, Inter processor arbitration, Inter processor
communication, Synchronization.
Code: CS502 Compiler Design

MODULE-I: Introduction to compiler and Finite automata Compilers, Analysis of source


programs, Tokens, patterns, lexemes, Phases of compilers, Parsing, Parse trees, Ambiguity,
Associativity and precedence of operators, Top-down parsing, Bottom-up parsing, Left
recursion, Syntax directed translation. Classification of grammars, NFA, DFA, Conversion of
NFA to DFA, RE to NFA (Thompson’s Construction), Optimization of NFA/DFA using FIRSTPOS,
LASTPOS, FOLLOWPOS.
MODULE-II: Context Free Grammar RE vs. CFG, Eliminating ambiguity and left recursion, Left
factoring.
MODULE-III: Compiler Parser Top down parsing-LL parser, LL grammars. Bottom up parsing-
LR parser, SLR parser, CLR parser, LALR parser. Polishing expressions Operator precedence
grammar. LR grammars. Comparison of parsing methods. Error handling.
MODULE-IV: Run time environments Symbol tables, Language facilities for dynamic storage
allocation, Dynamic storage allocation technique, Organization for non-block and block
structured languages.
MODULE-V: Intermediate code generation Intermediate languages, graphical representations,
Synthesized and inherited attributes, Dependency graph, Syntax directed translation, S and L-
attributed definitions, Polish notation, Three address, quadruples, triples, indirect triples Flow
of control statement.
MODULE-VI: Code optimization and code generation Basic blocks and flow graphs,
Optimization of basic blocks, Code optimization techniques, Issues in design of code generator,
Target machine code and simple code generator.
Code: CS503 Computer Graphics
Module – I: Introduction to computer graphics and graphics systems. Raster and vector
graphics systems, video display devices, physical and logical input devices, simple color
models.
Module – II: Points & lines, Line drawing algorithms; DDA algorithm, Bresenham’s line
algorithm, Circle generation algorithm; scan line polygon, fill algorithm, boundary fill
algorithm, flood fill algorithm.
Module – III: 2D Transformation : Basic transformations : translation, rotation, scaling ; Matrix
representations & homogeneous coordinates, transformations between coordinate systems ;
reflection shear ; Transformation of points, lines, parallel lines, intersecting lines.
Module – IV: Viewing pipeline, Window to Viewport co-ordinate transformation, clipping
operations, point clipping, line clipping, clipping circles, polygons & ellipse.
Module – V: Hidden Surfaces: Depth comparison, Z-buffer algorithm, Back face detection,
BSP tree method, the Printer’s algorithm, scan-line algorithm; Hidden line elimination, wire
frame methods, fractal - geometry. Rendering of a polygonal surface; Flat, Gouraud, and
Phong shading; Texture mapping, bump texture, environment map; Introduction to ray
tracing; Image synthesis, sampling techniques, and anti-aliasing.
Code: IT502 Web Technology

Module – I Introduction to html: Fundamentals of HTML elements, Document body, Different


tags, sections, text, hyperlink, lists, tables, color and images, frames, frameset, form. Web
Pages: types and issues, tiers; comparisons of Microsoft and java technologies; WWW: Basic
concept, web client and web server, HTTP protocol (frame format), universal resource locator
(URL).
Module – II Dynamic web pages: The need of dynamic web pages; an overview of DHTML,
Cascading Style Sheets (CSS), comparative studies of different technologies of dynamic page
creation. Active web pages: Need of active web pages; java applet life cycle.
Module – III JavaScript: Data types, variables, operators, conditional statements, array object,
date object, string object. Java Servlet: Servlet environment and role, HTML support, Servlet
API, the Servlet Life cycle, cookies and sessions.
Module – IV JSP: JSP architecture, JSP servers, JSP tags, understanding the layout in JSP,
Declaring Variables, methods in JSP, inserting java expressions in JSP, processing request from
user and generating dynamic response for the user, inserting applets and java beans into JSP,
using include and forward action, comparing JSP and CGI program, comparing JSP and ASP
program; Creating ODBC data source name, introduction to JDBC, prepare statement and
callable statement.
Module–V
J2EE:AnoverviewofJ2EEwebservices,basicsofEnterpriseJavaBeans,[Link],basic of
RMI,JNI. XML: Basics XML, elements and attributes, document type definition, xml parsers,
sequential and tree approach

Code: IT504 Data Communication


Module 1: Signals and Signal Analysis: Periodic and nonperiodic signals, Composite signals,
Signal analysis, Time and frequency domain representation. Introduction to Data and signal
fundamentals, Analog and digital signals.
Module 2: Analog Transmission: Concepts of carrier signal, noise, modulating signal and
modulated signal; Amplitude modulation – double sideband suppressed carrier, double
sideband transmitted carrier, single sideband; Frequency modulation – Narrowband FM and
wideband FM; Digital to analog conversion – Amplitude shift keying, Frequency shift keying,
Phase shift keying, Quadrature amplitude modulation, Performance.
Module 3: Digital Transmission: Problems with digital transmission, Different line coding
schemes, Block coding schemes, Scrambling techniques; Analog to digital conversion –
Sampling techniques, Sampling theorem, Pulse amplitude modulation, Pulse code
modulation, Differential pulse code modulation, Delta modulation (along with advantages and
disadvantages of each technique), Transmission modes (serial and parallel).
Module 4: Multiplexing and Spreading: Concept of multiplexing, Frequency division
multiplexing, Time division multiplexing – Synchronous and Statistical time division
multiplexing.
Module 5: Introduction: Data Communications, Networks, Network Types, Internet History,
Networks Models: Protocol Layering, TCP/IP Protocolsuite, The OSI model, Introduction to
Physical Layer-1: Data and Signals, Digital Signals, Transmission Impairment, Data Rate limits,
Performance, Digital Transmission: Digital to digital conversion (Only Line coding: Polar,
Bipolar and Manchester coding).

Common questions

Powered by AI

Cache memory hierarchy enhances system performance by providing faster access to frequently used data and instructions. By placing small, faster caches closer to the CPU, the system reduces the time needed to fetch data compared to conventional RAM. The hierarchy usually consists of multiple levels (L1, L2, L3), with each level being larger and slower than those above it. This setup takes advantage of temporal and spatial locality in programs, ensuring that the most accessed data is readily available, thereby significantly reducing the average data access time and improving overall CPU efficiency .

Bresenham’s line algorithm improves graphical rendering efficiency by using integer arithmetic rather than floating-point calculations to determine which pixels should be illuminated to form a line. This approach significantly speeds up the rendering process compared to more computationally intensive methods that rely on floating-point arithmetic. The simplicity and speed of Bresenham’s algorithm make it especially well-suited for real-time applications where performance is critical, and it provides visually accurate results by ensuring proper stepping through pixel positions .

Converting regular expressions to a nondeterministic finite automaton (NFA) followed by optimization to a deterministic finite automaton (DFA) contributes to compiler efficiency by providing a structured approach to pattern recognition. The Thompson's construction method facilitates building NFAs from regular expressions, which is crucial for lexical analysis in compilers. Further optimization of NFAs to DFAs reduces computational complexity by minimizing the number of state transitions, enhancing the speed and accuracy of token recognition. This process ensures efficient parsing of source code and accelerates the compilation process .

Different parsing strategies, such as top-down (LL parsers) and bottom-up (LR parsers), impact compiler performance and accuracy through their approach to analyzing and interpreting syntax. LL parsers are generally faster and simpler, using a straightforward, recursive approach, but they struggle with syntactic constructs that require backtracking or that involve left recursion. LR parsers, including SLR, CLR, and LALR variants, can handle a broader syntax range and offer more robust error handling, but are more complex and computationally intensive. The choice of parsing strategy affects how accurately the compiler can detect syntax errors and conform to language grammars, influencing both the speed and reliability of the compilation process .

Algorithms for basic arithmetic operations such as addition, subtraction, and multiplication in computer systems are designed to perform these tasks with minimal computational resources and high speed. The addition and subtraction algorithms often use binary arithmetic and carry/borrow lookahead methods to reduce the time complexity associated with these operations. Multiplication algorithms, like Booth's and the array multiplication method, improve efficiency by decreasing the number of required addition operations and leveraging parallel processing opportunities, which helps optimize the use of CPU cycles and enhances computational efficiency .

Paging and segmentation are both virtual memory techniques that help manage memory efficiently and improve multiprogramming. Paging divides memory into fixed-size pages, allowing easy allocation of memory without fragmentation issues, but it can lead to internal fragmentation if the last page is not fully used. Segmentation divides memory into variable-sized segments based on logical divisions of the program, which eliminates internal fragmentation but can lead to external fragmentation. Paging generally provides better performance due to its simpler memory management and easier page replacement strategy. Segmentation offers better program locality and protection capabilities as segments can more directly map onto program structures .

The web technology stack, comprising HTML, CSS, JavaScript, and server-side technologies like Java Servlets and JSP, enables dynamic and interactive web content by allowing for client-side interactivity and server-side computation. HTML provides the structure, CSS enhances design and layout, while JavaScript introduces dynamic behavior on the client side, enabling features like form validation and animations. Server-side technologies process data, generate responses, and interact with databases. This stack allows for rich user experiences by supporting responsive design, fast interactivity, and personalized content, essential for user engagement and satisfaction .

Hardwired control units are implemented with fixed logic circuits that directly interpret the control signals, providing faster execution speeds as there is no need to fetch microinstructions from memory. However, this setup lacks flexibility, making it difficult to modify or upgrade without redesigning the hardware. In contrast, micro-programmed control units use a set of instructions stored in memory, offering greater flexibility by allowing easier updates and changes to the control logic through software updates. Nevertheless, this flexibility can come at the cost of slower operation speeds due to the overhead of fetching microinstructions from memory .

Multiprocessor synchronization challenges, such as race conditions and deadlocks, significantly impede the efficiency of parallel processing by causing delays and data inconsistencies. Effective synchronization is essential to ensure that multiple processors access shared resources in a coordinated manner. Potential solutions include employing locks, semaphores, and barrier synchronization techniques to manage access and ensure correct task ordering. Additionally, using lock-free algorithms and fine-grained synchronization can reduce contention and improve throughput. Software tools for detecting and debugging synchronization issues also enhance parallel processing efficiency by identifying bottlenecks and enabling quicker resolutions .

Signal modulation techniques, such as amplitude modulation (AM), frequency modulation (FM), and phase modulation (PM), play a crucial role in analog transmission by modifying a carrier signal to encode information. These techniques influence the quality of communication by determining the bandwidth of the transmitted signal and its resilience to interference and noise. For example, FM provides better sound quality over AM by being less susceptible to amplitude noise but requires a wider bandwidth. The choice of modulation affects the signal-to-noise ratio and determines the trade-offs between fidelity, bandwidth usage, and the complexity of transmitters and receivers .

You might also like