Scribd
Upload
44 views1 page

Imp Notes & To Do

The document lists various topics related to computer science including number systems, lowest common multiples and highest common factors, speed distance time problems, programming languages C, C++, and Java, data structures, and operating systems. It also references chapters in a textbook on algorithms for finding all pairs in a graph represented using an adjacency list.

Uploaded by

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

Imp Notes & To Do

The document lists various topics related to computer science including number systems, lowest common multiples and highest common factors, speed distance time problems, programming languages C, C++, and Java, data structures, and operating systems. It also references chapters in a textbook on algorithms for finding all pairs in a graph represented using an adjacency list.

Uploaded by

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

Q) Johnsons algorith for all pair fpr any given graph using adjascency list

-->23,24,25,26 First 2 chapters of RS Agrawal.


Number system
LCM HCF
Speed Distance Time
C,C++, Data Structures, OS, Java

You might also like