B.Sc.IT: Semester - VI (April - 2017) [CBSGS - 75:25 Pattern | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
B.Sc.IT: Semester - VI (October - 2016) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (October - 2016) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (April – 2017) [Question Paper | CBSGS: 75:25 Pat...Mumbai B.Sc.IT Study
Digital Signals and Systems (April – 2017) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs Christopher Morris
This document proposes a new graph kernel called the glocalized Weisfeiler-Lehman graph kernel. It extends the classic Weisfeiler-Lehman graph kernel to consider both local and global graph properties. The kernel maps graphs to feature vectors based on the k-dimensional Weisfeiler-Lehman algorithm. Approximation algorithms using adaptive sampling are introduced to make the kernel scalable to large graphs. Experimental results on graph classification benchmarks demonstrate the kernel achieves high accuracy while having fast running times.
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks Christopher Morris
This document proposes methods to incorporate higher-order graph properties into graph neural networks (GNNs). It shows that GNNs are as powerful as the 1-dimensional Weisfeiler-Lehman graph isomorphism test for distinguishing graphs, but cannot capture higher-order properties like triangle counts. The document introduces k-dimensional GNNs and hierarchical k-GNNs to learn representations of subgraphs. Experimental results show these methods improve over 1-GNN baselines on graph classification and regression tasks.
We review our recent progress in the development of graph kernels. We discuss the hash graph kernel framework, which makes the computation of kernels for graphs with vertices and edges annotated with real-valued information feasible for large data sets. Moreover, we summarize our general investigation of the benefits of explicit graph feature maps in comparison to using the kernel trick. Our experimental studies on real-world data sets suggest that explicit feature maps often provide sufficient classification accuracy while being computed more efficiently. Finally, we describe how to construct valid kernels from optimal assignments to obtain new expressive graph kernels. These make use of the kernel trick to establish one-to-one correspondences. We conclude by a discussion of our results and their implication for the future development of graph kernels.
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...IJERA Editor
This document proposes a new efficient distributed arithmetic (NEDA) technique for implementing high-speed memory-efficient 1-D 9/7 wavelet filters. NEDA is an area-efficient architecture that does not require ROM, multiplication, or subtraction. It can expose redundancy in adder arrays consisting of entries of 0 and 1. The document describes how NEDA can be used to compute the high pass filter output of a 1-D discrete wavelet transform using 9/7 filters through an example. It also shows the proposed NEDA architecture and processing steps to obtain the low pass and high pass filter outputs with just additions and shifts.
B.Sc.IT: Semester - VI (October - 2016) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (October - 2016) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (April – 2017) [Question Paper | CBSGS: 75:25 Pat...Mumbai B.Sc.IT Study
Digital Signals and Systems (April – 2017) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs Christopher Morris
This document proposes a new graph kernel called the glocalized Weisfeiler-Lehman graph kernel. It extends the classic Weisfeiler-Lehman graph kernel to consider both local and global graph properties. The kernel maps graphs to feature vectors based on the k-dimensional Weisfeiler-Lehman algorithm. Approximation algorithms using adaptive sampling are introduced to make the kernel scalable to large graphs. Experimental results on graph classification benchmarks demonstrate the kernel achieves high accuracy while having fast running times.
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks Christopher Morris
This document proposes methods to incorporate higher-order graph properties into graph neural networks (GNNs). It shows that GNNs are as powerful as the 1-dimensional Weisfeiler-Lehman graph isomorphism test for distinguishing graphs, but cannot capture higher-order properties like triangle counts. The document introduces k-dimensional GNNs and hierarchical k-GNNs to learn representations of subgraphs. Experimental results show these methods improve over 1-GNN baselines on graph classification and regression tasks.
We review our recent progress in the development of graph kernels. We discuss the hash graph kernel framework, which makes the computation of kernels for graphs with vertices and edges annotated with real-valued information feasible for large data sets. Moreover, we summarize our general investigation of the benefits of explicit graph feature maps in comparison to using the kernel trick. Our experimental studies on real-world data sets suggest that explicit feature maps often provide sufficient classification accuracy while being computed more efficiently. Finally, we describe how to construct valid kernels from optimal assignments to obtain new expressive graph kernels. These make use of the kernel trick to establish one-to-one correspondences. We conclude by a discussion of our results and their implication for the future development of graph kernels.
High Speed Memory Efficient Multiplier-less 1-D 9/7 Wavelet Filters Based NED...IJERA Editor
This document proposes a new efficient distributed arithmetic (NEDA) technique for implementing high-speed memory-efficient 1-D 9/7 wavelet filters. NEDA is an area-efficient architecture that does not require ROM, multiplication, or subtraction. It can expose redundancy in adder arrays consisting of entries of 0 and 1. The document describes how NEDA can be used to compute the high pass filter output of a 1-D discrete wavelet transform using 9/7 filters through an example. It also shows the proposed NEDA architecture and processing steps to obtain the low pass and high pass filter outputs with just additions and shifts.
Jacobi solver is one of the most efficient to solve large linear system of equations. As this method involves more number
of iterations, it takes a longer time for giving the solution in VLSI. This paper presents an implementation of Jacobi solver in
FPGA, in which, the various blocks of Jacobi solver are implemented with Kogge-Stone adder (KSA) where ever addition is
required. This resulted in enhanced performance at the cost of little increase in area. The improvement in performance is a
decrease in the delay of 67.7% in the minimum period of delay, which is a substantial improvement. As compared to the Ripple
carry addition (RCA), addition implementation in the KSA is found to give an area savings of 21.21% in terms of slices, an area
increase of 56.60% in terms of flip-flops and an increase of 49.04% in terms of 4 input LUTs. Hence this design can be
implemented in places where high performance is of primary concern. The implementation and simulation have been performed
in VHDL in Xilinx 14.7 targeted to FPGA.
EXTENDED K-MAP FOR MINIMIZING MULTIPLE OUTPUT LOGIC CIRCUITSVLSICS Design
This paper proposes an extended Karnaugh map (K-map) technique for minimizing multiple output logic circuits using a single K-map. The algorithm accumulates the minterms of multiple functions into a single K-map. Clusters are generated from the extended K-map and popped from a stack to obtain the minimized Boolean expressions for each output function. Experimental results on circuits with up to 5 variables and outputs show the extended K-map approach is more space efficient than using multiple standard K-maps. A complexity analysis indicates the extended K-map uses O(2n) space compared to O(k*2n) for k functions using standard K-maps.
Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and...IJNSA Journal
This document analyzes the CAST-128 block cipher and a modified version using tests like avalanche criterion, encryption quality, correlation coefficient, and key sensitivity. It shows that the modified version performs similarly to the original CAST-128 algorithm according to these tests. Specifically, it finds that both algorithms exhibit good diffusion properties based on avalanche testing. Encryption quality analysis shows the modification does not degrade encryption quality. Key sensitivity testing illustrates that small key changes result in very different ciphertexts for both original and modified versions.
The document presents a new block cipher that blends concepts from the modified Feistel cipher and advanced Hill cipher. The cipher uses an involutory key matrix K to encrypt plaintext matrices P and Q through iterative applications of mixing, permutation, and XOR operations per equations 1.1 and 1.2. Cryptanalysis shows the cipher is strong as the encryption equations are nonlinear and functions like Shift() and Mix() cause diffusion in each round. The encryption and decryption processes are illustrated through flowcharts and algorithms.
Data Warehousing (April – 2015) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
mumbai bscit study, kamal t, mumbai university, old question paper, previous year question paper, bscit question paper, bscit semester vi, semester vi question paper, internet technology, april - 2015, 75:25 Pattern, 60:40 Pattern, revised syllabus, old syllabus, cbsgc, question paper, may - 2016, april - 2017, april - 2014, april - 2013, may – 2016, october – 2016, digital signals and system, data warehousing
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
A Cryptographic Hardware Revolution in Communication Systems using Verilog HDLidescitation
Advanced Encryption Standard (AES), is an
advancement of Federal Information Processing Standard
(FIPS) which is an initiated Process Standard of NIST. The
AES specifies the Rijndael algorithm, in which a symmetric
block cipher that processes fixed 128 bit data blocks using
cipher keys with different lengths of 128, 192 and 256 bits.
The earliest Rijndael algorithm had the advantage of
combining both data block sizes of 128, 192 and 256 bits with
any key lengths. AES can be programmed in pure hardware
Verilog HDL, Which includes Multiplexer to enhance more
secure to Cipher text. The results indicate that the hardware
implementation proposed in this project is Decrementing
Utilization of resource and power consumption of 113 mW
than other implementation. Using FPGA lead to reliability on
source modulations. This project presents the AES algorithm
with regard to FPGA and Verilog HDL. The software used for
Simulation is ModelSim-Altera 6.3g_p1 (Quartus II 8.1).
Synthesis and implementation of the code is carried out on
Xilinx ISE 13.4 (XC6VCX240T) device is used for hardware
evaluation.
https://github.com/telecombcn-dl/dlmm-2017-dcu
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of big annotated data and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which had been addressed until now with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks and Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles and applications of deep learning to computer vision problems, such as image classification, object detection or text captioning.
This document describes algorithms for finding minimum spanning trees in graphs. It discusses Prim's algorithm and Kruskal's algorithm, which are greedy algorithms used to find minimum spanning trees in undirected weighted graphs. It compares the time complexity of the two algorithms and notes that Prim's algorithm has lower time complexity and is simpler to implement. The document also outlines applications of minimum spanning trees and provides examples of applying Prim's and Kruskal's algorithms to find the minimum spanning tree of sample graphs.
This document discusses various algorithms and problems including:
1) The Towers of Hanoi puzzle and its solution requiring 2n-1 moves for n disks.
2) Permutations and two methods for generating all possible permutations.
3) The n-queens problem of placing n queens on an n×n chessboard without any queens threatening each other, solved using backtracking.
4) Backtracking as a general method for constraint satisfaction problems.
LSGAN - SIMPle(Simple Idea Meaningful Performance Level up)Hansol Kang
LSGAN은 기존의 GAN loss가 아닌 MSE loss를 사용하여, 더욱 realistic한 데이터를 생성함.
LSGAN 논문 리뷰 및 PyTorch 기반의 구현.
[참고]
Mao, Xudong, et al. "Least squares generative adversarial networks." Proceedings of the IEEE International Conference on Computer Vision. 2017.
The document discusses solutions to several algorithm questions.
For Q1, it summarizes that incrementing and resetting a binary counter can be done in O(n) time by keeping a pointer to the highest set bit.
For Q2, it shows that a queue can be implemented with two stacks in O(1) amortized time by pushing and popping between the stacks as needed.
For Q3, it explains that while the amortized costs of insert and extract-min for a binary heap are O(logn) and O(1) respectively, this does not imply the overall time complexity of heapsort is O(n).
For Q4, it proposes a solution
This document summarizes the Candid Covariance-Free Incremental Principal Component Analysis (CCIPCA) algorithm. CCIPCA incrementally estimates principal components from sequentially arriving sample vectors without storing a covariance matrix. It uses an iterative approach to estimate each eigenvector, subtracting the effect of prior eigenvectors from new samples. The algorithm includes an "amnesic parameter" l to weight more recent samples more heavily. Experimental results on face image data show CCIPCA converges faster and more accurately than other incremental PCA methods.
The document discusses algorithms for solving the range minimum query (RMQ) problem. It first reduces RMQ to the lowest common ancestor (LCA) problem in trees. It then presents several algorithms for solving RMQ, including:
1. A trivial preprocessing algorithm that requires O(n^2) time and O(1) query time
2. The sparse table (ST) algorithm that requires O(n log n) preprocessing time and O(1) query time
3. An improved algorithm that partitions the array into blocks and requires O(n) preprocessing time and O(1) query time for queries spanning multiple blocks
4. A general O(n) time solution that builds a Cartesian tree from
Mapping one network model into another involves embedding the vertices and edges of one graph G(V,E) into the vertices and edges of another graph G'(V',E'). This is needed when an algorithm's communication structure differs from the target parallel machine's architecture. Common mapping techniques include topology embedding and using metrics like dilation, congestion, and expansion. Examples shown include mapping a linear array onto a hypercube using Gray codes, a 2D mesh onto a hypercube by concatenating Gray codes, and a linear array or mesh onto each other. The mappings aim to minimize communication overhead and achieve maximum parallelism when running an algorithm on different network architectures.
1. The document provides instructions to solve problems related to digital waveguide oscillators, digital lattice filters, and other discrete-time linear systems. Students are asked to write state space equations, find eigenvalues, compute responses, and represent systems using different forms such as state space and block diagrams. MATLAB code is provided to help with computations.
2. Students must analyze cascaded and parallel systems, check controllability and observability, and represent pulse transfer functions using state space, direct form, cascade form, and other block diagram representations. They are also asked to transform state space representations between different coordinate systems.
http://imatge-upc.github.io/telecombcn-2016-dlcv/
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of big annotated data and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which had been addressed until now with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks and Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles and applications of deep learning to computer vision problems, such as image classification, object detection or text captioning.
We present Graph Convolutional Networks that, unlike classic DL models, allow supervised learning by exploiting both the single node features and its relationships with the others within the network.
Object Detection Beyond Mask R-CNN and RetinaNet IIIWanjin Yu
This document provides an overview of fine-grained image analysis. It begins with background on computer vision, deep learning, and traditional image recognition/retrieval. It then introduces fine-grained image analysis, distinguishing it from generic image recognition through examples. Challenges of fine-grained analysis are discussed, including small inter-class variance and large intra-class variance. Real-world applications of fine-grained analysis are presented across domains like species identification.
Photo-realistic Single Image Super-resolution using a Generative Adversarial ...Hansol Kang
* Ledig, Christian, et al. "Photo-realistic single image super-resolution using a generative adversarial network." Proceedings of the IEEE conference on computer vision and pattern recognition. 2017.
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Jacobi solver is one of the most efficient to solve large linear system of equations. As this method involves more number
of iterations, it takes a longer time for giving the solution in VLSI. This paper presents an implementation of Jacobi solver in
FPGA, in which, the various blocks of Jacobi solver are implemented with Kogge-Stone adder (KSA) where ever addition is
required. This resulted in enhanced performance at the cost of little increase in area. The improvement in performance is a
decrease in the delay of 67.7% in the minimum period of delay, which is a substantial improvement. As compared to the Ripple
carry addition (RCA), addition implementation in the KSA is found to give an area savings of 21.21% in terms of slices, an area
increase of 56.60% in terms of flip-flops and an increase of 49.04% in terms of 4 input LUTs. Hence this design can be
implemented in places where high performance is of primary concern. The implementation and simulation have been performed
in VHDL in Xilinx 14.7 targeted to FPGA.
EXTENDED K-MAP FOR MINIMIZING MULTIPLE OUTPUT LOGIC CIRCUITSVLSICS Design
This paper proposes an extended Karnaugh map (K-map) technique for minimizing multiple output logic circuits using a single K-map. The algorithm accumulates the minterms of multiple functions into a single K-map. Clusters are generated from the extended K-map and popped from a stack to obtain the minimized Boolean expressions for each output function. Experimental results on circuits with up to 5 variables and outputs show the extended K-map approach is more space efficient than using multiple standard K-maps. A complexity analysis indicates the extended K-map uses O(2n) space compared to O(k*2n) for k functions using standard K-maps.
Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and...IJNSA Journal
This document analyzes the CAST-128 block cipher and a modified version using tests like avalanche criterion, encryption quality, correlation coefficient, and key sensitivity. It shows that the modified version performs similarly to the original CAST-128 algorithm according to these tests. Specifically, it finds that both algorithms exhibit good diffusion properties based on avalanche testing. Encryption quality analysis shows the modification does not degrade encryption quality. Key sensitivity testing illustrates that small key changes result in very different ciphertexts for both original and modified versions.
The document presents a new block cipher that blends concepts from the modified Feistel cipher and advanced Hill cipher. The cipher uses an involutory key matrix K to encrypt plaintext matrices P and Q through iterative applications of mixing, permutation, and XOR operations per equations 1.1 and 1.2. Cryptanalysis shows the cipher is strong as the encryption equations are nonlinear and functions like Shift() and Mix() cause diffusion in each round. The encryption and decryption processes are illustrated through flowcharts and algorithms.
Data Warehousing (April – 2015) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
mumbai bscit study, kamal t, mumbai university, old question paper, previous year question paper, bscit question paper, bscit semester vi, semester vi question paper, internet technology, april - 2015, 75:25 Pattern, 60:40 Pattern, revised syllabus, old syllabus, cbsgc, question paper, may - 2016, april - 2017, april - 2014, april - 2013, may – 2016, october – 2016, digital signals and system, data warehousing
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
A Cryptographic Hardware Revolution in Communication Systems using Verilog HDLidescitation
Advanced Encryption Standard (AES), is an
advancement of Federal Information Processing Standard
(FIPS) which is an initiated Process Standard of NIST. The
AES specifies the Rijndael algorithm, in which a symmetric
block cipher that processes fixed 128 bit data blocks using
cipher keys with different lengths of 128, 192 and 256 bits.
The earliest Rijndael algorithm had the advantage of
combining both data block sizes of 128, 192 and 256 bits with
any key lengths. AES can be programmed in pure hardware
Verilog HDL, Which includes Multiplexer to enhance more
secure to Cipher text. The results indicate that the hardware
implementation proposed in this project is Decrementing
Utilization of resource and power consumption of 113 mW
than other implementation. Using FPGA lead to reliability on
source modulations. This project presents the AES algorithm
with regard to FPGA and Verilog HDL. The software used for
Simulation is ModelSim-Altera 6.3g_p1 (Quartus II 8.1).
Synthesis and implementation of the code is carried out on
Xilinx ISE 13.4 (XC6VCX240T) device is used for hardware
evaluation.
https://github.com/telecombcn-dl/dlmm-2017-dcu
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of big annotated data and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which had been addressed until now with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks and Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles and applications of deep learning to computer vision problems, such as image classification, object detection or text captioning.
This document describes algorithms for finding minimum spanning trees in graphs. It discusses Prim's algorithm and Kruskal's algorithm, which are greedy algorithms used to find minimum spanning trees in undirected weighted graphs. It compares the time complexity of the two algorithms and notes that Prim's algorithm has lower time complexity and is simpler to implement. The document also outlines applications of minimum spanning trees and provides examples of applying Prim's and Kruskal's algorithms to find the minimum spanning tree of sample graphs.
This document discusses various algorithms and problems including:
1) The Towers of Hanoi puzzle and its solution requiring 2n-1 moves for n disks.
2) Permutations and two methods for generating all possible permutations.
3) The n-queens problem of placing n queens on an n×n chessboard without any queens threatening each other, solved using backtracking.
4) Backtracking as a general method for constraint satisfaction problems.
LSGAN - SIMPle(Simple Idea Meaningful Performance Level up)Hansol Kang
LSGAN은 기존의 GAN loss가 아닌 MSE loss를 사용하여, 더욱 realistic한 데이터를 생성함.
LSGAN 논문 리뷰 및 PyTorch 기반의 구현.
[참고]
Mao, Xudong, et al. "Least squares generative adversarial networks." Proceedings of the IEEE International Conference on Computer Vision. 2017.
The document discusses solutions to several algorithm questions.
For Q1, it summarizes that incrementing and resetting a binary counter can be done in O(n) time by keeping a pointer to the highest set bit.
For Q2, it shows that a queue can be implemented with two stacks in O(1) amortized time by pushing and popping between the stacks as needed.
For Q3, it explains that while the amortized costs of insert and extract-min for a binary heap are O(logn) and O(1) respectively, this does not imply the overall time complexity of heapsort is O(n).
For Q4, it proposes a solution
This document summarizes the Candid Covariance-Free Incremental Principal Component Analysis (CCIPCA) algorithm. CCIPCA incrementally estimates principal components from sequentially arriving sample vectors without storing a covariance matrix. It uses an iterative approach to estimate each eigenvector, subtracting the effect of prior eigenvectors from new samples. The algorithm includes an "amnesic parameter" l to weight more recent samples more heavily. Experimental results on face image data show CCIPCA converges faster and more accurately than other incremental PCA methods.
The document discusses algorithms for solving the range minimum query (RMQ) problem. It first reduces RMQ to the lowest common ancestor (LCA) problem in trees. It then presents several algorithms for solving RMQ, including:
1. A trivial preprocessing algorithm that requires O(n^2) time and O(1) query time
2. The sparse table (ST) algorithm that requires O(n log n) preprocessing time and O(1) query time
3. An improved algorithm that partitions the array into blocks and requires O(n) preprocessing time and O(1) query time for queries spanning multiple blocks
4. A general O(n) time solution that builds a Cartesian tree from
Mapping one network model into another involves embedding the vertices and edges of one graph G(V,E) into the vertices and edges of another graph G'(V',E'). This is needed when an algorithm's communication structure differs from the target parallel machine's architecture. Common mapping techniques include topology embedding and using metrics like dilation, congestion, and expansion. Examples shown include mapping a linear array onto a hypercube using Gray codes, a 2D mesh onto a hypercube by concatenating Gray codes, and a linear array or mesh onto each other. The mappings aim to minimize communication overhead and achieve maximum parallelism when running an algorithm on different network architectures.
1. The document provides instructions to solve problems related to digital waveguide oscillators, digital lattice filters, and other discrete-time linear systems. Students are asked to write state space equations, find eigenvalues, compute responses, and represent systems using different forms such as state space and block diagrams. MATLAB code is provided to help with computations.
2. Students must analyze cascaded and parallel systems, check controllability and observability, and represent pulse transfer functions using state space, direct form, cascade form, and other block diagram representations. They are also asked to transform state space representations between different coordinate systems.
http://imatge-upc.github.io/telecombcn-2016-dlcv/
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of big annotated data and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which had been addressed until now with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks and Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles and applications of deep learning to computer vision problems, such as image classification, object detection or text captioning.
We present Graph Convolutional Networks that, unlike classic DL models, allow supervised learning by exploiting both the single node features and its relationships with the others within the network.
Object Detection Beyond Mask R-CNN and RetinaNet IIIWanjin Yu
This document provides an overview of fine-grained image analysis. It begins with background on computer vision, deep learning, and traditional image recognition/retrieval. It then introduces fine-grained image analysis, distinguishing it from generic image recognition through examples. Challenges of fine-grained analysis are discussed, including small inter-class variance and large intra-class variance. Real-world applications of fine-grained analysis are presented across domains like species identification.
Photo-realistic Single Image Super-resolution using a Generative Adversarial ...Hansol Kang
* Ledig, Christian, et al. "Photo-realistic single image super-resolution using a generative adversarial network." Proceedings of the IEEE conference on computer vision and pattern recognition. 2017.
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (April - 2015) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (December – 2017) [Question Paper | IDOL: Revised...Mumbai B.Sc.IT Study
Data Warehousing (April – 2016) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (May – 2016) [Question Paper | IDOL: Revised Course]Mumbai B.Sc.IT Study
This document is a question paper for the subject Digital Signals and Systems from Mumbai University. It contains 7 questions with 2-3 subparts each, for a total of 100 marks. The questions cover topics like digital filters, signal classification, Fourier transforms, Laplace transforms, z-transforms, convolution, stability, frequency response, DFT, windowing, and filter design. Students are asked to solve problems, explain concepts, derive properties and compare different techniques within the domain of digital signals and systems.
B.Sc.IT: Semester - VI (December - 2017) [IDOL - Revised Course | Question Pa...Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (December - 2017) [IDOL - Revised Course | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (April – 2013) [Question Paper | IDOL: Revised Co...Mumbai B.Sc.IT Study
Data Warehousing (April – 2016) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Digital Signals and Systems (October – 2016) [Question Paper | IDOL: Revised ...Mumbai B.Sc.IT Study
Data Warehousing (April – 2016) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Internet Technologies (October – 2014 ) [Question Paper | CBSGS: 75:25 Pattern]Mumbai B.Sc.IT Study
Internet Technologies (October – 2014 ) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Internet Technologies (October – 2015) [Question Paper | CBSGS: 75:25 Pattern]Mumbai B.Sc.IT Study
Internet Technologies (October – 2015) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
B.Sc.IT: Semester - VI (October - 2015) [CBSGS - 75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (October - 2015) [CBSGS - 75:25 Pattern | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Internet Technologies (October – 2017) [Question Paper | CBSGS: 75:25 Pattern]Mumbai B.Sc.IT Study
Internet Technologies (October – 2017) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Geographic Information Systems (October – 2015) [Question Paper | CBSGS: 75:2...Mumbai B.Sc.IT Study
Geographic Information Systems (October – 2015) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Geographic Information Systems (April – 2016) [Question Paper | CBSGS: 75:25 ...Mumbai B.Sc.IT Study
Geographic Information Systems (April – 2016) [Question Paper | CBSGS: 75:25 Pattern]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
Internet Technologies (April – 2015) [Question Paper | IDOL: Revised Course]Mumbai B.Sc.IT Study
Internet Technologies (April – 2015) [Question Paper | IDOL: Revised Course]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
B.Sc.IT: Semester - VI (October - 2017) [CBSGS - 75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
B.Sc.IT: Semester - VI (October - 2017) [CBSGS - 75:25 Pattern | Question Paper]
april - 2017, april - 2016, april - 2015, april - 2014, april - 2013, october - 2017, october - 2016, october - 2015, october - 2014, may - 2016, may - 2017, december - 2017, 75:25 pattern, 60:40 pattern, revised course, old course, mumbai bscit study, mumbai university, bscit semester vi, bscit question paper, old question paper, previous year question paper, semester vi question paper, question paper, CBSGS, IDOL, kamal t, internet technology, digital signals and systems, data warehousing, ipr and cyber laws, project management, geographic information system
B.Sc.IT: Semester - V (November - 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
This document is a question paper for the November 2017 semester 5 B.Sc. IT Network Security exam from Mumbai University. It contains 7 questions with multiple parts each. The questions cover topics like network security principles, encryption algorithms, digital certificates, protocols, and attacks. Students have 2.5 hours to answer as many questions as possible. Marks are awarded based on the number and depth of questions answered. Diagrams can be included where needed.
Linux System Administration (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document contains questions for an exam on Linux System Administration. It covers topics such as piping and redirecting commands, the duties of a Linux system administrator, find commands, process management commands, hard and symbolic links, RPM and YUM, Linux partitions, file systems, runlevels and services, enabling SSH, managing users and groups, firewalls, iptables tables and rules, encrypting and decrypting files, NFS, Samba file servers, DNS hierarchy, dhcp.conf parameters, MTA and MDA, Apache configuration, virtual hosts, shell script elements, script to create a directory, high-availability clusters, bonding devices, TFTP servers, and Kickstart files. The exam expects students to answer 15 marks
Advanced Web Programming (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document outlines the questions and structure for an exam on Advanced Web Programming. It includes 15 questions across 5 sections. The questions cover topics like namespaces, arrays, .NET framework architecture, inheritance, constructors, delegates, validation controls, exceptions, debugging, cookies, viewstate, CSS, ADO.NET objects, data readers, gridviews, authentication, impersonation, and AJAX controls. Students must attempt 3 questions from each section, for a total of 15 questions and a maximum of 75 points on the exam. Diagrams and examples are encouraged for full marks.
Artificial Intelligence (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document contains instructions and questions for an Artificial Intelligence exam. It is divided into 5 sections, with 3 questions in each section worth 15 marks each. The questions cover a range of topics in AI including agents and environments, search algorithms, logic, knowledge representation, planning and other concepts. Students must attempt 3 questions out of 6 in each section. Diagrams and examples should be provided where necessary. Calculators and electronic devices are not permitted.
Software Project Management (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document outlines the structure and questions for an exam on software project management. It contains 5 sections with 3 questions each, for a total of 15 questions. Students must answer 3 questions from each section for a total of 9 questions. The questions cover a range of topics in software project management, including project life cycles, project charters, portfolio management, estimation techniques, scheduling, risk management, configuration management, contract types, and project organization. The exam is 2.5 hours long and worth a total of 75 marks.
Next Generation Technologies (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document outlines the structure and questions for a B.Sc. IT semester 5 exam focusing on next generation technologies. It contains 5 sections with 3 questions each, covering topics like Big Data, NoSQL databases, MongoDB, jQuery, JSON, and more. Students must attempt 3 questions from each section. The exam is 2.5 hours long and carries a total of 75 marks. Diagrams and examples should be provided as needed. Use of calculators or other electronic devices is not permitted during the exam.
Internet Of Things (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document is an exam paper for the subject Internet of Things from Mumbai University. It contains 15 questions divided into 5 sections. Section 1 contains 6 questions on defining and explaining key concepts related to IoT. Section 2 contains 6 questions on prototyping embedded devices and comparing development platforms like Arduino and Raspberry Pi. Section 3 contains 6 questions on different methods of prototyping like non-digital methods, 3D printing and laser cutting. Section 4 contains 6 questions on limitations of memory in embedded systems, performance concerns and libraries. Section 5 contains 6 questions on designing PCBs, certification of IoT devices, privacy concerns and the sensor commons project. Students have to attempt 3 questions from each section and the exam is
Enterprise Java (November – 2018) [Choice Based | Question Paper]Mumbai B.Sc.IT Study
This document outlines the structure and content of an exam for an Enterprise Java course. The exam contains 5 questions, with students required to answer 3 sub-questions from each question. Question topics include Java EE container architectures, the servlet lifecycle, HTTP session management, JSP directives and expression language, enterprise beans, JNDI lookup, Hibernate architecture and components, and object-relational impedance mismatch. The exam is 2.5 hours long and worth a total of 75 marks. Students are instructed to write question numbers clearly and not mix sub-question responses. Diagrams and examples are encouraged where necessary.
Project Management (April - 2016) [CBSGS - Paper Solution] {Mumbai University}Mumbai B.Sc.IT Study
The document provides information about a project management textbook for the BSc IT program at Mumbai University. It includes details like the university, course, semester, subject, and author. The author, Kamal Thakur, provides his contact information and outlines the contents of the textbook, which covers topics like software development planning, requirements, architecture, automation, metrics, and future trends in project management. It contains several chapters with questions and solutions related to project management concepts.
Project Management (April - 2015) [CBSGS - Paper Solution] {Mumbai University}Mumbai B.Sc.IT Study
This document provides information about a project management paper solution from Mumbai University for the B.Sc. IT program. It includes the university details, course information, author information, and the paper solution content which is divided into 7 questions. The paper solution covers topics like software lifecycles, artifacts, architecture, estimation techniques, roles, automation, and metrics. Contact information is also provided for the author.
Project Management (October - 2015) [CBSGS - Paper Solution] {Mumbai University}Mumbai B.Sc.IT Study
This document provides information about a project management paper solution from Mumbai University for the B.Sc. IT program. It includes the university details, course information, author information, and the paper itself which contains 7 sections with multiple choice questions covering various aspects of project management like the project life cycle, cost estimation, quality parameters, workflows, and more.
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Fix the Import Error in the Odoo 17Celine George
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
The simplified electron and muon model, Oscillating Spacetime: The Foundation...RitikBhardwaj56
Discover the Simplified Electron and Muon Model: A New Wave-Based Approach to Understanding Particles delves into a groundbreaking theory that presents electrons and muons as rotating soliton waves within oscillating spacetime. Geared towards students, researchers, and science buffs, this book breaks down complex ideas into simple explanations. It covers topics such as electron waves, temporal dynamics, and the implications of this model on particle physics. With clear illustrations and easy-to-follow explanations, readers will gain a new outlook on the universe's fundamental nature.
1. QUESTION PAPER
Kamal T Universe
[B.SC.IT – SEMESTER: VI]
INTERNET TECHNOLOGIES
DIGITAL SIGNALS AND SYSTEMS
DATA WAREHOUSING
IPR AND CYBER LAWS
PROJECT MANAGEMENT
GEOGRAPHIC INFORMATION SYSTEMS
3. MUMBAI UNIVERSITY
QUESTION PAPER
INTERNET TECHNOLOGIES
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What is fragmentation? Which fields changes over datagram during fragmentation in routing? Explain. (5)
(B) Explain Dual Stack and Tunneling in IPV6. (5)
(C) Explain the options in IPv4. (5)
(D) Compare IPV4 with IPV6. (5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What are the types of ICMP Error Messages? Explain. (5)
(B) Mobile IP communication can be Inefficient. Why? What is its Solution? Explain. (5)
(C) What is Address Resolution Protocol? What is its use? Explain the ARP Request and Reply Messages. (5)
(D) What are the different RIP Times? Explain the purpose of RIP Timers. (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What are the services of TCP? Explain. (5)
(B) What is the concept of 3-Way Handshaking in TCP Connection establishment? Explain. (5)
(C) Compare TCP with UDP. (5)
(D) Explain the components of UDP package. (5)
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Write a short note on DNS. (5)
(B) Explain SCTP association establishment and Termination. (5)
(C) Describe the DHCP Client Server Operations in the different Network. (5)
(D) What are the types of SCTP Chunks? Explain the meaning of each. (5)
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain the term NVT along with its Character Set. (5)
(B) Explain the architecture of WWW. (5)
(C) List and explain the types of FTP Commands. (5)
(D) Describe the HTTP Messages. (5)
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain video Compression in MPEG. (5)
(B) Write a short note on MIME. (5)
(C) What are the flow Characteristics of QOS? Explain. (5)
(D) Explain the following Protocols: POP, IMAP (5)
[TURN OVER]
4. MUMBAI UNIVERSITY
QUESTION PAPER
INTERNET TECHNOLOGIES
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Describe an IPV4 Datagram Header Format. (5)
(B) What are the types of OSPF Links? Explain. (5)
(C) Explain the Purpose of each TCP Timer. (5)
(D) Explain the Header Format of SCTP. (5)
(E) What are the types of Modes in TELNET? Explain. (5)
(F) Describe the Leaky Bucket Technique of Traffic Shaping. (5)
6. MUMBAI UNIVERSITY
QUESTION PAPER
DIGITAL SIGNALS AND SYSTEMS
(APRIL – 2017 | 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) State and explain the properties of Unit Impulse Function (𝑡). (5)
(B) How are Continuous and Discrete Time Systems classified? Explain. (5)
(C) What are Energy and Power Signals?
Determine if the following signals are energy signals or power signals or neither:
(i) 𝑥(𝑡) = 𝑡𝑢(𝑡)
(ii) 𝑥(𝑛) = (−0.5) 𝑛
𝑢(𝑛)
(5)
(D) Obtain the Trigonometric Fourier series for the half wave rectified sine wave shown below: (5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Find the Laplace Transform of the following functions:
(i) 𝑓(𝑡) =
1−𝑒 𝑡
𝑡
(ii) 𝑓(𝑡) = 𝑐𝑜𝑠3
3𝑡
(5)
(B) Find the Laplace transform of the full wave rectified output as shown below: (5)
(C) Find the inverse Laplace transform of {
𝑆2−𝑆−3
(𝑆+5)(𝑆+4)2} (5)
(D) The unit step of a network is (1 – 𝑒−𝑎𝑡
). Determine the impulse response ℎ(𝑡) of the network. (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) A system has an impulse response ℎ(𝑛) = {1,2,3} and output response
𝑦(𝑛) = {1,1,2, −1,3}. Determine the input sequence 𝑥(𝑛).
(5)
(B) Determine the z-transform for the analog input signal 𝑥(𝑡) = 𝑒−𝑎𝑡
applied to a Digital Filter. (5)
(C) How is z-transform obtained from Laplace Transform? Derive the z-transform of 𝑓(𝑛𝑇) = 𝑐𝑜𝑠 𝜔𝑛𝑇 (5)
(D) Define one-sided z-Transform, Two-sided z-Transform and Inverse z-Transform. (5)
[TURN OVER]
7. MUMBAI UNIVERSITY
QUESTION PAPER
DIGITAL SIGNALS AND SYSTEMS
(APRIL – 2017 | 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain the Paley – Wiener criteria. (5)
(B) Consider a causal and stable LTI system whose input 𝑥(𝑛) and output 𝑦(𝑛) are related through the
second order difference equation. 𝑦(𝑛) −
1
12
𝑦(𝑛 − 1) −
1
12
𝑦(𝑛 − 2) = 𝑥(𝑛)
Determine the step response for the system.
(5)
(C) Find the response of the following difference equation
𝑦(𝑛) − 5𝑦(𝑛 − 1) + 6𝑦(𝑛 − 2) = 𝑥(𝑛) 𝑓𝑜𝑟 𝑥(𝑛) = 𝑢(𝑛)
(5)
(D) A second order discrete time system is characterised by the difference equation
𝑦(𝑛) − 0.1𝑦(𝑛 − 1) − 0.02𝑦(𝑛 − 2) = 2𝑥(𝑛) − 𝑥(𝑛 − 1)
Determine y(n) for 𝑛 ≥ 0 when 𝑥(𝑛) = 𝑢(𝑛) and the initial conditions are
𝑦(– 1) =– 10 𝑎𝑛𝑑 𝑦(– 2 ) = 5
(5)
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Find the 4-point DFT of the sequence 𝑥(𝑛) = 𝑐𝑜𝑠
𝑛𝜋
4
. (5)
(B) Compute the circular periodic convolution graphically of the two sequences:
𝑥(𝑛) = 𝛿(𝑛) + 𝛿(𝑛 − 1) − 𝛿(𝑛 − 2) − 𝛿(𝑛 − 3) 𝑎𝑛𝑑
ℎ(𝑛) = 𝛿(𝑛) − 𝛿(𝑛 − 2) + 𝛿(𝑛 − 4)
(5)
(C) Determine the cross-correlation values of the two sequences 𝑥(𝑛) = {1,0,0,1} and ℎ(𝑛) =
{4,3,2,1}.
(5)
(D) Distinguish between linear convolution and circular convolution. (5)
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Design a digital Chebyshev filter to satisfy the constrains
0.707 ≤ │𝐻(𝑒 𝑗𝜔
)│ ≤ 1, 0 ≤ 𝜔 ≤ 0.2𝜋
│𝐻(𝑒) 𝑗𝜔
│ ≤ 0.1, 0.5𝜋 ≤ 𝜔 ≤ 𝜋
Using bilinear transformation and assuming 𝑇 = 1𝑠.
(5)
(B) Design a Finite Impulse Response low pass filter with a cut-off frequency of 1𝑘𝐻𝑧 and sampling rate
of 4kHz with eleven samples using Fourier series.
(5)
(C) An analog filter has the following system function. Convert this filter into a digital filter using backward
difference for the derivative.
𝐻(𝑠) =
1
(𝑠 + 0.1)2 + 9
(5)
(D) Design a digital Chebyshev filter to satisfy the constrains
0.707 ≤ │𝐻(𝑒 𝑗𝜔
)│ ≤ 1, 0 ≤ 𝜔 ≤ 0.2𝜋
│𝐻(𝑒) 𝑗𝜔
│ ≤ 0.1, 0.5𝜋 ≤ 𝜔 ≤ 𝜋
Using bilinear transformation and assuming 𝑇 = 1𝑠.
(5)
[TURN OVER]
8. MUMBAI UNIVERSITY
QUESTION PAPER
DIGITAL SIGNALS AND SYSTEMS
(APRIL – 2017 | 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
3
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Write a short note on Dirichlet’s conditions. (5)
(B) In the parallel RLC circuit. I0 = 5 A, L = 0.2 H, C = 2 F And 𝑅 = 0.5 𝛺. Switch S is opened at time 𝑡 =
0. Obtain the complete particular solution for the voltage 𝑣(𝑡) across the parallel network. Assume
zero current through inductor L and zero voltage across capacitor C before switching.
(5)
(C) Convolve the sequences 𝑥(𝑛) and ℎ(𝑛) where
𝑥(𝑛) = 0, 𝑛 < 0
= 𝑎 𝑛
, 𝑛 ≥ 0
ℎ(𝑛) = 0, 𝑛 < 0
= 𝑏 𝑛
, 𝑛 ≥ 0
Specify the answers if (i) 𝑎 = 𝑏 and (ii) 𝑎 ≠ 𝑏
(5)
(D) Find the convolution of the two signals
𝑥(𝑛) = 𝑢(𝑛) 𝑎𝑛𝑑 ℎ(𝑛) = 𝑎 𝑛
𝑢(𝑛), ROC: |𝑎| < 1; 𝑛 ≥ 0
(5)
(E) Find the circular periodic convolution using DFT and IDFT of the two sequences:
𝑥(𝑛) = {1,1,2,2) 𝑎𝑛𝑑 ℎ(𝑛) = {1,2,3,4}
(5)
(F) Design an analog BPF to satisfy the following specifications:
(i) 3 dB upper and lower cut-off frequencies are 100 Hz and 3.8 kHz
(ii) Stop band attenuation of 20 dB at 20 Hz and 8 kHz.
(iii) No ripple with both passband and stopband.
(5)
10. MUMBAI UNIVERSITY
QUESTION PAPER
DATA WAREHOUSING
(APRIL – 2017 | 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What are the characteristics of a Data Warehouse? (5)
(B) Differentiate OLTP and OLAP. (5)
(C) Explain the different types of facts in a fact table with suitable examples. (5)
(D) Differentiate Star and Snowflake Schema with respect to Data Warehouse. (5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Why is it necessary to configure a listener before creating the Database? Explain the steps to configure
a listener.
(5)
(B) What are the different components of OWB? Illustrate the same with a neat diagram. (5)
(C) Explain the three windows in the OWB Design Center. (5)
(D) What is the role of a DSN? What are the steps involved in configuring a DSN? (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Why is it necessary to create a target user and a target module while designing a DW in OWB? (5)
(B) Differentiate Relational and Multidimensional implementation of a Dimensional Model in a Database. (5)
(C) Why Time Dimension is considered a key part of most Data Warehouses? Explain the different
characteristics of a dimension that has to be defined in an OWB.
(5)
(D) What are the Cube Details that can be seen for a cube in the Data Object Editor? (5)
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What is the significance of ETL while creating a Data Warehouse in OWB? How is this accomplished in
OWB?
(5)
(B) Explain how an Aggregator data flow operator is used in mapping between sources and targets in
OWB.
(5)
(C) Discuss in detail the constraints tab in the Data Object Editor in OWB. (5)
(D) What is the role of a Joiner data flow operator in mapping sources and targets in OWB? (5)
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain any three transformations operator in OWB. (5)
(B) Why is a Key Lookup operator necessary in a mapping in OWB? (5)
(C) Why is it important to validate the objects in a Design Center? What are the possible results after
validation process?
(5)
(D) What are the default operating modes the mapping code can run in when executing in the database? (5)
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What is the significance of Snapshot in OWB? (5)
(B) Why is it necessary to synchronize objects in OWB? (5)
(C) Explain the terms Data Sparsity and Data Explosion with respect to a Data warehouse. (5)
(D) Explain with a neat diagram the basic OLAP System Architecture. (5)
[TURN OVER]
11. MUMBAI UNIVERSITY
QUESTION PAPER
DATA WAREHOUSING
(APRIL – 2017 | 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Explain Slowly Changing Dimension with a suitable example. (5)
(B) What are the steps involved in configuring repository and workspaces in OWB? (5)
(C) What are the Dimension Details that can be seen in the Data Object Editor? (5)
(D) List the properties seen in the property window of Aggregator operator. (5)
(E) Explain the columns in Object Details window under the Control Center Manager window in OWB. (5)
(F) What is the role of Recycle Bin in OWB? Explain. (5)
13. MUMBAI UNIVERSITY
QUESTION PAPER
IPR AND CYBER LAWS
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What is the objective behind Patent Law? Explain. (5)
(B) What are the contents of Patent Specification? (5)
(C) Enumerate the basic Principles of Trademark. (5)
(D) Discuss "International Background of Intellectual Property Rights". (5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain Data Protection Act in detail. (5)
(B) Write a short note on Agreement on Trade-Related Aspects of Intellectual Property Rights. (5)
(C) Explain the concept of Semi-Conductors. State and explain Semiconductor IC Layout Design Act. (5)
(D) What do you mean by Domain Name and disputes in Domain Name? (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Discuss transfer of Patent Rights in the form of assignment. (5)
(B) Explain "Copyright is protection in form & not in idea". (5)
(C) What are the defences available in case of infringement of trademarks and design? (5)
(D) What is a Trademark? What are its Essential Elements? What are its Functions? (5)
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What are General Obligations for enforcement of Intellectual Property Rights? (5)
(B) What are different types of IP Licensing Formats? (5)
(C) What is Licensing Agreement? List its different types. (5)
(D) Discuss Civil and Criminal Remedies in enforcing Intellectual Property Rights. (5)
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Describe implementation of Cyber Law in India. (5)
(B) What is Digital Contract? Explain. (5)
(C) What are the different issues in the Cyber World? (5)
(D) Explain Copyright issue in India? Explain Copyright in WWW. (5)
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What are the objectives of IT Act, 2000? (5)
(B) What does a Certifying Authority certify, while issuing the Digital Signature Certificate? (5)
(C) Discuss the Malaysian Approach to Cyber Laws? (5)
(D) What does Chapter 9 of IT Act, 2000, "Penalties and Adjudication" cover? (5)
[TURN OVER]
14. MUMBAI UNIVERSITY
QUESTION PAPER
IPR AND CYBER LAWS
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) List the main features of Copyright Act of 1957. (5)
(B) Write a short note on WIPO Treaty. (5)
(C) Define Copyright. Explain different rights conferred by Copyright. (5)
(D) Discuss on "Border Security Measures". (5)
(E) Explain the conditions for applying Digital Signature. (5)
(F) What are the conditions under which Intermediary Gets Exemption from Liability? (5)
16. MUMBAI UNIVERSITY
QUESTION PAPER
PROJECT MANAGEMENT
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain the five basic Parameters of the Software Cost Model. (5)
(B) Explain the drawbacks of Waterfall Model. (5)
(C) How software size can be reduced? Explain. How software size can be reduced? Explain. (5)
(D) How peer inspection helps in improving returns on investment? Explain. (5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Summarize differences, in emphasis on different life cycle aspects, between the two Life Cycle Stages. (5)
(B) Explain "Elaboration Phase" of the Life Cycle. (5)
(C) List all the five artifact sets. Explain Release Specification. (5)
(D) Discuss Technical perspective of Software Architecture. (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Write a short note on Major Milestones. (5)
(B) Define WBS. Explain Evolutionary Work Break Down Structures. (5)
(C) Explain the Iteration Planning Process. (5)
(D) Summarize the Life Cycle Emphasis associated with each Workflow. (5)
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Define Organizational Structure. What is a Line of Business Organization? Briefly explain main features
of default Line of Business Organization.
(5)
(B) Discuss various change categories defined on the basis of causes of change. Allocate the appropriate
change category to the following changes:
(i) Port to New Platform
(ii) Loss of User Data
(iii) Use of colours to differentiate updates from the previous version
(iv) Browser expands but doesn’t collapse displayed entries
(v) Upgradation to improve Query Performance
(5)
(C) Explain Mapping between Process Workflows and Software Development Tools. (5)
(D) How the Teams Gravity shifts over the Life Cycle? Explain. (5)
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Define Metrics. Explain 7 Core Metrics. (5)
(B) Discuss the basic characteristics of Good Metrics. (5)
(C) Explain SPCP (Software Project Control Panel). (5)
(D) What do you mean by "Tailoring the Process"? Explain the dimensions of discriminating factors for
tailoring the process.
(5)
[TURN OVER]
17. MUMBAI UNIVERSITY
QUESTION PAPER
PROJECT MANAGEMENT
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) How Modern Process Framework Exploits several Critical Approaches for resolving the five recurring
issues of the Conventional Process.
(5)
(B) Discuss the Software Management Best Practices. (5)
(C) Discuss the two major improvements expected in the Next Generation Cost Models. (5)
(D) Discuss the Culture Shifts necessary for the transition to Modern Software Process. (5)
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Discuss important trends in improving Software Economics. (5)
(B) Give difference between Software Architecture and Design. (5)
(C) Discuss issues related to Conventional WBS. (5)
(D) Write a short note on SCO. (5)
(E) Explain EVS (Earned Value System). (5)
(F) Summarize the balanced application of modern principles to achieve Economic results. (5)
19. MUMBAI UNIVERSITY
QUESTION PAPER
GEOGRAPHIC INFORMATION SYSTEMS
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
1
Time: 2 ½ Hours Total Marks: 75
N.B.: (1) All Question are Compulsory.
(2) Make Suitable Assumptions Wherever Necessary And State The Assumptions Made.
(3) Answer To The Same Question Must Be Written Together.
(4) Number To The Right Indicates Marks.
(5) Draw Neat Labeled Diagrams Wherever Necessary.
(6) Use of Non – Programmable Calculator is allowed.
Q.1 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) List and explain GIS Operations related to Data Analysis. (5)
(B) Write a short note on Rasterization. (5)
(C) Explain the Universe Transverse Mercator (UTM) Grid System. Give suitable example. (5)
(D) Explain the following terms of Object Based Data Model and give suitable example:
(i) Aggregation
(ii) Association
(5)
Q.2 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) What is Root Mean Square Error in Geometric Transformation? Explain the role of RMS error in Affine
Transformation.
(5)
(B) Explain the Map-To-Map and Image-To-Map Transformation. (5)
(C) List the Common Resampling Methods and explain them. (5)
(D) Explain the Bilinear Interpolation Resampling Method with suitable example. (5)
Q.3 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain different types of attribute table. (5)
(B) Explain File and Hierarchical Database with suitable example. (5)
(C) Explain:
(i) Dot Map
(ii) Choropleth Map
(5)
(D) Explain Relational Database with suitable example. (5)
Q.4 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain Buffering. (5)
(B) List and explain various Overlay Operations based on feature type. (5)
(C) Explain the following Map Manipulation Operations with example:
(i) Dissolve
(ii) Append
(5)
(D) Explain the Reclassification Local Operation of Raster. (5)
[TURN OVER]
20. MUMBAI UNIVERSITY
QUESTION PAPER
GEOGRAPHIC INFORMATION SYSTEMS
(APRIL – 2017 | CBSGS – 75:25 PATTERN)
B.SC.IT
(SEMESTER – VI)
KjT MUMBAI B.SC.IT STUDY
FACEBOOK | TWITTER | INSTAGRAM | GOOGLE+ | YOUTUBE | SLIDESHARE | TUMBLR | GITHUB
PAGE
2
Q.5 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) Explain Buffering. (5)
(B) List and explain various Overlay Operations based on feature type. (5)
(C) Explain the following Map Manipulation Operations with example:
(iii) Dissolve
(iv) Append
(5)
(D) Explain the Reclassification Local Operation of Raster. (5)
Q.6 ATTEMPT ANY TWO QUESTIONS: (10 MARKS)
(A) List and explain the types of Spatial Interpolation. (5)
(B) Explain the Density Estimation local method. (5)
(C) What is Kriging? Explain. (5)
(D) Define following:
(i) Anisotrophy
(ii) Range
(iii) Nugget
(iv) Partial Sill
(v) Sill
(5)
Q.7 ATTEMPT ANY THREE QUESTIONS: (15 MARKS)
(A) Explain the different components of GIS. (5)
(B) Write a short note on metadata. (5)
(C) Explain normalization with suitable example. (5)
(D) Write a short note on feature selection by graphic data query. (5)
(E) Find the zonal mean for the input raster(a) using a zonal raster(b)
2 7 1 1
9 8 5 3
2 8 4 6
1 4 5 3
1 1 1 2
1 1 1 2
3 3 2 2
3 3 3 3
(a) (b)
(5)
(F) Describe how Semivariance can be used to qualify the spatial dependence in a Data Asset. (5)