Csa papers
•
1 like•817 views
The document is an exam for the subject of Computer System Architecture. It contains 10 short answer questions in Section A worth 2 marks each, totaling 20 marks. Section B contains 4 long answer questions worth 10 marks each, totaling 40 marks. The exam is worth a total of 60 marks and lasts 3 hours. Candidates are instructed to answer all of Section A and 4 questions from Section B. The document provides an overview of the exam structure and content areas that will be assessed, including topics like interrupts, addressing modes, pipelining, memory access instructions, I/O data transfer, and CPU control units.
Report
Share
Report
Share
Download to read offline
Recommended
Ec8791 model
This document outlines the questions that will be asked in an examination for a fourth year embedded and real-time systems course. It covers topics such as distributed control computer (DCC) systems, unified modeling language (UML) for embedded system design, ARM processor functions, microcontroller peripherals, data flow graphs, loop optimizations, scheduling algorithms, real-time operating systems (RTOS), distributed embedded systems, and more. Students will be asked short questions to test their knowledge, as well as longer questions involving diagrams and explanations of concepts.
Ec8791 model new
This document outlines an examination for an Embedded and Real Time Systems course. It contains three parts:
Part A contains 10 short answer questions assessing key concepts like distributed control systems, UML design, ARM processor functions, peripherals, data flow graphs, loop optimizations, scheduling algorithms, POSIX functions, and distributed embedded systems.
Part B contains 5 long answer questions, with options to choose between, assessing requirements analysis, system design methods, ARM architecture, program models, fault tolerance, and real-time operating systems.
Part C contains 1 long answer question, with options, requiring illustration and explanation of a video accelerator system or engine control unit, covering requirements, specification, architecture, component design/testing, and system
embedded-systems
The document is an exam paper for an M.E. Degree in Embedded Systems. It contains 15 multiple choice and long answer questions regarding various topics in embedded systems design. Some of the questions addressed are:
- The reasons why embedded computing machine design is difficult.
- How to implement an assembly code statement in the SHARC processor.
- The differences between CAN and I2C buses.
- The requirements to consider for computation-intensive system design.
- Examples of ambiguous and incomplete requirements documents.
Otl 552 model
This document contains an examination for a third year digital audio engineering course. It includes questions about key topics in digital audio such as sampling theory, pulse code modulation, compression techniques, optical storage disks, MIDI, MP3 and channel coding. The exam is divided into three parts: Part A contains 10 multiple choice questions worth 2 marks each, Part B contains 5 essay questions worth 13 marks each and Part C contains 1 question worth 15 marks.
III EEE-CS2363-Computer-Networks-important-questions-for-unit-3-for-may-june-...
III EEE-CS2363-Computer-Networks-important-questions-for-unit-3-for-may-june-2014 ANNA UNIVERSITY SEMESTER EXAM
Cs 64
The document is an exam for the course CS-64 Introduction to Computer Organization. It contains 6 questions with multiple parts each. Question 1 is compulsory and covers topics like the von Neumann machine model, combinational logic circuits, multiplexers, bus systems, error detection using parity bits, and addressing schemes. The other questions cover additional topics like boolean logic, interrupts, control units, RAM, arithmetic operations in 2's complement, 8086 assembly, registers, RAID, synchronous/asynchronous circuits, and assemblers and memory hierarchy.
Cs 68
The document is a past exam paper for a computer networks course. It contains 7 questions testing various topics in computer networks:
1) Token bus and token ring operation, factors causing network congestion, sliding window protocol explanation, data communication types (simplex, half-duplex, full-duplex), functions of the encryption layer in the OSI model, and differences between bit rate and baud rate.
2) Differences between LAN, MAN and WAN, LAN topologies, how RARP resolves MAC to IP addresses compared to ARP, differences between unicast, multicast and broadcast.
3) Why flow control is handled at two OSI layers, features of those layers, purpose of multiplexing
Os revision ques
This document contains 16 questions about operating systems topics like multiprocessing, scheduling algorithms, memory management, paging, and file systems. The questions cover symmetric and asymmetric multiprocessing, problems with serial processing, I/O methods, storage hierarchy caching, process control blocks, microkernel benefits, scheduling algorithms like FCFS, priority and round robin, memory allocation schemes like best fit and worst fit, page replacement algorithms like FIFO and optimal, file system directory structures. Diagrams and calculations of metrics like waiting times are required in some questions.
Recommended
Ec8791 model
This document outlines the questions that will be asked in an examination for a fourth year embedded and real-time systems course. It covers topics such as distributed control computer (DCC) systems, unified modeling language (UML) for embedded system design, ARM processor functions, microcontroller peripherals, data flow graphs, loop optimizations, scheduling algorithms, real-time operating systems (RTOS), distributed embedded systems, and more. Students will be asked short questions to test their knowledge, as well as longer questions involving diagrams and explanations of concepts.
Ec8791 model new
This document outlines an examination for an Embedded and Real Time Systems course. It contains three parts:
Part A contains 10 short answer questions assessing key concepts like distributed control systems, UML design, ARM processor functions, peripherals, data flow graphs, loop optimizations, scheduling algorithms, POSIX functions, and distributed embedded systems.
Part B contains 5 long answer questions, with options to choose between, assessing requirements analysis, system design methods, ARM architecture, program models, fault tolerance, and real-time operating systems.
Part C contains 1 long answer question, with options, requiring illustration and explanation of a video accelerator system or engine control unit, covering requirements, specification, architecture, component design/testing, and system
embedded-systems
The document is an exam paper for an M.E. Degree in Embedded Systems. It contains 15 multiple choice and long answer questions regarding various topics in embedded systems design. Some of the questions addressed are:
- The reasons why embedded computing machine design is difficult.
- How to implement an assembly code statement in the SHARC processor.
- The differences between CAN and I2C buses.
- The requirements to consider for computation-intensive system design.
- Examples of ambiguous and incomplete requirements documents.
Otl 552 model
This document contains an examination for a third year digital audio engineering course. It includes questions about key topics in digital audio such as sampling theory, pulse code modulation, compression techniques, optical storage disks, MIDI, MP3 and channel coding. The exam is divided into three parts: Part A contains 10 multiple choice questions worth 2 marks each, Part B contains 5 essay questions worth 13 marks each and Part C contains 1 question worth 15 marks.
III EEE-CS2363-Computer-Networks-important-questions-for-unit-3-for-may-june-...
III EEE-CS2363-Computer-Networks-important-questions-for-unit-3-for-may-june-2014 ANNA UNIVERSITY SEMESTER EXAM
Cs 64
The document is an exam for the course CS-64 Introduction to Computer Organization. It contains 6 questions with multiple parts each. Question 1 is compulsory and covers topics like the von Neumann machine model, combinational logic circuits, multiplexers, bus systems, error detection using parity bits, and addressing schemes. The other questions cover additional topics like boolean logic, interrupts, control units, RAM, arithmetic operations in 2's complement, 8086 assembly, registers, RAID, synchronous/asynchronous circuits, and assemblers and memory hierarchy.
Cs 68
The document is a past exam paper for a computer networks course. It contains 7 questions testing various topics in computer networks:
1) Token bus and token ring operation, factors causing network congestion, sliding window protocol explanation, data communication types (simplex, half-duplex, full-duplex), functions of the encryption layer in the OSI model, and differences between bit rate and baud rate.
2) Differences between LAN, MAN and WAN, LAN topologies, how RARP resolves MAC to IP addresses compared to ARP, differences between unicast, multicast and broadcast.
3) Why flow control is handled at two OSI layers, features of those layers, purpose of multiplexing
Os revision ques
This document contains 16 questions about operating systems topics like multiprocessing, scheduling algorithms, memory management, paging, and file systems. The questions cover symmetric and asymmetric multiprocessing, problems with serial processing, I/O methods, storage hierarchy caching, process control blocks, microkernel benefits, scheduling algorithms like FCFS, priority and round robin, memory allocation schemes like best fit and worst fit, page replacement algorithms like FIFO and optimal, file system directory structures. Diagrams and calculations of metrics like waiting times are required in some questions.
IOEfficientParalleMatrixMultiplication_present
This document presents an overview of making matrix multiplication algorithms more I/O efficient. It discusses the parallel disk model and how to incorporate locality into algorithms to minimize I/O steps. Cannon's algorithm for matrix multiplication in a 2D mesh network is described. Loop interchange is discussed as a way to improve cache efficiency when multiplying matrices by exploring different loop orderings. Results are shown for parallel I/O efficient matrix multiplication on different sized matrices, with times ranging from 0.38 to 7 seconds. References on cache-oblivious algorithms and distributed memory matrix multiplication are provided.
ca-ap9222-pdf
This document contains questions that appear to be from a computer architecture and parallel processing exam. It includes questions about parallelism, cache coherence, memory hierarchies, pipelining, and multiprocessor/multicomputer systems. The questions cover topics such as Bernstein conditions, page replacement algorithms, memory models, Amdahl's law, and differences between parallel computing architectures.
New geometric interpretation and analytic solution for quadrilateral reconstr...
Poster presentation for ICPR 2014 paper.
Title: New geometric interpretation and analytic solution for quadrilateral reconstruction
Author: Joo-Haeng Lee (ETRI)
Future semantic segmentation with convolutional LSTM
1) The document proposes a new approach called convolutional LSTM to predict future semantic segmentation frames from input video frames.
2) The approach uses an encoder-decoder model with a ResNet-101 encoder and convolutional LSTM modules to capture spatial and temporal information from multiple frames before the decoder predicts the future frame.
3) Experimental results on the Cityscapes dataset show the proposed convolutional LSTM approach outperforms other state-of-the-art methods for future semantic segmentation.
rf ic design previous question papers
This document contains an exam for an RF IC Design course, listing 8 questions covering various topics in radio frequency integrated circuit design. Students were instructed to answer any 5 of the 8 questions, which covered topics such as inter-symbol interference, analog modulation, coherent vs non-coherent detection, phase locked loops, low noise amplifier design, mobile RF communications concepts, transmitter architectures, oscillator design techniques, and power amplifier classes and matching. The exam was 3 hours long and worth a maximum of 60 marks.
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
In this paper, we propose an elliptic curve key generation processor over GF(2163) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using Xilinx Virtex II Pro FPGA and on an ASIC CMOS 45 nm technology as well. The proposed implementation provides a time of 2.07 ms and 38 percent of Slices in Xilinx Virtex II Pro FPGA. Such features reveal the high efficiently of this implementation design.
Capp nov dec2012
This document contains an exam for a Master's degree in Applied Electronics. The exam covers topics in computer architecture and parallel processing. It is divided into two parts: Part A contains 10 short answer questions; Part B contains 5 longer answer questions that require explaining concepts in computer architecture and parallel processing in detail. Key topics covered include classifications of parallel computer models, SIMD and VLSI models, network properties, cache memory mapping, backplane bus systems, multithreading architectures, and algorithms for parallel computing models.
Otl552 model new
This document contains questions from an electronics and communication engineering exam on digital audio engineering. It has three parts:
Part A contains 10 short answer questions covering topics like sampling theorem, Nyquist rate, channel coding, digital audio broadcasting principles, compression techniques, interleaving, DAT data structure, optical disk types, SDMI, and sound cards.
Part B has 5 long answer questions, with choices, on sampling and reconstruction, PCM, lossless and perceptual coding with subband coding, MPEG compression standards, digital audio editor structure, and CD/MD disc construction.
Part C is a single long answer question with choices on block/convolution coding or editing with random access and recording media.
Autonomus syllabus12 mtechcse_mtech sem1_mtech model papers_co model paper
This document contains 8 questions related to computer organization and architecture in a model paper format. The questions cover various topics like floating point representations, Boolean logic simplification, bidirectional shift registers, addition/subtraction with signed magnitudes, cache memory mapping, virtual memory addressing, programmed I/O vs interrupt-initiated I/O, DMA transfers, Booth multiplication algorithm, addition/subtraction flowcharts for signed numbers, x86 addressing modes, pipelining, CISC vs RISC architectures, vector computation approaches, and Intel x86 Core Duo multicore organization. Students have to answer any 5 questions out of the 8 questions in the 3 hour exam.
Cad for vlsi circuits june 2012
This document contains questions that appear to be from an exam on VLSI design.
Part A contains 10 short answer questions asking about general topics in VLSI design like general-purpose integrated circuits, integer linear programming, symbolic layout editors, partitioning problems, floorplanning algorithms, local routing parameters, static vs dynamic partitioning, two-level logic synthesis, ASAP scheduling, and supervertices.
Part B contains 5 longer answer questions with sub-questions on topics like the VLSI design process, verification methods, graph representations, minimum distance design rules, placement problems, constraint graph compaction, floorplanning concepts, channel routing algorithms, gate-level simulation issues, ROBDD construction and manipulation, data flow types, and assignment problem
High performance pipelined architecture of elliptic curve scalar multiplicati...
High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m)
Graph based transistor network generation method for supergate design
Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design
Building and road detection from large aerial imagery
This document presents a convolutional neural network approach for simultaneously detecting buildings and roads from aerial imagery in 3 channels. The CNN is trained on image patches from a dataset of 147 aerial images and corresponding 3-channel label maps containing buildings, roads, and other labels. Several CNN architectures are tested on 10 held-out images, with the basic architecture achieving the best precision of 0.8905 and 0.9241 for roads and buildings, respectively, outperforming a previous approach. The proposed method requires no pre-processing or hand-designed image features as the CNN is able to learn good feature extractors automatically through training.
MySQL Spatial Extensions - Boston MySQL Meetup April 2005
This document summarizes Andrew Collins' April 4th, 2005 presentation on MySQL Spatial Extensions. It outlines the OpenGIS Simple Features Specification geometry class hierarchy and spatial data model. It also describes some basic and spatial analysis methods defined in the specification, noting that MySQL implements some but not all methods. The document references additional OpenGIS specifications and the JTS Topology Suite library.
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question Papers
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question PapersBGS Institute of Technology, Adichunchanagiri University (ACU)
1) The document discusses various questions related to the finite element method and analysis. It includes questions on determining stresses and displacements in a bar element, principle of minimum potential energy, derivation of shape functions, consistent nodal load vector, Gauss quadrature, advantages and disadvantages of finite element method, Hermite shape functions, and short notes on C0, C1 and C2 functions, node numbering, serendipity elements, and patch tests.
2) The questions cover topics like derivation of shape functions, evaluation of shape functions, consistent nodal load vector, Gauss quadrature, Hermite shape functions, and flexibility and stiffness methods. Mathematical relations involving [K], [f], [a] are also givenFPGA Implementation of SubByte & Inverse SubByte for AES Algorithm
Advanced encryption standard was accepted as a Federal Information Processing Standard (FIPS) standard. In traditional look up table (LUT) approaches, the unbreakable delay is longer than the total delay of the rest of operations in each round. LUT approach consumes a large area. It is more efficient to apply composite field arithmetic in the SubBytes transformation of the AES algorithm. It not only reduces the complexity but also enables deep sub pipelining such that higher speed can be achieved. Isomorphic mapping can be employed to convert GF(28) to GF(22)2)2) ,so that multiplicative inverse can be easily obtained. SubBytes and InvSubBytes transformations are merged using composite field arithmetic. It is most important responsible for the implementation of low cost and high throughput AES architecture. As compared to the typical ROM based lookup table, the presented implementation is both capable of higher speeds since it can be pipelined and small in terms of area occupancy (137/1290 slices on a Spartan III XCS200-5FPGA).
Protein structure alignment beyond spatial proximity 3 dsig_2012
Background / Purpose:
The problem of automatically constructing an accurate protein structure alignment still remains challenging especially when proteins to be aligned are distantly-related.
Main conclusion:
We present a novel method, DeepAlign, which aligns two protein structures using not only spatial proximity of equivalent residues (after rigid-body superposition), but also evolutionary distance and hydrogen bonding similarity.
Graph based transistor network generation method for supergate design
This paper proposes a novel graph-based method to automatically generate optimized transistor networks from a sum-of-products expression to improve speed, power, and area of VLSI circuits. The method identifies efficient sub-networks ("kernels") from the graph representation and combines them, with transistor sharing, into a single minimized network. Experimental results show transistor count reduction compared to other approaches, leading to gains in gate performance, power, and area. The method was implemented in software simulation tools and on Spartan FPGA hardware.
Sma
(1) Sequence Mining Automata (SMA) is a new technique for mining frequent sequences from a database of sequences that adhere to a given regular expression. SMA models the regular expression as a specialized Petri net that can extract all valid subsequences in parallel from each database sequence.
(2) Previous approaches focus on pruning the search space based on the regular expression, while SMA focuses on the database and regular expression by constructing the sequences contained in each database entry.
(3) Experiments on both synthetic and real mobility data demonstrate the efficiency of SMA and its variants, which embed techniques like one-pass processing and full-cut partitioning to further improve performance.
Capp june 2012
This document contains questions that appear to be from a Master's degree examination on computer architecture and parallel processing. It includes questions in two parts - Part A contains 10 short answer questions on topics like performance metrics for parallel systems, differences between network topologies, possibility of super-linear speedup, and lower bounds on optimal schedules. Part B contains 5 longer answer questions requiring explanations on models of parallel computation, classification schemes, crossbar switches, applications of parallel processing, caching policies, virtual memory systems, multiprocessor architectures, and matrix multiplication algorithms for SIMD models.
2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper
The document contains an exam for an Operating Systems course, including:
1) A 10 question short answer section covering topics like the main functions of an OS, multiprogramming, threads, deadlocks, dynamic linking, paging, interrupts vs traps, system programs, and dispatchers.
2) A longer answer section with 4 questions, including questions on batch processing systems, scheduling queues/algorithms, analyzing turnaround and waiting times for different scheduling algorithms, the dining philosophers problem and deadlocks, page sizes and addresses, thrashing prevention, file operations, OS security threats, and data encryption.
The exam tests students' understanding of fundamental OS concepts through definitions, explanations of concepts, analyzing examples, and
2009 Punjab Technical University B.C.A Microprocessor Question paper
The document is an exam for a course on microprocessors. It contains 20 short answer questions in Section A and 4 longer answer questions in Section B. The questions cover topics like the essential elements of a CPU, addressing modes, interrupts and interrupt service routines in 8086 processors, writing assembly language programs for 8086, the architecture of 8086 processors, flags in 8086, clock generators, interrupt controllers, and direct memory access controllers. The exam tests students' understanding of microprocessor concepts and the 8086 architecture.
More Related Content
What's hot
IOEfficientParalleMatrixMultiplication_present
This document presents an overview of making matrix multiplication algorithms more I/O efficient. It discusses the parallel disk model and how to incorporate locality into algorithms to minimize I/O steps. Cannon's algorithm for matrix multiplication in a 2D mesh network is described. Loop interchange is discussed as a way to improve cache efficiency when multiplying matrices by exploring different loop orderings. Results are shown for parallel I/O efficient matrix multiplication on different sized matrices, with times ranging from 0.38 to 7 seconds. References on cache-oblivious algorithms and distributed memory matrix multiplication are provided.
ca-ap9222-pdf
This document contains questions that appear to be from a computer architecture and parallel processing exam. It includes questions about parallelism, cache coherence, memory hierarchies, pipelining, and multiprocessor/multicomputer systems. The questions cover topics such as Bernstein conditions, page replacement algorithms, memory models, Amdahl's law, and differences between parallel computing architectures.
New geometric interpretation and analytic solution for quadrilateral reconstr...
Poster presentation for ICPR 2014 paper.
Title: New geometric interpretation and analytic solution for quadrilateral reconstruction
Author: Joo-Haeng Lee (ETRI)
Future semantic segmentation with convolutional LSTM
1) The document proposes a new approach called convolutional LSTM to predict future semantic segmentation frames from input video frames.
2) The approach uses an encoder-decoder model with a ResNet-101 encoder and convolutional LSTM modules to capture spatial and temporal information from multiple frames before the decoder predicts the future frame.
3) Experimental results on the Cityscapes dataset show the proposed convolutional LSTM approach outperforms other state-of-the-art methods for future semantic segmentation.
rf ic design previous question papers
This document contains an exam for an RF IC Design course, listing 8 questions covering various topics in radio frequency integrated circuit design. Students were instructed to answer any 5 of the 8 questions, which covered topics such as inter-symbol interference, analog modulation, coherent vs non-coherent detection, phase locked loops, low noise amplifier design, mobile RF communications concepts, transmitter architectures, oscillator design techniques, and power amplifier classes and matching. The exam was 3 hours long and worth a maximum of 60 marks.
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
In this paper, we propose an elliptic curve key generation processor over GF(2163) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using Xilinx Virtex II Pro FPGA and on an ASIC CMOS 45 nm technology as well. The proposed implementation provides a time of 2.07 ms and 38 percent of Slices in Xilinx Virtex II Pro FPGA. Such features reveal the high efficiently of this implementation design.
Capp nov dec2012
This document contains an exam for a Master's degree in Applied Electronics. The exam covers topics in computer architecture and parallel processing. It is divided into two parts: Part A contains 10 short answer questions; Part B contains 5 longer answer questions that require explaining concepts in computer architecture and parallel processing in detail. Key topics covered include classifications of parallel computer models, SIMD and VLSI models, network properties, cache memory mapping, backplane bus systems, multithreading architectures, and algorithms for parallel computing models.
Otl552 model new
This document contains questions from an electronics and communication engineering exam on digital audio engineering. It has three parts:
Part A contains 10 short answer questions covering topics like sampling theorem, Nyquist rate, channel coding, digital audio broadcasting principles, compression techniques, interleaving, DAT data structure, optical disk types, SDMI, and sound cards.
Part B has 5 long answer questions, with choices, on sampling and reconstruction, PCM, lossless and perceptual coding with subband coding, MPEG compression standards, digital audio editor structure, and CD/MD disc construction.
Part C is a single long answer question with choices on block/convolution coding or editing with random access and recording media.
Autonomus syllabus12 mtechcse_mtech sem1_mtech model papers_co model paper
This document contains 8 questions related to computer organization and architecture in a model paper format. The questions cover various topics like floating point representations, Boolean logic simplification, bidirectional shift registers, addition/subtraction with signed magnitudes, cache memory mapping, virtual memory addressing, programmed I/O vs interrupt-initiated I/O, DMA transfers, Booth multiplication algorithm, addition/subtraction flowcharts for signed numbers, x86 addressing modes, pipelining, CISC vs RISC architectures, vector computation approaches, and Intel x86 Core Duo multicore organization. Students have to answer any 5 questions out of the 8 questions in the 3 hour exam.
Cad for vlsi circuits june 2012
This document contains questions that appear to be from an exam on VLSI design.
Part A contains 10 short answer questions asking about general topics in VLSI design like general-purpose integrated circuits, integer linear programming, symbolic layout editors, partitioning problems, floorplanning algorithms, local routing parameters, static vs dynamic partitioning, two-level logic synthesis, ASAP scheduling, and supervertices.
Part B contains 5 longer answer questions with sub-questions on topics like the VLSI design process, verification methods, graph representations, minimum distance design rules, placement problems, constraint graph compaction, floorplanning concepts, channel routing algorithms, gate-level simulation issues, ROBDD construction and manipulation, data flow types, and assignment problem
High performance pipelined architecture of elliptic curve scalar multiplicati...
High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m) High performance pipelined architecture of elliptic curve scalar multiplication over gf(2m)
Graph based transistor network generation method for supergate design
Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design Graph based transistor network generation method for supergate design
Building and road detection from large aerial imagery
This document presents a convolutional neural network approach for simultaneously detecting buildings and roads from aerial imagery in 3 channels. The CNN is trained on image patches from a dataset of 147 aerial images and corresponding 3-channel label maps containing buildings, roads, and other labels. Several CNN architectures are tested on 10 held-out images, with the basic architecture achieving the best precision of 0.8905 and 0.9241 for roads and buildings, respectively, outperforming a previous approach. The proposed method requires no pre-processing or hand-designed image features as the CNN is able to learn good feature extractors automatically through training.
MySQL Spatial Extensions - Boston MySQL Meetup April 2005
This document summarizes Andrew Collins' April 4th, 2005 presentation on MySQL Spatial Extensions. It outlines the OpenGIS Simple Features Specification geometry class hierarchy and spatial data model. It also describes some basic and spatial analysis methods defined in the specification, noting that MySQL implements some but not all methods. The document references additional OpenGIS specifications and the JTS Topology Suite library.
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question Papers
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question PapersBGS Institute of Technology, Adichunchanagiri University (ACU)
1) The document discusses various questions related to the finite element method and analysis. It includes questions on determining stresses and displacements in a bar element, principle of minimum potential energy, derivation of shape functions, consistent nodal load vector, Gauss quadrature, advantages and disadvantages of finite element method, Hermite shape functions, and short notes on C0, C1 and C2 functions, node numbering, serendipity elements, and patch tests.
2) The questions cover topics like derivation of shape functions, evaluation of shape functions, consistent nodal load vector, Gauss quadrature, Hermite shape functions, and flexibility and stiffness methods. Mathematical relations involving [K], [f], [a] are also givenFPGA Implementation of SubByte & Inverse SubByte for AES Algorithm
Advanced encryption standard was accepted as a Federal Information Processing Standard (FIPS) standard. In traditional look up table (LUT) approaches, the unbreakable delay is longer than the total delay of the rest of operations in each round. LUT approach consumes a large area. It is more efficient to apply composite field arithmetic in the SubBytes transformation of the AES algorithm. It not only reduces the complexity but also enables deep sub pipelining such that higher speed can be achieved. Isomorphic mapping can be employed to convert GF(28) to GF(22)2)2) ,so that multiplicative inverse can be easily obtained. SubBytes and InvSubBytes transformations are merged using composite field arithmetic. It is most important responsible for the implementation of low cost and high throughput AES architecture. As compared to the typical ROM based lookup table, the presented implementation is both capable of higher speeds since it can be pipelined and small in terms of area occupancy (137/1290 slices on a Spartan III XCS200-5FPGA).
Protein structure alignment beyond spatial proximity 3 dsig_2012
Background / Purpose:
The problem of automatically constructing an accurate protein structure alignment still remains challenging especially when proteins to be aligned are distantly-related.
Main conclusion:
We present a novel method, DeepAlign, which aligns two protein structures using not only spatial proximity of equivalent residues (after rigid-body superposition), but also evolutionary distance and hydrogen bonding similarity.
Graph based transistor network generation method for supergate design
This paper proposes a novel graph-based method to automatically generate optimized transistor networks from a sum-of-products expression to improve speed, power, and area of VLSI circuits. The method identifies efficient sub-networks ("kernels") from the graph representation and combines them, with transistor sharing, into a single minimized network. Experimental results show transistor count reduction compared to other approaches, leading to gains in gate performance, power, and area. The method was implemented in software simulation tools and on Spartan FPGA hardware.
Sma
(1) Sequence Mining Automata (SMA) is a new technique for mining frequent sequences from a database of sequences that adhere to a given regular expression. SMA models the regular expression as a specialized Petri net that can extract all valid subsequences in parallel from each database sequence.
(2) Previous approaches focus on pruning the search space based on the regular expression, while SMA focuses on the database and regular expression by constructing the sequences contained in each database entry.
(3) Experiments on both synthetic and real mobility data demonstrate the efficiency of SMA and its variants, which embed techniques like one-pass processing and full-cut partitioning to further improve performance.
Capp june 2012
This document contains questions that appear to be from a Master's degree examination on computer architecture and parallel processing. It includes questions in two parts - Part A contains 10 short answer questions on topics like performance metrics for parallel systems, differences between network topologies, possibility of super-linear speedup, and lower bounds on optimal schedules. Part B contains 5 longer answer questions requiring explanations on models of parallel computation, classification schemes, crossbar switches, applications of parallel processing, caching policies, virtual memory systems, multiprocessor architectures, and matrix multiplication algorithms for SIMD models.
What's hot (20)
New geometric interpretation and analytic solution for quadrilateral reconstr...
New geometric interpretation and analytic solution for quadrilateral reconstr...
Future semantic segmentation with convolutional LSTM
Future semantic segmentation with convolutional LSTM
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
Autonomus syllabus12 mtechcse_mtech sem1_mtech model papers_co model paper
Autonomus syllabus12 mtechcse_mtech sem1_mtech model papers_co model paper
High performance pipelined architecture of elliptic curve scalar multiplicati...
High performance pipelined architecture of elliptic curve scalar multiplicati...
Graph based transistor network generation method for supergate design
Graph based transistor network generation method for supergate design
Building and road detection from large aerial imagery
Building and road detection from large aerial imagery
MySQL Spatial Extensions - Boston MySQL Meetup April 2005
MySQL Spatial Extensions - Boston MySQL Meetup April 2005
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question Papers
2nd Semester M Tech: CMOS VLSI Design (June-2015) Question Papers
FPGA Implementation of SubByte & Inverse SubByte for AES Algorithm
FPGA Implementation of SubByte & Inverse SubByte for AES Algorithm
Protein structure alignment beyond spatial proximity 3 dsig_2012
Protein structure alignment beyond spatial proximity 3 dsig_2012
Graph based transistor network generation method for supergate design
Graph based transistor network generation method for supergate design
Similar to Csa papers
2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper
The document contains an exam for an Operating Systems course, including:
1) A 10 question short answer section covering topics like the main functions of an OS, multiprogramming, threads, deadlocks, dynamic linking, paging, interrupts vs traps, system programs, and dispatchers.
2) A longer answer section with 4 questions, including questions on batch processing systems, scheduling queues/algorithms, analyzing turnaround and waiting times for different scheduling algorithms, the dining philosophers problem and deadlocks, page sizes and addresses, thrashing prevention, file operations, OS security threats, and data encryption.
The exam tests students' understanding of fundamental OS concepts through definitions, explanations of concepts, analyzing examples, and
2009 Punjab Technical University B.C.A Microprocessor Question paper
The document is an exam for a course on microprocessors. It contains 20 short answer questions in Section A and 4 longer answer questions in Section B. The questions cover topics like the essential elements of a CPU, addressing modes, interrupts and interrupt service routines in 8086 processors, writing assembly language programs for 8086, the architecture of 8086 processors, flags in 8086, clock generators, interrupt controllers, and direct memory access controllers. The exam tests students' understanding of microprocessor concepts and the 8086 architecture.
2009 Punjab Technical University B.C.A Database Management System Question paper
This document outlines the structure and content of an exam for the Database Management System subject. [SECTION A] contains 10 short answer questions covering topics like physical database independence, database integrity, SQL, security, normalization, data types, schema architecture, relations, database administrator responsibilities, and concurrency. [SECTION B] contains 4 long answer questions asking students to compare data models, describe relational database design steps and pitfalls, explain the differences between relational algebra and calculus, discuss joins in DBMS with an example, explain the four forms of normalization with examples, and discuss distributed databases including the design steps.
2009 Punjab Technical University B.C.A Object Oriented Proagramming Language ...
This document outlines the structure and questions for an exam on Object Oriented Programming using C++. It is divided into two sections:
Section A contains 10 multiple choice questions covering topics like detecting end of file, if-else constructs, inline functions, stream classes, manipulators, and static variables.
Section B contains 4 longer answer questions asking about object oriented characteristics, user defined data types, constructors, inheritance, passing arguments by reference vs address, abstract base classes, and static vs runtime binding. Students must answer all of Section A and 4 of the 5 questions in Section B.
Computer Organization Jntu Model Paper{Www.Studentyogi.Com}
This document contains 8 sets of questions for a Computer Organization exam. Each set contains 2-3 questions related to various topics in computer organization including memory formats, arithmetic operations, processor registers, instruction sets, caching, I/O, and parallel processing. Students must answer any 5 questions out of the 16 total questions covering areas such as binary arithmetic, register organization, pipelining, memory addressing, and multiprocessor systems.
C O M P U T E R O R G A N I Z A T I O N J N T U M O D E L P A P E R{Www
This document contains 8 sets of questions for a Computer Organization exam. Each set contains 2-3 questions related to various topics in computer organization including memory formats, arithmetic operations, processor registers, instruction sets, caching, I/O, and parallel processing. Students must answer any 5 questions out of the 16 total questions covering areas such as binary arithmetic, register organization, pipelining, memory addressing, and multiprocessor systems.
Advanced computer architecture
The document contains questions from an exam on Advanced Computer Architecture. It asks about rapidly changing technologies that may shape computer design, factors that influence computer cost, Amdahl's law, popular data addressing modes, features of register indirect jumps, the impact of compiler technology on design decisions, hurdles of pipelining and techniques to improve performance, approaches for multiple issue processors, parameters to describe cache performance, techniques for cache optimization, multiprocessor cache coherence, limitations of symmetric shared multiprocessors, basic synchronization mechanisms for multiprocessors, characteristics of transaction processing benchmarks, cluster architecture, RAID performance, and issues in interconnection networks.
Computer Graphics and Multimedia Techniques Paper (RTU VI Semester)
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
Axes Tech
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Qb allunits
This document contains a question bank for an Introduction to IT course covering four units:
1. Generations of computers, digital computer components, binary arithmetic, and differences between types of devices, memory, printers, and data.
2. Types of software, language translators, data storage, memory, and application software.
3. Operating system functions, types of operating systems, scheduling, and DOS and Windows commands.
4. Computer networks, topologies, LAN, WAN, MAN, Excel functions, transmission media, protocols, and network devices.
BPSC Previous Year Question for AP, ANE, AME, ADA, AE
BPSC Previous Year Question for Assistant Programmer, Assistant Maintenance Engineer, Assistant Network Engineer by Stack IT job Solution
Book : Stack IT job Solution (A pattern Based IT job solution)
বুয়েট, কুয়েট, রুয়েট, ডুয়েট, পিএসসি, টেলিকম, আইবিএ, এমআইএস
সহ যেকোন প্যার্টানে জব প্রস্তুতির একমাত্র বই।
Order Link: https://stackvaly.com/product/stack-it-job-solution-p3qxo
WhatsApp: 01789741518
Database Management Systems Question Paper.pdf
This document contains information about a Database Management Systems examination for a university. It includes:
- The exam date and details such as duration and maximum marks.
- The exam will have two parts (Part A and Part B) and answering the questions in Part A is compulsory.
- Part A contains short questions testing basic DBMS concepts. Part B contains longer questions about more advanced topics requiring explanations and examples.
- The document provides four sample question papers with different questions that could be asked in the exam. This allows students to prepare for the wide range of concepts that could be covered.
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers BGS Institute of Technology, Adichunchanagiri University (ACU)
The document discusses various topics related to computer graphics and visualization:
i) It explains the concept of pinhole camera and finds the coordinates of a projected point on a film mounted inside the camera box. It also defines the field of view.
ii) It explains the graphics pipeline and its components.
iii) It explains the concept of transformations in homogeneous coordinates and finds the transformation matrix and its inverse for various transformations including rotation.2013-June: 5th Semester CSE / ISE Question Papers
This document contains questions from a Software Engineering exam, with multiple choice and descriptive answers across two sections. Key topics covered include:
1) Challenges in software engineering like project delivery and emergent system properties.
2) Critical systems and the spiral model of software development.
3) Non-functional requirements, requirement specifications, and standard requirement documents.
4) State charts, software project management, architectural design decisions, and control styles.
The questions assess understanding of software engineering principles and processes.
5th Semester CS / IS (2013-June) Question Papers
5th Semester CS / IS (2013-June) Question PapersBGS Institute of Technology, Adichunchanagiri University (ACU)
This document contains a software engineering exam with questions covering various topics:
1. The first part asks about key challenges in software engineering like delivery and emergent system properties. It also asks about critical systems and the spiral model.
2. The second part asks about architectural design decisions, control styles, and advantages of object models. It also covers agile methods, pair programming, and software prototyping.
3. The exam concludes with questions on verification vs validation, cleanroom software development, equivalence partitioning, software cost estimation, and project staffing.7th Semester (June; July-2015) Computer Science and Information Science Engin...
7th Semester (June; July-2015) Computer Science and Information Science Engin...BGS Institute of Technology, Adichunchanagiri University (ACU)
This document contains 8 questions that are part of an examination for a 7th semester computer engineering course covering Java and JEE technologies. It provides instructions to answer 5 full questions out of the 8, with at least 2 questions from each part (A and B).
Part A covers core Java concepts like object-oriented programming, applets, events, AWT vs Swing, and GUI components. Part B focuses on more advanced Java EE topics such as JDBC, transactions, servlets, cookies, sessions, JSP, and RMI. Students are asked to explain, define, write examples, and compare/contrast various Java and Java EE programming concepts and technologies.C g.2010 supply
The document contains 4 sets of questions for a Computer Graphics exam. Each set contains 8 questions related to topics in computer graphics like raster vs vector systems, transformations, line algorithms, surface detection, and animation. Students must answer 5 questions out of the 8 provided in each set. The questions test understanding of fundamental graphics concepts and algorithms through explanations, derivations, examples, and problem solving.
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure Concepts
Computer and Number Systems
1.
(10 pt)
You have been hired to develop a website-based sales system for a large international retail firm. List and describe at least four features that are specific to the Web design of your system and customer service important to consider if your system is to be successful at attracting and keeping customers living outside of the US. Include not only characteristics of the user interface, but those issues that must be uniquely addressed to successfully service your non-US customers.
2.
(2.5 pt each)
In order to receive credit for these problems, you must show all of the steps you took to arrive at your answers.
(c) Convert the following decimal number to binary:
21842
(d) Convert the following binary number to decimal:
11000111011.101
(c) Convert the following hexadecimal number to decimal:
CA97
(d) Convert the following binary number to hexadecimal:
1110011111011010100
CPU and Memory
3.
(10 pt)
ASCII, Unicode, and EBCDIC are, of course, not the only numeric / character codes. The Sophomites from the planet Collegium use the rather strange code shown in the Figure below. There are only thirteen characters in the Sophomite alphabet, and each character uses a 5-bit code. In addition, there are four numeric digits, since the Sophomites use base 4 for their arithmetic. Given the following Sophomite sequence, what is the corresponding binary message being sent by the Sophomites?
(HINT: Decode the sequence reading from left to right then write the corresponding binary sequence, leaving a space between each binary sequence.)
4.
(10 pt)
Define memory cache write-through and write-back techniques and describe the advantages and disadvantages of each.
Input / Output
5. Answer the follow questions about interrupts.
a.
(5 pt)
Describe in detail the steps that occur when a system receives an interrupt.
b.
(5 pt)
Describe how these steps differ in the case when a system receives multiple interrupts
Computer Systems
6. Answer the following questions about clusters.
a.
(5 pt)
Describe how you might use a cluster to provide fault-tolerant computing
b.
(5 pt)
Describe how you might use a cluster architecture to provide rapid scalability for a Web-based company experiencing rapid growth.
Networks
7. Answer the following questions about communication protocols.
a.
(5 pt)
Using the operations of UDP (User Datagram Protocol) and TCP (Transmission Control Protocol) as a basis, carefully explain the difference between connectionless and connection-oriented communication.
b.
(5 pt)
If you were ordering a number of items from an online seller, such as amazon.com, which Protocol (TCP or UDP) would you recommend and explain why
.
8. In the context of network security,
a.
(3 pt)
exp.
6th EC CBCS Model question papers
6th EC CBCS Model question papersCoorg Institute of Technology, Department Of Library & Information Center , Ponnampet
This document contains model question papers for the 6th semester BE (CBCS) EC/TC course Digital Communication (15EC61). It includes 10 sample questions divided into 5 modules. Each question has 3 parts with marks allocated for each part. The questions test various topics related to digital communication systems including Hilbert transforms, line codes, orthogonal signals, probability of error, modulation techniques like PSK, QAM, FSK and demodulation. It also includes questions on channel equalization, spread spectrum, channel coding and error control coding.1 Telecommunication Switching Systems And Networks
The document contains information about a telecommunication switching systems and networks exam, including:
- The exam code, date, course name, and maximum marks
- Instructions to answer any 5 of the 8 questions provided
- The 8 questions cover various topics related to telecommunication systems like earphones, satellite bandwidth requirements, switching networks, ISDN, and SONET.
Similar to Csa papers (20)
2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper
2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper
2009 Punjab Technical University B.C.A Microprocessor Question paper
2009 Punjab Technical University B.C.A Microprocessor Question paper
2009 Punjab Technical University B.C.A Database Management System Question paper
2009 Punjab Technical University B.C.A Database Management System Question paper
2009 Punjab Technical University B.C.A Object Oriented Proagramming Language ...
2009 Punjab Technical University B.C.A Object Oriented Proagramming Language ...
Computer Organization Jntu Model Paper{Www.Studentyogi.Com}
Computer Organization Jntu Model Paper{Www.Studentyogi.Com}
C O M P U T E R O R G A N I Z A T I O N J N T U M O D E L P A P E R{Www
C O M P U T E R O R G A N I Z A T I O N J N T U M O D E L P A P E R{Www
Computer Graphics and Multimedia Techniques Paper (RTU VI Semester)
Computer Graphics and Multimedia Techniques Paper (RTU VI Semester)
BPSC Previous Year Question for AP, ANE, AME, ADA, AE
BPSC Previous Year Question for AP, ANE, AME, ADA, AE
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers
7th Semester (June; July-2015) Computer Science and Information Science Engin...
7th Semester (June; July-2015) Computer Science and Information Science Engin...
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
1 Telecommunication Switching Systems And Networks
1 Telecommunication Switching Systems And Networks
Csa papers
- 1. BCA (SEM. – 3rd), MAY -2009 COMPUTER SYSTEM ARCHITECTURE SUBJECT CODE: BC-403(N2) TIME-03 Hours Maximum Marks: 60 Instruction to candidates: 1) Section – A is Compulsory. 2) Attempt any four questions from Section – B.ee SECTION-A (10 X 2=20) Q1) (a) What is the difference between trap and interrupt? (b) What must the address field of an indexed addressing mode instruction be to make it the same as a register indirect mode instruction? (c) Differentiate between Half adder and full adder? (d) Define OP codes. (e) What is Asynchronous data transfer? (f) Define Seek time. (g) Name the various addressing modes? (h) What is the function of accumulator in 8 bit microprocessor? (i) How pipeline helps in a faster execution of an Instruction? (j) What is mapping process? SECTION-B (4X10=40) Q2) (a) List the control functions and micro operations needed for the execution of memory reference instruction (b) Discuss the various modes of data transfer. Q3) (a) Determine the methods to handle branches in a pipeline instruction execution unit.
- 2. (b) Explain interrupt cycle? Draw the flow chart. Q4) What is DMA scheme of Data Transfer? Discuss its operating principle. What is cycle stealing mode of data transfer? Q5) (a) Explain the various page replacement techniques. (b) What are the various I/O data transfer modes? Differentiate between them? Q6) (a) Differentiate micro programmed and hardwired control unit? (b) Discuss the various phases of instruction cycle. Q7) Explain memory reference instructions in detail.