Cs 64
•
0 likes•203 views
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.
Report
Share
Report
Share
Download to read offline
Recommended
Cs 63
This document is a 3 page exam for a course on introduction to system software. It contains 5 questions with multiple parts each. Question 1 has 4 parts covering macro processors, shell programming to find greatest common divisor, calculating scheduling metrics for shortest job first and first come first serve scheduling, and regular expressions. Question 2 covers symbol tables, case tools, programming language generations, and address mapping. Question 3 defines 4GL and gives an example, discussing merits and demerits of 4GL use. It also explains the YACC function in compiler development. Question 4 covers hardware semaphore support for mutual exclusion and disk allocation strategies. Question 5 discusses fixed and variable length record I/O in UNIX and context free grammars for C
Csa papers
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.
EC202 SIGNALS & SYSTEMS PREVIOUS QUESTION PAPER
This document contains a 3 page exam for a signals and systems engineering course. It includes questions covering topics like linearity and stability of systems, convolution, Fourier transforms, sampling, Laplace transforms, Z-transforms, and properties of transforms. Students are asked to determine transforms, sketch spectra, compute outputs for different systems, and classify signals. The exam contains both theoretical and computational questions testing a range of topics from the course.
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.
Aae oop xp_06
The document discusses in-built functions in C++, command line parameters, and function pointers. It provides examples of commonly used string functions like strcpy, strcat, and strlen as well as numeric functions like abs, ceil, and sqrt. It explains that command line parameters allow passing values to programs during execution and are accessed through argc and argv. Function pointers are variables that store the address of a function and can be initialized with a function name.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [June /...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [June /...Mumbai B.Sc.IT Study
This document contains a question paper for a Microprocessor and Microcontroller exam. It has 7 questions covering topics like SRAM vs DRAM, the 8085 flag register, tri-state buffers, decoders, EPROM vs EEPROM, chip select logic, the 8085 system bus, registers, addressing modes, instructions, cache memory, RAID, buses, and the 8051 microcontroller. Students have 3 hours to answer 15 out of 21 subquestions that are spread across the 7 main questions.Applied maths for electronics engineers june 2013 (2)
This document contains two parts:
Part A provides examples of classifying fuzzy propositions and different types of fuzzy quantifiers.
Part B presents four mathematical problems: 1) determining the QR decomposition of a matrix, 2) finding the Cholesky decomposition of a matrix, 3) calculating properties of the Poisson distribution and finding moments of a given random variable, 4) solving problems related to the normal distribution including finding probabilities and the probability density function of a function of a Gaussian random variable.
Mcs 10 104 compiler design dec 2014
This document appears to be an exam for a Compiler Design course, covering four modules:
1) Compiler phases and intermediate representations
2) Data flow analysis techniques for determining variable properties
3) Control flow graph construction and dominance analysis
4) Optimization techniques including register allocation, instruction scheduling, common subexpression elimination, and interprocedural analysis
It contains eight questions testing knowledge of concepts from each module.
Recommended
Cs 63
This document is a 3 page exam for a course on introduction to system software. It contains 5 questions with multiple parts each. Question 1 has 4 parts covering macro processors, shell programming to find greatest common divisor, calculating scheduling metrics for shortest job first and first come first serve scheduling, and regular expressions. Question 2 covers symbol tables, case tools, programming language generations, and address mapping. Question 3 defines 4GL and gives an example, discussing merits and demerits of 4GL use. It also explains the YACC function in compiler development. Question 4 covers hardware semaphore support for mutual exclusion and disk allocation strategies. Question 5 discusses fixed and variable length record I/O in UNIX and context free grammars for C
Csa papers
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.
EC202 SIGNALS & SYSTEMS PREVIOUS QUESTION PAPER
This document contains a 3 page exam for a signals and systems engineering course. It includes questions covering topics like linearity and stability of systems, convolution, Fourier transforms, sampling, Laplace transforms, Z-transforms, and properties of transforms. Students are asked to determine transforms, sketch spectra, compute outputs for different systems, and classify signals. The exam contains both theoretical and computational questions testing a range of topics from the course.
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.
Aae oop xp_06
The document discusses in-built functions in C++, command line parameters, and function pointers. It provides examples of commonly used string functions like strcpy, strcat, and strlen as well as numeric functions like abs, ceil, and sqrt. It explains that command line parameters allow passing values to programs during execution and are accessed through argc and argv. Function pointers are variables that store the address of a function and can be initialized with a function name.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [June /...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [June /...Mumbai B.Sc.IT Study
This document contains a question paper for a Microprocessor and Microcontroller exam. It has 7 questions covering topics like SRAM vs DRAM, the 8085 flag register, tri-state buffers, decoders, EPROM vs EEPROM, chip select logic, the 8085 system bus, registers, addressing modes, instructions, cache memory, RAID, buses, and the 8051 microcontroller. Students have 3 hours to answer 15 out of 21 subquestions that are spread across the 7 main questions.Applied maths for electronics engineers june 2013 (2)
This document contains two parts:
Part A provides examples of classifying fuzzy propositions and different types of fuzzy quantifiers.
Part B presents four mathematical problems: 1) determining the QR decomposition of a matrix, 2) finding the Cholesky decomposition of a matrix, 3) calculating properties of the Poisson distribution and finding moments of a given random variable, 4) solving problems related to the normal distribution including finding probabilities and the probability density function of a function of a Gaussian random variable.
Mcs 10 104 compiler design dec 2014
This document appears to be an exam for a Compiler Design course, covering four modules:
1) Compiler phases and intermediate representations
2) Data flow analysis techniques for determining variable properties
3) Control flow graph construction and dominance analysis
4) Optimization techniques including register allocation, instruction scheduling, common subexpression elimination, and interprocedural analysis
It contains eight questions testing knowledge of concepts from each module.
13 quadratic formtemplate
This document provides instructions for creating a template function in a TI-Nspire calculator to find the solutions of a quadratic equation. The function is named "c61b711QUA" and takes in coefficients A, B, and C that are entered within the QuadForm function. It uses the quadratic formula to define the function that returns the solutions by taking the square root of B^2 - 4AC divided by 2A. An example is provided to test the function by inputting coefficients 1, 5, and 3.
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.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - II [Microprocessor and Microcontrollers] (Revised Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon.. Dsp model exam qp
This document contains a model examination for a Digital Signal Processing course. It includes two parts - Part A contains 10 short answer questions and Part B contains 5 long answer questions worth 16 marks each. The questions cover various topics in DSP including linear, time-invariant systems, Fourier transforms, FIR and IIR filter design, multirate signal processing, and speech processing applications. Students are required to answer 10 out of 15 questions in total within the 3 hour examination duration.
X10707 (me8691)
The document contains questions from a Mechatronics Engineering exam on the topic of computer aided design and manufacturing. It has three parts - Part A contains 10 short answer questions worth 2 marks each, Part B contains 5 long answer questions worth 13 marks each, and Part C contains 1 long answer question worth 15 marks. The questions cover topics such as product life cycles, spline curves, solid modeling approaches, CAD data exchange, CNC programming, flexible manufacturing systems, and geometric modeling techniques like Bezier curves.
Cs2303 theory of computation may june 2016
This document contains a question paper for a Theory of Computation exam. It has two parts - Part A contains 10 short answer questions worth 2 marks each on topics like mathematical induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes. Part B contains 5 long answer questions worth 16 marks each on topics like proofs by induction, Thompson's construction algorithm, regular expressions, context-free grammars, pushdown automata, Turing machines, undecidable problems, and recursively enumerable languages. Students are required to answer all questions in the paper.
ISMRM 2009, Honolulu
This document discusses two methods for calculating the impulse response function h(t) from dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) data: an analytical solution based on a physiological model and a numerical deconvolution method that directly calculates h(t) from the tissue and blood contrast agent curves without a model. It also notes that numerical deconvolution is sensitive to truncation and lag-time corrections of the curves.
Cia iii 17 18 qp
This document contains a summary of a test on digital communication that covers 5 course outcomes. It has 3 parts: Part A contains 5 short answer questions worth 2 marks each, Part B contains 4 long answer questions worth 5 marks each requiring students to attempt any 4, and Part C contains 2 long answer questions worth 15 marks each requiring students to attempt any 2. The questions cover topics such as digital modulation schemes, probability, error correction codes, spread spectrum techniques and matched filters.
Propulsion ii
This document contains a model examination for the subject Propulsion-II (Aeronautical Engineering) with questions in two parts - Part A and Part B.
Part A contains 10 multiple choice questions related to topics like impulse and reaction blades, turbine blade cooling, ramjet engine T-S diagram, components of pulse jet engine, applications of rocket propulsion, specific propellant consumption, types of propellant injectors, properties of liquid propellant, and thrust coefficient and nuclear propulsion.
Part B contains 5 long answer questions related to topics like lexical analyzer, transition diagrams, regular expressions, non-deterministic finite automata, deterministic finite automata, grammar, parsing tables, translation schemes, three address code, symbol
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - I [Fundamentals of Digital Computing] (Revised Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon.. Two-Way MIMO Decode-and-Forward Relaying Systems with Tensor Space-Time Coding
This document presents a new closed-form semiblind receiver for two-way MIMO decode-and-forward (DF) relaying systems using tensor space-time coding. The proposed receiver avoids error propagation at the relay by decoding and re-encoding the signals before forwarding to the sources. Simulation results show the DF receiver outperforms amplify-and-forward receivers in terms of symbol error rate due to less noise sensitivity. The cross-coding scheme employed at the relay also simplifies the receiver design and eliminates interference between sources.
Doc 20180130-wa0002
This document is a model exam paper for a data communication and networks course. It contains 5 questions testing knowledge of:
1) The OSI model layers and protocols, differences between IPv4 and IPv6.
2) Encoding techniques used in data transmission including Manchester encoding and modulation methods.
3) How data is broken into frames for transmission and the selective reject ARQ protocol.
4) Using time division multiplexing and frequency division multiplexing to transmit multiple telephone channels.
5) Differences between circuit switching and packet switching, comparing OSI layer 2 to IEEE 802 layer 2, functions of hubs and switches, transmission media for Ethernet, and Fast Ethernet specifications.
Model-counting Approaches For Nonlinear Numerical Constraints
This document summarizes research on using model counting approaches to analyze nonlinear numerical constraints that arise in applications like probabilistic inference, reliability analysis, and side-channel analysis. It presents two implementations of modular exponentiation with nonlinear constraints and evaluates the performance of various exact and approximate model counting tools on the path conditions extracted from symbolic execution. The results show that for small domains, brute force counting works best, while approximate model counting scales better to larger problems.
17428 computer hardware & maintenance
This document contains sample test papers and a question paper for a Diploma in Computer Engineering exam on the subject of Computer Hardware and Maintenance. It includes questions that assess understanding of computer components like BIOS, monitors, printers, memory, motherboards, buses, power supplies and storage devices. The test papers and question paper provide instructions on number of questions to attempt, marks allocation and time duration. They contain multiple choice, short answer and descriptive questions to evaluate knowledge of key computer hardware concepts and topics.
Pointers
Pointers are a data type in C that store memory addresses as their values. Pointers allow programs to access and manipulate data stored in memory. Pointers add power and flexibility to the C language. A pointer variable contains the address of another variable. Pointer operators like * and & are used to dereference pointers and get the address of a variable. Pointers can be passed as arguments to functions to allow the functions to modify memory outside their local scope.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - II [Microprocessor and Microcontrollers] (Revised Course). [Year - September / 2013] . . .Solution Set of this Paper is Coming soon.. Dsp
This document is the exam paper for a Digital Signal Processing mid-semester exam. It contains 4 questions assessing various concepts:
1) Question 1 asks to define discrete convolution, digital and discrete signals, time invariant systems, and the sampling theorem. It also asks to define a causal system.
2) Question 2(A) asks to determine the response of two linear time invariant systems based on given impulse responses and inputs.
3) Question 3(A) asks to explain the properties of the region of convergence and Question 3(B) asks about the region of convergence of a sequence, aspects of pipelining in DSPs, and the process of converting a continuous time signal to discrete time.
Q4.11: Using GCC Auto-Vectorizer
The document discusses using GCC's auto-vectorizer to optimize loops. It provides flags and options for enabling vectorization, checking which loops were vectorized, and tips for writing vectorizable code. Examples are given of vectorized NEON code for improved performance. The Linaro Toolchain group works on vectorization and related optimizations, and examples from users can help with vectorization efforts.
Complier
This document discusses next-use information, which tracks the subsequent uses of names (variables) in basic blocks to optimize register allocation. It describes computing next-use information by scanning backwards through three-address statements to determine which names are live and have subsequent uses at each statement. It also discusses storing multiple temporary names in the same register or memory location to reduce space and size when generating intermediate code.
Pc 4.5 notes_graphing
This document provides instructions for graphing sine and cosine functions. It notes the difference between (bx-c) and b(x-c) and provides examples of graphing 3 periods of different sine and cosine functions. The document also lists homework problems from page 328 involving graphing sine and cosine functions.
Cs 611
The document is a past exam paper for the course CS-611 Computer Fundamentals and PC Software. It contains 5 questions with multiple parts about various computing topics. Question 1 covers the basic computer architecture, cryptography, files vs folders, and tables in MS Word. Question 2 differentiates analog and digital transmission, parallel and serial transmission, compilers and interpreters, and programming language categories. Question 3 discusses WAN communication techniques, differences between WANs and LANs, and Windows 95 disk utilities. Questions 4 and 5 cover macros, email advantages and limitations, parallel processing categories, and Windows accessories.
Eco 2
The document is an exam for the elective course ECO-2 Accountancy-I. It contains 6 questions testing various accounting concepts. Question 1 has 4 sub-questions about the dual aspect concept, trial balance, bank reconciliation statement, and journal proper. Question 2 differentiates bills of exchange and promissory notes and explains the matching concept. Question 3 distinguishes normal and abnormal losses and sectional balancing. Question 4 provides journal entries for adjustments. Question 5 describes errors discovered in a trial balance and their rectification. Question 6 involves preparation of an income and expenditure account from a receipts and payments account.
More Related Content
What's hot
13 quadratic formtemplate
This document provides instructions for creating a template function in a TI-Nspire calculator to find the solutions of a quadratic equation. The function is named "c61b711QUA" and takes in coefficients A, B, and C that are entered within the QuadForm function. It uses the quadratic formula to define the function that returns the solutions by taking the square root of B^2 - 4AC divided by 2A. An example is provided to test the function by inputting coefficients 1, 5, and 3.
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.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - II [Microprocessor and Microcontrollers] (Revised Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon.. Dsp model exam qp
This document contains a model examination for a Digital Signal Processing course. It includes two parts - Part A contains 10 short answer questions and Part B contains 5 long answer questions worth 16 marks each. The questions cover various topics in DSP including linear, time-invariant systems, Fourier transforms, FIR and IIR filter design, multirate signal processing, and speech processing applications. Students are required to answer 10 out of 15 questions in total within the 3 hour examination duration.
X10707 (me8691)
The document contains questions from a Mechatronics Engineering exam on the topic of computer aided design and manufacturing. It has three parts - Part A contains 10 short answer questions worth 2 marks each, Part B contains 5 long answer questions worth 13 marks each, and Part C contains 1 long answer question worth 15 marks. The questions cover topics such as product life cycles, spline curves, solid modeling approaches, CAD data exchange, CNC programming, flexible manufacturing systems, and geometric modeling techniques like Bezier curves.
Cs2303 theory of computation may june 2016
This document contains a question paper for a Theory of Computation exam. It has two parts - Part A contains 10 short answer questions worth 2 marks each on topics like mathematical induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes. Part B contains 5 long answer questions worth 16 marks each on topics like proofs by induction, Thompson's construction algorithm, regular expressions, context-free grammars, pushdown automata, Turing machines, undecidable problems, and recursively enumerable languages. Students are required to answer all questions in the paper.
ISMRM 2009, Honolulu
This document discusses two methods for calculating the impulse response function h(t) from dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) data: an analytical solution based on a physiological model and a numerical deconvolution method that directly calculates h(t) from the tissue and blood contrast agent curves without a model. It also notes that numerical deconvolution is sensitive to truncation and lag-time corrections of the curves.
Cia iii 17 18 qp
This document contains a summary of a test on digital communication that covers 5 course outcomes. It has 3 parts: Part A contains 5 short answer questions worth 2 marks each, Part B contains 4 long answer questions worth 5 marks each requiring students to attempt any 4, and Part C contains 2 long answer questions worth 15 marks each requiring students to attempt any 2. The questions cover topics such as digital modulation schemes, probability, error correction codes, spread spectrum techniques and matched filters.
Propulsion ii
This document contains a model examination for the subject Propulsion-II (Aeronautical Engineering) with questions in two parts - Part A and Part B.
Part A contains 10 multiple choice questions related to topics like impulse and reaction blades, turbine blade cooling, ramjet engine T-S diagram, components of pulse jet engine, applications of rocket propulsion, specific propellant consumption, types of propellant injectors, properties of liquid propellant, and thrust coefficient and nuclear propulsion.
Part B contains 5 long answer questions related to topics like lexical analyzer, transition diagrams, regular expressions, non-deterministic finite automata, deterministic finite automata, grammar, parsing tables, translation schemes, three address code, symbol
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - I [Fundamentals of Digital Computing] (Revised Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon.. Two-Way MIMO Decode-and-Forward Relaying Systems with Tensor Space-Time Coding
This document presents a new closed-form semiblind receiver for two-way MIMO decode-and-forward (DF) relaying systems using tensor space-time coding. The proposed receiver avoids error propagation at the relay by decoding and re-encoding the signals before forwarding to the sources. Simulation results show the DF receiver outperforms amplify-and-forward receivers in terms of symbol error rate due to less noise sensitivity. The cross-coding scheme employed at the relay also simplifies the receiver design and eliminates interference between sources.
Doc 20180130-wa0002
This document is a model exam paper for a data communication and networks course. It contains 5 questions testing knowledge of:
1) The OSI model layers and protocols, differences between IPv4 and IPv6.
2) Encoding techniques used in data transmission including Manchester encoding and modulation methods.
3) How data is broken into frames for transmission and the selective reject ARQ protocol.
4) Using time division multiplexing and frequency division multiplexing to transmit multiple telephone channels.
5) Differences between circuit switching and packet switching, comparing OSI layer 2 to IEEE 802 layer 2, functions of hubs and switches, transmission media for Ethernet, and Fast Ethernet specifications.
Model-counting Approaches For Nonlinear Numerical Constraints
This document summarizes research on using model counting approaches to analyze nonlinear numerical constraints that arise in applications like probabilistic inference, reliability analysis, and side-channel analysis. It presents two implementations of modular exponentiation with nonlinear constraints and evaluates the performance of various exact and approximate model counting tools on the path conditions extracted from symbolic execution. The results show that for small domains, brute force counting works best, while approximate model counting scales better to larger problems.
17428 computer hardware & maintenance
This document contains sample test papers and a question paper for a Diploma in Computer Engineering exam on the subject of Computer Hardware and Maintenance. It includes questions that assess understanding of computer components like BIOS, monitors, printers, memory, motherboards, buses, power supplies and storage devices. The test papers and question paper provide instructions on number of questions to attempt, marks allocation and time duration. They contain multiple choice, short answer and descriptive questions to evaluate knowledge of key computer hardware concepts and topics.
Pointers
Pointers are a data type in C that store memory addresses as their values. Pointers allow programs to access and manipulate data stored in memory. Pointers add power and flexibility to the C language. A pointer variable contains the address of another variable. Pointer operators like * and & are used to dereference pointers and get the address of a variable. Pointers can be passed as arguments to functions to allow the functions to modify memory outside their local scope.
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - II [Microprocessor and Microcontrollers] (Revised Course). [Year - September / 2013] . . .Solution Set of this Paper is Coming soon.. Dsp
This document is the exam paper for a Digital Signal Processing mid-semester exam. It contains 4 questions assessing various concepts:
1) Question 1 asks to define discrete convolution, digital and discrete signals, time invariant systems, and the sampling theorem. It also asks to define a causal system.
2) Question 2(A) asks to determine the response of two linear time invariant systems based on given impulse responses and inputs.
3) Question 3(A) asks to explain the properties of the region of convergence and Question 3(B) asks about the region of convergence of a sequence, aspects of pipelining in DSPs, and the process of converting a continuous time signal to discrete time.
Q4.11: Using GCC Auto-Vectorizer
The document discusses using GCC's auto-vectorizer to optimize loops. It provides flags and options for enabling vectorization, checking which loops were vectorized, and tips for writing vectorizable code. Examples are given of vectorized NEON code for improved performance. The Linaro Toolchain group works on vectorization and related optimizations, and examples from users can help with vectorization efforts.
Complier
This document discusses next-use information, which tracks the subsequent uses of names (variables) in basic blocks to optimize register allocation. It describes computing next-use information by scanning backwards through three-address statements to determine which names are live and have subsequent uses at each statement. It also discusses storing multiple temporary names in the same register or memory location to reduce space and size when generating intermediate code.
Pc 4.5 notes_graphing
This document provides instructions for graphing sine and cosine functions. It notes the difference between (bx-c) and b(x-c) and provides examples of graphing 3 periods of different sine and cosine functions. The document also lists homework problems from page 328 involving graphing sine and cosine functions.
What's hot (20)
2009 Punjab Technical University B.C.A Microprocessor Question paper
2009 Punjab Technical University B.C.A Microprocessor Question paper
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [April ...
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...
[Question Paper] Fundamentals of Digital Computing (Revised Course) [April / ...
Two-Way MIMO Decode-and-Forward Relaying Systems with Tensor Space-Time Coding
Two-Way MIMO Decode-and-Forward Relaying Systems with Tensor Space-Time Coding
Model-counting Approaches For Nonlinear Numerical Constraints
Model-counting Approaches For Nonlinear Numerical Constraints
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...
[Question Paper] Microprocessor and Microcontrollers (Revised Course) [Septem...
Viewers also liked
Cs 611
The document is a past exam paper for the course CS-611 Computer Fundamentals and PC Software. It contains 5 questions with multiple parts about various computing topics. Question 1 covers the basic computer architecture, cryptography, files vs folders, and tables in MS Word. Question 2 differentiates analog and digital transmission, parallel and serial transmission, compilers and interpreters, and programming language categories. Question 3 discusses WAN communication techniques, differences between WANs and LANs, and Windows 95 disk utilities. Questions 4 and 5 cover macros, email advantages and limitations, parallel processing categories, and Windows accessories.
Eco 2
The document is an exam for the elective course ECO-2 Accountancy-I. It contains 6 questions testing various accounting concepts. Question 1 has 4 sub-questions about the dual aspect concept, trial balance, bank reconciliation statement, and journal proper. Question 2 differentiates bills of exchange and promissory notes and explains the matching concept. Question 3 distinguishes normal and abnormal losses and sectional balancing. Question 4 provides journal entries for adjustments. Question 5 describes errors discovered in a trial balance and their rectification. Question 6 involves preparation of an income and expenditure account from a receipts and payments account.
Cs 62
This document contains instructions for a term-end examination in 'C' Programming and Data Structures. It has 5 questions covering various topics like arrays, binary search, trees, graphs, linked lists, queues, heaps, sorting algorithms, and traversal techniques. Students are required to answer question 1 and any 3 other questions. All algorithms must be written in a style close to the C language.
Cs 69
This document is a 3 page exam for a course on TCP/IP programming. It contains 7 questions testing knowledge of IP addressing classes, TCP connection termination, writing client-server programs in C, Unix commands, ARP, differentiating network concepts, FTP protocol attributes, IP and TCP header fields, socket descriptors, and the purpose of the MIME protocol. Students are required to answer question 1 and any 3 other questions.
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
Cs 610
(1) Akbar had three sons, but by 1608 only one, Salim, was still alive as the other two had died of opium and alcohol addiction. (2) Salim too had become fond of stimulants and subject to mood swings when under the influence of arrack and opium, and he led several revolts against his father from 1600-1605. (3) Akbar's mind turned to Salim's son Khusram as a potential successor, as by widespread comment Khusram had all the qualities required at only 18 years of age.
Title: Akbar's Succession Troubles and his Consideration of his Grandson Khusram
achievements
The document discusses achievements in using enterprise architecture to support changes, including new domain and validation models. It also discusses creating a single guidance tool for competency-driven development, developing TSL skills and competencies, and providing a change framework with ideas from a TSL development planner report, delivery team, and learning from a TSL learning activity plan, learning development and innovation facilitator, and planning. The document concludes by thanking the audience.
Cs 74
This document contains a practice exam for a course on Introduction to Internet Programming. The exam contains 6 sections with multiple choice and written response questions. The questions cover topics like:
1) Java programming concepts like robustness, operator precedence, converting strings to numbers, exception handling, and differences between transient and volatile keywords.
2) Applet programming including ways to execute applets and writing an applet to demonstrate the applet lifecycle.
3) Additional Java topics like using protected access, method overloading, and garbage collection.
4) Packages, loops, command line arguments, extending interfaces.
5) Threading concepts like main and child threads, built-in exceptions, and
Cs 70
This document is a past exam for an Introduction to Software Engineering course. It contains 5 questions:
1. Design data flow diagrams, software requirements specification, entity relationship diagram, and PERT chart for a project proposal management system. Also specify an appropriate software development life cycle model.
2. Discuss the key process areas of the Capability Maturity Model and explain project tracking charts.
3. Discuss the role of a systems analyst and define fourth-generation languages.
4. Explain the concept of modularity and discuss categories of computer-aided software engineering tools.
5. Write short notes on software reviews, software upgradation, and the software crisis
Cs 71
The document is a past exam paper for the term-end examination in Computer Oriented Numerical Techniques. It contains 6 questions testing various numerical analysis techniques including interpolation, root finding using bisection, Newton-Raphson, and Regula Falsi methods, solving differential equations using Runge-Kutta and solving systems of equations using Gauss-Jordan elimination, Jacobi and Gauss-Seidel iteration methods. Students are required to answer 4 out of the 6 questions in the paper.
Cs 60
This document contains a 5 page exam for the course CS-60: Foundation Course in Mathematics in Computing. The exam contains 17 multiple choice and numerical problems covering topics like algebra, calculus, matrices, and complex numbers. Students have 3 hours to complete the exam which is worth a total of 75 marks. Question 1 is compulsory, and students must attempt any 3 questions from questions 2 through 6. The use of a calculator is permitted.
Cs 73
This document contains a term-end examination for a Theory of Computer Science course. It includes 8 questions testing various concepts:
1. Question 1 asks students to explain regular expressions, context-free grammars, non-deterministic finite automata (NFA), and the pumping lemma with examples. It also asks students to build a finite automaton and regular expressions.
2. Later questions address topics like grammars for odd palindromes, Turing machines, growth rate notations like Big O, and unsolvable decision problems.
3. The last few questions involve showing languages are/aren't regular or context-free, describing operations of a Turing machine, applications of finite automata,
Universo
Este documento presenta información sobre el universo dividida en cuatro secciones principales: 1) Nuestra imagen del universo, 2) Universo en expansión, 3) Los agujeros negros, y 4) La teoría de espacio y tiempo. Cada sección contiene párrafos sobre los descubrimientos científicos y teorías relacionadas con cada tema. El documento fue presentado por Jose Andres Camelo Barrera como parte de un proyecto virtual para el profesor Jhon Carabal en el curso 803JM con código 05.
Universo
Este documento presenta información sobre el universo dividida en cuatro secciones principales: 1) Nuestra imagen del universo, 2) Universo en expansión, 3) Los agujeros negros, y 4) La teoría de espacio y tiempo. Cada sección contiene párrafos sobre los descubrimientos científicos y teorías relacionadas con cada tema. El documento fue presentado por Jose Andres Camelo Barrera como parte de un proyecto virtual para el profesor Jhon Carabal en el curso 803JM con código 05.
Similar to Cs 64
Data structure using c bcse 3102 pcs 1002
This document contains a data structures exam from 2008 with 8 pages. It includes 10 multiple choice questions covering topics like data structures, binary trees, queues, stacks, graphs, and sorting algorithms. It also contains 8 additional problems requiring algorithms and programs related to linked lists, binary trees, heaps, graphs, searching, and polynomial representations. Students are instructed to answer question 1 and 5 of the additional problems.
8th Semester Computer Science (2013-June) Question Papers
8th Semester Computer Science (2013-June) Question PapersBGS Institute of Technology, Adichunchanagiri University (ACU)
This document contains questions for an examination on Software Testing. It is divided into two parts with multiple questions in each part. The questions cover various topics related to software testing including test metrics, defect management, test generation strategies, data flow testing, adequacy criteria, integration testing and system testing. Testing techniques like category-partition method, cause-effect graphing and predicate testing are also discussed in detail with examples.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.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.5th semester Computer Science and Information Science Engg (2013 December) Qu...
5th semester Computer Science and Information Science Engg (2013 December) Qu...BGS Institute of Technology, Adichunchanagiri University (ACU)
This document appears to be an exam question paper that covers topics in computer networks. It contains 8 questions with subparts that assess knowledge of various networking concepts across two parts. Students are instructed to answer 5 full questions by selecting at least 2 from each part. The questions address topics such as the OSI model, transmission impairment, modulation techniques, error detection, routing algorithms, and network security.Ec2203 digital electronics questions anna university by www.annaunivedu.org
EC2203 Digital Electronics Anna University Important Questions for 3rd Semester ECE , EC2203 Digital Electronics Important Questions, 3rd Sem Question papers,
http://www.annaunivedu.org/digital-electronics-ec-2203-previous-year-question-paper-for-3rd-sem-ece-anna-univ-question/
D I G I T A L I C A P P L I C A T I O N S J N T U M O D E L P A P E R{Www
This document contains eight questions related to digital integrated circuits and applications. The questions cover topics such as CMOS and TTL gates, VHDL programming, counters, decoders, arithmetic circuits, memories and programmable logic devices. Students are instructed to answer any five of the eight questions, which can include circuit design problems, writing VHDL code using different styles, and analyzing and explaining the operation of digital components.
Digital Ic Applications Jntu Model Paper{Www.Studentyogi.Com}
This document contains eight questions related to digital integrated circuits and applications. The questions cover topics such as CMOS and TTL gates, VHDL programming, counters, decoders, arithmetic circuits, memories and programmable logic devices. Students are instructed to answer any five of the eight questions, which can include circuit design problems, writing VHDL code, explaining concepts, and performing calculations. The exam is worth a total of 80 marks and is aimed at testing knowledge of digital logic design and implementation using integrated circuits.
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.
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.Operating%20 system iii_201
This document contains an exam for the subject of Operating Systems with 9 questions. It begins by asking for the exam roll number and provides exam details such as code, subject, duration, and maximum marks.
The first question contains 8 short answer sub-questions on topics like interrupts, fragmentation, threads, monitors, deadlock conditions, and disk scheduling algorithms.
The remaining questions are longer form questions divided into 4 units on topics of memory management, concurrency, I/O management, and file systems. The questions assess understanding of concepts like paging, segmentation, virtual memory, deadlocks, scheduling algorithms, disk scheduling, file allocation techniques, and directory structures.
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
Winter ’18 CIS 314 Final A Name: SID:
1. [5] Draw a 2-input XOR circuit using only AND, OR, and NOT gates:
2. [15] Describe the functionality of each Y86 pipeline stage during execution of the
andl rA, rB instruction in terms of the icode, ifun, rA, rB, valA, valB, valC, valP,
valE, valM, srcA, srcB, dstE, dstM, cnd signals (you may also use M, R, and PC):
IF:
ID:
EX:
MEM:
WB+PC:
3. [5] Briefly describe why the stall penalty for a pipelined Y86 ret instruction is 3
cycles:
4. [15] Consider the following C procedure:
void swap(int *xp, int *yp) {
int t0 = *xp;
int t1 = *yp;
*xp = t1;
*yp = t0;
}
Write Y86 code that implements the above C procedure. Comment your code:
5. [15] Consider the following C function:
int f(int *a, int *dest, int prod) {
*dest = prod ? 1 : 0;
for (int i = 0; i < len(a); ++i) {
if (prod) {
*dest *= a[i];
} else {
*dest += a[i];
}
}
}
Rewrite the above C function to minimize unnecessary function calls, memory
writes, and if statements:
6. [20] Consider the following Y86 code:
mrmovl 0(%eax) %ecx
mrmovl 0(%ebx) %edx
addl %ecx %ecx
xorl %ecx %edx
a. (10) How many pipeline stalls are required when running the above code without
data forwarding? Why? Draw a pipeline diagram to support your answer:
b. (10) How many pipeline stalls are required when running the above code with
data forwarding? Why? Draw a pipeline diagram to support your answer:
7. (25) Consider a 32-byte direct-mapped cache with 8-byte blocks for an 8-bit
machine (256 bytes of memory):
a. (5) Write a C function unsigned char getOffset(unsigned char address) that
returns the cache offset for the specified address using bitwise operators (assuming
the cache parameters above):
b. (5) Write a C function unsigned char getSet(unsigned char address) that returns
the cache set for the specified address using bitwise operators (assuming the cache
parameters above):
c. (15) If the following addresses are accessed in sequence, which addresses will
result in cache hits and which will result in misses (assuming the cache parameters
above and that the cache is initially empty)? For each address, show the tag, set,
offset, and whether it resulted in hit or miss:
0x02
0x04
0x8
0x26
0x04
0x24
.
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.
2013-June: 7th Semester CSE Question Papers
This document contains questions for an examination on Object Oriented Modeling and Design. It has two parts - Part A and Part B. Part A focuses on concepts related to UML, class modeling, associations, events, sequence diagrams and software development process. Part B focuses on use case modeling, class design, design patterns, and advanced OO concepts like templates and styles. The document provides guidelines for answering questions and allocates marks for each question.
7th cs june 2013
This document contains questions for an examination on Object Oriented Modeling and Design. It has two parts - Part A and Part B. Part A focuses on concepts related to UML, class modeling, associations, events, sequence diagrams and software development process. Part B focuses on use case modeling, class design, design patterns, and advanced OO concepts like templates and styles. The document provides guidelines for answering questions and allocates marks for each question.
7th Semester Computer Science (2013-June) Question Papers
7th Semester Computer Science (2013-June) Question PapersBGS Institute of Technology, Adichunchanagiri University (ACU)
This document contains questions for an examination on Object Oriented Modeling and Design. It has two parts - Part A and Part B. Part A focuses on concepts related to UML, class diagrams, associations, metamodels, events, sequence diagrams, activity diagrams etc. It also covers software development process. Part B focuses on use case diagrams, class models, advanced use case relationships, class design, patterns etc. Students are required to answer 5 out of the 8 questions, selecting at least 2 from each part.2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...
2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...BGS Institute of Technology, Adichunchanagiri University (ACU)
This document contains questions for a Big Data and Hadoop exam. It includes questions about structured, unstructured, and semi-structured data; using big data analytics to detect fraud; business models for big data; impedance mismatch; version stamps; sharding vs replication; the CAP theorem; materialized views; HDFS block size and replication; factors in HDFS design; ensuring data integrity in HDFS; serialization; MapReduce workflows; the WordCount problem using MapReduce; running MapReduce jobs with YARN; the HBase data model; Pig data types; HiveQL; Cassandra; and Avro.Vlsi model question paper 3 (june 2021)
This document outlines the course outcomes and assessment plan for the course EC8095 - VLSI Design. The 5 course outcomes cover key concepts in digital building blocks using CMOS transistors, design of combinational and sequential circuits, arithmetic blocks, memory systems, and FPGA design flow. The assessment is divided into 3 parts - Part A consists of 10 multiple choice questions, Part B contains 13 questions of 5 marks each, and Part C has 1 question of 15 marks. The questions map the course outcomes to different levels of Bloom's taxonomy including remembering, understanding, applying, analyzing, evaluating and creating knowledge. The document also provides a sample exam paper consisting of the 3 parts with representative questions assessing the course outcomes and knowledge levels.
Similar to Cs 64 (20)
8th Semester Computer Science (2013-June) Question Papers
8th Semester Computer Science (2013-June) Question Papers
7th Semester (June; July-2015) Computer Science and Information Science Engin...
7th Semester (June; July-2015) Computer Science and Information Science Engin...
5th semester Computer Science and Information Science Engg (2013 December) Qu...
5th semester Computer Science and Information Science Engg (2013 December) Qu...
Ec2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.org
D I G I T A L I C A P P L I C A T I O N S J N T U M O D E L P A P E R{Www
D I G I T A L I C A P P L I C A T I O N S J N T U M O D E L P A P E R{Www
Digital Ic Applications Jntu Model Paper{Www.Studentyogi.Com}
Digital Ic Applications Jntu Model Paper{Www.Studentyogi.Com}
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
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
7th Semester Computer Science (2013-June) Question Papers
7th Semester Computer Science (2013-June) Question Papers
2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...
2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...
More from Web Developer
Cs 612
The document is a past exam for a computer applications term-end exam. It contains 5 questions with various sub-questions about PC software skills topics like Excel, browsers, internet, and algorithms. Question 1 has sub-questions about solving a river crossing problem, Excel filters, chart wizards, browsers, and DNS. Questions 2-4 focus on algorithms, factorials, internet connections, templates, and pivot tables in Excel. Question 5 asks for short notes on HTTP, formatting in Excel, mailing lists, algorithms, and internet applications.
Cs 611 (p)s4
The document provides instructions for a term-end practical exam testing computer fundamentals and PC software skills. It outlines 4 questions worth a total of 80 marks testing abilities in Microsoft Windows, Word, PowerPoint, and mail merge functionality in Word. Question 1 involves installing a printer in Windows, finding PowerPoint files modified in the last month, displaying the IP address in DOS prompt, setting a screen saver with password. Question 2 focuses on formatting text and inserting tables, changing formatting in Word. Question 3 involves creating slides on "Arts and Culture of India" with different layouts and transitions in PowerPoint, and creating a macro to add headers and footers. Question 4 involves creating a data file of teacher addresses and using mail
Cs 611 (p)s3
The document provides instructions for a term-end practical examination in Computer Fundamentals and PC Software. It outlines 4 questions worth a total of 80 marks. Question 1 involves performing various tasks in MS Windows like sharing a file, changing TCP/IP settings, showing a drive directory tree, and uninstalling software. Question 2 focuses on tasks in MS Word like entering a formula, inserting and resizing an image, creating a multi-level numbered list, and formatting into columns. Question 3 requires creating slides with different layouts and transitions in addition to writing a macro to change document formatting. Question 4 involves creating a data file of university details and using mail merge to generate individual letters to each university requesting admission.
Cs 611 (p)s2
The document provides instructions for a term-end practical examination in Computer Fundamentals and PC Software. It outlines 4 questions worth a total of 80 marks testing skills in MS Windows, MS Word, MS PowerPoint, and mail merge. For question 1, students are asked to perform tasks like recovering deleted files, using disk defragmentor, creating dial-up connections, and changing desktop settings in Windows. Question 2 involves creating formulas and tables in Word. Question 3 requires creating PowerPoint slides on computer science and a macro to set margins. Question 4 involves mail merging a letter using a data file.
Cs 611 (p)s1
This document provides instructions for a term-end practical exam in Computer Fundamentals and PC Software. It outlines 4 questions worth a total of 80 marks. Question 1 involves performing tasks in MS Windows like finding files and changing settings. Question 2 focuses on tasks in MS Word like creating a boxed paragraph, inserting a table, and using auto-text. Question 3 asks the test-taker to create PowerPoint slides with different layouts and transitions, and write a macro to change a document to two-column format. Question 4 involves creating a data file of friends' names and addresses, and using a mail merge in Word to generate individual letters to each friend.
Cs 601
This document contains a 7 page exam for the course CS-601: Differential and Integral Calculus with Applications. The exam contains 8 questions testing a variety of calculus concepts:
1) Part a contains 6 multiple choice questions testing derivatives, integrals, limits, and monotonicity. Part b contains 6 fill in the blank questions testing derivatives, integrals, and equations of tangents.
2) Questions 2-5 contain additional multiple choice or short answer problems testing continuity, derivatives, integrals, Rolle's theorem, and partial derivatives.
3) Questions 6-8 contain free response problems on geometry, differential equations, and approximating an area using Simpson's rule. The exam tests a comprehensive understanding of
Cs 74 (p)s8
The document is a past practical examination paper for an Introduction to Internet Programming course. It contains instructions for a 2 question, 1 hour exam worth a total of 30 marks. Question 1 is worth 10 marks and asks students to write a program in Java to print all possible combinations of 3 input digits. Question 2 is also worth 10 marks and asks students to write a program to remove leading and trailing blanks from a character string.
Cs 75
This document is a 2 page exam for a course on intranet administration. It contains 5 questions with multiple parts each. Question 1 is compulsory and students must attempt 3 of the remaining questions. The questions cover topics like explaining the difference between an intranet and internet, security tools for intranets, database models used in intranets, components of IP addresses, protocols for e-commerce, graphic formats, groupware applications, hacking, VPNs, bulletin boards, TELNET, FTP, UDP, CGI protocol, WAP advantages and protocol stack, features of Samba server software, and features of an intranet authoring tool.
Cs 74 (p)s7
The document provides instructions for a term-end practical examination for an Introduction to Internet Programming course. It specifies that the exam is 1 hour long and worth a total of 30 marks. There are two compulsory programming questions worth 10 marks each - the first asks students to write a program that reads and sorts three strings from command line arguments alphabetically, and the second asks students to write a recursive program to compute Fibonacci numbers. An additional 10 marks are for a viva-voce oral examination. All programs must be written in Java.
Cs 74 (p)s6
The document is a past exam paper for an Introduction to Internet Programming course. It provides instructions for a 1 hour practical exam worth 30 marks total. The exam contains 2 compulsory questions worth 10 marks each - the first asks students to write a Java program that throws a custom exception for negative numbers, and the second asks students to write a program that compares elements in two arrays and returns true if they match or false if they don't. An additional 10 marks are available for a viva voce evaluation. All programs must be written in Java.
Cs 74 (p)s5
The document provides instructions for a term-end practical examination in Introduction to Internet Programming. It specifies that there are two compulsory questions worth 10 marks each, and an additional 10 marks for a viva voce portion. The first question asks students to write a recursive Java program to find the greatest common divisor of two positive integers. The second question asks them to write a recursive program that prints a given string in reverse order.
Cs 74 (p)s4
The document provides instructions for a term-end practical examination in Introduction to Internet Programming. There are two compulsory questions worth 10 marks each requiring students to write Java programs. The first question asks students to write a program that converts case of letters in a string from upper to lower or lower to upper. The second question asks students to accept student marks in an array, sort in ascending order, assign letter grades based on ranges, and print in a table.
Cs 74 (p)s3
The document is an exam for an Introduction to Internet Programming course, consisting of two compulsory questions worth 10 marks each. The first question asks students to write a Java program to calculate the sum of a harmonic series given an interactive user input for n. The second question asks students to write a Java program to extract a portion of a character string starting from the nth character for a length of m, accepting both n and m through interactive user input.
Cs 74 (p)s2
The document provides instructions for a Bachelor in Computer Applications term-end practical examination in Introduction to Internet Programming. It specifies that the exam is 1 hour long with two compulsory questions worth 10 marks each and an additional 10 marks for a viva-voce. The first question asks students to write a Java program that returns the location of an element in an array that matches a given value. The second question asks students to write a Java program to calculate the first 5 Fibonacci numbers.
Cs 74 (p)s1
The document provides instructions for a term-end practical examination in Introduction to Internet Programming. It indicates there are two compulsory questions worth 10 marks each, involving writing Java programs - one to calculate the sum of squares of 10 numbers in an array, and another to reformat a person's name from first, middle, last to last, first and middle. It also notes there are 10 marks for a viva-voce portion of the exam.
Cs 72 (p)s8
The document provides instructions for a C++ programming exam with two questions worth 40 marks each.
Question 1 asks students to design and implement a LineSegment class that stores the x and y coordinates of two endpoints. The class should include a constructor and a function to calculate the length of the line segment.
Question 2 asks students to design a class hierarchy for education programs including classes for Face to Face and Distance Learning programs. The hierarchy includes data members like program code and name. Students are tasked to implement the classes and demonstrate polymorphism using a print function and main.
Cs 72 (p)s5
1. The document provides instructions for a C++ programming exam with two compulsory questions worth 40 marks each.
2. The first question asks students to design a Mark-list class to store marks of 10 students in an array for three subjects (Physics, Chemistry, Mathematics). The class should have functions to find the topper and average marks in each subject.
3. The second question asks students to design a class hierarchy for workers, supervisors, and chief supervisors with data members like ID, name, payment details. Supervisors oversee workers. The chief supervisor gets a bonus. Students must implement constructor(s) and a PrintDetails() function for each class to demonstrate polymorphism.
Cs 72 (p)s4
This document provides instructions for a C++ and Object Oriented Programming term-end practical exam. It includes two compulsory questions worth 40 marks each.
Question 1 asks students to design a Rectangle class with constructor and area calculation member function, and overload the minus operator to find the difference in areas of two rectangles.
Question 2 asks students to design classes for an educational video hierarchy with Lectures and Outdoor Video subclasses. Students must include constructors and a printvideoinfo member function to demonstrate polymorphism.
Cs 72 (p)s2
This document contains instructions for a C++ programming exam with two questions worth 40 marks each.
Question 1 asks students to design and implement a class to represent real numbers with integer mantissa and exponent. The class should include a constructor, overloaded multiplication operator, and a printing function.
Question 2 asks students to design a class hierarchy for telephone customers with base and derived classes for different types of customers. Students should implement the classes with appropriate data members and functions, demonstrate polymorphism using a print function, and include a constructor in each class.
Cs 72 (p)s1
This document provides instructions for a C++ programming exam with two questions.
Question 1 asks students to design a Longtime class to represent time in hours, minutes, and seconds in 24-hour format. The class should have a constructor that initializes time to 12:00:00 and two member functions - one to find the difference between two Longtime objects and another to print the time in a.m. or p.m. format.
Question 2 asks students to design a class hierarchy for Department, Production, and Marketing classes with various data members. Students must implement the classes using C++ with appropriate constructors and a print_department_info() function. Polymorphism must be demonstrated using this
More from Web Developer (20)
Recently uploaded
UiPath Test Automation using UiPath Test Suite series, part 6
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Join us to introduce Milvus Lite, a vector database that can run on notebooks and laptops, share the same API with Milvus, and integrate with every popular GenAI framework. This webinar is perfect for developers seeking easy-to-use, well-integrated vector databases for their GenAI apps.
Pushing the limits of ePRTC: 100ns holdover for 100 days
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...Edge AI and Vision Alliance
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Full-RAG: A modern architecture for hyper-personalization
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications.
Presentation of the OECD Artificial Intelligence Review of Germany
Consult the full report at https://www.oecd.org/digital/oecd-artificial-intelligence-review-of-germany-609808d6-en.htm
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Removing Uninteresting Bytes in Software Fuzzing
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
20 Comprehensive Checklist of Designing and Developing a Website
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
Video Streaming: Then, Now, and in the Future
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Building RAG with self-deployed Milvus vector database and Snowpark Container...
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
Mind map of terminologies used in context of Generative AI
Mind map of common terms used in context of Generative AI.
Recently uploaded (20)
UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to Production
20 Comprehensive Checklist of Designing and Developing a Website
20 Comprehensive Checklist of Designing and Developing a Website
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Mind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AI
Cs 64
- 1. No. of Printed Pages : 3 CS-64 BACHELOR IN COMPUTER APPLICATIONS Term-End Examination June, 2011 CS-64 : INTRODUCTION TO COMPUTER ORGANISATION Time : 3 hours Maximum Marks : 75 Note : Question No. 1 is compulsory. Answer any three questions from the rest. 1. (a) List the basic key features of a von-Neuman 5 machine. Also draw structure of von- Neuman machine. (b) What is a combinational circuit ? Draw a 5 combinational circuit for boolean expression F= + X•Y + X•17 (c) Explain need of multiplexer. Also explain 5 how a 4 x 1 multiplexer works. (d) What is a bus ? Explain the working of a 5 shared bus system with an example. (e) Explain the need of error detection and 5 correction. What is a parity bit ? How a parity bit can be used for the purpose of error detection ? CS-64 1 P.T.O.
- 2. (f) What is addressing ? List and explain any 5 two addressing schemes with the help of an example of each. 2. (a) Simplify the following boolean expression using K-Map F (x, y, z, w)= xyav + x/ z + xyzto + + ZW Also, draw the logic circuit for the simplified boolean expression. (b) What is an interrupt ? Explain use of 5 interrupt in assembly programming with an example. (c) What is a hardwired control unit ? Explain 4 its advantages. 3. (a) Draw a combinational circuit for 3-bit odd 5 parity generator. Also make truth table for it. (b) What is random access memory (RAM) ? 6 Briefly explain working of RAM. (c) Perform the following arithmetic operations 4 on 8 bit numbers using 2's complement notation. Indicate overflow/underflow, if any : (i) 57 — 48 (ii) — 82 + 41 CS-64 2
- 3. 4. (a) What are four types of segments in 8086 6 assembly programming ? Explain the use of ASSUME directive with an example. (b) What are the four general purpose registers 4 in 8086 ? Explain uses of each of them. (c) What is redundant array of independent 5 disk (RAID) ? Explain three basic characteristics of RAID. 5. (a) Write an assembly program to add two 8 bit numbers. (b) Differentiate between synchronous and 5 asynchronous circuits. Also explain the need of a flip-flop in circuit design with the help of an example. (c) Explain the following terms with the help 5 of an example/diagram/illustrations, if needed. (i) Assembler (ii) Memory hierarchy. CS-64 3